Scribd
Upload
97 views

PC-II - Advanced Data Structure

This document outlines a course on Advanced Data Structures that is a core 4-credit course for the 1st semester of a Computer Engineering program. It includes the course objectives, topics, experiments, equipment requirements, recommended books, and open source/learning resources. The objectives are to understand and apply linear and non-linear data structures as well as algorithms related to trees, hashing, sorting, backtracking, and NP-completeness problems. Topics include stacks, queues, linked lists, trees, graphs, hashing techniques, sorting methods, backtracking, and NP-hard problems.

Uploaded by

Hitesh Patel
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
97 views

PC-II - Advanced Data Structure

This document outlines a course on Advanced Data Structures that is a core 4-credit course for the 1st semester of a Computer Engineering program. It includes the course objectives, topics, experiments, equipment requirements, recommended books, and open source/learning resources. The objectives are to understand and apply linear and non-linear data structures as well as algorithms related to trees, hashing, sorting, backtracking, and NP-completeness problems. Topics include stacks, queues, linked lists, trees, graphs, hashing techniques, sorting methods, backtracking, and NP-hard problems.

Uploaded by

Hitesh Patel
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

MONARK UNIVERSITY

INSTITUTE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF COMPUTER ENGINEERING

SUBJECT NAME: ADVANCED DATA STRUCTURES

ME 1ST SEMESTER (CE/IT)

Type of Course: Core-II

Teaching Scheme (Credits and Hours)

Teaching Scheme Credits Evaluation Scheme


Total
Internal External
L T P C Marks
Theory Pr. Theory Pr.
3 0 2 4 40 20 60  30 150

LEARNING OBJECTIVES:
As per ‘Bloom’s Taxonomy’ in the area of technical education, the objectives of this subject are
divided into cognitive, affective and sensory domains. The purposes of this course are…

 Understand and apply linear data structures – Stack, Queue and Linked Lists.
 Understand the nonlinear data structures - tree, graph.
 To develop and analyze algorithms for red-black trees, B-trees and Splay trees.
 Understand the implementation of symbol table using hashing techniques.
 To learn algorithm design techniques backtracking and branch & bound.
 To learn NP - completeness problems.

Sr. Teaching Weightage


Topics
No. Hrs. (%)
Linear Data Structure:-
Abstract data type (ADT), stack and it’s applications, queue,
circular and double ended queue, applications of queue,
1 9 20
singly linked list, doubly linked list, circular linked list and
applications of linked list.

Non-linear Data Structures:-


Definition of tree and concepts, binary search tree, AVL tree,
2 B-tree, red-black tree, 2-3 tree, splay tree, graph - traversing 12 27
graphs, depth first search, breath first search, applications of
graphs, topological sorting, shortest path algorithms.
Hashing:-
3 Hash function, collision resolution methods - open addressing, 5 11
closed addressing, rehashing and extendible hashing.
Sorting:-
4 Shell sort, heap sort, merge sort, quick sort, radix sort, 6 13
comparison of sorting methods.
Backtracking and Branch and Bound:-
5 Introduction, the eight queens’ problem, knapsack problem 3 7
and travelling salesman problem.
Text Processing:-
The naive string matching algorithm, the Boyer-Moore
6 algorithm, the Knuth-Morris-Pratt algorithm, standard tries, 5 11
compressed tries, suffix tries, text compression-Huffman
coding and decoding.
Introduction to NP-Hard and NP-Complete Problems:-
7 P & NP problems, NP-complete problems, approximation 5 11
algorithms for NP-hard problems, traveling salesman problem.

 List of Experiments:-
Sr.
Name of Experiment
No.
Write a menu driven program to implement following operations on the singly linked list:
(a) Insert a node at the front of the linked list.
1
(b) Insert a node at the end of the linked list.
(c) Delete a first node of the linked list.
2 Write a program to count the nodes in a circular queue.
3 Write a program which create binary search tree.
4 Implementation of 2-3 Trees.
5 Implementation of B Tree.
6 Implementation of Red-Black Tree.
7 Write a program to implement quick sort.
8 Write a program to implement merge sort.
Implementation of a program for string matching, using naive string matching algorithm
9
on text file content.
Implementation of a program for string matching, using Knuth-Morris-Pratt algorithm on
10
text file content.

 Major Equipments:-
 Hardware: Computer System with minimum PIV processor (or equivalent) and
minimum 1 GB RAM.
 Software: Turbo C++/ Borland C++/ any other higher software.

 Books Recommended:-

1. Jean-Paul Tremblay, Paul .G. Sorenson, "An Introduction to Data Structures with
Applications", Tata McGraw Hill second edition , 1991.
2. Thomas H.Coremen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, "Introduction
to algorithms", Third edition, MIT press.
3. Mark Allen Weiss, "Data Structures and Algorithm Analysis in C", Third Edition,
Pearson Education, Asia, 2007.
4. E. Horowitz, S. Sahni and Dinesh Mehta, Fundamentals of Data structures in C++,
University Press, 2009.
5. E. Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms/C++, Second Edition,
University Press, 2007.
6. “Algorithms Unlocked” by Thomas H. Cormen.
7. “Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles”
by Narasimha Karumanchi.

 List of Open Source Software/Learning Website:-

 Turbo C/C++ or Borland C/C++ or any software that support C/C++ compiler
 Advanced Data Structure Tutorial: https://www.programiz.com/dsa
 Advanced Data Structure Fundamentals: https://cs-fundamentals.com/data-
structures/introduction-to-data-structures
 Advanced Data Structure Video: http://www.youtube.com/watch?v=tORLeHHtazM

***

You might also like