You are on page 1of 4

MAILAM ENGINEERING COLLEGE

(Approved by AICTE New Delhi, Affiliated to Anna University Chennai
& Accredited by National Board of Accreditation (NBA) New Delhi)

MAILAM (PO), Villupuram(Dt). Pin: 604 304

DEPARTMENT OF COMPUTER APPLICATIONS
LECTURE PLAN FOR THEORY – (SEP 2012 – DEC 2012)
STAFF NAME: Mrs. V.REKHA

CLASS: MCA

SEM:I
SUBJECT CODE: MC9214

SUBJECT NAME: DATA STRUCTURES
SEP’12

PERIO
D

Specify
Teaching
Aids ( if
required)

PORTION COVERAGE

4

-

UNIT I - DATA STRUCTURES
Introduction to Data Structures

DATE

DAY

WORKIN
G DAYS

10.09.12,
11.09.12,
12.09.12,
13.09.12
14.09.12
15.09.12
17.09.12,
19.09.12
20.09.12
21.09.12

MON
TUE
WED
THU
FRI
SAT
MON
WED
THU
FRI

1
2
3
4
5
6
7
8
9
10

22.09.12

SAT

11

1

24.09.12
25.09.12
27.09.12
28.09.12
29.09.12
01.10.12
03.10.12
04.10.12

MON
TUE
THU
FRI
SAT
MON
WED
THU

12
13
14
15
16
17
18
19

1
1
1
2
1
2
1
1

05.10.12

FRI

20

08.10.12
09.10.12
10.10.12
11.10.12
12.10.12,
15.10.12
16.10.12,
17.10.12

MON
TUE
WED
THU
FRI
MON
TUE
WED

21
22
23
24
25
26
27
28

18.10.12,
19.10.12

THU
FRI

22.10.12
25.10.12,
27.10.12

2
1

Arrays
Structures

2

Stack Definition and examples

1
2

2

Representing Stacks
Applications of Stack
Infix, Postfix, Prefix Expressions
using Stack
Queues and its representation
Applications of Queue
Priority Queue
List and its Representation
Linked list
Doubly Linked List
Circular Linked List
Application of List
UNIT II - TREES
Binary Trees

2
1
1
1

Operations on binary trees
Binary Tree Representations
Internal node, External node
implicit array representation

3

Binary tree Traversals

2

Huffman Algorithm

29
30

2

Representing Lists as Binary Trees

MON

31

2

UNIT III - SORTING AND
SEARCHING
General Background

THU
SAT

32
33

2

Exchange sorts

REMARKS

11.11.11.11.12 WED THU 44 45 2 UNIT IV .11.12.11.11.12 FRI 37 1 Merge Sort 03.12 SAT 47 1 Representation of graphs 19.12 THU 65 1 Freeing list nodes 07.11. 08.12 TUE 35 1 Tree Sorting 01.12.11.12 MON 68 69 2 Garbage Collection .12 TUE 40 1 Tree Searching 07.12 TUE THU 57 58 2 Graph Traversals 30.STORAGE MANAGEMENT General Lists: Introduction 03.12 08.12 FRI 46 2 An application of graphs 17.11.29.12 TUE 63 1 linked list representation 05.11. 29.12 MON 48 49 2 transitive closure.12 MON 39 2 Basic Search Techniques 06.12 FRI SAT 66 67 2 Automatic list Management: Reference count method 10.11.12. 15.12 TUE 50 1 Shortest path algorithm 21.12.11.12 FRI 43 2 Hashing 14.11.11.12 SAT 38 1 Radix Sorts 05.11.12 MON 34 1 Selection 30.10.12.11.12 WED 51 1 a flow Problem 22.12.11.GRAPHS AND THEIR APPLICATIONS Graphs 16.12 WED 64 1 using lists 06. Warshall’s algorithm 20.12 SAT MON 55 56 2 Linked representation of Graphs 27.12. 26.10.11.12.11.12 WED THU 41 42 2 General Search Trees 09.12 THU 36 1 Insertion Sorts 02.12.12.12 MON 61 62 2 Operations 04.11.12 FRI 53 54 2 An application of scheduling 24.11.12.12 THU 52 1 Dijkstra’s algorithm 23.12 FRI 59 60 2 UNIT V .

12.12 THU 72 1 Compaction STAFF SIGN HOD PRINCIPAL MAILAM ENGINEERING COLLEGE MAILAM (PO).11. Pin: 604 304 (Approved by AICTE New Delhi.12. Villupuram(Dt).12 TUE 70 1 Algorithms 12.12. Affiliated to Anna University Chennai & Accredited by National Board of Accreditation (NBA) New Delhi) DEPARTMENT OF Master of Computer Applications LECTURE PLAN FOR LABORATORY – (JUNE 2012 – NOV 2012) STAFF NAME: SUBJECT CODE: CLASS: SEM: SUBJECT NAME: JULY’12 DATE DAY WORKING DAYS 05-07-12 06-07-12 07-07-12 THU FRI SAT 1 2 3 08-07-12 SUN HOLIDAY PERIOD EXPERIMENT COVERAGE * REMARKS .12 WED 71 1 Collection 13.

STAFF SIGN HOD PRINCIPAL .