Scribd
Upload
392 views1 page

CS-201 Data Structure 3-1-0-4 3 Sem (CSE) Prerequisites: CS-101

This document outlines the course CS-201 on data structures. It includes 3-4 credits over 3 semesters and has prerequisites in CS-101. Topics covered include data types, asymptotic analysis, lists, trees, graphs, sorting/searching, and memory management. Specific data structures taught are linked lists, stacks, queues, trees, heaps and hashing. The course aims to make students familiar with special data structures and their uses, and develop expertise in designing customized structures. Learning outcomes include selecting appropriate structures for problems, implementing linear and non-linear structures, and handling operations like search, insert, delete on various structures.

Uploaded by

Dr Suganya Devi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
392 views1 page

CS-201 Data Structure 3-1-0-4 3 Sem (CSE) Prerequisites: CS-101

This document outlines the course CS-201 on data structures. It includes 3-4 credits over 3 semesters and has prerequisites in CS-101. Topics covered include data types, asymptotic analysis, lists, trees, graphs, sorting/searching, and memory management. Specific data structures taught are linked lists, stacks, queues, trees, heaps and hashing. The course aims to make students familiar with special data structures and their uses, and develop expertise in designing customized structures. Learning outcomes include selecting appropriate structures for problems, implementing linear and non-linear structures, and handling operations like search, insert, delete on various structures.

Uploaded by

Dr Suganya Devi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

CS-201 Data Structure 3-1-0-4

3rd Sem (CSE) Prerequisites: CS-101

Introduction: Introduction to data types, Data structures and Abstract Data Types (ADT), asymptotic notations;
complexity analysis of algorithms.
Lists: Linked list, doubly linked list: header list, polynomial arithmetic, stack, recursion and their implementation;
evaluation of postfix expression, conversion for infix to postfix expression and their algorithms; queue, circular
queue; priority queues; Dequeue; multiple stacks and queues
Trees: Introduction, Binary tree, BST, AVL trees, B Trees, B+ Trees; Multiway Search trees: Implementation of
dictionary and binary search tree; heap; hashing and hash table.
Graphs: Basic concepts; Representation schemes; graph traversals; spanning tree; shortest path algorithm.
Sorting & Searching: Different sorting techniques; Tree searching and graph searching techniques.
Memory management issues: Introduction, storage allocation, garbage collection, compaction.

BOOKS:

1. Data Structures using C/C++ – Tanenbaum A.S., Langsam Y., Augenstein M. J. (PHI)
2. Data Structure – Aho V., Ullman J.D. (Addision-Wesley)
3. The Art of Computer Programming (Vol. 1, 2, 3) – Knuth D.E. (Addision- Wesley).
4. Fundamentals of Data Structures – Horowitz E., Sahni S. (Galgotia Pub.)
5. Algorithms, Data Structures, Programs – Wirth N. (PHI)

Course Objective:
1. To make students familiar with requirement of special and user defined structures.
2. To make students understand uses of different data structures.
3. To develop expertise in designing of customized data structures.

Course Outcome (CO):


1. Student will be able to select appropriate data structure to be used for specified problem definition.
2. Students will be able to implement linear and non-linear data structures.
3. Student will be able to handle operations like searching, insertion, deletion, traversing mechanism etc. on
various data structures.
4. Students will be able to implement projects requiring the implementation of the learned data structures.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 ✔ ✔ ✔ ✔
CO2 ✔ ✔ ✔ ✔ ✔ ✔ ✔
CO3 ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔
CO4 ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔

You might also like