BALUJA INSTITUTE

of Technology & Management

ADDRESS:
A1/17, Top Floor, Opposite Metro Pillar no:
[email protected] 636, Main Najafgarh Road, Janakpuri, New
011-4166-8088, 90155-96280, 9313565406 Delhi - 110058
 Data Structures

 Duration: 1.5
Months Fees: Rs 10000/-
1. Introduction
 Definition  Static Storage Class
 Classification of Data Structures  Recursion Essentials
 Description of Various Data Structures 1.4.1 Arrays  Disadvantages of Recursion
 Lists  Simple Recursive Program
 Stack  Tower of Hanoi
 Queues  Recursion vs Iterations
 Trees 3. Arrays
 Graph  Introduction
 C++ Memory Map  One-dimensional Arrays
 Memory Allocations in C++  Initializing One-dimensional Array
 Free Store  Accessing One- dimensional Array Elements
 Memory Allocation Operators  Implementation of One-dimensional Array in Memory
 New  Passing Arrays to Function
 Delete  Insertion in One-dimensional Array
 Memory Leaks  Deleting an Element form One-dimensional Array
 Algorithms
 Traversing of Array
 Performance Analysis & Measurement
 Merging Two Arrays
 Space Complexity
 Combining All Together
 Time Complexity
 Multi-dimensional Arrays
 Big OH Notation
 Initialization of Multidimensional Arrays
 Categories of Algorithms
 Accessing Two-dimensional Arrays Elements
 Limitation of OH Notation
 Implementation of Two-dimensional Array
2. Recursion- A Breath Breaker
 Row- Major Implementation
 Introduction
 Types of Recursion  Column Major Implementation
 Storage Classes  Pointer and Array
 Automatic Storage Class  Pointer and One-dimensional Array
 Register Storage Class  Pointer and Multidimensional Arrays
 Storage Class
  Algorithm for Deletion From a Queue
Array of Pointer
  Limitation of Simple Queues
Arrays of Structures
  Algorithm for Insertion and Deletion in Queue(Using
Arrays within the Structure
 Poniters)
Sparse Matrix
 Variations in a Queue
 Limitation of Linear Arrays
 A Circular Queue
4. Stacks
 Double Ended Queues
 Introduction
 Priority Queues
 Stack Implementation
 Operations on Stack 6. Linked Lists
 Introduction
 Stack Terminology
 Linked Lists
 Algorithms for Push and Pop
 Advantages
 Implementing Stacks Using Pointers
 Disadvantages
 Applications of Stacks
 Key Terms
 Stack Frames
 Representation of Linear Linked List
 Reversing a String
 Operation on Linked List
 Calculation of Postfix Expression
 Type of Linked List
 A Notation Conversions
 Singly Linked List
 Algorithm for Converting Infix Expression to Postfix form
 Inserting Nodes
 Algorithm to Evaluate a Postfix Expression
 Inserting A Node at the Beginning
5. Queues
 Inserting A Node at the end
 Introduction
 Inserting A New Node at the specific position
 Queue Implementation
 Deleting Nodes
 Operations on a Queue
 Deleting the First Node
 Algorithms for Insertion and Deletion in Queue(Using
 Deleting the Last Node
Arrays)
 Algorithm for Addition in a Queue  Deleting the Node from Specified Position
 Circular Linked List
  Inorder Traversal
Inserting A Node at the Beginning
  C Preorder Traversal
Deleting A Node from the End
  Postorder Traversal
The Josephus Problem
  Technique of Conversion of an Expression into Binary
Doubly Doubly Linked List
 Tree
Inserting A Node at the Beginning
 Binary Search Trees
 Inserting A Node at the End
 Insertion of Nodes
 Deleting A Node the Beginning
 Binary Searching for Node
 Deleting A Node from the End
 Deletion a Node
 Circular Doubly Linked List
 Threaded Binary Trees
 Creation Of Circular Doubly Linked List
 Height Balanced Trees
 Inserting a Node at The Beginning
 B-Tree Insertion
 Inserting a Node at The End
 B-Tree Deletion
 Deleting a Node from the Beginning
 8. Sorting and Searching
Deleting a Node from the End
 Introduction
7. Trees
 Sorting Array
 Introduction
 Bubble Sorting
 Tree Terminology
 Selection Sorting
 Binary Tree
 Insertion Sort
 Strictly Binary Tree
 Quick Sort
 Complete Binary Tree
 Bucket or Radix Sort
 Extended Binary Tree
 Heap Sort
 Binary Tree Representation
 Heap as a Priority Queue
 Array Representation of Binary Trees
 Sorting Using a Heap
 Linked List Representation of Binary Tree
 Heapsort Procedure
 Creation of on Binary Trees
 Efficiency of Heap Sort
 Operations on Binary Trees
 Shell Sort
 Traversal of a Binary Tree
 Searching of Array Element 10. Files
 Linear or Sequential Searching  Introduction
 Binary Searching  Terminology
 Hashing  File Organisation
 Resolving Hash Clashes by Open Addressing  File Operations
