UNIT – 1:
Introduction to programming methodologies and design of algorithms. Abstract Data Type, array, array organization, sparse array. Stacks and Stack ADT, Stack Manipulation, Prefix, infix and postfix expressions, their interconversion and expression evaluation. Queues and Queue ADT, Queue manipulation. General Lists and List ADT, List manipulations, Single, double and circular lists.
UNIT – II:
Trees, Properties of Trees, Binary trees, Binary Tree traversal, Tree manipulation algorithms, Expression trees and their usage, binary search trees, AVL Trees, Heaps and their implementation.
UNIT – III:
Multiway trees, B-Trees, 2-3 trees, 2-3-4 trees, B* and B+ Trees. Graphs, Graph representation, Graph traversal.
UNIT – IV:
Sorting concept, order, stability, Selection sorts (straight, heap), insertion sort (Straight Insertion, Shell sort), Exchange Sort (Bubble, quicksort), Merge sort (only 2-way merge sort). Searching – List search, sequential search, binary search, hashing concepts, hashing methods (Direct, subtraction, modulo-division, midsquare, folding, pseudorandom hashing), collision resolution (by open addressing: linear probe, quadratic probe, pseudorandom collision resolution, linked list collision resolution), Bucket hashing.
Additional Topics related to Data Structure
Data Structure simply corresponds to Structure of data that helps in implementing the best solution to solve a particular problem. A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. There are many types of data structure like array, link list, stack, queue, tree and graph.
The choice of data structure depends on two considerations.
- it must be rich enough in structure to show the actual relationships of data in real world.
- data structure should be simple enough so that one can process the data when necessary.
Primitive Data Structure: Integer, Float, Character, Pointer, Double.
Non Primitive Data Structure:
- Linear Data Structure: Array, String, Stack, Queue, Link List.
- Non Linear Data Structure: Tree, Graph.
Operations on primitive data structure:Creation, Selection, Update, Destroy.
Operations on Non-primitive data structure:Traversing, Sorting, Merging, Searching, Insertion, Deletion.
Notes: Sparse Matrix
----
Vinay Kumar Saini
Assistant Professor (I.T Department)
Maharaja Agrasen Institute of Technology (MAIT)
Sector-22, Rohini, Delhi-110086, India
Email-Id : vinay.kr.saini@gmail.com
Connect with me
Visit My Blog: http://vinay-kumar-saini.blogspot.in/
