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
Rashtrasant Tukadoji Maharaj Nagpur University, Maharashtra
Artificial Intelligence
Data Structures
Rashtrasant Tukadoji Maharaj Nagpur University, Maharashtra, Artificial Intelligence Semester 3, Data Structures Syllabus
Data Structures 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
Unit 1
Introduction
1.1 Basic Terminologies Data Structure
1.2 Analysis of an Algorithm
1.3 Asymptotic Notations
1.4 TimeSpace trade off
1.5 Searching Linear Search and Binary Search Techniques and their complexity analysis
Unit - 2 Stacks and Queues
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
Unit 3
Linked Lists
3.1 Singly linked lists Representation in memory Static Dynamic
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 Trees
Unit 4
Trees
4.1 Basic Tree Terminologies
4.2 Different types of Trees Binary Tree Threaded Binary Tree Binary Search Tree AVL Tree
4.3 Tree operations on each of the trees and their algorithms with complexity analysis
4.4 Applications of Binary Trees
4.5 B Tree B Tree definitions algorithms and analysis
4.6 Binary Heaps
Unit - 5 Graphs
Unit 5
Graphs
5.1 Basic Terminologies and Representations
5.2 Graph search and traversal algorithms and complexity analysis Breadth and depth first searches
5.3 Connected component
5.4 Spanning trees
5.5 Shortest path–single source all pairs
5.6 Topological sort
5.7 Hamiltonian path
Download AI Sem 3 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-3
Operating systems
Digital circuits & microprocessor
Computer architecture & organization
Discrete mathematics and graph theory
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