Centre for UG & PG Studies
Biju Patnaik University of Technology, Odisha
Chhend, Rourkela, 769015
PROGRAMMING IN C AND DATA STRUCTURE
Sub.Code: 23ES1003 Branch / Year / SEM: CSE/1st/ 1st
Sub.Name: PC Batch: 2025-2029
Faculty: Mrs. Nirlipta Pallabee Samapika Academic Year:2025-26
Lecture: 3 Periods / Week Credits: 3
Course Objectives
• To learn the fundamentals of C programming language.
• To develop skills in algorithmic problem solving and structured program design.
• To understand functions, arrays, structures, unions, and pointers in C.
• To explore dynamic memory allocation and its applications.
• To implement and analyze basic data structures, sorting, and searching techniques.
Assessment
Teacher’s Assessment (TA) – 20 Marks
Quiz: 10 Marks
Assignment: 5 Marks
Attendance: 5 Marks
Internal-I Examination – 30 Marks (60 min)
Internal-II Examination – 30 Marks (60 min)
End Semester Examination – 100 Marks (180 min)
Note: The student must secure a minimum of 35 marks out of 100 in the End Semester
Examination and 25 marks out of 50 in the Internal Examination.
Textbooks
T1: Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill.
T2: Pradip Dey, Manas Ghosh, Programming in C, Oxford Publication.
T3: Data Structures – Schaum's Outlines, McGraw-Hill Education.
Reference Books
R1: Yashwant Kanetkar, Let Us C, BPB Publications.
R2: Kamthane A.N., Programming with ANSI and Turbo C, Pearson Education.
R3: Brian W. Kernighan & Dennis M. Ritchie, The C Programming Language, Prentice Hall.
R4: R. S. Salaria, Programming for Problem Solving, Khanna Publishing House.
R5: Amiya Kumar Rath & Alok Kumar Jagadev, Data Structures Using C, Scitech
Publications.
Web Resources
W1: https://nptel.ac.in/courses/106104128
W2: https://onlinecourses.nptel.ac.in/noc22_cs35
Lesson Plan
Lectur Module Topic Resources
e No.
1 I Problem-solving process: Algorithms & Flowcharts T1, R1, W1
2 I Introduction to C: Structure of C program, keywords, T1, R1, R5,
identifiers W1
3 I Data types, constants, variables T1, R1, W1
4 I Input/Output statements in C T1, R1, W1
5 I Operators & expressions, precedence of operators T1, R1, W2
6 I Control structures: if, if-else, switch-case T1, R2, W1
7 I Loops: for, while, do-while T1, R1, W1
8 I Module I Revision & Problem Solving T1, R1, W1
9 II Functions: Built-in, User-defined, Recursion T1, R1, W2
10 II Arrays: 1D, 2D, matrix operations T1, R1, W1
11 II Strings, string functions, arrays in functions T1, R2, W1
12 II Structures and Unions T1, R3, W1
13 II Module II Revision & Case Studies T1, R1, W2
14 III Pointers: pointer arithmetic, call by value vs. reference T1, R1, W1
15 III Pointers with arrays, strings, functions T1, R1, W1
16 III Pointers to structures, dynamic memory allocation T1, R2, W2
17 III malloc(), calloc(), realloc(), free() T1, R2, W2
18 III Module III Revision & Practice T1, R1, W1
19 IV Introduction to Data Structures T3, R5, W2
20 IV Linked List: creation, insertion, deletion T3, R5, W1
21 IV Stack & Applications (infix to postfix, evaluation) T3, R5, W2
22 IV Queue: Linear & Circular T3, R5, W2
23 IV Module IV Revision & Case Study T3, R5, W2
24 V Trees: Binary Tree, Binary Search Tree T3, R5, W1
25 V Sorting: Bubble sort, Quick sort T3, R5, W2
26 V Searching: Linear & Binary search T3, R5, W1
27 V Module V Revision & Practice T3, R5, W1
28 - Comprehensive Problem-Solving Session T1, T3, W2
29 - Student Seminar/Presentations T1, T3, W2
30 - Course Summary & Revision T1, R1, W1
Course Outcomes
CO1: Implement algorithms in C programs for problem solving.
CO2: Use functions, arrays, structures, and unions effectively in programs.
CO3: Apply pointer concepts and dynamic memory allocation in program design.
CO4: Design and implement basic data structures like linked lists, stacks, and queues.
CO5: Apply sorting and searching algorithms for efficient problem solving.
Mrs. Nirlipta Pallabee Samapika
Guest Faculty
Department of CSE
CUPGS, BPUT, Odisha
