6021.cs2021 data structures
TRANSCRIPT
8/3/2019 6021.CS2021 Data Structures
http://slidepdf.com/reader/full/6021cs2021-data-structures 1/5
Page 1 of 5
Institute / School Name Chitkara School of Engineering and Technology
Program Name B.E. II (ECE) and MCA II
Course Code CS2021
Course Name Data StructuresLecture / Tutorial (per week) 4 Course Credits 4
Course Coordinator Name Neha Aggarwal
1. Scope and Objectives of the Course
1. To demonstrate understanding of the growth of functions and the hierarchy of
complexity classes.
2. To compare different implementations of data structures and to recognize the
advantages and disadvantages of different implementations.
3. To demonstrate understanding of various searching and sorting algorithms.
4. To be able to analyze the complexity and efficiency of an algorithm in terms of time
and space, demonstrate the understanding of the properties of various data
structures such as arrays, stacks, queues, linked lists, trees and graphs.
2. Textbook
TB1: ‘Data Structures’ by Seymour Lipschutz, 3rd
Edition, Tata Mc Grawhill Publication
3. Reference Books RB1: ‘Data Structures using C’ by Aaron M.Tanenbaum, Yedidyah Langsam, Moshe
J.Augenstein, Pearson Education
RB2: ‘Data Structure, Algorithms and Applications Using C++ ’ by S. Sahni, Sillicon Press
4. Other readings and relevant websites
S.No. Link of Journals, Magazines, websites and Research Papers
1. http://www.cs.cmu.edu/~adamchik/15-
121/lectures/Stacks%20and%20Queues/Stacks%20and%20Queues.html
2. http://www.cs.sunysb.edu/~skiena/214/lectures/
3. http://technical-interview.com/DataStructures.aspx
4. http://www.mycstutorials.com/articles/data_structures/linkedlists
5. www.acm.org
6. http://www.haskell.org/haskellwiki/Research_papers/Data_structures
7. http://comjnl.oxfordjournals.org/content
8/3/2019 6021.CS2021 Data Structures
http://slidepdf.com/reader/full/6021cs2021-data-structures 2/5
Page 2 of 5
8. Course Plan
Lecture
Numbe
Topics Text Book /
Reference Book /Other reading
material
Page
numbers oText
Book(s)
1-2 Course Discussion:
Course Code, Course Structure, Course Team,
Credits, and Overview of Course to be shared
with students.
Why learn Data Structure?
TB1 NA
3-4 Data Structure:
Definition Classification of Data Structure:
Linear Data Structures.
Non Linear Data Structures.
Operations on data structure.
TB1 1.1-1.9
5 Complexity Of Algorithms: Time/Space
Tradeoff.
Asymptotic Notations: Big(oh), Omega, And
Theta
TB1 1.10-1.12,
2.17-2.19
6-9 Arrays:
Representation of Arrays
Address Calculation for One-Dimensional Array
Two-Dimensional Array.
Operations on Arrays:
Traversal
Insertion
Deletion
Merging
Pointers:
Pointer Arrays
TB1 4.1-4.8,
4.18-4.24
10-12 Searching techniques:
Linear search
Binary search
TB1 4.12-4.18
13-18 Sorting Techniques:
Bubble sort
Selection sort
Insertion sort
Merge sort
Radix sort
TB1 9.1-9.18
8/3/2019 6021.CS2021 Data Structures
http://slidepdf.com/reader/full/6021cs2021-data-structures 3/5
Page 3 of 5
19-22 Matrix Operations:
Addition
Multiplication.
Sparse matrix: Operation on Sparse Matrix:
Transpose
Addition.
TB1 4.34-4.38
23-25 Stack:
Definition
Array Representation of Stacks
Linked List Representation of Stacks
Operations:
Push
Pop.
TB1 6.1-6.6
26-29 Stack Applications:
Evaluation of an Arithmetic Expression
Polish Notation
Infix to Postfix Conversion & vice versa
Quick sort
Recursion
TB1 6.9-6.21
30-34 Queues:
Definition
Array Based Representation of Linear Queue
Linked List Based Representation of Linear
Queue
Insertion & Deletion from Linear Queue.
Circular Queues
Dequeue
Priority Queues
TB1 6.32-6.35,
6.39-6.44
8/3/2019 6021.CS2021 Data Structures
http://slidepdf.com/reader/full/6021cs2021-data-structures 4/5
Page 4 of 5
35-39 Linked List:
Introduction
Linked Lists
Representation of linked list in memory
Various operations on linked list
Insertion
Deletion
Searching
Sorting
Circular List
Header linked list
Two way linked list
Linked representation of stacks and queues
TB1 5.1-5.30,
5.31-5.40,
6.7-6.8,
6.36-6.38
40-45 Trees:
Introduction
Binary trees
Representation of binary trees in memory
Traversing binary trees
Traversing algorithms using stacks.
Binary Search trees and their operations.
TB1 7.1-7.34
46-51 Graphs: Introduction
Graph theory terminology
Sequential representation of graph
Adjacency matrix
Path matrix
Traversing a graph:
BFS
DFS
TB1TB1
8.1-8.7,8.21-8.24
52-56 Shortest path algorithms:
Warshall’s algorithm
Dijkstra’s algorithm
TB1 8.8-8.11
9. Evaluation Scheme:
Component 1 Quizzes /Assignments/ Presentation/Class Test/ Open Book Test/ Case
Study
15
Component 2* Sessional Tests (STs)* 15
Component 3** End Term Examination** 50Component 4 Lab Evaluation 20
8/3/2019 6021.CS2021 Data Structures
http://slidepdf.com/reader/full/6021cs2021-data-structures 5/5
Page 5 of 5
Total 100
* There are three Sessional Tests (STs) for all theory papers, the first two are compulsory
and the third one is the non-mandatory make up / mercy test. The average of best two isconsidered.
** The End Term Comprehensive examination will be held at the end of semester. The
mandatory requirement of 75% attendance in all theory classes is to be met for being
eligible to appear in this component.
10. Details of Evaluation Component 1
Description Duration Marks To be held in week Remarks
Test 1 20 min 10 3rd
Week
Test 2 20 min 10 6th Week
Assignment -------- 10 10th
– 11th
Week
Open Book Test 20 min 10 12th
– 13th
Week
Surprise Test 20 min 10 Will be intimated 1
week before the test
This Document is approved by:
Designation Name Signature
Course Coordinator Ms. Neha Aggarwal
PI/CoD/HoD
Dean
Date