Course Objectives: The Objective of This Course Is To
Course Objectives: The Objective of This Course Is To
Course Objectives
The objective of this course is to:
1. Provide an overview of concepts in ‘C’ language
2. Serve as a foundation for the study of programming languages.
3. Learn to develop program using ‘C’ language.
4. To develop the software using the concept of ‘C’ Language.
5. OOPs concepts using C++
Course Outcomes
At the end of the course student will be able to:
CO 1: Understand the basic terminology used in programming and able to write, compile and
debug programs in ‘C’ programming language and to develop program logics using
decision structures and loop structures.
CO 2: Develop program logics using the concept of arrays,strings and pointers.
CO 3: Describe the modular techniques such as functions and difference between structure and
union definitions.
CO 4: Implement and develop the different File handling operations.
CO 5: Learn the basic concepts of ‘C++’ and identify the differences between ‘C’ and ‘C++’.
Reference Books:
1. Yashwant Kanitkar, Lets us C, BPB publications.
2. Herbert Schildt,C: The Complete Reference Paperback – 1 July 2017
3. Al Kelley and Ira Pohl (1998), A Book on C Programming in C, 4 th Edition, Pearson
Education.
4. E. Balagurusamy 7th Edition, Programming ANSI C, McGraw-Hill
5. Brian W. Kernighan and Dennis M. Ritchie, The C programming Language, Prentice-Hall in
1988
6. Byron Gottfried, Programming with C, Schaum's Outline
Mode of Evaluation:
Relationship between the Course Outcomes (COs) and Program Outcomes
(POs)
Mapped Program
Sl. No. Course Outcomes (COs)
Outcomes
CO-PO Mapping:
B
T
C P P P P P
L P P P P P P P P P
O O O O S S
CO Statement e O O O O O O O O O
' 1 1 1 O O
v 1 2 3 4 5 6 7 8 9
s 0 1 2 1 2
e
l
Understand the basic terminology used in
C programming and able to write, compile and
K
O debug programs in ‘C’ programming language 1 2 2
1
1 and to develop program logics using decision
structures and loop structures.
C
Implement and develop the different File K
O 3 3 3 2 3
handling operations. 3
4
List of Experiment:
1. Problem based on switch-case, if-else and loop statements.
2. Problem based upon nested for/while loop for printing pattern.
3. Problem based recursive function.
4. Problem based upon dynamic memory allocation for n no of inputs and performs
following operations: sum of diagonal elements, sum of all the outside elements of a 2-D
arrays.
5. Problem based sorting of strings, which are inputted on dynamic memory allocations.
6. Problem based upon extracting numeric and characters from an inputted an alphanumeric
inputted text.
7. Problem based upon modifying the inputted strings alternatively in lowercase and
uppercase letters.
8. Problem based upon 2-D dynamic arrays.
9. Problem based upon various operations on strings using pointer and dynamic memory
initialization.
10. Problem based on sorting using recursive and non-recursive calls of function having
pointer and arrays as an argument.
11. Problem based on reading sets of values like students record using structure and performs
sorting based upon the entire record based upon their performance in five subjects.
12. Problem based upon nested/ self-referential structure.
13. Problem based upon Union, passing it as an argument inside the function.
14. Problem based upon returning a pointer from a function.
15. Problem based upon returning structure from a function.
16. Problem based upon passing structure as an argument from a function.
17. Problem based upon file handling using fscanf and fprintf.
18. Problem based upon file handling using fgets-fputs.
19. Problem based upon file handling using fgetw and fputw.
20. Problem based upon file handling using fgetc-fputc.
21. Problem based upon file handling using fread-fwrite.
22. Problem based upon file handling using ftell, fseek, and rewind functions.
23. Problem based upon classes and objects.
24. Problem based upon array of objects.
25. Problem based upon Friend function, static member function.