PROGRAMMING
Duration: 1.5 Months Fees: Rs 10000/-
COURSE Data Structures
Lorecmontipacstuums@dboalolurjasilat
basm.inet, consectetur pisci0n1g1-
H 9313565406
www.balujalabs.in
e4l1it6.6-S8u0s8p8e,n9d0i1ss5e5-i9n6280,
A1/17, Top Floor, Opapdois-ite
Metro Pillar no: 636, Main
Najafgarh
Road, Janakpuri New Delhi - 110058
EADLIN
Data Structures
Introduction
4. Stacks
Definition
Classification of Data Structures Introduction
Description of Various Data Structures 1.4.1 Stack Implementation
Arrays Operations on Stack
Lists Stack Terminology
Stack Algorithms for Push and Pop
Queues Implementing Stacks Using Pointers
Trees Applications of Stacks
Graph Stack Frames
C++ Memory Map Reversing a String
Memory Allocations in C++ Calculation of Postfix Expression 4.7.3A
Free Store Notation Conversions
Memory Allocation Operators Algorithm for Converting Infix Expression to
New Postfix form
Delete Algorithm to Evaluate a Postfix Expression
Memory Leaks 5. Queues
Algorithms
Performance Analysis & Measurement 1.11.1 Introduction
Space Complexity Queue Implementation
1.11.2 Time Complexity Operations on a Queue
Big OH Notation Algorithms for Insertion and Deletion in
Categories of Algorithms Queue(Using Arrays)
Limitation of OH Notation Algorithm for Addition in a Queue
Algorithm for Deletion From a Queue
2. Recursion- A Breath Breaker Limitation of Simple Queues
Algorithm for Insertion and Deletion in Queue(Using
Introduction Poniters)
Types of Recursion Variations in a Queue
Storage Classes A Circular Queue
Automatic Storage Class 2.3.2 Double Ended Queues
Register Storage Class 2.3.2 Storage Priority Queues
Class
2.3.3 Static Storage Class 6. Linked Lists
Recursion Essentials
Disadvantages of Recursion 2.6 Simple Introduction
Recursive Program 2.7 Towerof Hanoi Linked Lists
2.8 Recursion vs Iterations Advantages
Disadvantages
3. Arrays Key Terms
Representation of Linear Linked List
Introduction Operation on Linked List
One-dimensional Arrays Type of Linked List
Initializing One-dimensional Array Singly Linked List
Accessing One- dimensional Array Elements Inserting Nodes
Implementation of One-dimensional Array in Memory 6.7.1 A Inserting A Node at
Passing Arrays to Function the Beginning 6.7.1B Inserting A Node at
Insertion in One-dimensional Array the end
Deleting an Element form One-dimensional Array 3.9 C Inserting A New Node at the specific position
Traversing of Array Deleting Nodes
Merging Two Arrays 6.7.2 A Deleting the
Combining All Together First Node 6.7.2b Deleting the
Multi-dimensional Arrays Last Node
Initialization of Multidimensional Arrays 6.7.2C Deleting the Node from Specified Position
Accessing Two-dimensional Arrays Elements Circular Linked List
Implementation of Two-dimensional Array 3.15.1 Row- Major Inserting A Node at the Beginning
Implementation Deleting A Node from the End
3.15.2 Column Major Implementation The Josephus Problem
Pointer and Array Doubly Doubly Linked List
Pointer and One-dimensional Array Inserting A Node at the Beginning
Pointer and Multidimensional Arrays Inserting A Node at the End
Deleting A Node the Beginning
Deleting A Node from the End
Array of Pointer Circular Doubly Linked List
Arrays of Structures Creation Of Circular Doubly Linked List
Arrays within the Structure Inserting a Node at The Beginning
Sparse Matrix
Limitation of Linear Arrays
[email protected]
011-4166-8088, 90155-96280, 9313565406
Inserting a Node at The End
Deleting a Node from the Beginning 9. Graphs
Deleting a Node from the End
Introduction
Defining Graph
Basic Terminology
7. Trees
Graph Representation
Introduction Adjacency Matrix
Tree Terminology Adjacency List
Binary Tree Representation
Strictly Binary Tree Multi-list Representation
Complete Binary Tree Graph Traversal
Extended Binary Tree Breadth-First Traversal
Binary Tree Representation Depth First Traversal
Array Representation of Binary Trees Shortest Path Problem
Linked List Representation of BinaryTree Warshall's Algorithm
Creation of on Binary Trees Floyd's Algorithm
Operations on Binary Trees Dijkstra's Algorithm
7.6.1A Traversal of a Binary Tree Minimal Spanning Tree
7.6.1B Inorder Traversal Kruskal's Algorithm
C Preorder Traversal Prim's algorithm
7.6.1D Postorder Traversal Hamiltonian Paths
Technique of Conversion of an Expression
into Binary Tree
Binary Search Trees 10. Files
Insertion of Nodes
Binary Searching for Node Introduction
Deletion a Node Terminology
Threaded Binary Trees File Organisation
Height Balanced Trees File Operations
B-Tree Insertion Creation of File
B-Tree Deletion Reading of File
Updation of File
8. Sorting and Searchingt Insertion in the File
Introduction Deletion from the File
Sorting Array Sequential Files
Bubble Sorting Operations
Selection Sorting Disadvantages
Insertion Sort Areas og Use
Quick Sort 10.5.5 The Structure of
Bucket or Radix Sort Sequential Files
8.2.7 Heap Sort Direct File Organisation
8.2.7A Heap as a Priority 10.7.1 Direct File Organisation
Queue Multiple-key Access
B Sorting Using a Heap8.2.7C Multilist Oranization
Inverted-List
Heapsort Procedure 8.2.7D
Organization
Efficiency of Heap Sort
Shell Sort
Searching of Array
Element
Linear or Sequential
Searching
Binary Searching
Hashing
Resolving Hash Clashes
by Open Addressing
011-4166-8088, 90155-96280, 9313565406
Course Highlight
1. Consistent Classroom Guidance
2. Meticulously designed Study Material
3. One on One attention
EDUCATION
4. Time Bound Completion
5. Experienced full time faculty
6. Small batches
7. 5 days and weekend batches
8. Accommodation for outstation
[email protected]
students (PG)
011-4166-8088, 90155-96280,
9313565406
www.balujalabs.in
A1/17, Top Floor, Opposite Metro Pillar no: 636, Main Najafgarh
Road, Janakpuri New Delhi - 110058
