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
Shivaji University, Maharashtra
Electronics and Communication engineering
Data Structures
Shivaji University, Maharashtra, Electronics and Communication engineering Semester 4, 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 & Overview
1.1 Introduction to theory of data structures
1.2 Data types
1.3 Classification of data structure
1.4 Algorithms complexity time space tradeoff with example
Unit - 3 Linked Lists
3.1 Introduction linked lists its representation Traversing searching a linked list
3.2 Memory allocation
3.3 Garbage collection
3.4 Insertion deletion of nodes of linked list
3.5 Header linked list
3.6 Twoway lists
Unit - 4 Stacks & Queues
4.1 Introduction to stacks
4.2 Stack as an Abstract Data type
4.3 Representation through Arrays linked lists
4.4 Arithmetic expressions Polish notation
4.5 Applications of stacks
4.6 Stacks Recursion
4.7 Queue
4.8 Representation of queue as an array and as a linked list
4.9 Circular double ended priority application of queues
Unit - 5 Trees
5.1 Binary Tree introduction types definition properties representations operations binary tree traversal reconstruction counting number of binary trees applications
5.2 Advanced trees AVL trees or height balanced trees representation operation
5.3 Threaded binary trees
5.4 Expression trees
5.5 Multi way trees trees multi way search trees
5.6 B trees
5.7 Heaps construction of a Heap
Unit - 6 Graphs &Hashing
6.1 Introduction Graph theory terminology
6.2 Sequential representation of graphs Adjacency Matrix Path matrix
6.3 Warshall’s Algorithm
6.4 Shortest paths
6.5 Linked representation
6.6 Operations Traversing Posets Topological sorting
6.7 Hashing Hash functions collision chaining
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
Digital communication
Control system engineering
Linear integrated circuits
Electronic circuit design-ii
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