Bihar Engineering University, Bihar, Information Technology Semester 3, Data Structure & Algorithms Syllabus

Data Structure & Algorithms Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Unit - 1 Introduction

1.1 Basic Terminologies Elementary Data Organizations

1.2 Data Structure Operations insertion deletion traversal etc.

1.3 Analysis of an Algorithm

1.4 Asymptotic Notations

1.5 TimeSpace trade off

Unit - 2 Stacks and Queues

2.1 ADT Stack and its operations Algorithms and their complexity analysis

2.2 Applications of Stacks Expression Conversion and evaluation – corresponding algorithms and complexity analysis

2.3 ADT queue

2.4 Types of Queue Simple Queue

2.5 Circular Queue

2.6 Priority Queue

2.7 Operations on each Type of Queues Algorithms and their analysis

Unit - 3 Linked Lists

3.1 Singly linked lists Representation in memory

3.2 Algorithms of several operations Traversing

3.3 Searching

3.4 Insertion into

3.5 Deletion from linked list

3.6 Linked representation of Stack and Queue

3.7 Header nodes

3.8 Doubly linked list operations on it and algorithmic analysis

3.9 Circular Linked Lists all operations their algorithms and the complexity analysis.

Unit - 4 Searching, Sorting and Hashing

4.1 Linear Search and Binary Search Techniques and their complexity analysis

4.2 Objective and properties of different sorting algorithms Selection Sort

4.3 Bubble Sort

4.4 Insertion Sort

4.5 Quick Sort

4.6 Merge Sort

4.7 Heap Sort

4.8 Performance and Comparison among all the methods

4.9 Hashing

Unit - 5 Trees and Graph

5.1 Trees Basic Tree Terminologies

5.2 Different types of Trees Binary Tree Threaded Binary Tree Binary Search Tree AVL Tree

5.3 Tree operations on each of the trees and their algorithms with complexity analysis

5.4 Applications of Binary Trees

5.5 B Tree B Tree definitions algorithms and analysis

5.6 Graph Basic Terminologies and Representations

5.7 Graph search and traversal algorithms and complexity analysis.

Download IT Sem 3 syllabus pdf
Download previous years solved question papers pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-1
Technical writing
Digital electronics
Discrete mathematics
Object oriented programming using c++
Mathematics-iii (differential calculus)
Popular posts
Top 10 free online resources to learn coding
What is machine learning
Top 10 jobs in information technology
An overview of object oriented programming
What is sorting algorithm
Share  
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us