Professional Documents
Culture Documents
Ph.0141-2770445
E.mail: support@gitjaipur.com
Estd. 2002
COURSE FILE
-1-
Year : I
Remarks S. No. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. Content /Item no. Syllabus MTE I (Mid Term Exam), and MTE II Course File Course File/ Gudielines Course File/ Objectives & Outcomes Course File/ Expected Outcomes TFTT Lecture Plan Course Schedule Assignments Question of previous years (University) Mid Term Question Paper ( I & II). Grading of Assignment Page No. Faculty 4-5 6-8 9 10 11 12 13 14-51 52-56 57-61 62-65 66-67 68-70 HOD Dean
-2-
Subject: Computer Programming & IT : Kapil Kumar Jhajharia : Assistant Professor : Computer Science & Engineering
Sem : I
1. 2. 3.
Course Details
Batch Semester
: 2011-12 : I
Annexures
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. Time Table and syllabus copy must be enclosed. Please attach the Marks List of the Students in respect of MTE I (Mid Term Exam), and MTE II for this subject in your Course File. TFTT (Time Frame Time Table/ Course Plan). Lecture Plan. Tutorial Sheet (If required, as per the syllabus). List of Assignments / Seminar Topics given to students should also be included in the Course File. Unit Test. Lab manual if required. Model Question Paper of the subject which would be distributed to the students, should be included in the Course File Papers (Question Bank of important Questions). Question of previous years (University) . Mid Term Question Paper ( I & II). Performance of the unit test should the enclosed. Grading of Assignment. Photocopy of the best and the average answer sheets of MTE I & II, should be included in the Course File. Photocopy of the best and the average assignment copies should be enclosed in the course file. Any additional resources like OHP transparencies, handouts used may also be enclosed.
-3-
Sem : I
Unit I Introduction: Stored Program Architecture of Computers, Evolution of Processors (In terms of word length & Speed only), Storage Device- Primary Memory and Secondary Storage, Working Principle of Primary Storage devices- RAM, ROM, PROM, EPROM, EEPROM, Random, Direct, Sequential access methods. Language Translators Concept of High-Level, Assembly and Low Level programming languages. Working of Assembler, Interpreter and compiler. Representing Algorithms through flow chart, pseudo code, step by step etc. Unit II Number System: Data Representation, Concept of radix and representation of numbers in radix r with special cases of r=2, 8, 10 and 16 with conversion from radix r1 to radix r2. rs and (r-1)s complement. Representation of Integer in sign-magnitude, signed 1s and 2s complement. Floating point representation. Concept of bias and normalization. Representation of alphabets. Binary Codes: Binary arithmetic, Addition and subtraction of Integers and floating point numbers. Multiplication of Integers. Gray code, BCD 8421 and 2421, Excess-3 and Excess-3 gray codes. Unit III Programming in C: Structure of C Program, Concept of Preprocessor, Macro Substitution, Intermediate code, Object Code, Executable Code. Compilation Process. Basic Data types, Importance of braces ({ }) in C Program, enumerated data type, Identifiers, Scope of Variable, Storage Class, Constants, Expressions in C, Type Casting, Control Statements, printf( ), scanf ( ), reading single character. Command Line Arguments. Unit IV Arrays in C, Pointers, Using pointers to represent arrays, Dynamic Memory allocation, Structures, using typedef, Arrays of Structures & pointers, File Handling (Opening in different modes & closing of file, fscanf & fprintf only). Unit V Functions in C, Passing Parameters (By value & Reference), using returned data, Passing arrays, structures, array of structures, pointer to structures etc., passing characters and strings, The void pointer. -4-
Textbook: BK-1Computer Fundamentals: By Pradeep K. Sinha and Priti Sinha, BPB Publications BK-2 Let Us C: Yashwant Kanetkar
-5-
Year : I
S. No.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Student Name
AAKASH MALVIYA AKASH NENAWA AKRAM RAZZA MANSURI AMIT SINGH ANURAG PEETALIYA APURAV SURI ARPIT YADAV BABULAL SHARMA BALRAM UPADHYAY BHARAT JAJRA BHAVESH AGARWAL CHANDRA BHUSHAN TRIPATHI DASRATH KUMAR SHARMA DEEPAK SHARMA DEEPANSHU BANSAL DHANANJAY KUMAR DHEERAJ SAINI DHRUV KUMAR SINGHAL DIPENDER SINGH GAURANG CHOTIA HARSH TANK HIMANSHU DIXIT HIMANSHU SONI HITESH JANGIR HONEY SAXENA
1Term
12 07 04 12 8 14 14 5 16 11 10 15 9 8 13 8 11 12 9 10 11 13 13 15 14
2Term
15 8 4 AB 12 16 9 9 20 6 8 12 8 6 8 8 15 8 8 4 5 17 10 10 8
Average
14 8 4 6 10 15 12 7 18 9 9 14 9 7 11 8 13 10 9 7 8 15 12 13 11
-6-
26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
ME11(II)026 ME11(II)027 ME11(II)028 ME11(II)029 ME11(II)030 ME11(II)031 ME11(II)032 ME11(II)033 ME11(II)034 ME11(II)035 ME11(II)036 ME11(II)037 ME11(II)038 ME11(II)039 ME11(II)040 ME11(II)041 ME11(II)042 ME11(II)043 ME11(II)044 ME11(II)045 ME11(II)046 ME11(II)047 ME11(II)048 ME11(II)049 ME11(II)050 ME11(II)051 ME11(II)052 ME11(II)053 ME11(II)054 ME11(II)055 ME11(II)056 ME11(II)057
ISHAAN KOHLI JAWED ALAM JOBIN CHACKO KAPIL MENGHRANI KARMJEET SINGH SEHMI KULDEEP SHARMA LOVELESH NAMDAV MAHAVEER NAGAR MARUTI NANDAN MOHD. IZHAR NITIN KUMAR YADAV NIVESH MATHUR OSAID AHMAD PANKAJ KUMAR PRASHANT KUMAR SRIVASTAVA PRINCE KUMAR PUNEET KUMAR RAHUL PORWAL RAJESH SHARMA RAKESH MALONIYA RANA GARIB NATH RISHABH THAKUR SATISH SHARMA SAURAV YADAV SHASHIKANT SHARMA SHUBHAM AGRAWAL SIKANDER ALI SUNIL KUMAR TANISH KHANDELWAL TARUN SACHDEVA TEJPAL SINGH VIJAY KAMLANI
13 6 14 12 11 7 3 15 8 7 13 18 2 8 10 10 9 10 13 6 7 13 8 9 13 17 14 14 12 11 12 10
11 8 4 6 8 11 8 20 17 3 6 20 5 9 15 3 8 9 7 6 11 16 8 13 8 16 14 10 10 17 6 16
12 7 9 9 10 9 6 18 13 5 10 19 4 9 13 7 9 10 10 6 9 15 8 11 11 17 14 12 11 14 9 13
-7-
58 59 60 61 62 63
VIKAS KUMAR CHOUDHARY VIKASH KUMAR SHARMA VIMLESH KUMAR SINGH VIPIN VIVEK SHARMA YASH SHARMA
16 13 16 13 8 17
20 13 20 17 1 18
18 13 18 15 5 18
-8-
Sem : I
1. 2. 3. 1.
2.
COURSE PLAN
(Please write how you intend to cover the syllabus: i.e. coverage of Units by lecturers, guest lecturers, design exercises, solving numerical problems, demonstration of models, model preparation, or by assignment, etc.)
METHOD OF EVALUATION
3.1 3.2 3.3 3.4 3.5 3.6 Mid Term Examinations (MTE I & II) Assignment / Semesters Mini Projects Quiz Term End Examination Others (Unit Test Papers)
List out any new topic (s) or any innovation introduced/proposed in teaching the subject in this semester
-9-
Sem : I
1. 2. 3.
Guidelines to Study the Subject The course addresses basic concepts of computer systems, generation, number system concept, and gives an in-depth treatment of Language Translators. The course is organized around the issue of computer programming and different methods. The objective of this course is to provide the student with a general understanding of the concept of a program, algorithm and programming knowledge.To enable students to understand the process of a program in a high-level language being translated by a compiler into machine language program and then executed. Better understanding of how to write and use functions, arrays, pointers and structures including passing parameters. The student can: 1. Write C programs that are non-trivial. 2. Use the variety of data types appropriate to specific programming problems. 3. Demonstrate efficiency and readability. 4. Demonstrate the use of the various control flow constructs. 5. Use arrays as part of the software solution. 6. Utilize pointers to efficiently solve problems. 7. Include the structure data type as part of the solution. 8. Use functions from the portable C library. The contents of this subject guide are arranged as follows: Introduces the computer generation Disscusses the invention of different devices Understanding the programming flow and design Introduces the number system Disscusses the high level programming
Prerequisites: The prerequisites for this subject include knowledge of basics of computer. - 10 -
Sem : I
1. 2. 3.
On completion of this Subject / Course the students shall be able to: S.No. Objectives 1. 2. Outcomes An ability to design and conduct The student is able to understand the basic concepts of experiments, as well as to analyze Programming in C. and interpret data It should help the student for designing the Algorithm An ability to identify, formulates, and Flow charts. and solves engineering Problems. An ability to use the techniques, To enable students to understand the process of a skills, and modern engineering program in a high-level language being translated by a tools necessary for engineering compiler into machine language program practice
3.
Note: For each of the OBJECTIVE indicate the appropriate OUTCOMES to be achieved.
- 11 -
Sem : I
1. 2. 3.
g h i
An ability to use the techniques, skills, and modern engineering tools necessary of engineering practice.
a
Objectives
1 2 3
x x x x
- 12 -
Subject: Computer Programming & IT : Kapil Kumar Jhajharia : Assistant Professor : Computer Science & Engineering
Sem : I
1. 2. 3.
1. 2. 3. 4. 5.
Introduction of Computer and Language Translators Number System and Binary Codes Structure of C, Basic Data types and Scope of Variable Arrays , Structure and Pointer in C, Functions and File Handling in C
- 13 -
Sem : I
Date: 29/08/11 1. 2. 3. Subject Lecture No. Title : Computer Programming & IT : 01 Subject Code: 104 Duration of Lecture: 55 Minutes
S.NO. 1 2
Topic:
Introduction to Computer System Knowledge of computer generation
Tough
- 14 -
Sem : I
Date: 30/08/11 1. 2. 3. S.NO. 1 Subject Lecture No. Title : Computer Programming & IT : 02 : Storage Device Topic: Deatiled Study on Storage Device Tough Easy Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 15 -
Sem : I
Date: 02/09/11 1. 2. 3. S.NO. 1 2 Subject Lecture No. Title : Computer Programming & IT : 03 Subject Code: 104 Duration of Lecture: 55 Minutes
: Primary Memory and Secondary Storage Topic: Time Allotted 35 15 Tough Easy
Knowledge about memory and classification including Primary Memory Secondary Storage
- 16 -
Sem : I
Date: 05/09/11 1. 2. 3. S.NO. 1 2 Subject Lecture No. Title : Computer Programming & IT : 04 Subject Code: 104 Duration of Lecture: 55 Minutes
Brife knowledge of primary and secondary memory Working Principle of Primary Storage devices Tough
- 17 -
Sem : I
Date: 06/09/11 1. 2. 3. S.NO. 1 2 Subject Lecture No. Title : Computer Programming & IT : 05 Subject Code: 104 Duration of Lecture: 55 Minutes
Introduction of Random, Direct memory access methods Knowledge of Sequential access methods Tough
- 18 -
Sem : I
Date: 09/09/11 1. 2. 3. S.NO. 1 2 3 Subject Lecture No. Title : Computer Programming & IT : 06 Subject Code: 104 Duration of Lecture: 55 Minutes
: Language Translators: Working of Assembler, Interpreter and compiler Topic: Time Allotted 25 15 10 Tough Easy
- 19 -
Sem : I
Date: 12/09/11 1. 2. 3. S.NO. 1 2 Algorithms Flow chart Tough Easy Subject Lecture No. Title : Computer Programming & IT : 07 : Algorithms, flow chart Topic: Time Allotted 30 20 Subject Code: 104 Duration of Lecture: 55 Minutes
- 20 -
Sem : I
Date: 13/09/11 1. 2. 3. S.NO. 1 2 Step by step Pseudo code Tough Easy Subject Lecture No. Title : Computer Programming & IT : 08 : Pseudo code, step by step Topic: Time Allotted 25 25 Subject Code: 104 Duration of Lecture: 55 Minutes
- 21 -
Sem : I
Date: 19/09/11 1. 2. 3. S.NO. 1 Number System Tough Easy Subject Lecture No. Title : Computer Programming & IT : 01 : Number System Topic: Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 22 -
Sem : I
Date: 20/09/11 1. 2. 3. S.NO. 1 2 Subject Lecture No. Title : Computer Programming & IT : 02 : Radix Representation Topic: Radix and representation in radix r with special cases of r=2, 8 r=10 and 16. Tough Easy Time Allotted 35 15 Subject Code: 104 Duration of Lecture: 55 Minutes
- 23 -
Sem : I
Date: 26/09/11 1. 2. 3. S.NO. 1 2 Subject Lecture No. Title : Computer Programming & IT : 03 Subject Code: 104 Duration of Lecture: 55 Minutes
- 24 -
Sem : I
Date: 28/09/11 1. 2. 3. S.NO. 1 2 Floating point representation Operation with Compliments Tough Easy Subject Lecture No. Title : Computer Programming & IT : 04 : Floating point representation Topic: Time Allotted 10 40 Subject Code: 104 Duration of Lecture: 55 Minutes
- 25 -
Sem : I
Date: 30/09/11 1. 2. 3. S.NO. 1 2 Binary Code Arithmetic operation Tough Easy Subject Lecture No. Title : Computer Programming & IT : 05 : Concept of bias and normalization Topic: Time Allotted 30 20 Subject Code: 104 Duration of Lecture: 55 Minutes
- 26 -
Sem : I
Date:03/10/11 1. 2. 3. S.NO. 1 2 3 Gray code BCD 8421 BCD 2421 Tough Easy Subject Lecture No. Title : Computer Programming & IT : 06 : Gray code, BCD 8421 and 2421 Topic: Time Allotted 25 15 10 Subject Code: 104 Duration of Lecture: 55 Minutes
- 27 -
Sem : I
Date: 04/10/11 1. 2. 3. S.NO. 1 2 Excess-3 Excess-3 gray codes Tough Easy Subject Lecture No. Title : Computer Programming & IT : 07 : Excess-3 and Excess-3 gray codes Topic: Time Allotted 30 20 Subject Code: 104 Duration of Lecture: 55 Minutes
- 28 -
Sem : I
Date: 07/10/11 1. 2. 3. S.NO. 1 2 3 Structure of C Preprocessor Macro Substitution Tough Easy Subject Lecture No. Title : Computer Programming & IT : 01 Subject Code: 104 Duration of Lecture: 55 Minutes
- 29 -
Sem : I
Date: 10/10/11 1. 2. 3. S.NO. 1 2 Intermediate code Object Code Tough Easy Subject Lecture No. Title : Computer Programming & IT : 02 : Intermediate code, Object Code Topic: Time Allotted 30 20 Subject Code: 104 Duration of Lecture: 55 Minutes
- 30 -
Sem : I
Date: 10/10/11 1. 2. 3. S.NO. 1 2 Data types Importance of braces ({ }) in C Control Statements Tough Easy Subject Lecture No. Title : Computer Programming & IT : 03 : Data types, Importance of braces Topic: Time Allotted 30 20 Subject Code: 104 Duration of Lecture: 55 Minutes
- 31 -
Sem : I
Date: 11/10/11 1. 2. 3. S.NO. 1 2 3 Enumerated data type Practical approach to derive data types Identifiers Tough Easy Subject Lecture No. Title : Computer Programming & IT : 04 : Data types, Identifiers Topic: Time Allotted 10 20 20 Subject Code: 104 Duration of Lecture: 55 Minutes
- 32 -
Sem : I
Date: 17/10/11 1. 2. 3. S.NO. 1 2 Scope of Variable Types of variables Tough Easy Subject Lecture No. Title : Computer Programming & IT : 05 : Scope and Types of Varibles Topic: Time Allotted 20 30 Subject Code: 104 Duration of Lecture: 55 Minutes
- 33 -
Sem : I
Date: 19/10/11 1. 2. 3. S.NO. 1 2 Storage Classes Program Constants Tough Easy Subject Lecture No. Title : Computer Programming & IT : 06 Subject Code: 104 Duration of Lecture: 55 Minutes
- 34 -
Sem : I
Date: 01/11/11 1. 2. 3. S.NO. 1 2 Expressions in C Type Casting Tough Easy Subject Lecture No. Title : Computer Programming & IT : 07 : Expressions and type Casting Topic: Time Allotted 20 30 Subject Code: 104 Duration of Lecture: 55 Minutes
- 35 -
Sem : I
Date: 02/11/11 1. 2. 3. S.NO. 1 2 Reading single character Command Line Arguments Tough Easy Subject Lecture No. Title : Computer Programming & IT : 08 : Command Line Arguments Topic: Time Allotted 15 35 Subject Code: 104 Duration of Lecture: 55 Minutes
- 36 -
Sem : I
Date: 04/11/11 1. 2. 3. S.NO. 1 2 Arrays in C Pointers Tough Easy Subject Lecture No. Title : Computer Programming & IT : 01 : Basics of Arrays and Pointers Topic: Time Allotted 40 10 Subject Code: 104 Duration of Lecture: 55 Minutes
- 37 -
Sem : I
Date: 14/11/11 1. 2. 3. S.NO. 1 2 Pointers to represent arrays Dynamic Memory allocation Tough Easy Subject Lecture No. Title : Computer Programming & IT : 02 Subject Code: 104 Duration of Lecture: 55 Minutes
: Representing array threw Pointers & Dynamic memory allocation Topic: Time Allotted 25 25
- 38 -
Sem : I
Date: 15/11/11 1. 2. 3. S.NO. 1 Working with Array Tough Easy Subject Lecture No. Title : Computer Programming & IT : 03 : Array Topic: Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 39 -
Sem : I
Date: 16/11/11 1. 2. 3. S.NO. 1 Subject Lecture No. Title : Computer Programming & IT : 04 : Two Dimensional Array Topic: Working with Two Dimensional Array Tough Easy Time Allotted 40 Subject Code: 104 Duration of Lecture: 55 Minutes
- 40 -
Sem : I
Date: 18/11/11 1. 2. 3. S.NO. 1 2 Structures Using type-def Tough Easy Subject Lecture No. Title : Computer Programming & IT : 05 : Structures Topic: Time Allotted 35 15 Subject Code: 104 Duration of Lecture: 55 Minutes
- 41 -
Sem : I
Date: 22/11/11 1. 2. 3. S.NO. 1 Arrays of Structures Tough Easy Subject Lecture No. Title : Computer Programming & IT : 06 : Array of Structure Topic: Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 42 -
Sem : I
Date: 24/11/11 1. 2. 3. S.NO. 1 Representation of Pointers Tough Easy Subject Lecture No. Title : Computer Programming & IT : 07 : Representing Pointers Topic: Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 43 -
Sem : I
Date: 25/11/11 1. 2. 3. S.NO. 1 File Handling Tough Easy Subject Lecture No. Title : Computer Programming & IT : 08 : File Handling Topic: Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 44 -
Sem : I
Date: 29/11/11 1. 2. 3. S.NO. 1 Functions in C Tough Easy Subject Lecture No. Title : Computer Programming & IT : 01 : Functions Topic: Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 45 -
Sem : I
Date: 29/11/11 1. 2. 3. S.NO. 1 2 3 4 Continue Break Goto Exit functions Tough Easy Subject Lecture No. Title : Computer Programming & IT : 02 Subject Code: 104 Duration of Lecture: 55 Minutes
- 46 -
Sem : I
Date: 30/11/11 1. 2. 3. S.NO. 1 2 Subject Lecture No. Title : Computer Programming & IT : 03 : Parameters Passing Topic: Passing Parameters (By value & Reference) Returned data Tough Easy Time Allotted 35 15 Subject Code: 104 Duration of Lecture: 55 Minutes
- 47 -
Sem : I
Date: 02/12/11 1. 2. 3. S.NO. 1 2 Passing arrays Structures Tough Easy Subject Lecture No. Title : Computer Programming & IT : 04 : Passing arrays and structures Topic: Time Allotted 25 25 Subject Code: 104 Duration of Lecture: 55 Minutes
- 48 -
Sem : I
Date: 07/12/11 1. 2. 3. S.NO. 1 2 Array of structures Dynamic memory allocation in structures Tough Easy Subject Lecture No. Title : Computer Programming & IT : 05 Subject Code: 104 Duration of Lecture: 55 Minutes
: Implementing array and dynamic memory allocation in structure Topic: Time Allotted 20 30
- 49 -
Sem : I
Date: 13/12/11 1. 2. 3. S.NO. 1 Pointer to structures etc Tough Easy Subject Lecture No. Title : Computer Programming & IT : 06 : Implementing pointers in structures Topic: Time Allotted 50 Subject Code: 104 Duration of Lecture: 55 Minutes
- 50 -
Sem : I
Date: 13/12/11 1. 2. 3. S.NO. 1 2 Passing characters and strings Void pointer Tough Easy Subject Lecture No. Title : Computer Programming & IT : 07 : Passing and Strings Topic: Time Allotted 40 10 Subject Code: 104 Duration of Lecture: 55 Minutes
- 51 -
UNIT - I
Sem : I
1. 2. 3. S.No.
Name of the Faculty Designation Department Date No. of Periods 1 1 1 1 1 1 09/09/11 7 8 12/09/11 13/09/11 1 1
: Kapil Kumar Jhajharia : Assistant Professor : Computer Science & Engineering Topics / Sub Topics Objectives & Outcome Nos. and 1,a 1,a 1,a 1,a 1,a 1,a 1,a 1.a BK-1/197-209 BK-1/211-216 Reference (Text Book, Journal.) Page No.to BK-1/1-12 BK-1/20 BK-1/20 BK-1/20-21 BK-1/20-21 BK-1/223-234
1 2 3 4 5 6
computer
Primary Memory and Secondary Storage Working Principle of Primary Storage devices. Random, Direct, Sequential access methods Language Translators: Working of Assembler, Interpreter and compiler Algorithms, flow chart Pseudo code, step by step
- 52 -
UNIT - II
Sem : I
1. 2. 3.
: Kapil Kumar Jhajharia : Assistant Professor : Computer Science & Engineering Topics / Sub Topics
S.No.
Date
No. of Periods
1 2
19/09/11 20/09/11
1 1
Number System Radix and representation in radix r with special cases of r=2, 8, 10 and 16. Representation of Integer in signmagnitude, Signed 1s and 2s complement. Floating point representation, operations on compliments Binary Code and arithmetic operation Gray code, BCD 8421 and 2421 Excess-3 and Excess-3 gray codes.
BK-1/23-37 2,c 2,c 2,c 2,c 2,c BK-1 BK-1/52-60 BK-1 BK-1
1 1 1 1
- 53 -
UNIT - III
Sem : I
1. 2. 3. S.No.
Name of the Faculty Designation Department Date No. of Periods 1 1 1 10/10/11 4 11/10/11 5 6 7 8 17/10/11 19/10/11 01/11/11 02/11/11 1 1 1 1 1
: Kapil Kumar Jhajharia : Assistant Professor : Computer Science & Engineering Topics / Sub Topics Objectives & Outcome Nos. 2,c 2,c Reference (Text Book, Journal.) Page No.to BK-2/191-209 BK-2/192-193 BK-2/168-174 2,c BK-2/10,215, 560 3,a,c & 1,a 1,a 1,a 1,a 1,a BK-2/7-10 BK-2/6-9,174 BK-2/565 BK-2
1 2 3
07/10/11 10/10/11
Structure of C, Preprocessor, Macro Substitution Intermediate code, Object Code Data types, Importance of braces ({ }) in C Control Statements Enumerated data type, Practical approach to derive data types, Identifiers Scope of Variable, Types of variables Storage Class, Program Constants Expressions in C, Type Casting, Reading single character ,Command Line Arguments
- 54 -
UNIT - IV
Sem : I
1. 2. 3. S.No.
Name of the Faculty Designation Department Date No. of Periods 1 1 14/11/11 3 4 5 6 7 8 15/11/11 16/11/11 18/11/11 22/11/11 24/11/11 25/11/11 1 1 1 1 1 1
: Kapil Kumar Jhajharia : Assistant Professor : Computer Science & Engineering Topics / Sub Topics Objectives & Outcome Nos. 3,a,c & 2,c 2,c 2,c 2,c Structures, using type-def Arrays of Structures Pointers File Handling 3,a,c 1,a 1,a 3,a,c BK-2/563 BK-2/297-307 BK-2/230-242 BK-2/331-346 BK-2/213-230 BK-2/230-244 Reference (Text Book, Journal.) Page No.to BK-2/213-244, 140-141, 223-242 BK-2/223-242, 691
1 2
04/11/11
Arrays in C, Pointers Pointers to represent arrays, Dynamic Memory allocation Working with Array Two Dimensional Array
- 55 -
Sem : I
1. 2. 3.
: Kapil Kumar Jhajharia : Assistant Professor : Computer Science & Engineering Topics / Sub Topics
S.No.
Date
No. of Periods 1 1 1 1 1 1 1
Objectives & Outcome Nos. 2,c & 3,a,c 1,a & 2,c 2,c & 3,a,c 2,c & 3,a,c 1,a & 2,c 1,a 3,a,c & 2,c
1 2 3 4 5 6 7
Functions in C Continue, Break, Goto, Exit functions Passing Parameters (By value & Reference), Returned data Passing arrays, Structures Array of structures Pointer to structures etc. Passing characters and strings, Void pointer
Reference (Text Book, Journal.) Page No.to BK-2/122-135 BK-2/122-135 BK-2/139 BK-2/221-223, 289-307 BK-2/297 BK-2/305 BK-2/261-281, 390
- 56 -
Year : I ASSIGNMENT SHEET-I Subject: Computer Programming Sem : I Global Institute of Technology, Jaipur & IT (Approved by AICTE and Affiliated to RTU, Kota) Unit-1 1. 2. 3. Name of the Faculty Designation Department : : : Kapil Kumar Jhajharia Assistant Professor Computer Science & Engineering
- 57 -
Year : I ASSIGNMENT SHEET-II Subject: Computer Programming & IT Sem : I Global Institute of Technology, Jaipur Unit-1I
(Approved by AICTE and Affiliated to RTU, Kota)
1. 2. 3.
: : :
Kapil Kumar Jhajharia Assistant Professor Computer Science & Engineering Date of Assignment: 04/10/2011 Date of Submission: 10/10/2011
- 58 -
Year : I ASSIGNMENT SHEET-III Subject: Computer Programming & IT Sem : I Global Institute of Technology, Jaipur Unit-1II
(Approved by AICTE and Affiliated to RTU, Kota)
1. 2. 3.
: : :
Kapil Kumar Jhajharia Assistant Professor Computer Science & Engineering Date of Assignment: 02/11/2011 Date of Submission: 09/11/2011
Q.1 explains storage classes in c with example. Q.2 what is meant by scope of variables in c? List and explain with example. Q.3 what are constant? Explain type of constants. Q.4 what is keywords and identifiers? Q.5 WAP for findout no. is pallandrome or not?
- 59 -
Year : I ASSIGNMENT SHEET-IV Subject: Computer Programming & IT Sem : I Global Institute of Technology, Jaipur Unit-IV
(Approved by AICTE and Affiliated to RTU, Kota)
1. 2. 3.
: : :
Kapil Kumar Jhajharia Assistant Professor Computer Science & Engineering Date of Assignment: 25/11/2011 Date of Submission: 02/12/2011
- 60 -
Year : I ASSIGNMENT SHEET-V Subject: Computer Programming & IT Sem : I Global Institute of Technology, Jaipur Unit-V
(Approved by AICTE and Affiliated to RTU, Kota)
1. 2. 3.
: : :
Kapil Kumar Jhajharia Assistant Professor Computer Science & Engineering Date of Assignment: 13/12/2011
Date of Submission: 26/12/2012 Objectives: Knowledge of call a function in a program and implemented using pointer and array. Q.1 What do you mean by function? How many types of functions are available in 'C'? Q.2 Discuss all categories of function with examples? Q.3 What are the requirements of user defined function? explain. Q.4 Write a program to calculate power using functions. Q.5 Write a program to print reverse of a number using functions.
- 61 -
Sem : I
lEl024
B. Tech. (Sem l) (main/Back Examination, January/ February 201 Computer Programming 8. IT (Common to all Branches of Engg.) Time: 3 Hours] [Total Marks: 80 [Min. Passing Marks: 24 Attempt overall five questions. All questions caITY equal marks. Use of following supporting material is permitted during examination. (Mentioned in form No. 205)
1(a) Design and explain the architecture of computer. (b) What is difference between ROM and PROM? OR 1 (a) What do you mean by Language Translators? Explain with example. (b) Write difference between high level, assembly and machine language. 2 (a) Calculate rs and (r - 1) complement of (42) 10. (b) Convert (1000)2 to Gray code. (c) Represent tbe following numbers in sign magnitude. l's complement and 2's complement representation. Assume word length = 16 bits: (i) (+34) 10 (ii) (-38.2) 10 (iii) (-76.8) 10 (iv) (+45) 10 8 3 (a) Write a program of add two numbers and explain this program step by step with the help of flow chart. (b) What are the data types in C? Explain with examples. OR - 62 8 8 8
4 4
8 8
(a) 'What are the advantages and disadvantages of C language? (b) What is the difference between Constant and Variable?
8 8
(a) Write a program to check the input number is prime or not. (b) What is difference between while and do-while loops? (c) Write a program in C to prin t the sum of the following series: X3 X5 X7 X - ---- + ---- - ---- + 3! 5! X!
5 5
(b) Explain the function fopen( ) used to open a file in C. What are the difference modes associated witb-fo meaning of each one.
(a) Write a program to read a character and check whether it is vowel or not? (b) What is the difference between pointer and structure? 8
OR 5 (a) What do you mean by function? How many types offunctions are available in C? (b) Write a program to swap two numbers using pointer. 8
- 63 -
B. Tech. 1st Semester (Main) Examination Feb.- 2010 Computer Programming and IT (Common to all Branches of Engineering)
lEl024
Time: 3 Hours
instructions to Candidates: Attempt overall Five questions selecting one questionfrom each unit. All questions carry equal marks. . Unit I 1. a) Define block diagram of computer system. b) Explain various types of memory in detail. (4) (4)
c) Explain low level, assembly and concept of High level programming languages briefly. OR a) Explain briefly about compiler, assembler and interpreter. (8) b) Make a flowchart to find maximum number among 3 numbers. Unit II 2. a) Convert the following :i) (276.65)8 to Decimal ii) (1101110.1010)2 to Octal iii) (FB9.EC)16 to Octal iv) (725.36)8 to Binary b) Write short notes on BCD, ASCIT and EBC.DICcodes. OR a) Subtract 25910 from 79810 using, (r-1)'s complement method. b) Subtract 11101012 from 100010102, (8) (8)
(4) (4)
are possible with i) 6 bits ii) 8 bits. Unit III 3 a) Explain structure of program in C language briefly. b) Write a program that given (Inputted) number is prime or not. OR a) Write a program to generate the following pattern. ********* ******* ***** *** * b) Write a program to generate following pattern. 1 232 34543 4567654 567898765 Unit- IV 4.
(8)
(8) (8)
(8)
(8)
a) What is array? What are the advantages of array? Write a program to find maximum value from n values in array. (8) b) What is pointer? Discuss advantages of pointer. OR a) Explain call by value and call by address. (8) (8)
b) Write some records of employee like name, address, age & salary in a file. Read that records from file again and display. Unit- V 5. a) Define storage class in user define function. b) Write a program of reverse of a number using function. OR Write a program that a number (i.e. 153) is Amstrong number of not using user defined function return value. (16) - 65 (8) (8) (8)
Sem : I
Q1. What is data processing?Differentiate b/w Data and Information? Which is more useful to the people and why? Q2. What is difference b/w primary and secondry storage? Explain Different types of memory used in computer. Q3. What is difference b/w Compiler, Assembler and Interpreter? Q4. Draw the flowchart to determine whether a year is leap year or not. Q5. Solve these problems (1) (154)6 +(132)4 =(?)9 (2) (145)n =(65)10 find the value of n (3) (10101)2 (01110)2= (?)2 (4) (1111)2 * (101)2 * (111)2 = (?)2
- 66 -
Sem : I
Q.1 What is translator? Explain different type of translators used in programming language. Q.2 What is difference between While and Do While loop? Explain with example. Q.3 What are the different storage classes used in c? Explain with example. Q.4 Write a program to calculate matrix multiplication of two input matrices? Q.5 What is function? Why it is used? Write a program using function to find out the input number is prime or not. Q.6 What is array? Why it is used? Explain memory allocation of array in c with example.
- 67 -
Performance of Assignment
Year : I
Subject: Computer Programming & IT Code: 104 Sem : I Global Institute of Technology, Jaipur
(Approved by AICTE and Affiliated to RTU, Kota)
S. No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
Grades Roll No. ME11(II)001 ME11(II)002 ME11(II)003 ME11(II)004 ME11(II)005 ME11(II)006 ME11(II)007 ME11(II)008 ME11(II)009 ME11(II)010 ME11(II)011 ME11(II)012 ME11(II)013 ME11(II)014 ME11(II)015 ME11(II)016 ME11(II)017 ME11(II)018 ME11(II)019 ME11(II)020 ME11(II)021 ME11(II)022 ME11(II)023 ME11(II)024 Student Name #1 AAKASH MALVIYA AKASH NENAWA AKRAM RAZZA MANSURI AMIT SINGH ANURAG PEETALIYA APURAV SURI ARPIT YADAV BABULAL SHARMA BALRAM UPADHYAY BHARAT JAJRA BHAVESH AGARWAL CHANDRA BHUSHAN TRIPATHI DASRATH KUMAR SHARMA DEEPAK SHARMA DEEPANSHU BANSAL DHANANJAY KUMAR DHEERAJ SAINI DHRUV KUMAR SINGHAL DIPENDER SINGH GAURANG CHOTIA HARSH TANK HIMANSHU DIXIT HIMANSHU SONI HITESH JANGIR - 68 A C A C A A+ B B A+ C A B B A B B A A A B C A B A #2 B B C B A A+ A B A+ B B A A B B A A+ B A A C A A A+ #3 A B B C A+ A B A A C B A B B C B A B B B B A B A #4 B B B A B A A B A B A B A C A A A B B A C A A A #5 A A B B A A A B A C C A B A A B A+ C B C C A A A+ A B B B A A A B A C B A B B B B A B B B C A A A Average
25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
ME11(II)025 ME11(II)026 ME11(II)027 ME11(II)028 ME11(II)029 ME11(II)030 ME11(II)031 ME11(II)032 ME11(II)033 ME11(II)034 ME11(II)035 ME11(II)036 ME11(II)037 ME11(II)038 ME11(II)039 ME11(II)040 ME11(II)041 ME11(II)042 ME11(II)043 ME11(II)044 ME11(II)045 ME11(II)046 ME11(II)047 ME11(II)048 ME11(II)049 ME11(II)050 ME11(II)051 ME11(II)052 ME11(II)053 ME11(II)054 ME11(II)055 ME11(II)056
HONEY SAXENA ISHAAN KOHLI JAWED ALAM JOBIN CHACKO KAPIL MENGHRANI KARMJEET SINGH SEHMI KULDEEP SHARMA LOVELESH NAMDAV MAHAVEER NAGAR MARUTI NANDAN MOHD. IZHAR NITIN KUMAR YADAV NIVESH MATHUR OSAID AHMAD PANKAJ KUMAR PRASHANT KUMAR SRIVASTAVA PRINCE KUMAR PUNEET KUMAR RAHUL PORWAL RAJESH SHARMA RAKESH MALONIYA RANA GARIB NATH RISHABH THAKUR SATISH SHARMA SAURAV YADAV SHASHIKANT SHARMA SHUBHAM AGRAWAL SIKANDER ALI SUNIL KUMAR TANISH KHANDELWAL TARUN SACHDEVA TEJPAL SINGH - 69 -
A A A B A A B A A+ B B B A+ C B A A A B B B A+ B B B A A B A A A+ B
B B B A B B B C A+ A B B A+ B A B B B A B B A+ A B B B A+ A A B A A
A B B C B B C C A B A C A+ B A B B A B A C A A A C B A C B B B B
B B A B A C A B A A B B A+ C B A C C A B B A A B B B A B B C A A
A A C B C A A C A B B A A C A C A B A B A A A B A A A B C A A A
A B B B B B B C A B B B A C A B B B A B B A A B B B A B B B A A
57 58 59 60 61 62 63
VIJAY KAMLANI VIKAS KUMAR CHOUDHARY VIKASH KUMAR SHARMA VIPIN VIVEK SHARMA YASH SHARMA
A A+ A A B A A
A A+ B A A A A+
A A B B A A+ B
B A B A B A A+
A A A A A A+ A
A A B A A A A
Signature Faculty
Signature HOD
- 70 -