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 world-class Digital Marketer in the next 3 months.
Join
SkillCamper's
Digital Marketing Bootcamp.
Get guaranteed job placement and a minimum
salary of Rs 5 lakhs.
Explore Now
Aryabhatta Knowledge University, Bihar, Computer Engineering 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 Operator Overloading
4.2 Function Overloading
4.3 Function Templates
4.4 Class Templates
4.5 Single and Multiple Inheritance
4.6 Virtual Base class
4.7 Abstract Class
4.8 Pointer and Inheritance
Unit - 5 Trees and Graph
5.1 Void Pointers
5.2 Pointer to Class
5.3 Pointer to Object
5.4 Arrays
5.5 The keywords try throw and catch
5.6 Creating own Exception Classes
5.7 Exception Handling Techniques Terminate the Program Fix the Error and Continue Log the Error and Continue
5.8 Stack Unwinding
Download CSE 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
Analog electronic circuits
Object oriented programming using c++
Mathematics-iii (differential calculus)
Popular posts
Google
Yahoo
Ola
Twitter
gmail
insta
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