JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR Course Structure and Syllabus for M.Tech. COMPUTER SCIENCE AND ENGINEERING (CSE) AND COMPUTER SCIENCE (CS) for affiliated Engineering Colleges 2009-10 I YEAR I SEMESTER Subject Hours/ Week Mathematical Foundations of Computer Science 4 Advanced Data Structures and Algorithms 4 Computer System Design 4 Java and Web Technologies 4 Software Engineering 4 Elective-I a. Advances in Databases b. Distributed Databases c .Computer Vision 4 Software Lab- 1 (Covering the experiments: Data structures & Algorithms and Web Technologies) 4 I YEAR II SEMESTER Subject Hours/ Week Object Oriented Analysis and Design 4 Advanced Computer Networks 4 Distributed Systems 4 Software Quality Assurance and Testing 4 Data Warehousing and Mining 4 Elective-II a. Software Architecture b. Software Design c. Design Patterns 4 Software Lab- 2 (Covering the 4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPURCourse
Structure and Syllaus !or "#Tec$# CO"PUTER SCIENCE AN% ENGINEERING
&CSE' AN% CO"PUTER SCIENCE &CS' !or a!!(l(ated En)(neer(n)
Colle)es *++,-.+I YEAR I SE"ESTERSubject Hours/WeekMathematical
Foundations of Computer Science 4Advanced Data Structures and
Alorithms 4Computer S!stem Desin 4"ava and Web #echnoloies
4Soft$are %nineerin 4%lective&'a( Advances in Databasesb(
Distributed Databasesc (Computer )ision4Soft$are *ab& +
,Coverin the e-periments. Data structures /Alorithms andWeb
#echnoloies04I YEAR II SE"ESTERSubject Hours/Week1bject 1riented
Anal!sis and Desin 4Advanced Computer 2et$orks 4Distributed S!stems
4Soft$are 3ualit! Assurance and #estin 4Data Warehousin and Minin
4%lective&''a( Soft$are Architectureb( Soft$are Desin c( Desin
4atterns4Soft$are *ab& 5 ,Coverin the e-periments. 11AD / Data
Warehousin and Minin 4II YEAR&III / IV
Se0esters'S67"%C#SSeminar4roject $orkJAWAHARLAL NEHRU TECHNOLOGICAL
UNIVERSITY ANANTAPUR"#Tec$ &Co01uter Sc(ence / En)(neer(n)'I
YEARI SE"ESTER "ATHE"ATICAL 2OUN%ATIONS O2 CO"PUTER SCIENCE UNIT
IMathematical *oic. Statements andnotations8 Connectives8 Well
formedformulas8 #ruth#ables8tautolo!8 e9uivalence implication8
2ormal forms8 #heor! of inference for the statement calculus UNIT
II:ules of inference8 Consistenc!of premises andindirect methodof
proof8 Automatic #heorem4rovin4redicate calculus. 4redicates8
statement functions8 variables and 9uantifiers8 predicate formulas8
free/ bound variables8 universe of discourse8 inference theor! of
predicate calculus UNIT III Set theor! /:elations. 'ntroduction8
:elations and orderin8 4roperties of binar! :elations8%9uivalence8
Compatibilit! :elations8 4artial orderin8 Hasse diaram( Functions.
composition of functions8 'nverse Function8 :ecursive Functions8
*attice and its 4roperties84ieon hole 4rinciples and its
application(UNIT IV Alebraic structures. Alebraic s!stems8 %-amples
and eneral properties8 Semi roups and monoids8roups8 sub roups8
Definitions8 %-amples8 homomorphism8 'somorphism and related
problems(UNIT V %lementar! Combinatorics. 7asis of countin8
%numeration of Combinations /4ermutations8%numeratin of
Combinations / 4ermutations $ith repetitions and constrained
repetitions8 7inomialCoefficients8 7inomial Multinomial theorems8
principles of 'nclusion ; %-clusion( UNIT VI :ecurrence
:elations.
