B.Tech. Degree Programme Computer Science & Engineering

B.Tech. Computer Science & Engineering (Regular)4. Nabajyoti, Barkakati, “Object OrientedProgramming in C++”, Prentice Hall of India, 3 rdEdition, 1995.5. Jack, B. Rochester, “Using Computers andInformation”, Prentice Hall of India, 1996.6. Byron, C. Gottfried, “Theory and Problem ofProgramming with C”, Tata McGraw Hill7. Press, Barry and Press, Marcia, “Teach Yourselfall About Computers”, IDG Books India, 2000.8. Schildt, Herbert, “C++: The Complete Reference”,Tata McGraw Hill, 4 th Edition, 20039. Liberty, Jesse, “Programming C#”, O’Reilly, 4 thEdition, 2005.WEB REFERENCES1. http://www.physics.drexel.edu/courses/Comp_Phys/General/C_basics/c_tutorial.html2. http://www.eskimo.com/~scs/cclass/notes/top.html3. http://www.lysator.liu.se/c/bwk-tutor.htmlCS-151COMPUTER PROGRAMMING L T P CrLAB 0 0 2 1LIST OF EXPERIMENTS/EXERCISES1. Basic/Simple logic building2. Handling mathematical data3. Use of control structures4. Use of Function5. Handling mathematical problems6. Array and Pointer7. Searching and Sorting8. String Manipulation9. Use of Structure and Union10. File handlingREFERENCE BOOKS1. Dennis, M. Ritchie and Brian, W. Kernigham, “TheC Programming Language”, Prentice Hall of India,1988.2. Byron, C. Gottfried, “Theory and Problem ofProgramming with C”, Tata McGraw Hill3. Barkakati, Nabajyoti, “Object OrientedProgramming in C++”, Prentice Hall of India, 2001.4. Schildt, Herbert, “C++: The Complete Reference”,Tata McGraw Hill, 4 th Edition, 2003CS-201DATA STRUCTURES & L T P CrALGORITHMS 5 1 0 4OBJECTIVETo relay the theoretical and practical fundamentalknowledge of most commonly used algorithms.PRE-REQUISITESKnowledge of basic computer programming1. INTRODUCTION TO DATA STRUCTURES:Definition of data structures and abstract datatypes; polymorphic data types; linear vs. non-lineardata types; primitive vs. non-primitive data types;static and dynamic implementations; arrays, 2, 3and multi-dimensional arrays; examples and reallife applications.2. RUNNING TIME: Time complexity; Big Ohnotation; running times; best case, worst case,average case; factors depends on running time;introduction to recursion; divide and conqueralgorithm; evaluating time complexity.3. STACKS AND QUEUES: Stacks: definition, arraybased implementation of stacks, linked list basedimplementation of stacks; examples: infix, postfix,prefix representation; conversions, applications;definition of queues; array based implementationof queues4. LINKED LISTS: Lists; linked list implementation ofstacks and queues; circular implementation ofqueues and singly linked lists; straight / circularimplementation of doubly linked queues; priorityqueues; applications.5. TREES: Definition of trees and binary trees;properties of binary trees and implementation;binary traversal pre-order, post-order, in-ordertraversal; binary search trees; implementations;threaded trees; balanced multi way search trees;AVL trees; implementations6. GRAPHS: Definition of undirected and directedgraphs and networks; array based implementationof graphs; adjacency matrix; path matriximplementation; linked list representation ofgraphs; shortest path algorithm, graph traversal:breadth first traversal, depth first traversal; hashtables, hash function; implementations andapplications.7. SORTING AND SEARCHING ALGORITHMS:Introduction, sorting by exchange, selection,insertions, bubble sort, straight selection sort,efficiency of above algorithms; shell sort,performance of shell sort, merge sort, merging ofsorted arrays and algorithms; quick sort algorithmanalysis, heap sort: heap construction, heap sort,bottom – up, top – down heap sort approach;searching algorithms: straight sequential search,binary search (recursive & non–recursivealgorithms)TEXT BOOKLangsam, Augentem M.J. and Tenenbaum A. M.,“Data Structures using C & C++”, Prentice Hall of India,2009.REFERENCE BOOKS1. Aho A. V., Hopcroft J. E. and Ullman T. D., “DataStructures and Algorithms”, Original Edition,Addison-Wesley, Low Priced Edition, 1983.2. Horowitz Ellis and Sahni Sartaj, “Fundamentals ofData Structures”, Addison-Wesley Pub, 1984.3. Horowitz, Sahni and Rajasekaran, “Fundamentalsof Computer Algorithms” 2007.4. Kruse Robert, “Data Structures and ProgramDesign in C”, Prentice Hall of India, 19945. Lipschetz Jr. Seymour, “Theory & Problems ofData Structures”, Schaum’s Outline, Tata McGrawHill6. Weiss Mark Allen, “Data Structures and AlgorithmsAnalysis in C”, Pearson Education, 20007. Cormen T. H. et al., “Introduction to Algorithms”,2nd Edition, Prentice Hall of India, 2001.8. Dasgupta Sanjay, Christos P. and Vazirani Umesh,“Algorithms”, Tata McGraw Hill, 200828