Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE PLAN-EVEN SEMESTER 2016-2017

Subject with code Data Structures - CSE103Course B.Tech (CSE)Semester / Sec II / A-DCourse Credit 2Course Coordinator Dr.P.DeepalakshmiModule Coordinator Dr.K.KartheebanProgramme Coordinator

Dr. R. Ramalakshmi

COURSE DESCRIPTION

This course provides a fairly good concept of the fundamentals of data structures and algorithms to the students. The main objective of this course is to teach the basic skills and knowledge to develop efficient algorithms to solve computational problems and to make informed choices between different solutions for the same problem. After completion of this course, students will be able to choose an appropriate data structure for a particular problem.

COURSE PRE-REQUISITES: Programming Languages (CSE102)

COURSE OBJECTIVE:The major objectives of this course is to make the students to

1. Identify the systematic way of solving the problems.2. Understand and evaluate Abstract Data Types and linear data structures3. Design non-linear data structures such as trees and graphs 4. Understand efficiency of various searching and sorting techniques 5. Apply data structure concepts to various examples and real life applications

PROGRAMME SPECIFIC OUTCOME

PSOs DESCRIPTIONPSO1 Problem-Solving Skills:  The ability to apply mathematics, science

and computer engineering knowledge to analyze, design and develop cost effective computing solutions for complex problems with environmental considerations.

PSO2 Professional Skills:   The ability to apply modern tools and strategies in software project development using modern programming environments to deliver a quality product for business accomplishment.

1Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound

technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

PSO3 Communication and Team Skill: The ability to exhibit proficiency in oral and written communication as individual or as part of a team to work effectively with professional behaviors and ethics.

PSO4 Successful Career and Entrepreneurship: The ability to create a inventive career path by applying innovative project management techniques to become a successful software professional, an entrepreneur or zest for higher studies.

PROGRAMME OUTCOMES:

POs DESCRIPTIONPO1 Ability to apply knowledge of mathematics, science and computer engineering

to solve computational problems.PO2 Ability to identify, formulate, analyze and solve complex computing problems.PO3 Capability to design and develop computing systems to meet the requirement

of industry and society with due consideration for public health, safety and environment.

PO4 Ability to apply knowledge of design of experiment and data analysis to derive solutions in complex computing problems and society with due consideration for public health, safety and environment.

PO5 Ability to develop and apply modeling, simulation and prediction tools and techniques to engineering problems.

PO6 Ability to assess and understand the professional, legal, security and societal responsibilities Relevant to computer engineering practice.

PO7 Ability to understand the impact of computing solutions in economic, environmental and societal context for sustainable development.

PO8 Applying ethical principles and commitment to ethics of IT and software profession.

PO9 Ability to work effectively as an individual as well as in teams.PO10 Ability to communicate effectively with technical community and with society.PO11 Demonstrating and applying the knowledge of computer engineering and

management principles in software project development and in multidisciplinary areas.

PO12 Understanding the need for technological changes and engage in life-long learning.

COURSE OUTCOMES COs DESCRIPTIONCO1 Understand role of efficient algorithms in computingCO2 Develop algorithms for linear data structures and its operations and apply it

for real world problems.CO3 Design and Apply different tree operations and traversal techniques to solve

problems.CO4 Analyze and apply learned sorting and searching techniques to solve

problems. 2

Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the

requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

CO5 Design data structures and develop code for real life problems using graphs

MAPPING OF POs and PEOs:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10

PO11

PO12

PSO1 S S S SPSO2 S S S M SPSO3 S M S S SPSO4 M S M M M S S

MAPPING OF COs AND POs:PO1 PO2 PO

3PO4

PO5

PO6

PO7 PO8

PO9

PO10

PO11

PO12

CO1 S S CO2 S S S MCO3 S M S MCO4 S S MCO5 S M S L S M

S- Strong Correlation M- Medium Correlation L – Low Correlation

MAPPING OF COs AND PSOs:PSO1 PSO

2PSO3 PSO4

CO1 S L CO2 S L L LCO3 S M L LCO4 S L L LCO5 S S M M

S- Strong Correlation M- Medium Correlation L – Low Correlation

DELIVERY/INSTRUCTIONAL METHODOLOGIES: Chalk & Talk PPT Presentations Flipped Class room Programming exercises

ASSESSMENT METHODOLOGIES-DIRECT: INDIRECT:

Assignments Sessional / Model / End Semester Exam Programming Exercises Flipped Classroom

Course End Survey

TEXT BOOK3

Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the

requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

TEXT/REFERENCE

BOOK TITLE/AUTHORS/PUBLICATION

Text 1 Weiss M. A., “Data Structure and Algorithm Analysis in C”, Addison Wesley.Text 2 Cormen T. H., Leiserson C. E., Rivest R. L. and Stein C,” Introduction to

Algorithms” Prentice Hall India, 3rd Edition, 2010.Reference 1

Aaron Tenenbaum M, Yeedidyah Langsam, Moshe Augenstein J ,“Data structures using C” Pearson Education, 2nd Edition.

Reference 2

Horowitz E., Shan S, “Fundamentals of Data Structures” Pittman.

