Friday, January 11, 2019

Data structure parts

DATA STRUCTURE :-


  • BASIC CONCEPT : 
  1. Introduction to Complexity.
  2. Data Structure and Data Structure operations. 
  3. Applications of Data Structure.
  4. Basic data Structures.     
  • ARRAYS :
  1. Introduction.
  2. Types of Array.
  3. Memory representation.
  4. Applications and operations.
  • STACKS :
  1. Introduction.
  2. memory representation.
  3. Applications and operations.
  • LINKED LIST :
  1. Operations:-traversing.
  2. searching.
  3. inserting.
  4. deleting.
  5. operations oh header linked list.
  6. circular linked list.
  7. doubly linked list.
  8. memory representation.
  9. Applications.
  10. polynomial manipulation.
  • QUEUE :
  1. Introduction.
  2. Types.
  3. Memory Representation and Applications.
  • TREES :
  1. Definition and Basic concepts.
  2. Representation in Contiguous Storage.
  3. Binary Tree.
  4. Binary Tree Traversal.
  5. Searching.
  6. Insertion and deletion in Binary trees.
  7. Binary Search tree.
  • GRAPHS :
  1. Introduction.
  2. Memory Representation.
  3. Graph Traversal (DFS and BFS).
  • SEARCHING :
  1. Binary search.
  2. Linear search.
  • SORTING :
  1. Bubble Sort.
  2. Insertion Sort.
  3. Selection Sort.
  4. Merge Sort.
  5. Quick Sort.
  6. Comparison of various Searching and Sorting algorithms.

No comments:

Post a Comment