9. Graphs  Creation of File
 Introduction  Reading of File
 Defining Graph  Updation of File
 Basic Terminology  Insertion in the File
 Graph Representation  Deletion from the File
 Adjacency Matrix  Sequential Files
 Adjacency List Representation  Operations
 Multi-list Representation  Disadvantages
 Graph Traversal  Areas of Use
 Breadth-First Traversal  The Structure of Sequential Files
 Depth First Traversal  Direct File Organisation
 Shortest Path Problem  Direct File Organisation
 Warshall's Algorithm  Multiple-key Access
 Floyd's Algorithm  Multilist Oranization
 Dijkstra's Algorithm  Inverted-List Organization
 Minimal Spanning Tree
 Kruskal's Algorithm
 Prim's algorithm
 Hamiltonian Paths
 Reasons to Choose Baluja Institute for
Data Structures Training in Delhi
 Our Data Structures training in Delhi is developed in compliance to current IT industry.

 We provide the best Data Structures training in Delhi covering entire course modules during the

Data Structures classes. Also, students avail Data Structures course in Delhi with placement
assistance.
 Data Structures training in Delhi are scheduled on weekdays and weekends. Also students can opt

for customized schedule according to the requirements.

 Our team of trainers are industry-experts possessing more than a decade experience in training.

 Ultra-modern I.T laboratory equipped with latest infrastructure.

 Our lab is open 365 days in a year. Students, according to their convenience can utilize the lab for

completing projects and practice the technical assignments.

 Our training classrooms are equipped with modern I.T infrastructure such as projectors, live racks,

Wi-Fi, and digital pads.

 We facilitate our students with glass-door study room and discussion zone area (meeting room) to

enhance their learning and exploring abilities.

 Along with technical training and course, we organize no cost sessions on personality

development spoken English, group discussion, mock interview and presentation skills to
develop high level of confidence in students.
 We also organize no cost personality development and presentation seminars.

 Our course material includes books, and soft copies of tutorials in the form of PDFs, sample

papers, technical and HR interview questions, and projects available on our website.
 Students enrolled to Data Structures training in Delhi can also avail hostel facility at Rs.4,500/-

a month.
 We facilitate students with no cost study material, soft copies of PDFs, video training, sample

questions for respective certification, and interview questions along with lab guides made
available on our website for quick access.
 Our certificates are globally recognized provided after completion of course.

 We facilitate students with Extra Time Slots (E.T.S) for doing unlimited practical at no cost.

 According to the requirements, students can retake the class at no cost.

 Our instructors pay one-to-one attention.

 Baluja Institute Delhi Trainer's Profile for
Data Structures Course Training in Delhi
Baluja Institute's Delhi Data Structures Trainers are:
 Our trainers are industry-experts and subject specialists who have mastered on

running applications providing best Data Structures training to the students.

 We have received various prestigious awards by our recognized IT partners and

organizations.
 Our trainers are MNC working professionals employed in HCL Technologies, Birla-soft,

TCS, IBM, Sapient, Agilent Technologies, and many other.

 Our trainers are certified professionals possessing 7+ years of experience in the

industry.
 Our trainers have regular coordination with MNCs HR team on daily basis.
 Placement Assistance after Data Structures
Training in Delhi
Along with Data Structures training in Delhi, we provide placement
assistance to the students.
 Baluja Institute Delhi with successful 96% placement rate has a dedicated HR wing that

assist students in securing placement according to their requirements.

 Baluja Institute Delhi assist students in developing their resume matching the current

industry needs.
 Baluja Institute Delhi, apart from course training, also facilitate students with sessions

provided on personality development, spoken English, group discussion, mock

interview, and presentation skills to develop a high level of confidence for facing tricky
and challenging interviews competently.
 Baluja Institute Delhi provide an in-depth training to the students, which assist them to

secure placement in top IT firms such as HCL, TCS, Infosys, Wipro, Accenture, and many
more effortlessly.
 Course Highlight
1. Consistent Classroom Guidance
2. Meticulously designed Study Material
3. One on One attention
4. Time Bound Completion
5. Experienced full time faculty
6. Small batches
7. 5 days and weekend batches
8. Accommodation for outstation students (PG)