Scribd
Upload
14 views2 pages

Electrical

Resources

Uploaded by

dsubhadra759
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

Electrical

Resources

Uploaded by

dsubhadra759
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Biju Patnaik University of

Technology, Odisha B.E./B.Tech


CSE Sem 3 syllabus

Data Structure

RCS3C002 Data Structure

Module - I Introduction: Basic Terminologies: Elementary Data


Organizations, Data Structure Operations: insertion, deletion,
traversal etc.; Analysis of an Algorithm, Asymptotic Notations, Time-
Space trade off. Searching: Linear Search and Binary Search
Techniques and their complexity analysis.

Module – II Stacks and Queues: ADT Stack and its operations:


Algorithms and their complexity analysis, Applications of Stacks:
Expression Conversion and evaluation – corresponding algorithms
and complexity analysis. ADT queue, Types of Queue: Simple Queue,
Circular Queue, Priority Queue; Operations on each types of Queues:
Algorithms and their analysis.

Module - III Linked Lists: Singly linked lists: Representation in


memory, Algorithms of several operations: Traversing, Searching,
Insertion into, Deletion from linked list; Linked representation of
Stack and Queue, Header nodes, Doubly linked list: operations on it
and algorithmic analysis; Circular Linked Lists: all operations their
algorithms and the complexity analysis.

Module - IV Sorting and Hashing: Objective and properties of


different sorting algorithms: Selection Sort, Bubble Sort, Insertion
Sort, Quick Sort, Merge Sort, Heap Sort; Performance and
Comparison among all the methods, Hashing.

Module - V Trees: Basic Tree Terminologies, Different types of


Trees: Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL
Tree; Tree operations on each of the trees and their algorithms with
complexity analysis. Applications of Binary Trees. B Tree, B+ Tree:
definitions, algorithms and analysis. Graph: Basic Terminologies and
Representations, Graph search and traversal algorithms and
complexity analysis.

Books:
• “Fundamentals of Data Structures”, Illustrated Edition by Ellis
Horowitz, Sartaj Sahni, Computer Science Press.
• Algorithms, Data Structures, and Problem Solving with C++”,
Illustrated Edition by Mark Allen Weiss, Addison-Wesley Publishing
Company
• “How to Solve it by Computer”, 2nd Impression by R.G. Dromey,
Pearson Education.

Visit www.goseeko.com to access free study material as per your university syllabus

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy