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 (B-3)

Instructor

  • Dr. Lalatendu Behera

TAs

  • Harshita Singh

Class Timings and Venue

  • Wednesday: 08:30 AM - 09:25 AM

  • Thursday: 9:30 AM - 10:25 AM

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

  • Venue: SB - 3

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. Quiz/Assignment/Project: Four Quizzes (Best Three) (15%)

  3. Mid-semester: 30%

  4. End-semester: 50%

Recommended Materials

  1. C Operator Precedence Table

Classes

Lecture No. Date Topic Source
1 17/01 Introduction to the course
2 18/01 Introduction to Computers
3 19/01 Compilers, Assemblers and Interpreters Brochure
4 24/01 Basic elements of C (Characters, Identifiers, Variables, Data Types) Brochure
5 25/01 Number Systems Refer Class Notes
6 31/01 Floating-point Numbers Refer Class Notes
7 01/02 Keywords, Constants, printf, and scanf Brochure
8 02/02 Binary and Unary Arithmetic Operators, Typecast Brochure
9 07/02 Relational and Logical Operators Brochure
10 08/02 Examples on Logical Operators Brochure
11 09/02 Bitwise, Assignment, Conditional and Comma Operator Brochure
12 14/02 if - else Brochure
13 15/02 switch-case Brochure
14 16/02 while loop Brochure
15 21/02 for loop, do-while, break, and continue Brochure
16 22/02 Introduction to Pointers Brochure
17 28/02 Pointers Brochure
18 29/02 Introduction to arrays Brochure
19 01/03 1-D Arrays Brochure
20 06/03 Arrays and Pointers Brochure
21 07/03 Array and its adresses Brochure
22 13/03 Sorting Brochure
23 03/04 Mid-semester Q/A Discussion
24 04/04 Searching, Array of pointers, and Pointer to an array Refer Class Notes
25 05/04 Introduction to 2-D Arrays Brochure
26 10/04 2-D Arrays and Pointers Brochure
27 12/04 Pointer to const int, const pointer to int, & const pointer to const int Brochure
28 18/04 Introduction to Function Brochure
29 19/04 Call by value and Call by reference Brochure
30 20/04 Passing 1-D Arrays to a function Brochure
31 24/04 Passing 2-D Arrays to a function, Recursion Brochure Brochure
32 25/04 Dynamic Memory Allocation Brochure
33 26/04 Strings Brochure
34 01/05 Constant Strings, Constant Pointers, and Example of Recursion Brochure
35 02/05 Introduction to Structures Brochure
36 03/05 Structures and Functions and Union Brochure
37 08/05 Preprocessor Directives Brochure
38 09/05 Storage Classes Brochure
39 10/05 Files Brochure

Homeworks or Quizzes

  • 1st Quiz on 14/February/2024 at 5:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 2nd Quiz on 06/March/2024 at 5:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 3rd Quiz on 17/April/2024 at 5:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 4th Quiz on 01/May/2024 at 5:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

Practice Questions