Dr. Lalatendu Behera

Vision and Mission of the Department and Institute

CSFC0101: Computer Programming (B-1)

Instructor

  • Dr. Lalatendu Behera

TAs

  • Harshita Singh

Class Timings and Venue

  • Monday: 04:30 PM - 05:25 PM

  • Tuesday: 04:30 PM - 05:25 PM

  • Friday: 01:30 PM - 02:25 PM

  • Venue: WE - 2

Course Outcomes

CO
1 Understand the basic components of a digital computer and create simple applications using basic elements of C.
2 Analyze and solve various algorithmic problems using arrays and function.
3 Implement real-time applications in C using structures.
4 Develop complex applications using file systems.

CO - PO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 M L
CO2 L H M
CO3 M M M M L H M
CO4 M M M M L H M

Recommended Books

  1. B. W. Kernighan and D. M. Ritchie, “The C Programming Language”, Pearson Education, 2006.

  2. Byron S. Gotfried, “Programming with C”, Schaum's Outlines, Tata Mcgraw-hill, 2006.

  3. Y. P. Kanetkar, “Let us C”, BPB Publication, 2011.

  4. E. Balagurusamy, “Programming in ANSI C”, Tata Mcgraw-hill, 2019.

Evaluation

  1. Class Performance: 5%

  2. Assignment: 5%

  3. Quiz: Three Quizzes (Best Two) (10%)

  4. Mid-semester: 30%

  5. End-semester: 50%

Recommended Materials

Classes

Lecture No. Date Topic Source
1 19/01 Introduction to the course Brochure
2 20/01 Introduction to computers Brochure
3 23/01 Flowchart, Algorithms, and Translators
4 27/01 Basic Elements of C (Character sets, Identifiers, Variables, Keywords, and Data Types)
5 30/01 Number Systems and Floating-point Numbers
6 02/02 Keywords, printf, and scanf
7 03/02 Constants and Assignment Operators
8 06/02 Binary Arithmetic Operators
9 09/02 Increment, Decrement operators, and Relational
10 10/02 Logical and Bitwise Operators
11 13/02 Comma operator, if statement and if-else statement and nested if-else
12 16/02 switch-case
13 17/02 while and do-while loop
14 23/02 for loop
15 24/02 Introduction to pointers
16 27/02 Pointer Arithmetics
17 20/03 Mid-semester Q/A Discussion
18 23/03 Introduction to Arrays, Declaration, and Initialization
19 24/03 Example Programs of Arrays
20 30/03 2-D Arrays and Array Address Calculations
21 02/04 Pointer to const int, const pointer to int, & const pointer to const int
22 06/04 Strings and Pointers with Strings
23 07/04 String Operations
24 10/04 Array of Pointers and Pointer to an Array
25 13/04 Introduction to Functions and Function prototype, function definition, function call
26 14/04 Parameter passing: Pass by value, Passby reference, Returning array from a function, Returning pointer from a function,
27 17/04 Recursion
28 20/04 Structure, Nested structures, and Array of structures
29 21/04 Pointers, Functions, and Structures
30 24/04 storage classes and pre-processor directives
31 27/04 Self-referential structures, Dynamic memory allocation, Singly linked list, typedef
32 28/04 Files, Types of file processing: Sequential access, Random access, Sequential access file
33 04/05 Revision
34 05/05 Revision
35 08/05 Revision

Homeworks

Quizzes

Practice Questions

To be declared