B.Tech. Degree Programme Computer Science & Engineering

More documents

Recommendations

Info

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
Lingaya’s University, FaridabadWEB REFERENCES1. http://www.cs.auckland.ac.nz/software/AlgAnim/ds_ToC.html2. http://en.wikipedia.org/wiki/Data_structure3. http://www.itl.nist.gov/div897/sqg/dads/4. http://www.brpreiss.com/books/opus4/html/book.htmlCS-202PROGRAMMING L T P CrLANGUAGES 5 0 0 3OBJECTIVEThis subject focuses on the fundamental concepts thatunderlie programming language syntax and semanticsthrough a comparative study of several languages andtheir features; to learn several new programminglanguage features and paradigms.PRE-REQUISITESKnowledge of data structures, microprocessors andinterfacing1. INTRODUCTION: Syntactic and semantic rules ofa Programming language; Characteristics of agood programming language; Programminglanguage translators compiler and interpreters;Elementary data types – data objects, variable &constants, data types; Specification &implementation of elementary data types;Declarations; type checking & type conversions;Assignment & initialization; Numeric data types;enumerations, Booleans & characters.2. STRUCTURED DATA OBJECTS : Structured dataobjects & data types; specification &implementation of structured data types;Declaration & type checking of data structure;vector & arrays; records; Character strings;variable size data structures; Union, pointer &programmer defined data objects; sets; files.3. SUBPROGRAMS AND PROGRAMMERDEFINED DATA TYPES: Evolution of data typeconcept; abstraction, encapsulation & informationhiding; Subprograms; type definitions; abstractdata types.4. SEQUENCE CONTROL: Implicit & explicitsequence control sequence; control withinexpressions; sequence control within statement,Subprogram sequence control: simple call return,recursive subprograms; Exception & exceptionhandlers; co routines; sequence control.5. DATA CONTROL: Names & referencingenvironment; static & dynamic scope; blockstructure; Local data & local referencingenvironment; Shared data: dynamic & static scope;Parameter & parameter transmission schemes.6. STORAGE MANAGEMENT: Major run timeelements requiring storage; programmer andsystem controlled storage management & phases;Static storage management; Stack based storagemanagement; Heap storage management; variable& fixed size elements.7. PROGRAMMING LANGUAGES: Introduction toprocedural, non-procedural, structured, functionaland object oriented programming language;Comparison of C & C++ programming languages.TEXTBOOKPratt and Zelkowitz, “Programming Languages:Design and Implementation”, 4th edition, PrenticeHall, 2001REFERENCES1. Tucker Allen & Noonan Robert, “ProgrammingLanguages – Principles and Paradigms”, TataMcGraw Hill, 20062. Ellis Horowitz, “Fundamentals of Programminglanguages”, Galgotia Publications/ SpringerVerlag, 19843. Ghezzi C., “Programming Languages Concepts”,3 rd ed., Wiley Publications, 1997.WEB REFERENCES1. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html2. http://www.fib.upc.edu/en/infoAca/estudis/assignatures/ADA.html3. http://algo.inria.fr/AofA/CS-203DISCRETE STRUCTURESL T P Cr5 1 0 4OBJECTIVETo lay mathematical foundation for the fundamentals ofvarious computational structures such as Booleanalgebra, propositional logic, graph and trees.PRE-REQUISITESKnowledge of Data Structure1. SET THEORY: Introduction to set theory; setoperations; algebra of sets: duality, finite andinfinite sets, classes of sets, power sets, multi sets,Cartesian product, representation of relations,types of relation, equivalence relations andpartitions, partial ordering relations and lattices;function and its types, composition of function andrelations; cardinality and inverse relations2. PROPOSITIONAL CALCULUS: Basic operations:AND (Λ), OR (V), NOT (~), truth value of acompound statement, propositions, tautologies,contradictions.3. TECHNIQUES OF COUNTING: Permutations withand without repetition, combination.4. RECURSION AND RECURRENCE RELATION:Polynomials and their evaluation; sequences,introduction to AP, GP and AG series, partialfractions; linear recurrence relation with constantcoefficients; homogeneous solutions, particularsolutions, total solution of a recurrence relationusing generating functions.5. ALGEBRIC STRUCTURES: Definition andexamples of a monoid, semigroup, groups andrings; homomorphism, isomorphism andautomorphism; subgroups and normal subgroups;cyclic groups, integral domain and fields; co-sets;Lagrange’s theorem6. GRAPHS: Introduction to graphs, directed andundirected graphs; homomorphic and isomorphicgraphs; subgraphs; cut points and bridges;multigraph and weighted graph; paths and circuits,shortest path in weighted graphs; Eulerian path29
Page 1: B.Tech. Degree ProgrammeComputer Sc
Page 6 and 7: B.Tech. Computer Science & Engineer
Page 31: Lingaya’s University, FaridabadCH
Page 35 and 36: Lingaya’s University, FaridabadCS
Page 37 and 38: Lingaya’s University, Faridabad2.
Page 39 and 40: Lingaya’s University, Faridabadpe
Page 43 and 44: Lingaya’s University, FaridabadPR
Page 45 and 46: Lingaya’s University, Faridabadco
Page 47 and 48: Lingaya’s University, Faridabadar
Page 49 and 50: Lingaya’s University, Faridabadex
Page 55 and 56: Lingaya’s University, FaridabadRE
Page 82 and 83:
B.Tech. Computer Science & Engineer
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
show all

B.Tech. Degree Programme Computer Science & Engineering

Create successful ePaper yourself

Delete template?

Save as template?