0% found this document useful (0 votes)
13 views1 page

DSP Topics

DSA topics to learn

Uploaded by

negikumar7186
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
0% found this document useful (0 votes)
13 views1 page

DSP Topics

DSA topics to learn

Uploaded by

negikumar7186
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 Created By:

Data Structure & Programming

CS33201

Unit Sub Unit Topic Duration


Hashing Application of graph - C representation of graphs, Transitive closure, Warshall¶s algorithm, Shortest path 9
and algorithm, Linked representation of graphs, Dijkstra¶s algorithm, Graph traversal, Traversal methods for
Graphs graphs., Introduction to Hashing, Hash Tables,
Unit 1 Abstract data types - Sequences as value definitions - Data types in C, Introduction to Data Structure,, Types 10
(Introduc of Data Structure,, Arrays,, Dynamic Arrays,, Complexity of algorithms,, Time Complexity and space
tion To complexity,, Asymptotic notations,, Dynamic allocation functions-malloc and calloc,, Introduction to
Data structures., Arrays,
Structure
s and
Complexi
ty of
algorithm
)
Unit 2 Stack definition and examples ±Primitive operations -Examples, Representing stacks in C, Push and pop 10
(Stack, operation implementation, Implementation of queues, Insert operation - Priority queue, Array implementation
Queue of priority queue., Inserting and removing nodes from a list-linked implementation of stack, Queue and priority
And queue
Linked
List)
Unit 3 Binary trees: Operations on binary trees, Applications of binary trees - Binary tree representation, Node 10
(Trees) 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, Trees
and their applications: C representation of trees, Tree traversals - Evaluating an expression tree -
Constructing a tree.
Unit 4 General background of sorting, Efficiency considerations, Notations, Efficiency of sorting, Exchange sorts: 9
(Sorting Bubble sort; Quick sort; Selection sort; Binary tree sort; Heap sort., Heap as a priority queue - Sorting using a
And heap-heap sort procedure, Insertion sorts: Simple insertion, Shell sort - Address calculation sort, Merge sort -
Searchin Radix sort, Sequential search: Indexed sequential search - Binary search - Interpolation search.
g)

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

You might also like