Scribd
Upload
18 views2 pages

TE7960-Data Structures-R02 (2)

Uploaded by

anushka.tandon.btech2023
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
18 views2 pages

TE7960-Data Structures-R02 (2)

Uploaded by

anushka.tandon.btech2023
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

Course Name : Data Structures

Course Code : TE7960


Faculty : Engineering
Course Credit : 3
Course Level : 3
Sub-Committee (Specialization) : Computer Science
Learning Objectives :
The students will be able to:
Implement and compare different searching sorting techniques.
Use knowledge of dynamic data structure and constructs in link list programs.
Implement set operations on the link list
Demonstrate different types of tree data structure and use algorithms for tree traversals.
Implement different graph algorithms and its applications.
Illustrate AVL tree to solve problems and understand symbol table.
Books Book Author Publisher
Recommended :
A practical data structure and algorithm Information Computing and NA
research on drawing and editing vector Telecommunications (YC-ICT),
graphics 2010 IEEE Youth Conference
on
Data structure & Algorithm Analysis in Weiss, Mark Allen Addison Wesley
C++, ISBN-032144146X,3rd Edition
2007.
Data structure using C,ISBN AM Tanenbaum, Y Langsam & Pearson Prentice
9788131702291, 9th Edition 2009 MJ Augustein Hall India
Data structures & Program Design in Robert Kruse, C.L.Tondo, Pearson
C,ISBN 9780132883665, 4th Edition Bruce Leung
2009.
Data Structures: A pseudo code R. Gilberg,B. Forouzan Cenage Learning
approach with C, ISBN 9780534390808,
2nd Edition October 11, 2004.
Fundamentals of Data Structures in C, E. Horowitz, S.Sahani and University Press
ISBN 10:8173716056, 2nd Edition 2007. S.Anderson-Freed
Let us C & Pointer in C, ISBN Yashwant Kanitkar BPB
9788183331630, 13thEdition 2013 .
Research of shortest path algorithm Software Engineering and NA
based on the data structure Service Science (ICSESS),
2012 IEEE 3rd International
Conference on
Course Outline : Contact
Actual
Sr. Hours
Topic Teaching
No. Equivale
Hours
nce
1 Need of sorting and searching, Sorting and searching 10 10
techniques using array, General sort concepts sort order,
sorting order stability in sorting. Concept of internal and
external sorting. Searching methods: Algorithms for Sequential
search, Binary search Sorting methods: Bubble, insertion,
selection, merge and quick sort

Page: 1
2 Linked lists: Linear list concepts, list v/s array, different types 10 10
of linked lists. Singly linked lists: create a list, insert node
empty list, beginning, middle, end, delete node first, last,
middle, reverse and concatenation. Stack and queue using a
singly link list. Circularly-linked list: create la ist, insert node
empty list, beginning, middle, end, delete node first, last,
middle, reverse and concatenation. Doubly linked list: create a
list, insert node empty list, beginning, middle, end, delete node
first, last, middle reverse and concatenation
3 Tree: Difference in linear and non-linear data structure, trees 10 10
and binary trees-concept and terminology, binary tree as an
ADTAbstract Data Type, algorithm for tree traversals recursive
and non-recursive, conversion of general tree tobinary tree,
binary search trees, concept of threaded binary tree, Different
types of threaded binary tree, preorder, inorder traversals of
threaded binary search tree
4 Graph:Graph as an ADT, representation of graphs using 10 10
adjacency matrix, adjacency list, Depth First Search and
Breadth First Search, algorithms for minimal spanning tree
Prims and Kruskalsand shortest path-Dijkstras algorithm,
application of these algorithms
5 Symbol tables and dynamic trees:The notion of the symbol 5 5
table, AVL Adelson-Velskii and Landis Trees, Balanced
Imbalanced AVL Tree Problem Solving
Total 45 45
Pre Requisites :
Knowledge of C/C, Basics of data structures and file handling.
Evaluation :
Assignment
Seminar
Quiz
Examination
Viva
Mini Project
Experiential Learning
Pedagogy :
Classroom teaching
Hacker rank
Expert :
Dharmendra Shahi,Devops Architect,IBM India

You might also like