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-2)

Instructor

  • Dr. Lalatendu Behera

TAs

  • Harshita Singh

Class Timings and Venue

  • Tuesday: 02:30 PM - 03:25 PM

  • Wednesday: 02:30 PM - 03:25 PM

  • Thursday: 02:30 PM - 03:25 PM

  • Venue: SB - 1

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

  2. Range of values for different data types

Classes

Lecture No. Date Topic Source
1 16/01 Introduction to the course Brochure
2 21/01 Introduction to computers Brochure
3 22/01 Flowchart, Algorithms, and Translators Brochure
4 23/01 Basic Elements of C (Character sets, Identifiers, Variables, and Data Types) Brochure
5 28/01 Number Systems and Floating-point Numbers Follow class notes
6 29/01 Keywords, printf, and scanf Brochure
7 30/01 Constants and Assignment Operators Brochure
8 04/02 Binary Arithmetic Operators Brochure
9 05/02 Increment and Decrement operators Brochure
10 06/02 Relational and Logical Operators Brochure
11 11/02 No Class
12 12/02 Logical and Bitwise Operators Refer Class Notes
13 13/02 Ternary operator, Comma operator, and if statement Brochure
14 18/02 if-else statement and nested if-else Brochure
15 19/02 switch-case Brochure
16 20/02 while loop Brochure
17 25/02 for loop Brochure
18 27/02 do-while loop, break, and continue statements Brochure
19 04/03 Pointers Brochure Brochure
20 05/03 Arithmetic Operators on pointers Brochure
21 06/03 Practice Problems Brochure
22 26/03 Mid-semester Q/A Discussion
23 27/04 Introduction to Arrays Brochure
24 01/04 Arrays Brochure
25 02/04 Pointers and Arrays Refer Class Notes
26 03/04 Sorting and Searching Brochure Brochure Brochure
27 08/04 No Class
28 09/04 Pointer to const int, const pointer to int, & const pointer to const int Brochure
29 15/04 2-D Arrays and pointers Brochure
30 16/04 Strings Follow arrays PPT
31 17/04 Introduction to Function Brochure
32 22/04 Call by value and Call by reference Brochure
33 23/04 passing arrays to a function and Recursion Brochure Brochure
34 24/04 Preprocessor Directives and Storage Classes Brochure Brochure

Homeworks

Quizzes

  • 1st Quiz on 06/February/2025 at 12:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 2nd Quiz on 03/March/2025 at 12:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

  • 3rd Quiz on 23/April/2025 at 12:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

Practice Questions

To be declared