Scribd
Upload
39 views

Teaching Plan Data Structures: June & I June & II June & III

The document outlines a teaching plan for a Data Structures course over one semester, including 14 topics to be covered such as linear and non-linear data structures, stacks, queues, trees, graphs, and sorting/searching algorithms. Each topic is allocated 4 hours of instruction over the semester for a total of 56 hours. References for further reading on data structures and algorithms in Python and C++ are also provided.

Uploaded by

Gudipudi Dayanandam
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
39 views

Teaching Plan Data Structures: June & I June & II June & III

The document outlines a teaching plan for a Data Structures course over one semester, including 14 topics to be covered such as linear and non-linear data structures, stacks, queues, trees, graphs, and sorting/searching algorithms. Each topic is allocated 4 hours of instruction over the semester for a total of 56 hours. References for further reading on data structures and algorithms in Python and C++ are also provided.

Uploaded by

Gudipudi Dayanandam
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Government College for Men (Autonomous): Kadapa

Department of Computer Science


Teaching Plan
Data Structures
Year: 2020 - 2021 Semester: IV
No. of hour per week: 4 Total hours/credits: 56/3

S. Month & No. of Topic Curricular Co-curricular Rema


No. Week hours Activity Activity rks
1 April & I 04 Concept of Abstract Data Types (ADTs), data types, data
structures, storage structures, and file structures, primitive
and non-primitive data structures, linear and non-linear data
structures.
2 April & II 04 Linear Lists – ADT, Array and Linked representations,
references. Arrays – ADT, Mappings, Representations, Sparse
Matrices, Sets – ADT, Operations.
3 April & III 04 Linked Lists: Single Linked List, Double Linked List, Circular
Linked List, applications.
4 April & 04 Stacks: Definition, ADT, array and linked representations,
IV implementations and applications.
5 April & V 04 Queues: definition, ADT, array and linked representations,
circular queues
6 May & I 04 De-queues, priority queues, implementations and
applications.

7 May & II 04 Trees: binary tree, definition, properties, ADT, array and
linked representations, implementations and applications.
8 May & III 04 Binary Search Trees (BST) – definition, ADT, operations and
implementations, applications.
9 May & IV 04 Threaded Binary Trees, Heap Trees.
10 June & I 04 Graphs: introduction, representation, traversals, connected
components
11 June & II 04 Basic searching techniques, minimal spanning trees.
12 June & III 04 Sorting: selection, insertion, bubble, merge
13 June & IV 04 Quick, heap. Searching linear, binary.
14 July & V 04 Revision

References
1. Benjamin Baka, Python Data Structures and Algorithms
2. Rance D. Necaise, Data Structures and Algorithms Using Python
3. Kent D. Lee, Steve Hubbard, Data Structures and Algorithms with Python 
4. M. T. Goodrich, R.Tamassia, M. H. Goldwasser, Data Structures and Algorithms in Python
5. Sahani S, Data Structures, Algorithms and Applications in C++, McGraw-Hill, 2002.
6. SamantaD, Classic Data Structures, Prentice-Hall of India, 2001.
7. Heilman G I, Data Structures and Algorithms with OOP, Tata McGraw-l lill. 2002. (I and 14).

You might also like