Computer_Science_Engineering.pdf

Documents

10 pages
139 views

Please download to get full document.

View again

of 10
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
Share
Description
www.jntuworld.com || www.android.jntuworld.com || www.jwjobs.net || www.android.jwjobs.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA KAKINADA - 533 003, Andhra Pradesh, India Branch : COMPUTER SCIENCE & ENGINEERING M.Tech I YEAR I SEMESTER COMPUTER SCIENCE & ENGINEERING COURSE STRUCTURE S.NO SUBJECT L P
Transcript
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA KAKINADA - 533 003, Andhra Pradesh, India   Branch : COMPUTER SCIENCE & ENGINEERING   M.Tech I YEAR I SEMESTER COMPUTER SCIENCE & ENGINEERING COURSE STRUCTURE S.NO SUBJECT L P C 1 ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS 4 - 3 2 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 4 - 3 3 COMPUTER ORGANIZATION AND ARCHITECTURE 4 - 3 4 DATABASE MANAGEMENT SYSTEMS 4 - 3 5 OPERATING SYSTEMS 4 - 3 6 SOFTWARE ENGINEERING 4 - 3 7 CSE LAB I - 4 2 www.jntuworld.com || www.android.jntuworld.com || www.jwjobs.net || www.android.jwjobs.net  www.jntuworld.com || www.jwjobs.net     JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA KAKINADA - 533 003, Andhra Pradesh, India   M.Tech I YEAR I SEMESTER ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS UNIT I: Introduction to Data Structures, Singly Linked Lists, Doubly Linked Lists, Circular Lists-Algorithms. Stacks and Queues: Algorithm Implementation using Linked Lists. UNIT II:  Searching-Linear and Binary Search Methods. Sorting-Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort.  Trees- Binary trees, Properties, Representation and Traversals (DFT,BFT),Expression  Trees(Infix,prefix,postfix). Graphs-Basic Concepts , Storage Structures and Traversals. UNIT III: Dictionaries, ADT, The List ADT, Stack ADT, Queue ADT, Hash Table Representation, Hash Functions, Collision Resolution-Separate Chaining, Open Addressing-Linear Probing, Double Hashing. UNIT IV: Priority queues- Definition, ADT, Realising a Priority Queue Using Heaps, Definition, Insertion, Deletion . Search Trees- Binary Search Trees, Definition, ADT, Implementation, Operations-Searching, Insertion, Deletion. UNIT V: Search Trees- AVL Trees, Definition, Height of AVL Tree, Operations-, Insertion, Deletion and Searching. Search Trees- Introduction to Red-Black and Splay Trees, B-Trees, , Height of B-Tree, Insertion, Deletion and Searching, Comparison of Search Trees. TEXT BOOKS: 1.   Data Structures: A PseudoCode Approach, 2/e, Richard F.Gilberg,Behrouz A.Forouzon, Cengage. 2.   Data Structures, Algorithms and Applications in java, 2/e, Sartaj Sahni, University Press. REFERENCES BOOKS: 1.   Data Structures And Algorithm Analysis, 2/e, Mark Allen Weiss, Pearson. 2.   Data Structures And Algorithms, 3/e, Adam Drozdek, Cenage. 3.   C and DataStructures: A Snap Shot Oriented Treatise Using Live Engineering Examples, N.B.Venkateswarulu, E.V.Prasad, S Chand & Co, 2009. 4.   Data Structures, Algorithm and OOP,Heilman, TMH. 5.   Inroductions to Algorithms, 2/e, Cormen, PHI,2001. 6.   Fundamentals of Computer Algorithms, 2/e, Horowitz,Sahni,Rajasekaran, University Press. 7.   Design and Analysis, Dave, Pearson, 2008. 8.   Design and Analysis Algorithms, Panneerselvam, PHI,2007. 9. Data Structures, Seymour Lipschutz, Schaum’s Outlines, TMH.   www.jntuworld.com || www.android.jntuworld.com || www.jwjobs.net || www.android.jwjobs.net  www.jntuworld.com || www.jwjobs.net     JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA KAKINADA - 533 003, Andhra Pradesh, India   M.Tech I YEAR I SEMESTER MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE UNIT I : Mathematical Logic: Statements and notations, Connectives, Well formed formulas,  Truth Tables, tautology, equivalence implication, Normal forms, Theory of inference for the statement calculus, Rules of inference, Consistency of premises and indirect method of proof, Automatic Theorem Proving Predicate calculus: Predicates, statement functions, variables and quantifiers, predicate formulas, free & bound variables, universe of discourse, inference theory of predicate calculus UNIT II  Set theory & Relations: Introduction, Relations and ordering, Properties of binary Relations, Equivalence, Compatibility Relations, Partial ordering, Hasse diagram. Functions: composition of functions, Inverse Function, Recursive Functions, Lattice and its Properties, Pigeon hole Principles and its application. Algebraic structures: Algebraic systems, Examples and general properties, Semi groups and monoids, groups, sub groups, Definitions, Examples, homomorphism, Isomorphism and related problems. UNIT III  Elementary Combinatorics: Basis of counting, Enumeration of Combinations & Permutations, Enumerating of Combinations & Permutations with repetitions and constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, principles of Inclusion  –   Exclusion. UNIT IV  Recurrence Relations: Generating Function of Sequences, Calculating Coefficient of generating functions, Recurrence relations, Solving recurrence relation by substitution and Generating functions, The method of Characteristic roots, Solution of Inhomogeneous Recurrence Relation. UNIT V  Graph Theory: Representation of Graph, Spanning Trees, BFS, DFS, Kruskals Algorithm, Binary trees, PlanarGraphs, Graph Theory and Applications, Basic Concepts, Isomorphism and Sub graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers TEXT BOOKS : 1. Discrete Mathematical Structures with Applications to computer science J.P  Tremblery, R.Manohar, TMH 2. Discrete Mathematical for computer Scientists & Mathematicians “  J.L. Molt, A.Kandel ,T.P.Baker, PHI REFERENCE TEXTBOOKS:  1. Elements of Discrete Mathematics, C L Liu, D P Mohanpatra,TMH 2. Discrete Mathematics, Schaum ’  s Outlines,Lipschutz,Lipson  TMH. 3. Discrete Mathematical Structures, Kolman, Busby, Ross, 6th ed., PHI, 2009 4. Discrete Mathematics, Johnsonbaugh, 6th ed., Pearson, 2005 5. Discrete Mathematics, Malik, Sen, 6th ed., Cengage Learning, 2004 6. Discrete Mathematics for computer science, Bogart, Stein and Drysdale, www.jntuworld.com || www.android.jntuworld.com || www.jwjobs.net || www.android.jwjobs.net  www.jntuworld.com || www.jwjobs.net     JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA KAKINADA - 533 003, Andhra Pradesh, India   Springer, 2005 7. Discrete Mathematics and Combinatorics, Sengadir, Pearson, 2009 8. Discrete and Combinatorial Mathematics, Grimaldi, Ramana, 5th ed., Pearson. 2006 9. Mathematical Foundations of Computer Science, Rajendra Prasad, Rama Rao et al., USP, 2009 10. Discrete Mathematics, J K Sharma, 2nd ed., Macmillan, 2005 11. Discrete Mathematics with Combinatorics and Graph Theory, Santha, Cengage Learning, 2009 12. Applied Discrete Structures For Computer Science, Alan Doerr, Levassure, GP, 2005 13. Discrete Mathematics with Applications, Koshy, Elsevier,2006. 14. Discrete Mathematics and its Applications, Rosen, 5th ed, T M Graw-Hill ed, 2006. 15. Discrete Mathematics for Computer Science, Gary Haggard, John Schlipf, Sue Whitesides, Cengage.,2006. 16. Discrete Mathematical, Kevin Ferland, Cengage,2008. 17. Discrete Mathematical Structures, Jayant Ganguly, Sanguine, 2007. www.jntuworld.com || www.android.jntuworld.com || www.jwjobs.net || www.android.jwjobs.net  www.jntuworld.com || www.jwjobs.net 
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks
SAVE OUR EARTH

We need your sign to support Project to invent "SMART AND CONTROLLABLE REFLECTIVE BALLOONS" to cover the Sun and Save Our Earth.

More details...

Sign Now!

We are very appreciated for your Prompt Action!

x