Study material
Engineering
Computer Engineering
Information Technology
Electrical Engineering
Civil Engineering
Mechanical Engineering
Electronics and Communications
Electronics and Telecommunication
Electrical and Electronics
B.Com
B.A
BBA
BAF
BMS
New Test BE-Btech
Demo BE-Btech
Prod BE-BTech
Blog
Log in
Become a data analyst in the next 4 months and kickstart your career.
100% placement assistance.
Start your Analytics journey with our free
Python course.
Explore Now
Home
Universities
Biju Patnaik University of Technology, Odisha
Electronics and Communication engineering
Data Structure
Biju Patnaik University of Technology, Odisha, Electronics and Communication engineering Semester 4, Data Structure Syllabus
Data Structure 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
1.6 Searching Linear Search and Binary Search Techniques and their complexity analysis
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 Sorting and Hashing
4.1 Objective and properties of different sorting algorithms Selection Sort
4.2 Bubble Sort
4.3 Insertion Sort
4.4 Quick Sort
4.5 Merge Sort
4.6 Heap Sort
4.7 Performance and Comparison among all the methods
4.8 Hashing
Unit - 5 Trees and Graphs
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 ECE Sem 4 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-2
Network theory
Power electronics
Constitution of india
Digital systems design
Electromagnetic theory
Organisational behaviour
Popular posts
Top 5 websites all engineers should use
Top 5 websites for academic reasearch
Top 5 interview advice for engineers
What is race around condition
What is convolution theorem
Share
Link Copied
More than
1 Million
students use Goseeko! Join them to feel the power of smart learning.
Try For Free
Spot anything incorrect?
Contact us