JB INSISTUTE OF ENGINEERING AND TECHNOLGY

Bhaskar Nagar, Yenkapally(V), Moinabad (M),R.R.District,

Hyderabad 500 075, T.S., India.

UNIT PLAN

Academic Year : 2017-2018

Semester : I

Name of the Program : B.Tech Year: II

Course/Subject: DATA STRUCTURES THROUGH C Course Code: E215A

Name of the Faculty: M VENU GOPAL Dept.: IT

Designation: ASSISTANT PROFESSOR

TEXT BOOKS:
1. Data Structures Using C Reema Thareja, Oxford University Press, 2011 Learning.
2. Data Structures Using C (Paperback) by Aaron M. Tenenbaum

Course
Objectives References
No. of
& (Text Book,
Lesso Period
UNIT Date Topics / Sub-Topics Course Out Journal)
n No. s
comes
Nos.
12/07/2017 COb 1 & T1, T2
1 1 Introduction to Data Structures CO 1

13/07/2017 COb 1 & T1, T2

2 1 abstract data types CO 1

18/07/2017 COb 1 & T1, T2

2 Linear list singly linked list CO 1
Unit 3
implementation
I
19/07/2017 COb 1 & T1, T2
4 2 insertion, deletion and searching CO 1
 operations on linear list

20/07/2017 COb 1 & T1, T2

2 circular linked list CO 1
5
implementation

21/07/2017 COb 1& T1, T2

2 Double linked list CO 1
6
implementation

24/07/2017 COb 1 & T1, T2

2 insertion, deletion and searching CO 1
7
operations

25/07/2017 COb 1 & T1, T2

8 1 Applications of linked lists CO 1

26/07/2017 COb 1 & T1, T2

9
CO 1
27/07/2017 COb 1 & T1, T2
10
CO 1
28/07/2017 COb 1 & T1, T2
11
CO 1
31/07/2017 COb 1 & T1, T2
12
CO 1
01/08/2017 COb 1 & T1, T2
13
CO 1
02/08/2017 COb 1 & T1, T2
14
CO 1
03/08/2017 COb 1 & T1, T2
15
CO 1
04/08/2017 COb 1 & T1, T2
16
CO 1
08/08/2017 COb 1 & T1, T2
17 1 Stacks-Operations CO 1

09/08/2017 COb 1 & T1, T2

Unit 18 2 array and linked representations CO 1
of stacks
II
10/08/2017 COb 2 & T1, T2
19 2 stack applications-infix to CO 1
postfix conversion

11/08/2017 COb 2 & T1, T2

20 1 postfix expression evaluation CO 1
 16/08/2017 COb 2 & T1, T2
21 1 recursion implementation CO 1

17/08/2017 COb 2 & T1, T2

22 1 Queues-operations CO 1

1 array and linked representations

2 Circular Queue operations

2 Dequeue

1 applications of queue

18/08/2017 COb 2 & T1, T2

23 1 Trees Definitions CO 1

21/08/2017 COb 2 & T1, T2

24 1 Binary tree representation CO 1

22/08/2017 COb 2 & T1, T2

25 2 Binary search tree CO 1

23/08/2017 COb 2 & T1, T2

Unit 26 2 binary tree traversals CO 1
III
24/08/2017 COb 2 & T1, T2
27 2 AVL tree operations CO 1

28/08/2017 COb 2 & T1, T2

28 2 B-tree operations CO 1

29 29/08/2017 COb 2 & T1, T2

CO 1
30/08/2017 COb 2 & T1, T2
30 CO 1

31 31/08/2017 COb 2 & T1, T2

01/09/2017 COb 2 & T1, T2

32
CO 1
04/09/2017 COb 2 & T1, T2
33
 05/09/2017 COb 2 & T1, T2
34
CO 1
11/09/2017 COb 2 & T1, T2
35
CO 1
12/09/2017 COb 3 & T1, T2
36 CO 2

13/09/2017 COb 3 & T1, T2

37 CO 2

14/09/2017 COb 3 & T1, T2

38
CO 2
15/09/2017 COb 3 & T1, T2
39 1 Graphs: Terminology CO 2

18/09/2017 COb 3 & T1, T2

1 sequential and linked CO 2
40
Unit representation
IV
19/09/2017 COb 3 & T1, T2
41 2 graph traversals CO 2

21/09/2017 COb 3 & T1, T2

42 2 Depth First Search CO 2

22/09/2017 COb 3 & T1, T2

2 Breadth First Search CO 2
43
implementation

25/09/2017 COb 3 & T1, T2

44 2 Spanning trees CO 2

26/09/2017 COb 3 & T1, T2

45 3 Prims and Kruskals method CO 2

27/09/2017 COb 3 & T1, T2

46
CO 2
05/10/2017 COb 3 & T1, T2
47
CO 2
06/10/2017 COb 3 & T1, T2
48
CO 2
9/10/2017 COb 4& T1, T2
49
CO 3
10/10/2017 COb 4& T1, T2
50
CO 3
51 11/10/2017 COb 4& T1, T2
CO 3
 12/10/2017 COb 4& T1, T2
52
CO 3
13/10/2017 COb 4& T1, T2
53 1 Searching and Sorting CO 3

16/10/2017 COb 4& T1, T2

54 1 Big O Notation CO 3

17/10/2017 COb 4& T1, T2

Unit 55 1 Sorting- selection sort CO 3
V
19/10/2017 COb 4& T1, T2
56 1 bubble sort CO 3

20/10/2017 COb 4& T1, T2

57 1 insertion sort CO 3

23/10/2017 COb 4& T1, T2

58 1 quick sort CO 3

24/10/2017 COb 4& T1, T2

59 1 merge sort CO 3

25/10/2017 Searching-linear and binary COb 5& T1, T2

60 2 search methods. CO 4

26/10/2017 COb 5& T1, T2

61
CO 4
27/10/2017 COb 1 & T1, T2
62
CO 1
63 30/10/2017 COb 1 & T1, T2
CO 1
31/10/2017 COb 1 & T1, T2
64
CO 1
01/11/2017 COb 1 & T1, T2
65
CO 1