Go Back   2018 2019 EduVark > Education Discussion > Career and Jobs



  #1  
Old April 24th, 2015, 09:44 AM
Unregistered
Guest User
 
Posts: n/a
Default Iit cse syllabus

Hi I want the syllabus of Computer Science and Engineering of B.Tech 2nd & 3rd semester Indian Institute of Technology Patna?
Reply With Quote
Have a Facebook Account? Ask your Question Here
  #2  
Old April 24th, 2015, 12:06 PM
Super Moderator
 
Join Date: Mar 2012
Posts: 23,404
Default Re: Iit cse syllabus

The Indian Institute of Technology Patna is an autonomous institute of education and research in science, engineering and technology located in Patna, India. It is recognized as an Institute of National Importance by the Government of India. It was established in 2008.

B.Tech Computer Science and Engineering syllabus

Second Semester

CS101 Introduction to Computing

Digital computer fundamentals: flowcharts, the von Neumann architecture, programs, assembly language, high level programming languages, text editors, operating systems. Imperative programming (Using C): data types, variables, operators, expressions, statements, control structures, functions, arrays and pointers, recursion, records (structures), files, input/output, some standard library functions and some elementary data structures.

Program development: programming tools, testing and debugging.

Texts:
A. Kelley and I. Pohl, A Book on C, 4th Ed, Pearson Education, 1998.

References:

B. W. Kernighan and D. Ritchie, The C Programming Language, 2nd Ed, Prentice Hall of India, 1988.

CS110 Computing Laboratory

Laboratory experiments will be set in consonance with the material covered in CS 101. This will include assignments in a programming language like C.

References:

Kernighan B., Ritchie D., The Programming Language, Prentice Hall India, 1995.

Third Semester-

CS201 OOP and Data Structures

From C to Java: basics of Java, introduction to the object oriented programming (OOP) concepts (such as classes, objects, constructors, destructors, inheritance, polymorphism, operator overloading) using Java, JVM, applets, APIs, GUI Programming. From Java to C++: the OOP concepts using C++. Performance of algorithms: space and time complexity, asymptotics. Fundamental Data structures: linked lists, arrays, matrices, stacks, queues, binary trees, tree traversals. Algorithms for sorting and searching: linear search, binary search, insertion-sort, bubble-sort, quicksort. Priority Queues: lists, heaps. Graphs: representations, depth first search, breadth first search. Hashing: separate chaining, linear probing, quadratic probing. Search Trees: binary search trees, red-black trees, AVL trees, splay trees, B-trees.

Texts:

M. A. Weiss, Data Structures and Problem Solving Using Java, 2nd Ed, Addison-Wesley, 2002.
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press, 2001.

References:

B. W. Kernighan and D. Ritchie, The C Programming Language, 2nd Ed, Prentice Hall of India, 1988.

CS203 Discrete Mathematics

Set theory: sets, functions, relations, partial orders, lattices. Logic: propositional logic (formulae, truth tables, proof systems, soundness and completeness of proof systems), predicate logic (formulae, interpretations, proof systems, soundness and completeness of proof systems). Combinatorics: permutations, combinations, partitions, Stirling numbers. Recurrences, summations, generating functions, asymptotics. Graph Theory: paths, connectivity, subgraphs, isomorphic and homeomorphic graphs, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs. Algebraic Structures: semigroups, groups, subgroups, homomorphisms, rings, integral domains, fields.

Texts:

J. P. Tremblay and R. P. Manohar, Discrete Mathematics with Applications to Computer Science, Tata McGraw-Hill, 199

References:

C. L. Liu, Elements of Discrete Mathematics, 2nd Ed, Tata McGraw-Hill, 2000.
R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 2nd Ed, Addison-Wesley, 1994.
N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall of India, 1974.
S. Lipschutz and M. L. Lipson, Schaumís Outline of Theory and Problems of Discrete Mathematics, 2nd Ed, Tata McGraw-Hill, 1999.

CS221 Digital Design

Number Systems: representations of numbers (binary, octal, decimal, and hexadecimal), arithmetics of signed and unsigned numbers. Boolean Algebra and logic gates: gate level minimization of Boolean functions. Combinational logic circuits: design and analysis, some standard combinational circuits (encoders, decoders, multiplexers). Sample and hold Circuits, Analog-to-Digital Converter, Digital-to-Analog Converter. Synchronous sequential logic circuits: design and analysis; flip-flops, registers, counters; finite state model: state tables and state diagram, state minimization. Asynchronous sequential logic circuits: design and analysis; incompletely specified machines; reduction of states and flow tables; race free state assignments. Programmable logic devices: memory, PLA, PAL. Representation and synthesis using ASM charts.

Texts:

M. M. Mano, Digital Design, 3rd Ed, Pearson Education Asia, 2002.

References:

S. Brown and Z. Vranesic, Fundamentals of Digital Logic - With Verilog Design, Tata McGraw-Hill, 2002.
S. Brown and Z. Vranesic, Fundamentals of Digital Logic - With VHDL Design, Tata McGraw-Hill, 2002
J. P Uyemura, A First Course in Digital System Design - An Integrated Approach, Vikas Publishing House, 2001.
Z. Kohavi, Switching and Finite Automata Theory, 2nd Ed, Tata McGraw-Hill, 1995.

Contact details

Indian Institute Of Technology Patna
Navin Government Polytechnic Campus, Patliputra Colony, Patna, Bihar 800013 ‎
0612 255 2067

Map location

Reply With Quote
Sponsored Links




















Reply

Similar Threads
Thread
ICSE syllabus and CBSE syllabus Differences
LL.M. Syllabus in MDS university Ajmer syllabus


Forum Jump


All times are GMT +5.5. The time now is 03:47 PM.


Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2018, vBulletin Solutions, Inc.
Content Relevant URLs by vBSEO 3.6.0

1 2 3