Scribd
Upload
2 views2 pages

Data Structures

The document outlines a syllabus for a course on Data Structures, divided into five modules covering linear and nonlinear data structures, searching and sorting algorithms, divide and conquer techniques, dynamic programming, greedy methods, and backtracking problems. Key topics include various data structures like lists, stacks, queues, trees, and graphs, along with their operations and applications. The syllabus also includes specific algorithms for sorting, searching, and optimization problems.

Uploaded by

madanmadhu818
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Data Structures

The document outlines a syllabus for a course on Data Structures, divided into five modules covering linear and nonlinear data structures, searching and sorting algorithms, divide and conquer techniques, dynamic programming, greedy methods, and backtracking problems. Key topics include various data structures like lists, stacks, queues, trees, and graphs, along with their operations and applications. The syllabus also includes specific algorithms for sorting, searching, and optimization problems.

Uploaded by

madanmadhu818
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Data Structures

SYLLABUS

MODULE 1:

Linear Data Structures Abstract Data Types, List ADT, array based implementation, linked list
implementation, singly linked list, circularly linked list, doubly linked list- all operations –
creation, insertion, deletion, traversal, applications of list – polynomial manipulation. Stack
ADT- operation, applications, evaluating arithmetic expressions, conversion of infix to postfix
expression, queue ADT – operations- circular queuepriority queue- deque – applications of
queues.

MODULE 2:

Nonlinear data structures Tree ADT – tree traversal – binary tree ADT –expression trees –
applications of trees – binary search tree ADT- threaded binary tree-AVL trees, B+ Trees,
HeapApplications of heap. Definition of [Link] representation – types of graph - Bread
first traversal – depth first traversalapplications of graph.

MODULE 3:

Search and Sorting Searching - Linear search – binary search – depth first search – breath first
search. Sorting – Bubble sort-selection sortinsertion sort- radix sort- shell sort – topological
sort. Hash functions- separate chaining - open addressing – rehashing – extendible Hashing.

MODULE 4 :

Divide and conquer and dynamic Programming:

Divide and Conquer - Definition - Merge sort – quick sort – binary tree traversal. Dynamic
Programming – definition – knapsack problem and memory functions – optimal binary search
trees

MODULE 5 :

Greedy Technique and Back tracking Greedy Method – Prims’ Algorithm – Kruskal’s
Algorithm – Dijikstra’s algorithm – Huffman Trees and codes. Back Tracking - Hamiltonian

1
Cycle – N queen Problem – M-Coloring problem – Sudoku solving Problem CO5 PO1 PO2
PO3 PO6 PO11 Text and Reference Book

You might also like