Pandian Saraswathi Yadav Engineering College,

Sivagangai, Arasanoor – 630 561

Course Plan

Department : Electronics and Communication Engineering

Subject Code & Subject : EC8393 FUNDAMENTALS OF DATA STRUCTURES IN C
Semester : 03
Name of the faculty member : Mr.K.Rajasekaran
Text and Reference Books:

S.No. Title of the book Author(s) Publications

T1 The C Programming Language. Brian W. Kernighan and 2nd Edition, Pearson Education, 1988.
Dennis M. Ritchie
T2 Data Structures and Algorithm Analysis in C Mark Allen Weiss. 2nd Edition, Pearson Education,
1997.
R1 Programming and Data Structures E.Balagurusamy McGraw Hill Education.
R2 Fundamentals of Data Structures in C S.Kavitha,BharathiAshok Magnus Publication
R3 Computer programming V.Ramesh Babu VRB Publishers Pvt Ltd , 2013-2014
R.Samyuktha
M.Muniratnam
R4 Programming in C Stephen G. Kochan 3rd edition, Pearson Ed.,

Lecture Date Unit No. Topic to be taught Page numbers of Text or

No. Referencebook

1 02-07-18 I Structure of a ‘C’ program R2[1.2-1.5]

2 03-07-18 I compilation and linking processes R2[1.2-1.5]
3 05-07-18 I Constants, Variables – Data Types R2[1.8-1.11]
4 06-07-18 I Expressions using operators in ‘C R2[1.14]
5 09-07-18 I Managing Input and Output operations R2[1.23]
6 10-07-18 I Decision Making and Branching R2[1.32]
7 12-07-18 I Looping statements R2[1.44]
8 13-07-18 I Array And its Types R2[2.1-2.34]
9 16-07-18 I String and its operation,sorting searching R2[2.52]
10 17-07-18 II Function – definition of function R2[3.1-3.17]
11 19-07-18 II Declaration of function R2[3.1-3.17]
12 20-07-18 II Pass by value R2[3.23-3.33]
13 23-07-18 II Pass by reference R2[3.23-3.33]
14 24-07-18 II Recursion R2[3.34]
15 26-07-18 II Pointers - Definition – Initialization R2[4.1]
16 27-07-18 II Structure R2[5.1]
17 30-07-18 II Union R2[5.25]
18 31-07-18 II Storage Class and Preprocessor Directives R2[5.32-5.43]
19 02-08-18 III Array based implementation R2[6.3]
20 03-08-18 III Stack ADT R2[7.1]
21 06-08-18 III Queue ADT R2[8.1]
22 07-08-18 III Singly linked Lists R2[6.4]
23 09-08-18 III Doubly linked List R2[6.10]
24 10-08-18 III Circular linked List R2[6.15]
25 13-08-18 III Linked List based implementation of Stack R2[7.2]
26 14-08-18 III Linked List based implementation of Queue R2[8.5]
27 16-08-18 III Polynomial Manipulation R2[6.15]
28 17-08-18 IV Tree ADT R2[9.1]
29 20-08-18 IV Tree Traversals R2[9.22]
30 21-08-18 IV Binary Tree ADT and Expression trees R2[9.6-9.8]
31 23-08-18 IV Applications of trees R2[9.22]
32 24-08-18 IV Binary Search Tree ADT R2[9.10]
33 27-08-18 IV Set and Union R2[10.1-10.7]
34 28-08-18 IV Representation of Graph R2[11.1-11.7]
35 30-08-18 IV Types of Graph R2[11.10]
36 31-08-18 IV Graph Traversal R2[11.12]
37 03-09-18 V Linear Search R2[12.1]
38 04-09-18 V Binary Search R2[12.2]
39 06-09-18 V Bubble Sort R2[12.19]
40 07-09-18 V Insertion Sort R2[12.7]
41 10-09-18 V Merge Sort R2[12.39]
42 11-09-18 V Quick Sort R2[12.22]
43 14-09-18 V Hash Tables R2[13.1]
44 17-09-18 V Extendible Hashing R2[13.14]
45 18-09-18 V Overflow handling R2[13.3]

Faculty member HOD Pricipal