Scribd
Upload
46 views1 page

DataStructure TS

The document outlines the key data structures and algorithms topics taught in technical university computer science curriculums using C and C++. These include arrays, linked lists, trees, graphs, sorting, searching, and string manipulation algorithms. Specific algorithms covered are binary search, merge sort, heap sort, quick sort, depth-first search, breadth-first search, topological sort, and shortest path algorithms like Dijkstra's. Abstract data types, stacks, queues, hash tables, and balanced binary search trees are also discussed.

Uploaded by

Durgesh Kumar Gupta
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 PDF, TXT or read online on Scribd
46 views1 page

DataStructure TS

The document outlines the key data structures and algorithms topics taught in technical university computer science curriculums using C and C++. These include arrays, linked lists, trees, graphs, sorting, searching, and string manipulation algorithms. Specific algorithms covered are binary search, merge sort, heap sort, quick sort, depth-first search, breadth-first search, topological sort, and shortest path algorithms like Dijkstra's. Abstract data types, stacks, queues, hash tables, and balanced binary search trees are also discussed.

Uploaded by

Durgesh Kumar Gupta
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 PDF, TXT or read online on Scribd
You are on page 1/ 1

DATA STRUCTURE USING 'C' and 'C++'

(As per Technical Universities Curriculum)

1 DEVELOPMENT OF ALGORITHMS:
Ø Algorithm and Analysis
Ø Notation (Big 'O' 'Omega' and 'Theta')
Ø Arrays and it's Operations, Storage structures for arrays
Ø Sparse matrices and it's Operations(Addition, Transpose and
Multiplication)
Ø Structures and arrays of structures, Abstract Data Type (ADT)
Ø Stacks and Queues (Deque, Priority Queue and Circular Queue)

2 LINKED LISTS:
Ø Singly linked lists - Linked stacks and queues
Ø Polynomial Operation( Addition and Multiplication)
Ø Circularly Linked Lists.
Ø Doubly Linked Lists and Multi linked list
Ø Dynamic storage management (First-fit. Worst-fit and Best-fit)
Ø Garbage collection and compaction.

3 SEARCHING & SORTING TECHNIQUES:


Ø Linear searching - Binary Searching. Hash Table Methods and
Address calculation
Ø Selection, Bubble, Insertion and Radix Sort
Ø Merge Sort
Ø Heap Sort
Ø Quick Sort

4 TREES :
Ø General Tree
Ø Binary Search Trees
Ø Tree Traversing (In-order, Pre-order ,Post-order and level-order)
Ø Operations on Binary Trees
Ø Expression Manipulations and Symbol Table construction
Ø Height Balanced Trees.( AVL tree, Red Black Tree)
Ø B-tree and B+ - Tree

5 GRAPHS :
Ø Representation of Graphs-(Adjacency list, Adjacency matrix and
Path Matrix)
Ø BFS, DFS Traversal
Ø Connected component & Strongly connected component in
Graph
Ø Bi-connected Graphs
Ø Topological sort, MST(Kruskal's and Prim's Algorithm)
Ø Shortest path problems (Dijkstra's Algorithm)
Ø Strings - Representation & Manipulations.
Ø Pattern Matching Operation (Boyer Moore & Knuth Morris Pratt)

You might also like