Reference 3

Byron S. Gottfried,” Theory and Problems of Programming with C”, TATA McGraw Hill, 3rd Edition, 2010.

WEB RESOURCES

S.No

Units Websites1. Introductio

n To Data Structures

http:/ 1. www.cs.cf.ac.uk/Dave/C/ 2. www.lysator.liu.se/c/bwk-tutor.html

3. www.imada.sdu.dk/~svalle/courses/dm14-2005/mirror/c/4. www.eskimo.com/~scs/cclass/notes/top.html5.www.eden.rutgers.edu/~pmj34/?page=%2FNotes%2FComputer%20Science

%2F%2FData%20Structures.md6. www.le.ac.uk/cc/tutorials/c/

2 Stack, Queues and Hashing

1. http://www.desy.de/gna/html/cc/Tutorial/node4.html2. http://www.sqa.org.uk/e-learning/LinkedDS02CD/page_45.htm3.http://www.cs.ucr.edu/cs14/cs14_03win/lecture_slides/lec6/lec6.pdf4.http://en.wikibooks.org/wiki/Data_Structures/Stacks_and_Queues5. http://www.sqa.org.uk/e-learning/LinkedDS02CD/page_23.htm6. http://www.cs.ucr.edu/cs14/cs14_05win/slides/Stacks.pdf7. http://cpp.datastructures.net/textbook/index.html

8. http://lcm.csa.iisc.ernet.in/dsa/node21.html3 Trees 1. http://kumarharmuscat.tripod.com/ds/schedule.html

2.http://www.personal.kent.edu/rmuhamma/Algorithms/MyAlgorithms/binarySearchTree.html3. http://cs.ucsb.edu/~yangli/CS130A%20Files/Binary%20Search%20Trees.pdf4. http://orion.lcg.ufrj.br/Dr.Dobbs/books/book3/chap5.htm5. http://www.sci.csuhayward.edu/~billard/cs3240/node19.html6. http://www.cs.purdue.edu/homes/ayg/CS251/slides/chap7b.pdf7. http://fortheloot.com/public/AVLTreeTutorial.rtf8.http://pages.cs.wisc.edu/~vernon/cs367/notes/11.PRIORITY-Q.html

4 Sorting and Searching

1. http://www.cosc.canterbury.ac.nz/mukundan/dsal/ISort.html2. http://maven.smith.edu/~thiebaut/java/sort/3. http://www.cs.pitt.edu/~kirk/cs1501/animations/Sort2.html4. http://www.tech-faq.com/sorting.shtml5. http://www.ansatt.hig.no/frodeh/algmet/animate.html6. http://www.tech-faq.com/quick-sort.shtml7. http://www.tech-faq.com/merge-sort.shtml8. http://linux.wku.edu/~lamonml/algor/sort/sort.html

4Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound

technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

5 Graphs 1. http://www.brpreiss.com/books/opus4/html/page557.html2.http://www.algolist.net/Algorithms/Graph_algorithms/Undirected/Depth_first_search3. http://www.brpreiss.com/books/opus4/html/page535.html4. http://lcm.csa.iisc.ernet.in/dsa/node216.html5.http://homepages.ius.edu/rwisman/C455/html/notes/Chapter22/TopSort.htm6.http://www.eecs.wsu.edu/~ananth/CptS223/Lectures/shortestpath.pdf7. http://www.cs.auckland.ac.nz/~jmor159/PLDS210/dijkstra.html8. http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html9. http://compprog.wordpress.com/2007/11/09/minimal-spanning-trees- prims-

algorithm/10.http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/

GraphAlgor/dijkstraAlgor.htm

5Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound

technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

LESSON PLAN:

Topic

NoTopic Name Text/ Refe

Page No.No. of Period

s

Cum. No. of

periods

UNIT I – INTRODUCTION1. The Role of Algorithms in Computing T2(5-10)

2 22. Algorithms, Algorithms as a Technology T2(10-14)3. Structures in C- Implementation of Structures

R3(282-382) 3 54. Structure parameters 5. Unions in C - Implementation of Unions6. Recursive definition and processes: Factorial

function - Fibonacci sequence (Student Seminar) R3(174-184) 2 77. Recursion in C – Efficiency of recursion8. Tutorial/Quiz 1 8

UNIT II – STACKS, QUEUES AND HASHING9. Abstract Data Types T1(57 - 58) 1 910. Stacks - -Stack applications

T1(78 – 95) 2 1111.Balancing symbols, Infix to postfix expression conversion, Postfix Expression evaluation, Function calls

12. Queues T1(95 – 101) 1 1213. Linked lists-singly, doubly, circular linked list T1( 58 – 78) 3 1514. Hash Tables - Direct-address tables – Hash tables

T1(165 -181 ) 2 1715. Hash functions

16. Open addressing17. Tutorial/Quiz 1 18

UNIT III – TREES

18. Tree Terminologies - Binary tree - Binary tree traversal - Expression tree construction T1(105 -

123) 3 2119. Binary Search Trees20. Querying a binary search tree - Insertion and

deletion21. AVL trees-Rotations, Insertion, Deletion T1(126 -

139) 3 2422. B-Trees- Definition (Student Seminar)

