Page 1 of5Institute / School Name Chitkara School of Engineering and Technology Program Name B.E. II (ECE) and MCA II Course Code CS2021 Course Name Data Structures Lecture / 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 ofcomplexity classes. 2. To compare different implementations of data structures and to recognize the advantages and disadvantages of diffe rent 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, 3 rd Edition, Tata Mc Grawhill Publication 3.Reference BooksRB1: ‘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/S tacks%20and%20Que ues/Stacks%20and %20Queues.html 2.http://www.cs.sunysb.edu/~skiena/214/lectures/ 3.http://technic al-interview.com/DataStructures.asp x 4.http://www.mycstutori als.com/article s/data_structu res/linkedli sts 5.www.acm.org 6.http://www.haskell.org/haskellwiki/Research_papers/Data_structures 7.http://comjnl.oxfordjournals.org/content
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.