Scribd
Upload
16 views

DSa syllbus

Uploaded by

chaurasiyaravi2611
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
16 views

DSa syllbus

Uploaded by

chaurasiyaravi2611
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/ 1

Quantum School of Technology

Roorkee - Dehradun Highway, Mandawar, Roorkee, Uttarakhand 247167


Fax No.

www.quantumuniversity.edu.in

Syllabus

Course Type: Engineering Course : Bachelor of Technology

Year/sem: 3 Sem Branch : CSE-AIML Created By:

Data Structure & Programming

CS33201

Unit Sub Unit Topic Duration


1 Abstract data types, , Introduction to Data Structure, Types of Data Structure, Arrays, Dynamic Arrays, 10
Complexity of algorithms, Time Complexity and space complexity,, Asymptotic notations, Dynamic allocation
functions-malloc and calloc, Introduction to structures.
2 Implementation of queues 10
- Insert operation
, Inserting and removing nodes from a list-linked implementation of stack, Stack definition and examples –
Primitive operations – Example - Representing stacks in C, Priority queue And Queue, Priority queue, Array
implementation of priority queue, Push and pop operation implementation
3 Binary trees: Operations on binary trees, Applications of binary trees, Binary tree representation 10
- Node representation of binary trees
, Implicit array representation of binary tree – Binary tree traversal in C, Threaded binary tree, Representing
list as binary tree - Finding the Kth element –
Deleting an element
, Tree Representation and their applications: C representation of trees, traversals - Evaluating an expression
tree - Constructing a tree.
4 General background of sorting, Efficiency considerations, Notations, Efficiency of sorting, Shell sort - Address 9
calculation sort - Merge sort -Radix sort, Sequential search: Indexed sequential search, Heap as a priority
queue - Sorting using a heap-heap sort procedure, Binary search - Interpolation search, Insertion sort ,
selection sort, Bubble sort; Quick sort, Binary sort , Heap sort
5 Warshall’s algorithm – Shortest path algorithm, Linked representation of graph, Dijkstra’s algorithm - Graph 9
traversal, Graph traversal - Traversal methods for graphs, Introduction to Hashing, Hash Tables, Application
of graph - C representation of graphs

Copyright @ Cyborg IT Services (P) Ltd. An ISO 9001: 2008 certified company Campsys

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