Scribd
Upload
615 views

CS102 Data Struct PDF

This document provides details about the Data Structures course offered by the Computer Science and Engineering department at Indian Institute of Technology Roorkee. The course covers various data structures like lists, stacks, queues, hashing, trees, search trees, multiway trees and graphs. It aims to provide fundamental data structure concepts in an object-oriented setting for designing, implementing, testing and maintaining software systems. The course spans 42 contact hours over various topics and suggests textbooks for further reference.

Uploaded by

Benvindo DreamsSTS
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
615 views

CS102 Data Struct PDF

This document provides details about the Data Structures course offered by the Computer Science and Engineering department at Indian Institute of Technology Roorkee. The course covers various data structures like lists, stacks, queues, hashing, trees, search trees, multiway trees and graphs. It aims to provide fundamental data structure concepts in an object-oriented setting for designing, implementing, testing and maintaining software systems. The course spans 42 contact hours over various topics and suggests textbooks for further reference.

Uploaded by

Benvindo DreamsSTS
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPT./CENTRE: Computer Science and Engineering

1. Subject Code: CS - 102 Course Title: Data Structures

2. Contact Hours: L: 3 T: 1 P: 0

3. Examination Duration (Hrs.): Theory 0 3 Practical 0 0

4. Relative Weight: CWS 125 PRS 0 MTE 25 ETE 50 PRE 00

5. Credits: 0 4 6. Semester Spring

7. Pre-requisite: CS-103
8. Subject Area: DCC
9. Objective: To provide basic data structure concepts in an object-oriented setting for design,
implementation, testing and maintenance of software systems.

10. Details of the Course:

Sl. Contents Contact


No. Hours
1. Complexity Analysis: Time and Space complexity of algorithms, 3
asymptotic analysis, big O and other notations, importance of efficient
algorithms, program performance measurement, data structures and
algorithms.
2. Linear Lists: Abstract data type, sequential and linked representations, 8
comparison of insertion, deletion and search operations for sequential
and linked lists, list and chain classes, exception and iterator classes for
lists, doubly linked lists, circular lists, linked lists through simulated
pointers, lists in STL, skip lists, applications of lists in bin sort, radix
sort, sparse tables.
3. Stacks and Queues: Abstract data types, sequential and linked 6
implementations, exception handling in classes, representative
applications such as parenthesis matching, towers of Hanoi, wire routing
in a circuit, finding path in a maze, simulation of queuing systems,
equivalence problem.
4. Hashing: Search efficiency in lists and skip lists, hashing as a search 4
structure, hash table, collision avoidance, linear open addressing, chains,
uses of hash tables in text compression, LZW algorithm.
5. Trees: Binary trees and their properties, terminology, sequential and 8
linked implementations, tree traversal methods and algorithms, heaps as
priority queues, heap implementation, insertion and deletion operations,
heapsort, heaps in Huffman coding, leftist trees, tournament trees, use of
winner trees in mergesort as an external sorting algorithm, bin packing.
6. Search Trees: Binary search trees, search efficiency, insertion and 4
deletion operations, importance of balancing, AVL trees, searching
insertion and deletions in AVL trees, red-black trees, comparison with
AVL trees, search insert and delete operations.
7. Multiway Trees: Issues in large dictionaries, m-way search trees, B- 5
trees, search insert and delete operations, height of B-tree, 2-3 trees, sets
and multisets in STL.
8. Graphs: Definition, terminology, directed and undirected graphs, 4
properties, connectivity in graphs, applications, implementation –
adjacency matrix and linked adjacency chains, graph traversal – breadth
first and depth first, spanning trees.
Total 42

11. Suggested Books:

Sl. Name of Books / Authors Year of


No. Publication
1. Sahni, S., “Data Structures, Algorithms, and Applications in C++”, 2001
WCB/McGraw-Hill.
2. Sahni, S., “Data Structures, Algorithms, and Applications in Java”, 2001
WCB/McGraw-Hill.
3. Drozdek, A., “Data Structures and Algorithms in C++”, Vikas 2002
Publishing House.
4. Wirth, N., “Algorithms and Data Structures”, Prentice-Hall of India. 1985
nd
5. Lafore, R., “Data Structures and Algorithms in Java”, 2 Ed., Dorling 2007
Kindersley.

You might also like