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

Instructor

  • Dr. Lalatendu Behera

TAs

  • Harshita Singh

Class Timings and Venue

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

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

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

  • Venue: C - 4

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 23/08 Introduction to the course Brochure
2 29/08 Introduction to Computers Brochure
3 30/08 Algorithm, Flowchart, and Translators Brochure
4 02/09 Basic Elements of C Brochure
5 05/09 Number Systems (Decimal, Binary, Octal, and Hexadecimal) Refer class notes
6 06/09 signed, 1's Complement, and 2's Complement Representation Refer class notes
7 09/09 Floating-point Numbers Refer class notes
8 12/09 Printf, Scanf, Constants, and Arithmetic Operators Brochure
9 13/09 Arithmetic Operators Brochure
10 19/09 Increment, Decrement, sizeof, and Relational Operators Brochure
11 20/09 Logical Operators Brochure
12 23/09 Bitwise Operators and Comma Operator Refer class notes
13 26/09 Ternary Operator Brochure
14 27/09 if else Brochure
15 30/09 switch-case Brochure
16 14/10 Loops Brochure
17 17/10 Mid-semester Q/A Discussion Brochure
18 18/10 while and for loops Brochure
19 21/10 do-while loop, continue and break statements Brochure
20 24/10 Pointers Brochure
21 25/10 Revision
22 04/11 Operators with pointers Brochure
23 05/11 Basics of Arrays Brochure
24 07/11 Arrays and pointers Brochure
25 08/11 Pointer to const int, const pointer to int, & const pointer to const int Brochure
26 11/11 Character Arrays Brochure
27 12/11 Constant Pointer and String Constant Brochure
28 18/11 Sorting and Searching Algorithms Brochure Brochure Brochure
28 19/11 2D Arrays Brochure Brochure
29 21/11 Introduction to Functions, Call by value Follow the slides of the next class
30 22/11 Call by reference, actual and formal arguments, passing 1-D array to a function Brochure
31 25/11 Passing arrays to a function and Recursion Brochure Brochure
32 26/11 Storage Classes and Preprocessor Directives Brochure Brochure
33 28/11 Structures Brochure

Homeworks or Quizzes

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

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

  • 3rd Quiz on 20/November/2024 at 5:30 PM in lecture theatres.

  • 4th Quiz on 27/November/2024 at 12:30 PM in lecture theatres.

Practice Questions