COMPANY

LOGO.

BUSINESS
BUSINESS
·BR OCHURE·

PROGRAMMING
Duration: 1.5 Months Fees: Rs 10000/-
COURSE Data Structures

Lorem ipsum dolor sit amet, consectetur

contactus@balujalabs.in
piscing elit. Suspendisse
011-4166-8088, in
90155-96280,
HEADLINE
9313565406
adi- Metro
A1/17, Top Floor, Opposite
Pillar no: 636, Main Najafgarh
Road, Janakpuri New Delhi - 110058
www.balujalabs.in
 Data Structures
Introduction
4. Stacks
Definition
Introduction
Classification of Data Structures
Stack Implementation
Description of Various Data Structures 1.4.1
Operations on Stack
Arrays
Stack Terminology
Lists
Algorithms for Push and Pop
Stack
Implementing Stacks Using Pointers
Queues
Trees Applications of Stacks
Stack Frames
Graph
Reversing a String
C++ Memory Map
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
Introduction
Disadvantages of Recursion 2.6 Simple
Linked Lists
Recursive Program 2.7 Towerof Hanoi
Advantages
2.8 Recursion vs Iterations
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.1A Inserting A Node at the Beginning
Passing Arrays to Function 6.7.1B Inserting A Node at the end
Insertion in One-dimensional Array C Inserting A New Node at the specific position
Deleting an Element form One-dimensional Array 3.9 Deleting Nodes
Traversing of Array 6.7.2A Deleting the First Node
Merging Two Arrays 6.7.2b Deleting the Last Node
Combining All Together 6.7.2C Deleting the Node from Specified Position
Multi-dimensional Arrays Circular Linked List
Initialization of Multidimensional Arrays Inserting A Node at the Beginning
Accessing Two-dimensional Arrays Elements Deleting A Node from the End
Implementation of Two-dimensional Array 3.15.1 Row- Major The Josephus Problem
Implementation Doubly Doubly Linked List
3.15.2 Column Major Implementation Inserting A Node at the Beginning
Pointer and Array Inserting A Node at the End
Pointer and One-dimensional Array Deleting A Node the Beginning
Pointer and Multidimensional Arrays 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 contactus@balujalabs.in
Limitation of Linear Arrays
011-4166-8088, 90155-96280, 9313565406
 Inserting a Node at The End
9. Graphs
Deleting a Node from the Beginning
Deleting a Node from the End Introduction
Defining Graph
Basic Terminology
7. Trees Graph Representation
Adjacency Matrix
Introduction
Adjacency List
Tree Terminology
Representation
Binary Tree
Multi-list Representation
Strictly Binary Tree
Graph Traversal
Complete Binary Tree
Breadth-First Traversal
Extended Binary Tree
Depth First Traversal
Binary Tree Representation
Shortest Path Problem
Array Representation of Binary Trees
Warshall's Algorithm
Linked List Representation of BinaryTree
Floyd's Algorithm
Creation of on Binary Trees
Dijkstra's Algorithm
Operations on Binary Trees
Minimal Spanning Tree
7.6.1A Traversal of a Binary Tree
Kruskal's Algorithm
7.6.1B Inorder Traversal
Prim's algorithm
C Preorder Traversal
Hamiltonian Paths
7.6.1D Postorder Traversal
Technique of Conversion of an Expression
into Binary Tree
10. Files
Binary Search Trees
Insertion of Nodes
Introduction
Binary Searching for Node
Terminology
Deletion a Node
File Organisation
Threaded Binary Trees
File Operations
Height Balanced Trees
Creation of File
B-Tree Insertion
Reading of File
B-Tree Deletion
Updation of File
8. Sorting and Searchingt Insertion in the File
Deletion from the File
Introduction Sequential Files
Sorting Array Operations
Bubble Sorting Disadvantages
Selection Sorting Areas og Use
Insertion Sort 10.5.5 The Structure of
Quick Sort Sequential Files
Bucket or Radix Sort Direct File Organisation
8.2.7 Heap Sort 10.7.1 Direct File Organisation
8.2.7A Heap as a Priority
Multiple-key Access
Queue Multilist Oranization
B Sorting Using a Heap 8.2.7C 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
contactus@balujalabs.in
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