Scribd
Upload
53 views1 page

Data Structures

This document outlines the units covered in an MC9214 Data Structures course. The units include: data structures like arrays, stacks, queues and linked lists; binary trees including representations, traversals and the Huffman algorithm; sorting and searching algorithms like insertion sort, merge sort and hashing; graphs including representations, shortest path algorithms and applications; and storage management including lists, garbage collection and compaction. The course allocates 45 lectures and 15 tutorials over 60 periods.

Uploaded by

Sajitha Banu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
53 views1 page

Data Structures

This document outlines the units covered in an MC9214 Data Structures course. The units include: data structures like arrays, stacks, queues and linked lists; binary trees including representations, traversals and the Huffman algorithm; sorting and searching algorithms like insertion sort, merge sort and hashing; graphs including representations, shortest path algorithms and applications; and storage management including lists, garbage collection and compaction. The course allocates 45 lectures and 15 tutorials over 60 periods.

Uploaded by

Sajitha Banu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

MC9214 DATA STRUCTURES

UNIT I DATA STRUCTURES Introduction Arrays Structures Stack: Definition and examples, Representing Stacks - Queues and lists: Queue and its Representation, lists Applications of Stack, Queue and Linked Lists. UNIT II TREES Binary Trees Operations on binary trees - Binary Tree Representations node representation, internal and external nodes, implicit array representation Binary tree Traversals - Huffman Algorithm Representing Lists as Binary Trees UNIT III SORTING AND SEARCHING General Background Exchange sorts Selection and Tree Sorting Insertion Sorts Merge and Radix Sorts Basic Search Techniques Tree Searching General Search Trees Hashing. UNIT IV GRAPHS AND THEIR APPLICATIONS Graphs An application of graphs Representation transitive closure - Warshalls algorithm Shortest path algorithm - a flow Problem Dijkstras algorithm An application of scheduling - Linked representation of Graphs Graph Traversals UNIT V STORAGE MANAGEMENT General Lists: Operations, linked list representation, using lists, Freeing list nodes Automatic list Management: Reference count method, Garbage Collection, Algorithms, Collection and compaction L : 45 T : 15 TOTAL : 60 PERIODS5 TEXTBOOK: 1. Tanaenbaum A.S.,Langram Y. Augestein M.J Data Structures using C Pearson Education , 2004 REFERNCES: 1. Robert Kruse & Clovis L. Tondo Data Structures and Program Design in C,Prentice Hall , 2nd edition.,11. 2. Weiss Data Structures and Algorithm Analysis in C ,Addison Wesley , Second Edition, 1

You might also like