0% found this document useful (0 votes)
45 views

PIC Syllabus Theoryyy

Uploaded by

Ankit Pandey
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views

PIC Syllabus Theoryyy

Uploaded by

Ankit Pandey
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

PaperCode: ES-101 / ES-102 Paper: Programming in ‘C’ L T/P C


3 - 3
Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should
be objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the
syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus.
However, the student shall be asked to attempt only one of the two questions in the unit.
Individual questions may contain upto 5 sub-parts / sub-questions. Each Unit shall have a marks
weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper.
The standard / level of the questions to be asked should be at the level of the prescribed
textbook.
5. The requirement of (scientific) calculators / log-tables / data – tables may be specified if
required.
Course Objectives:
1: To impart basic knowledge about simple algorithms for arithmetic and logical problems so
that students can understand how to write a program, syntax and logical errors in ‘C’.
2: To impart knowledge about how to implement conditional branching, iteration and
recursion in ‘C’.
3: To impart knowledge about using arrays, pointers, files, union and structures to develop
algorithms and programs in ‘C’.
4: To impart knowledge about how to approach for dividing a problem into sub-problems and
solve the problem in ‘C’.
Course Outcomes (CO):
CO1 Ability to develop simple algorithms for arithmetic and logical problems and implement
them in ‘C’.
CO2 Ability to implement conditional branching, iteration and recursion and functions in ‘C’
CO3 Ability to use arrays, pointers, union and structures to develop algorithms and programs
in ‘C’.
CO4 Ability to decompose a problem into functions and synthesize a complete program using
divide and conquer approach in ‘C’.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping (scale 1: low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 3 3 2 1 1 - - - 2 1 1 3
CO2 3 3 2 1 1 - - - 2 1 1 3
CO3 3 3 3 1 1 - - - 2 1 1 3
CO4 3 3 3 1 1 - - - 2 1 1 3

Unit I

Introduction to Programming: Computer system, components of a computer system, computing


environments, computer languages, creating and running programs, Preprocessor, Compilation
process, role of linker, idea of invocation and execution of a programme. Algorithms: Representation
using flowcharts, pseudocode.
Introduction to C language: History of C, basic structure of C programs, process of compiling and
running a C program, C tokens, keywords, identifiers, constants, strings, special symbols, variables,
data types, I/O statements. Interconversion of variables.
Operators and expressions: Operators, arithmetic, relational and logical, assignment operators,
increment and decrement operators, bitwise and conditional operators, special operators, operator
precedence and associativity, evaluation of expressions, type conversions in expressions.[8Hrs][T2]

Unit II

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 14


Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Control structures: Decision statements; if and switch statement; Loop control statements: while, for
and do while loops, jump statements, break, continue, goto statements.
Arrays: Concepts, One dimensional array, declaration and initialization of one dimensional arrays, two
dimensional arrays, initialization and accessing, multi-dimensional arrays.
Functions: User defined and built-in Functions, storage classes, Parameter passing in functions, call
by value, Passing arrays to functions: idea of call by reference, Recursion.
Strings: Arrays of characters, variable length character strings, inputting character strings, character
library functions, string handling functions. [8Hrs] [T2]

Unit III

Pointers: Pointer basics, pointer arithmetic, pointers to pointers, generic pointers, array of pointers,
functions returning pointers, Dynamic memory allocation. Pointers to functions. Pointers and Strings
Structures and unions: Structure definition, initialization, accessing structures, nested structures,
arrays of structures, structures and functions, self-referential structures, unions, typedef,
enumerations.
File handling: command line arguments, File modes, basic file operations read, write and append.
Scope and life of variables, multi-file programming. [8Hrs][T2]

Unit IV

C99 extensions. ‘C’ Standard Libraries: stdio.h, stdlib.h, assert.h, math.h, time.h, ctype.h, setjmp.h,
string.h, stdarg.h, unistd.h [3Hrs] [T1, R8]
Basic Algorithms: Finding Factorial, Fibonacci series, Linear and Binary Searching, Basic Sorting
Algorithms- Bubble sort, Insertion sort and Selection sort. Find the square root of a number, array
order reversal, reversal of a string [7Hrs][T1]

Textbooks:
1. How to solve it by Computer by R. G. Dromey, Prentice-Hall India EEE Series, 1982.
2. The C programming language by B W Kernighan and D M Ritchie, Pearson Education, 1988.

References:
1. Programming Logic & Design by Tony Gaddis, Pearson, 2nd Ed. 2016.
2. Programming Logic and Design by Joyce Farrell, Cengage Learning, 2015.
3. Engineering Problem Solving With C by Delores M. Etter, Pearson, 2013.
4. Problem Solving and Program Design in C by Jeri R. Hanly and Elliot B. Koffman, Pearson, 2016.
5. Structure and Interpretation of Computer Programs by Harold Abelson and Gerald Sussman with
Julie Sussman, MIT Press, 1985.
6. How to Design Programs by Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, and Shriram
Krishnamurthi, MIT Press, 2018.
7. ANSI/ISO 9899-1990, American National Standard for Programming Languages ‘C’ by American
National Standards Institute, Information Technology Industry Council, 1990 (C89).
8. ISO/IEC 9899:1999. International Standard for Programming Languages – C (ISO/IEC 9899) by
American National Standards Institute, Information Technology Industry Council, 2000 (C99).
9. INCITS/ISO/IEC 9899-2011.American National Standard for Programming Languages ‘C’ by
American National Standards Institute, Information Technology Industry Council, 2012 (C11).

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 15


Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

PaperCode: ES-153 / ES-154 Paper: Programming in ‘C’ Lab. L P C


- 2 1
Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instructions:
1. The course objectives and course outcomes are identical to that of “Programming in ‘C’” as
this is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement
under intimation to the office of the office of the Head of Department / Institiution in which
the paper is being offered from the list of practicals below. Atleast 8 experiments must be
performed by the students

1. Write a program to find divisor or factorial of a given number.


2. Write a program to find sum of a geometric series
3. Write a recursive program for tower of Hanoi problem
4. Write a recursive program to print the first m Fibonacci number
5. Write a menu driven program for matrices to do the following operation depending on whether
the operation requires one or two matrices
a. Addition of two matrices
b. Subtraction of two matrices
c. Finding upper and lower triangular matrices
d. Transpose of a matrix
e. Product of two matrices.
6. Write a program to copy one file to other, use command line arguments.
7. An array of record contains information of managers and workers of a company. Print all the data
of managers and workers in separate files.
8. Write a program to perform the following operators on Strings without using String functions
a. To find the Length of String.
b. To concatenate two string.
c. To find Reverse of a string.
d. To copy one string to another string.
9. Write a Program to store records of a student in student file. The data must be stored using
Binary File.Read the record stored in “Student.txt” file in Binary code.Edit the record stored in
Binary File.Append a record in the Student file.
10. Write a programmed to count the no of Lowercase, Uppercase numbers and special Characters
presents in the contents of text File.

Note:
1. At least 8 Experiments out of the list shall be performed by the students. Teachers may introduce
new experiments for the class in addition to above.
2. In addition Two Mini Projects based on the skills learnt shall be done by the students. Teachers
shall create the mini projects so that the same is not repeated every year. These mini projects may
be done in a group not exceeding group size of 4 students.
3. Usage of IDE like Visual Studio Community Edition, Codeblocks, etc. are recommended.

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 37

You might also like