Scribd
Upload
160 views

Data Structures: Course Code: USIT302

This document outlines the units covered in a Data Structures course. The five units cover: 1) introduction to data structures and analysis, arrays, and linked lists; 2) stacks and queues; 3) sorting and searching techniques like bubble sort and binary search trees; 4) advanced tree structures like red-black trees and B-trees; and 5) hashing techniques and graphs. Key data structures covered include arrays, linked lists, stacks, queues, trees, hashes, and graphs. Operations on and applications of each data structure are also discussed.

Uploaded by

Ajay
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
160 views

Data Structures: Course Code: USIT302

This document outlines the units covered in a Data Structures course. The five units cover: 1) introduction to data structures and analysis, arrays, and linked lists; 2) stacks and queues; 3) sorting and searching techniques like bubble sort and binary search trees; 4) advanced tree structures like red-black trees and B-trees; and 5) hashing techniques and graphs. Key data structures covered include arrays, linked lists, stacks, queues, trees, hashes, and graphs. Operations on and applications of each data structure are also discussed.

Uploaded by

Ajay
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Data Structures

Course Code: USIT302


Unit 1:
• Introduction: Data and Information, Data Structure, Classification of Data Structures,
Primitive Data Types, Abstract Data Types, Data structure vs. File Organization, Operations
on Data Structure, Algorithm, Importance of Algorithm Analysis, Complexity of an
Algorithm, Asymptotic Analysis and Notations, Big O Notation, Big Omega Notation, Big
Theta Notation, Rate of Growth and Big O Notation.
• Array:Introduction, One Dimensional Array, Memory Representation of One Dimensional
Array, Traversing, Insertion, Deletion, Searching, Sorting, Merging of Arrays,
Multidimensional Arrays, Memory Representation of Two Dimensional Arrays, General
Multi-Dimensional Arrays, Sparse Arrays, SparseMatrix, Memory Representation of Special
kind of Matrices, Advantages and Limitations of Arrays.
Unit 2:
• Linked List: Linked List, One-way Linked List, Traversal of Linked List, Searching,
Memory Allocation and De-allocation, Insertion in Linked List, Deletion from Linked List,
Copying a List into Other List, Merging Two Linked Lists, Splitting a List into Two Lists,
Reversing One way linked List, Circular Linked List, Applications of Circular Linked List,
Two way Linked List, Traversing a Two way Linked List, Searching in a Two way linked
List, Insertion of an element in Two way Linked List, Deleting a node from Two way Linked
List, Header Linked List, Applications of the Linked list, Representation of Polynomials,
Storage of Sparse Arrays, Implementing other Data Structures.
Unit 3:
• Stack: Introduction, Operations on the Stack Memory Representation of Stack, Array
Representation of Stack, Applications of Stack, Evaluation of Arithmetic Expression,
Matching Parenthesis, infix and postfix operations, Recursion.
• Queue: Introduction, Queue, Operations on the Queue, Memory Representation of Queue,
Array representation of queue, Linked List Representation of Queue, Circular Queue,Some
special kinds of queues, Deque,Priority Queue, Application of Priority Queue, Applications of
Queues.
Unit 4:
• Sorting and Searching Techniques Bubble, Selection, Insertion, Merge Sort. Searching:
Sequential Binary, Indexed Sequential Searches, Binary Search.
• Tree : Tree, Binary Tree, Properties of Binary Tree, Memory Representation of Binary Tree,
Operations Performed on Binary Tree, Reconstruction of Binary Tree from its Traversals,
Huffman Algorithm, Binary Search Tree, Operations on Binary Search Tree, Heap, Memory
Representation of Heap, Operation on Heap, Heap Sort.
• Advanced Tree Structures : Red Black Tree, Operations Performed on Red Black Tree,
AVL Tree, Operations performed on AVL Tree, 2-3 Tree, B-Tree.
Unit 5:
• Hashing Techniques
• Hash function, Address calculation techniques, Common hashing functions Collision
resolution, Linear probing, Quadratic,Double hashing, Buckethashing, Deletion and
rehashing
• Graph: Introduction, Graph, Graph Terminology, Memory Representation of Graph,
Adjacency Matrix Representation of Graph, Adjacency List or Linked Representation of
Graph, Operations Performed on Graph, GraphTraversal, Applications of the Graph,
Reachability, Shortest Path Problems, Spanning Trees.

You might also like