Menu
Home
Experience
Research
Publication
Students
Professional Activities
Teaching
Courses
External Links
LinkedIn
Google Scholar
ResearcGate
DBLP
usefull links
Jemdoc

Dr. Lalatendu Behera

Vision and Mission of the Department and Institute

CSFC0101: Computer Programming (A-2)

Instructor

  • Dr. Lalatendu Behera

TAs

  • Harshita Singh

Class Timings and Venue

  • Wednesday: 10:30 AM - 11:25 AM

  • Thursday: 11:30 AM - 12:25 AM

  • Friday: 11:30 AM - 12:25 AM

  • 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. Quiz/Assignment/Project: Four Quizzes (20%)

  2. Mid-semester: 30%

  3. End-semester: 50%

Recommended Materials

  1. C Operator Precedence Table

Classes

Lecture No. Date Topic Source
1 23/08 Introduction to the course
2 24/08 Introduction to Computers
3 28/08 Compilers, Assemblers and Interpreters Brochure
4 30/08 Basic elements of C (Characters, Identifiers, Variables, Data Types) Brochure
5 31/08 Floating-point Numbers Brochure
6 01/09 Constants, Assignment, l-value and r-value Brochure
7 06/09 Binary and Unary Arithmetic Operators, Typecast Brochure
8 11/09 Relational, Logical Operators and Assignment Operators Brochure
9 13/09 Bitwise Operators Brochure
10 14/09 Comma Operator and if-else statement Brochure Brochure
11 25/09 if-else and switch-case Brochure
12 27/09 while and for loop Brochure
13 04/10 do while loop, break, and continue Brochure
14 05/10 Basics of Pointers Brochure
15 06/10 Pointer Arithmetics Brochure
16 11/10 Introduction to Arrays Brochure
17 12/10 Arrays Brochure
18 13/10 Sorting and Searching Brochure
19 18/10 Arrays and Pointers Brochure
20 19/10 2-D Arrays Brochure
21 20/10 2-D Array Addresses Follow the class notes of the previous class
22 01/11 2-D Array insight Brochure
23 02/11 Strings Brochure
24 03/11 Constant Pointer, Constant String, pointer to constant int, and constant pointer to int Brochure
25 08/11 Introduction to function Brochure
26 09/11 Function Declaration, Definition, Call, Call by value, call by Reference and Pssing 1-D Array to functions Brochure
27 10/11 Scope and Passing 2-D Array to functions Brochure
28 16/11 Recursion and Dynamic Memory Allocation Brochure Brochure
29 17/11 Introduction to Structures Brochure
30 20/11 Storage Classes Brochure
31 22/11 Structures Brochure
32 23/11 Files Brochure
33 24/11 Preprocessor directives Brochure

Homeworks or Quizzes

  • 1st Quiz on 13/October/2023 at 5:40 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 2nd Quiz on 08/November/2023 at 5:40 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 3rd Quiz on 17/November/2023 at 5:40 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 4th Quiz on 23/November/2023 at 5:40 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 5th Quiz on 06/December/2023 at 5:40 PM in lecture theatres.

Practice Questions