T1(149–154 ) 2 2623. Basic operations on B-trees

24. Insertion and Deletion of a key from a B-tree25. Tutorial/Quiz 1 27

UNIT-IV SORTING AND SEARCHING26. Priority Queue (Heap) T1(193-202) 2 2927. Model – Simple implementations

6Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound

technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

28. Binary Heap - properties

29. Sorting - Bubble sort, Insertion sort, Shell sort, Heap sort, Quick sort, Merge sort, Selection sort

T1(236 – 261) 4 33

30. Radix sort (Student Seminar) T1(70-73)2 3531. Searching- Linear search R1(372-376)

32. Binary search R2(45-46)33. Tutorial/Quiz 1 36 UNIT V – GRAPHS34. Graph terminologies - Representations of graphs T1(299-302)

1 3735. Topological sort T(302-306)36. Breadth-first search T2(594-602)

2 3937. Depth-first search T2(603-612)

38. Strongly connected components (Student Seminar)

T2(1170-1172)

39. Minimum Spanning Trees- Growing a minimum spanning tree T1(329-335) 1 40

40. The algorithms of Kruskal and Prim41. Shortest paths in directed acyclic graphs T1(306 -

324) 2 4242. Dijkstra's algorithm43. All Pairs Shortest Paths - Shortest paths and

matrix multiplication T2(684-693) 1 4344. The Floyd - Warshall algorithm T2(693-700) 2 4545. Tutorial/Quiz 1 46

TOPICS BEYOND THE SYLLABUS: Space-Time complexity tradeoffs for implementation of common ADT's Rotations, Root Insertion in Binary Search Tree Priority Queues and Their Extensions Backtracking Algorithms NP Completeness Problems

ASSESSMENT PLAN FOR THE COURSE

SI. No

Course Outcomes How Measured When Measured

1 CO1: Understand the role of efficient algorithms in computing

Based on the performance in SE-I, End-Semester, Assignment - I and Tutorial - I

After SE-I, End-Semester

2 CO2: Develop algorithms for linear data structures and its operations and apply it for real world problems

Based on the performance in SE-I, SE-II, End-Semester, Assignment - I and Tutorial – I

After SE-I, SE-II and End-Semester

CO3: Design and Apply different tree operations and traversal techniques to solve

Based on the performance in SE-II, End-Semester, Assignment - II and Tutorial – II

After SE-II and End-Semester

7Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound

technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

problems.4 CO4: Analyze and apply

learned sorting and searching techniques to solve problems.

Based on the performance in SE-III, End-Semester, Assignment - III and Tutorial – III

After SE-III and End-Semester

5 CO5 Design and develop code for real life problems using graphs

Based on the performance in SE-III, End-Semester, Assignment - III and Tutorial - III

After SE-III and End-Semester

ASSIGNMENTS AND TUTORIALS

S.NO

Assignments/Tutorials Date

1 Assignment-I 08.01.20162 Assignment-II 12.02.20163 Assignment-III 11.03.20164 Tutorial-I 18.01.20165 Tutorial-II 17.02.20166 Tutorial-III 16.03.2016

MAPPING OF CO TO ASSIGNMENT AND TUTORIALS

A / T /

Assign.-I Assign.-II Assign.-III Tutorial-I Tutorial-II Tutorial-III

COCO1 CO2 CO3 CO4 CO5

ASSIGNMENTS

Detailed assignments are available in Student’s LMS Page (http://kalasalingam.ac.in/elearn/)

Real time Application Projects:

1. Call center phone systems will use Queues, to hold people calling them in an order, until a service representative is free

2. Undo functionality in Photoshop or Word is a real time application for doubly linked list 3. Sorting a hand of playing card is a real time application for insertion sort 4. Large LAN with many switches, finding a minimum spanning tree will be vital to

ensure that only a minimum number of packets will be transmitted across the network.

Related Online Courses

1. NPTELProgramming, Data structure and algorithm -http://nptel.ac.in/courses/106102064/1

2. courseraAlgorithms: Design and Analysis - https://class.coursera.org/algo-004/lecture

8Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound

technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the requirement of the industry and society

Vision: To become a Centre of Excellence in Teaching and Research in the field of Computer Science and Engineering

PORTIONS FOR SESSIONAL EXAMINATIONS

S. No Test No. Topics

1. Sessional –I 1-13

2. Sessional –II 14-28

3. Sessional-III 29-45

4. End Semester 1-45

Study Materials are available in the following server

START RUN \\172.16.0.7 (for LAN) or \\172.16.16.7(for WiFi)Username: CSE103Password : CSE103

Folder Path: \\172.16.0.7\students\I year\CSE103 Data Structures

Course Coordinator Module Coordinator(Dr..P.Deepalakshmi) (Dr. K. Kartheeban)

Programme Coordinator HOD/CSE(Dr. R. Ramalakshmi) (Dr.P.Deepalakshmi) *******

9Mission: To prepare the students for prospective career in IT industry and for higher learning by imparting sound

technical knowledge. To carry out research in cutting edge technologies in Computer Engineering to meet the requirement of the industry and society