B Tech In JNU Delhi

I have completed 12th and now I want to do B.Tech course Jawaharlal Nehru University so tell me the branches available in the B.Tech course in this University also tell me the fee structure of B.Tech course? Is this University accepts III JEE scores for admission?

Can you provide me the syllabus of B Tech in Computer Science and Engineering and MS/M Tech in Social Sciences/Humanities/ Science/Technology Program offered by Jawaharlal Nehru University, School of Engineering?

[pooja]

The syllabus of B Tech in Computer Science and Engineering and MS/M Tech in Social Sciences/Humanities/ Science/Technology Program offered by Jawaharlal Nehru University, School of Engineering is as follows:

Syllabus of Computer Science & Engineering


Computer Programming

Stored program concept (with simple computer simulator), machine language and instruction formats, assembly language for the simple computer. Characteristics of Computers, Evolution of Computing, Binary Number Systems, Types of Computer Software, Operating Systems, Programming Languages, Problem Solving Techniques using Computers: Algorithm, Flow Charts, Pseudocode. Introduction to Computer Networks, Internet, World Wide Web, Getting Connected to Internet. Problem Solving, Concept of Algorithms, Introduction to Computer Programming, Editing and Compiling a Program.

Text/ Reference Books:
V. Rajaraman, N. Adabala, Fundamentals of Computers, PHI, 2014
P. Pannu, Y. A. Tomer, ICT4D Information Communication Technology for Development, I K International Publishing House Pvt. Ltd, 2010.
S.K.Basandra, Computer Today, Galgotia Publications, 2009

Data Structures

Introduction to Data Structures, algorithms, pseudo-code, time and space complexities; arrays and their applications, sparse matrix, stacks and their applications such as recursion, queues including priority queues and their applications, linked lists and their applications, Introduction to trees, forest, static tree structures: binary tree, threaded binary tree, their traversal techniques, Binary Search Trees, including their applications, dynamic tree structures: AVL trees, B-trees, B+ trees, B* tree, including their applications, Introduction to Graphs, DFS, BFS. Sorting and searching algorithms, hashing.

Text/ Reference Books:
H Ellis, S. Sahni, Fundamentals of Data Structures, W H Freeman and Co. 1995.
J. P. Tremblay, P. G. Sorenson, Introduction to Data Structures: With Applications, McGraw Hill Higher Education, 1983.
Kruse Robert L., Data Structures and Program Design, Prentice Hall, 2007
R. Gilberg, B. A. Forouzan, Data Structures: A Pseudocode Approach with C, Course Technology Inc, 2004.

Discrete Mathematical Structures

Propositions and Logical Operations: Notation, Connections, Normal forms, Truth Tables, Equivalence and Implications, Theory of interference for statement calculus, Predicate calculus, Rules of Logic, Mathematical Induction and Quantifiers. Sets, Relations and Diagraphs: Review of set concepts, Relations and digraphs, Properties of relations, Equivalence relations, Computer representation of relations and digraphs, Manipulation of relations, Partially Ordered Sets (Posets), Recurrence RelationsGroups and Applications: Monoids, Semi groups, Product and quotients of algebraic structures, Isomorphism, homomorphism, automorphismElementary Graph Theory: Euler, Hamiltonian graph, Tree, Planner graph, Graph representationClassification of Languages: Overview of Formal Languages-Representation of regular languages and grammars, finite state machines.

Text/ Reference Books:
J. P. Tremblay, R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, McGraw Hill Education, 2001.
C. L. Liu, Elements of Discrete Mathematics, McGraw-Hill Education,1986.
K H. Rosen, Discrete Mathematics and Its Applications, McGraw Hill Education, 1999.
N. Dev, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall India Learning Private Limited, 1979.