Syllabus

M. Sc. (Computer Science) Department of Computer Science Assam University, Silchar

Course Structure for M.Sc. (Computer Science)-5 years integrated I-Semester

101. General English 102. Digital Electronics & Fundamentals Of com uters 10!. "tatistical #ethods and $ lications 104. %rogramming Fundamentals and %ro&lem "ol'ing ()ith FO*+*$,Total Contact Hours: 20Hours/Week

L
4 4 4 4

T
1 1 1 1

P
-

S
25 25 25 25

E
75 75 75 75

TM
100 100 100 100

II-Semester
201. $lternati'e English.#/0 202. #athematics 20!. 1om uter "2stem Organi3ation & $rchitecture 204. %rogramming )ith 1
Total Contact Hours: 20Hours/Week

L
4 4 4 4

T
1 1 1 1

P
-

S
25 25 25 25

E
75 75 75 75

TM
100 100 100 100

III-Semester
!01. En'ironmental "tudies 702. "cientific 1om utation !0!. Data & File "tructure !04. 0a&orator2 1ourse in (a- "cientific 1om utation (&- Data & File "tructure
Total Contact Hours: 27 Hours/Week

L
4 4 4 -

T
1 1 1 -

P
4 4

S
25 25 25 1! 12

E
75 75 75 !7 !5

TM
100 100 100 50 50

IV-Semester
401. Design and $nal2sis of 1om uter $lgorithms 402. #icro rocessor and $ssem&l2 0anguage 40!. Data 6ase #anagement "2stems 404. 0a&orator2 1ourse in (a- #icro rocessor and $ssem&l2 0anguage (&- Data 6ase #anagement "2stems
Total Contact Hours: 27 Hours/Week

L
4 4 4 -

T
1 1 1 -

P
4 4

S
25 25 25 1! 12

E
75 75 75 !7 !5

TM
100 100 100 50 50

V-Semester
501. "2stem $nal2sis and Design 502. O&7ect oriented Design and %rogramming 50!. O erating "2stem and $rchitecture 504. 0a&orator2 1ourse in (a- O&7ect oriented Design and %rogramming (&- O erating "2stem and $rchitecture
Total Contact Hours: 27 Hours/Week

L
4 4 4 -

T
1 1 1 -

P
4 4

S
25 25 25 1! 12

E
75 75 75 !7 !5

TM
100 100 100 50 50

VI-Semester
401. 1om uter ,et)or8s and data communications 402. 1om uter Gra hics 40!. "2stem rogramming 404. %ro7ect
Total Contact Hours: 27 Hours/Week

L
4 4 4 -

T
1 1 1 -

P
12

S
25 25 25 25

E
75 75 75 75

TM
100 100 100 100

VII-Semester
701. +heor2 of 1om utation 702. $d'anced Data 6ase #anagement "2stem 70!. $rtificial /ntelligence 704. 0a&orator2 9 /: (a- %ractical on $d'anced D6#" (&- %ractical on $rtificial /ntelligence
Total Contact Hours: 27 Hours/Week

L
4 4 4 -

T
1 1 1 -

P
4 4

S
25 25 25 1! 12

E
75 75 75 !7 !5

TM
100 100 100 50 50

VIII-Semester
501. "oft)are Engineering 502. %rinci les of 1om uter Design 50!. #odeling and "imulation 504. 0a&orator2 9 : (a- %ractical on 1om uter Design (&- %ractical on #odeling & "imulation
Total Contact Hours: 27 Hours/Week

4 4 4 -

1 1 1 -

4 4

25 25 25 1! 12

75 75 75 !7 !5

100 100 100 50 50

IX-Semester
;01. $d'anced 1om uter $rchitecture ;02. O erating *esearch ;0!. %arallel & Distri&uted 1om uting ;04. 0a&orator2 9 :/ (a- %ractical on O erations *esearch (&- %ractical on %arallel & D. 1om uting
Total Contact Hours: 35 Hours/Week

4 4 4 -

1 1 1 -

4 4

25 25 25 1! 12

75 75 75 !7 !5

100 100 100 50 50

X-Semester
1001. Electi'e<< 1002. Fu332 set theor2 and a lications 100!. %ro7ect
Total Contact Hours: 35 Hours/Week

4 4 -

1 1 -

25

25 25 50

75 75 150

100 100 200

Electives**:
1. 2. !. 4. Digital /mage %rocessing ,atural 0anguage %rocessing ,eural ,et)or8s and $ lications /nternet +echnologies and $ lications

L: Lecturer Hrs/Week T: Tutorial P: Practical Hrs/Week S: Sessional Marks E: End Semester Marks TM: Total Marks Total Marks / Semester 4

Semester-I
BCS! . "eneral #n$lish

AS prescribed in Assam University Undergraduate courses in the P.G department. Text/References: AS prescribed in Assam University Undergraduate courses in the P.G department. BCS - !%. &un'amentals of Computers an' Di$ital #lectronics( Unit )( Electronics: Diode as a rectifier, S PS, transistor characteristics, Amplifiers, multi! vibrators, "asics of #$ technology. Unit ))( "inary Systems, "oolean algebra and logic gates, simplifications of "oolean functions, the map method, t%o and three variable & maps, product of sums, simplification, 'A'D and '() implementation, other t%o level implementation, Don*t!care conditions, +he tabulation method, determination of prime implicants, selection of prime implicants. Unit )))( $ombinational logic: #ntroduction , Design procedures , Adders, Subtractors, $ode conversions, Analysis procedure, ulti level 'A'D circuit, E,clusive &() and E-uivalence functions, "inary Parallel Adder, agnitude $omparator, Decoders, multiple,ers, )ead (nly emory.)( /, Programmable 0ogic Array.P0A/. Unit )*( Se-uential 0ogic: #ntroduction, 1lip!1lops, Analysis of $loc2ed Se-uential circuits, State )eduction and Assignment, 1lip!1lop!E,citation table, Design Procedure, Design (f counters, Design %ith state E-uations. Unit *( )egisters, $ounters and the emory Unit: #ntroduction, registers, Shift )egisters, )ipple $ounters, Synchronous $ounters, +iming Se-uences, +he memory Unit, E,amples of )andom Access memories. Text/References: Digital 0ogic and computer design orris mano,P3#,4556 Digital Principles and applications alvino and 0each,+ 3,4554 Digital $omputer Electronics alvino A.P. + 3,4554 Digital $omputer 1undamentals - +.$ bate, cGra% 3ill,4557

BCS -

!+. Statistical Metho's , Applications

Unit )( easures of location, measures of dispersion, s2e%ness, co!efficient of s2e%ness, +heory of probability, A,iomatic approach to probability, concept of events, sets, Additional multiplication theorem on probability, conditional probabilities, independent, pair %ise independent and mutual independent events and applications, "ay*s theorems and applications, 0a%s of e,pectations, oment Generating functions and variance!covariance matri,. Unit ))( )andom variables, Discrete and continuous, Probability mass function, probability of function, 8oint distribution, P.D.1., conditional distribution and marginal distribution. Unit )))( +heoretical discrete and continuous distributions, "inomial, Poisson, 'ormal, "eta, E,ponential distribution, other discrete distributions .Derivations not necessary/. Unit )*( $orrelation, simple, partial and multiple correlations, regression, simple and comple, regression, lines of regression, regressive curves and coefficients, $urve fitting by the least s-uares, Possible solution to system of linear e-uations by 0agrange*s principle s-uares. Unit *( Sampling, sampling of attributes, standard errors, sampling distribution, +esting of signal uniti9ing :,+,1 and ;!statics ,analysis of variance &one %ay and t%o %ay classes ,co!variance analysis . Texts/References: 1undamentals of athematical Statistics. !S.$.Gupta,<.= =apoor and Sa,ena ,455>,S $hand ? $o. 'e% Delhi athematical statistics !=apoor and Sa,ena ,455>,S.$hand ? $o .'e% Delhi Statistical methods !S.P.Gupta Statistics !$.".Gupta ethods and Application !Sanchetti and =apoor 1undamentals of Applied Statistics !S.$.Gupta and <.=.=apoor BCS - !-. .ro$rammin$ &un'amentals an' .roblem Solvin$ (/ith &0121A3) Unit )( #ntroduction ,Program (rgani9ation: #ntroduction, Storing 'umber )eading in Data, a2ing Decision, (vervie% of computer and 0anguages. Arithmetic Statements: #ntroduction, 'umerical constants .numbers/, <ariable 'ames.'ames of Storage 0ocation/,+ype statements &#ntegers, )eal, Arithmetic (perators!#ntegers and )eal Arithmetic Assignment Statements, $omputer Arithmetic .

Unit ))( 'umerical #nput@output: #ntroduction, unformatted and formatted input output, formatted input and input field specifications, literal field, records, multiple records, slash, reception factor , simple complete program. +ransfer of control, flo%charts introduction, unconditional transfer, relation e,pression, 0ogical #1 statement, $ontrolling a loop, Arithmetic #1 statement, $omputed G(+( statement algorithms Unit )))( D( 0oops #ntroduction , $('+#'UE statement, simple uses of the D( statement, D( statement, rules on the use of the D( loops, e,it from a D( loop, transfer %ithin and to a D( loop , 'ecessity of the $('+#'UE statement, nested D( loops. Arrays and Subscripted variables. #ntroduction, one!dimensional arrays, D# E'S#(' statements, arithmetic e,pressions for subscripts, e,amples using D( loops, programming techni-ues e,ample. Unit )*( 1unctions and Subroutines: #ntroduction, 1U'$+#(' subprograms, calling 1U'$+#(' Subprograms, 1U'$+#(' Subprograms computing several values, Arrays and 1U'$+#(' Subprograms, variable dimensions, arithmetic statement function, subroutines, subroutine <s function. Programming techni-ues and numerical calculations: #ntroduction, sorting, merging, searching, update, vectors and matrices, linear e-uations. Unit *( $haracter #nformation, logical variables and operations: #ntroduction, sorting character, A!1ield, manipulating character information, 3!1ield, logical constants and logical variables, logical operators and logical e,pressions, assigning logical values, 0!1ield, hierarchy of operation, e,ecution!time format, ASS#G', $( (' and EAU#<A0A'$E statements. Texts/References: +heory and Problems of programming %ith 1()+)A'BB - Cilliam E. ayo ? artin $omputer Programming in 1()+)A' BB, Dth edition - )aEaraman, P3# $omputer Programming in 1()+)A' 5F, - )aEaraman, P3# 3o% to solve it by computer - Dromey G. Prentice 3all,4576 $omputing System 1undamentals - Danhof, Addison Cesley, 4574 $omputer Programming %ith 1()+)A' BB@5F - Grover, Allied Publishers Programming %ith 1()+)A' BB - )am =umar, + 3

Semester-II
BCS - %! . Alternative #n$lish4M)5 As prescribed in Assam University undergraduate courses in the PG Department. Texts/References: As prescribed in Assam University Undergraduate courses in the PG departments. BCS - %!%. Mathematics Unit )( Dot product and $ross product of t%o vectors, differentiation and partial differentiation of vector functions, derivative of sum, gradient, divergence of curl. Unit ))( System of circles, standard e-uations and properties of parabola, ellipse and hyperbola. General e-uations of second degree in t%o variables, tracing of conic section, sphere. Unit )))( Successive differentiation, 0eibnit9 theorem, partial differentiation, curvature, asymptotes, singular points, concativity points of inflection and tracing of $artesian curves. Unit )*( #ntegration of irrational functions, reduction formulae, rectification, -uadrature, volumes and surfaces of revolution, differential e-uation of first order. Unit *( Groups, rings, fields, vector spaces, graph theory. Texts/References: <ector Algebra - Shanti 'arain, S. $hand ? $o. Analytical Geometry and vector analysis - ". Das, (rient "oo2 $o. #ntegral $alculus - Das ? u2herEee 3igher Algebra .Abstract ? 0inear/ - S. =. apa, Asho2a Pra2ashan Differential $alculus - Das ? u2herEee #ntegral $alculus aity ? Ghosh $o!ordinate Geometry - S. 0. 0oney. Discrete athematical Structures %ith Application to $omputer Science - 8. P. +rembley ? ). anohar

BCS - %!+. Computer System Architecture Unit )( )egister transfer and micro operations, register transfer language, bus and memory transfers, arithmetic logic micro operations, shift micro operations, basic computer organi9ation and design: #nstructions and instruction cases, computer instruction. +iming and control, #nstruction cycle, memory reference instructions, input output interruptsG complete computer description. Unit ))( Programming the basic computer: machine language, assembly language, the assembler, program loops, programming arithmetic and logic, subroutines and input output programming. icro programmed control: control memory, address se-uencing, microprogram e,ample, design of control unit. Unit )))( $entral processing unit: general register organi9ation, stac2 organi9ation, instruction formats, addressing modes, data transfer and manipulation, program control, reduced instruction set computer, pipeline and vector processing, parallel processing, pipelining, arithmetic pipeline, vector processing, array processors. $omputer arithmetic: addition and subtraction, multiplication algorithms, division algorithms, floating!point arithmetic operations, decimal arithmetic unit, and decimal arithmetic operations. Unit )*( #nput (utput (rgani9ation: Peripheral devices, input output interfaces, asynchronous data transfer, modes of transfer, priority interrupt, direct memory access .D A/, input output processor .#(P/, serial communication. Unit *( ultiprocessors: $haracteristics of multiprocessors, interconnection structures inter processor arbitrationG inter processor communications and synchroni9ation, cache coherence. Texts/References: $omputer System Architecture orris ano, Prentice 3all, 4557 #ntroduction to computer architecture - Stones S. Galgotia Publication $omputer Architecture and organi9ation - 8ohn. P. 3ayes, cGra% 3ill, 4557 $omputer (rgani9ation and Architecture design for Performance, Dth edition - C. Stallings, P3# $omputer Engineering ! 3ard%are Design . orris ano, P3# $omputer Architecture and parallel processing - =ai 3%ang ? 1aye "riggs, cGra% hill, 4576

BCS - %!-. .ro$rammin$ /ith C Unit )( #ntroduction to $: +he $ character set, identifiers and 2ey%ords, data types, constants, variables and arrays, declaration, e,pressions, statements, symbolic constants. Arithmetic operator: Unary operators, library functions, data input@output, preparing and running complete $ program. $ontrol statements: preliminaries, the C3#0E, D(! C3#0E, 1(), #1!E0SE, SC#+$3, ")EA=, $('+#'UE, G(+( S+A+E E'+S, nested loops, the $( A operator. Unit ))( 1unctions: A brief overvie%, defining a function, accessing a function, passing arguments to a function, specifying arguments data types, function prototypes, recursion. Program structure, storage classes, automatic variables, e,ternal variables, static variables, multi file programs. Arrays: Defining an array, processing an array, passing arrays to functions, multi dimensional arrays, arrays and strings. Unit )))( Pointers: 1undamental, pointer declarations, passing pointers to a function, pointers and one dimensional arrays, operations on pointers, pointer and multi dimensional arrays, array of pointers, passing functions to other functions, more about pointer declaration. Unit )*( Structures and Unions: defining a structure, processing a structure, user define data types, structures and pointers, passing structure to a function, self referential structure, union. Unit *( Data files: (pening and closing a data file, creating a data file, processing a data file, programming %ith $ unformatted data files. Enumeration, command line parameters, macros, the $ preprocessor. Texts/References: Programming %ith $ - E. "alagurusamy, cGra% 3ill, 455B. Programming %ith $ - Gottfried., Schaum*s (utline Series, 4554 Programming %ith $ ! )aEaraman ).,P3# Programming %ith A'S# $ ! ".+. 3olmes, "P" +he $ Programming 0anguage ! =ernighan ? )itchie, P3#

Semester-III
BCS +! . #nvironmental Stu'ies As prescribed in Assam University undergraduate courses in PG departments. BCS +!%. Scientific Computation Unit )( 1loating Point Arithmetic: "asic concepts of floating point number systems, implications of f finite precision, illustrations of errors due to round off. Unit ))( #nterpolation: 1inite difference calculus, polynomial interpolation. Unit )))( Appro,imation: Uniform, discrete, least s-uare, polynomial, 1ourier. Unit )*( 'umerical #ntegration and Differentiation: interpolation, numerical integration, numerical differentiation. Unit *( Solution of 'on!linear e-uations: "isection, fi,ed point iteration, 'e%ton!)aphson ethods, Solution of ordinary differential e-uations, +aylor series method, )unga! =utta method, Euler method. Text /References: 'umerical Analysis !S.S. Sastry, P3# $omputer (riented 'umerical ethods !)aEaraman, P3# 'umerical $omputations ! <en2ataraman $omputer (riented 'umerical ethods !Stoer, "ullrich, Springer <erlag, 457F BCS +!+. Data an' &ile Structures Data Structures Unit )( 0inear and 0ist Structures: arrays, stac2s, -ueues and lists, se-uential and lin2ing structures, simple lists, circular lists, doubly lin2ed lists, inverted lists, threaded lists, operations on all these structures and applications. Unit ))( Arrays: ultidimensional arrays, se-uential allocation, address calculations, sparse arrays.

Unit )))( +ree Structures: +rees, binary trees, tree traversal algorithms, threaded trees, binary search trees, trees in search algorithms, "!trees, "H trees and applications. &ile Structures Unit )*( Physical storage devices and their characteristics, constituents of a file vi9. fields, records, 1i,ed and variable length records, primary and secondary 2eys, file operation, basic files system operation. Unit *( 1ile organi9ation: serial, se-uential, inde,ed se-uential, direct inverted, multi!list, hashing functions and collision handling methods. Text/References: Data structures using $ !+enenbaum, P3#, 455> 1undamentals of Data Structures !3oro%it9 and Sahani, $omputer Science Press,45B7 Data structures and Algorithms ! Alfred <. Aho, 8ohn E. 3opcroft and 8.E. Ullman. An introduction to data structures %ith applications !8ean Paul +rembley and Paul Sorenson, cGra% 3ill, #nternational Student Edition,4576 Data Structures ! )ean Gold Data Structures and Program design in $, Ind edition !). =ruse, 0eung ? +ondo, P3# publication. BCS +!-. 5aboratory Course in .a/ Scientific $omputation .b/ Data ? 1ile Structures

Semester-IV
BCS -! . Desi$ns an' Analysis of Computer Al$orithms Unit )( #ntroduction: %riting structured programs, analy9ing algorithms, stac2 and -ueues, tree, heap and heap sort, graphs and hashing. Unit ))( Divide and con-uer: the general method, binary search, finding the ma,imum and minimum merge sort, -uic2 sort, strassen*s matri, multiplication, minimum spanning tree. Unit )))( Dynamic programming : the general method, multistage graphs, all pair shortest paths, optimal binary search trees@# 2napsac2, reliability design, the traveling sales persons problem, flo% shop scheduling. Unit )*( "asic search and traversal techni-ues: the techni-ues, code generation, A'D@() graphs, game trees, biconnected components and depth search. Unit *( "ac2trac2ing: 3amilton cycles, the fast 1ourier transform, 'P!3A)D and 'P complete problems. Text/References: 1undamentals of computer algorithms !Ellis 3oro%it9 and SatraE Sahani, computer science press,457D Design and analysis of computer algorithms !+enenbaum Design and analysis of computer algorithms ! Aho A.<, 3opcroft, 8.E. Ullman, Addison!Cesley, 45BD Algorithms! the construction, proof and analysis of programs !"erlion,, P., "i9ard, P., Eohn Ciley ?sons, 457> BCS -!%. Microprocessor An' Assembly lan$ua$e Unit )( Evolution of microprocessor: overvie% of #ntel 7F76 to #ntel pro Pentium, 7FF series, po%er P$, DE$!alpha chip, )#S$ and $#S$ architecture. otorola

Unit ))( "asic microprocessor architecture and interface: internal architecture, e,ternal system bus architectureG memory and #@( interface. Unit )))( Programming model: general purpose computersG printer and inde, registersG flags, segment registersG program invisible registersG memory addressing and addressing models.

Unit )*( emory interfacing: controllers.

emory address decoding, cache memory and cache

Unit *( "asic #@( interfaces: #@( mapped #@(, memory mapped #@(, basic input@output and handsha2ing, input@output, #@( port address decoding,7I76 programming peripheral interfaceG7IB5 programmable 2eyboard and display interfaceG interrupts!interrupts vector, <ector tables, hard%are and soft%are interrupts 7I65 programmable interrupts controller, real!time cloc2G direct memory access , 7IJB@7I6B D A controllers video controller, shared bus operationsG Text/References: icroprocessors Architecture, Programming and Applications !)amesh S. Goan2ar, Ciley eastern, 455D #ntroduction to microprocessors !Aditya P athur, + 3, 4556 icroprocessor!Principles and Applications !AEit Pal, + 3, 455F BCS -!+. Database Mana$ement Systems Unit )( Data modeling for a database: records and files, abstraction and data integration, database management systemsG the three levels architecture of a D" S, components of a D" S. Unit ))( Data models and there implementation: )elational, net%or2s, hierarchical, )elational data manipulationsG relational algebra, relational calculus, SA0. Unit )))( )elational database design: functional dependencies, findings 2eys, decomposition computing closures of a 1D*s. Unit )*( Auery processing: general strategies for -uery processing -uery optimi9ation, -uery processor, concepts of security and recovery. Unit *( Database design proEect: definition and analysis of e,isting systems, preliminary and final design, testing and implementation, operation and tanning .use of relational D" S pac2age for class proEect. Text/references: Data "ase anagement System !3enry 1. =orth ? Abraham Silberschat9, cGra% hills, 4554. An introduction to data base management system vol # ?## !Date $.8., Addison Cesley, 4574, 457J Principles of data base system !Ullman 8.D., computer science ,457I.

BCS -!-. 5aboratory Course in .a/ icroprocessors and assembly language. .b/ Data base management systems.

Semester-V
BCS- 6! . System Analysis an' Desi$n Unit )( #ntroduction to system analysis and design : Effective communication in systems analysisG tools of the systems analyst, problem definition, classification, data collection and analysis. Unit ))( System planning and alternative, fle,ibility, Selection of a system plan, the system proposal, System cost determination, system cost and system benefit, comparative cost analysis processing cost, DP cost centre concept. Unit )))( A structured approach o systems design : Structured +op!Do%n design, logical design re-uirements, data administration and dictionaries, auditable systems : forms re-uirements and design, $)+ screen design, program specification, development complementation schedule, structured %al2!through. Unit )*( ProEect management and control : Development of standards, proEect control, Gantt chart PE)+ and $P@ . Unit *( System conversion and management : Planning consideration, conversion methods, systems follo%!up, -uality assurance of a ne% systems. Texts/References: System Analysis and Design, Ind edition - A%ad, E 3ome%ood, Galgotia publications, 4557 System Analysis*s +echni-ues - $ougger, 8ohn Cilley ? Sons Publication System Analysis and Design - Don Keates, aura Shields ? David 3elmy, acmillan Publication, 455> BCS- 6!%. 0b7ect 0riente' Desi$n an' .ro$rammin$ Unit )( #ntroduction to obEect oriented odeling, modeling techni-ues, (bEect oriented design, obEect Design, comparison of methodologies.SA@SD, ( +, 8SD/

Unit ))( Principles of (bEect Programming, "eginning %ith $HH, +o2ens, E,pressions and $ontrol structure. Unit )))( 1unction in $HH, $lasses and (bEects, $onstructors, Destructors. Unit )*( (perator (verloading and +ype $onversions, inheritance : E,tending $lasses. Unit *( Pointers, <irtual 1unctions and polymorphism, Cor2ing %ith 1iles. Texts/References: (bEect!(riented Programming %ith $HH - E. "alagurusamy, + 3 +ech yourself $HH - 3erbert Schildt, (sborne cGra% 3ill (bEect!(riented analysis and Design %ith applications - Grady "ooch $ ? $HH $omplete reference ! 3erbert Schildt, (sborne cGra% 3ill (bEect!(riented programming in $HH - 'abaEyoti "ar2a2ati, P3# $HH Primer Plus - Stephen Prata, Galgotia Publications, 455> $HH +he $omplete )eference - 3erbert Schildt, (sborne cGra% 3ill, 4554 BCS- 6!+. 0peratin$ System Architecture Unit )( (perating System Architecture : (perating System as an e,tended machine and resource manager, (perating System classification, (perating System modes and system calls, (perating System architecture. Processor management functions : process model, hierarchies and implementation, process states and transitions, multiprogramming, multitas2ing, multithreading, levels of schedules and scheduling algorithms, micro 2ernel architecture. Unit ))( emory management functions : memory management of a single user operating system, memory management for multiuser operating systems, partition, s%apping, paging, segmentation, virtual memory. Unit )))( Device management 1unctions : #@( Device and controllers, interrupt handlers, device independent #@( Soft%are, user user@Space #@( soft%are, Dis2 scheduling, cloc2 hard%are, soft%are, soft%are, +erminals #@( Soft%are. Unit )*( 1ile management 1unctions : 1ile naming structure, type, access mechanism, attributes and operations, 3ierarchical directory system, Directory structure and

directory operations, 1ile!space allocations, 1ile sharing, file loc2ing, symbolic lin2s, file protection and security, distributed file system. Unit *( $oncurrent programming, Se-uential and concurrent process, precedence graph, "ernstein*s conditions, time dependency, critical node selection, mutual e,clusion problem, classical coordination problem, deadloc2 handling, inter!process communication. +his course can be taught %ith U'#: operating system as a prototype. Texts/References: An introduction to operating systems - 3. . Dietel, Addition Cesley 455F odern (perating Systems - Andre% S +enenbaum. (perating System $oncepts, Ind Edition - Peterson ? Silberschat9, Addison Cesley 4576 (perating Systems adnic2 and Donovan, cGra% 3ill Principles of (perating Systems - Ullman, Galgotia Publications. BCS- 6!-. 5aboratory Course in .a/ (bEect (riented Design and Programming. .b/ (perating Systems and Architecture.

Semester-VI
BCS- 8! . Computer 3et/or9s an' Data Communication Unit )( Data $ommunication : $oncepts of data, signal, channel, band%idth, bit!rate band! rate, 1ourier analysis, a,imum data!rate of channel, Analog and digital communications, asynchronous and asynchronous transmission, Data encoding techni-ues, odulation techni-ues. Unit ))( ultiple,ing, +#@E# carrier systems, +ransmission error!detection and correction codes. edium, +ransmission errors,

Unit )))( 'et%or2 classification and data communication Services : 0ocal Area 'et%or2, Cide Area 'et%or2, inter net%or2, s%itched multimegabit data service, :.I6, frame relay, narro% band and broad band #SD', asynchronous transfer modes. Unit )*( 'et%or2 reference modes : 0ayered architecture, protocol hierarchies, interface and service, #S(@(S# reference models, +$P@#P reference models, 'ovel 'et%or2 #nternet Protocol Stac2s.

Unit *( Data lin2 0ayer 1unctions and Protocols : 1raming, error!control, flo% control, sliding %indo% protocol, 3D0$, S0#P and PPP protocol, edium Access Sub layer : $S A@$D Ethernet, to2en ring, 1DD#, #EEE standards for 0A' and A', satellite net%or2s +D A and <SA+. #ntroduction to net%or2 Programming. Texts/References: $omputer 'et%or2s - Andre% S. +enenbaum, P3#, 4556 $omputer 'et%or2s and Distributed Processing artin, 8ames, P3#, 4576 BCS- 8!%. Computer "raphics Unit )( Development of computer graphics : basic graphics systems and standards, raster scan and random scan graphics, continual refresh and storage displays, displays processor and character generator, color display techni-ue, frame buffer and bit operation, concept in raster graphics. Unit ))( Points, lines and curves, scan conversion, line dra%ing algorithm, circle and ellipse generation, polygon filling, conic section generation, antialiasing. Unit )))( +%o!dimensional vie%ing : "asic transformations, co!ordinate systems, %indo%ing and clipping, segments, interactive picture construction techni-ues, interactive input@ output devices. Unit )*( +hree dimensional concepts : J!D representation and transformation, spline curve and surfaces, fractals, -uad tree and octree data structure. Unit *( J!D vie%ing, algorithm for J!D volumes, hidden lines and surface rendering, animation. #ntroduction to graphics pac2ages and applications. Texts/References: Principles of #nteractive $omputer Graphics - 'e%man, C. Sproul, ).1., cGra% 3ill,457F 1undamentals of #nteractive $omputer Graphics - 1oley 8.D., <an Dome, Addison Cesley,457I $omputer Graphics - 3earn D., "a2er, P3#, 457> Procedural Elements for $omputer Graphics ! )ogers D. 1., cGra% 3ill, 457> (bEect!(riented programming in $HH - 'abaEyoti "ar2a2ati, P3#

BCS- 8!+. Systems .ro$rammin$ Unit )( #ntroduction and machine structure Evolution of the component of a program system. Evolution of operating system general machine structure %ith special reference to #" J>F and JBF system. achines assembly language!e,amples. Unit ))( Assemble : Assembler general design procedures!design of assembles & statements of problems formation of tables!format of variables. Unit )))( icro instructions, features of micro 1acility, #mplementation. Unit )*( Different loader schemes design of an absolute loader, design of an Direct!lin2ing loader. Unit *( $ompilers, )ecogni9ing "asic Elements, #ntermediate form, storage allocation, code generation, General model of compiler. BCS-8!-. .ro7ect +he ProEect gives an opportunity to the students to use the methodologies@techni-ues taught in several courses in the curriculum. +he topics for the proEect to be underta2en by the department, after deliberations among the faculty members, shall be notified to the students. +he proEect is a group proEect and is to be carried out under the guidance of a faculty member of the department. +he group of students should submit J copies of dissertation for evaluation at the end of the semester and present their proEect as a seminar topic. +he e,ternal e,aminer in consultation %ith the internal e,aminer shall carry out the adEudication, after giving due %eightage to the %or2 carried out in the proEect, the presentation of the proEect, and viva voice. +he guide@supervisor %ill be the internal e,aminer and e,ternal shall be appointed from a panel of e,aminers. ar2s Distribution: #nternal Assessment & I6 mar2s Dissertation & 6F mar2s Viva Voce - 25 marks

Semester-VII
CS-:! . 2heory of Computation Unit )( Deterministic and 'ondeterministic 1inite Automata .D1A and E1A/. E-uivalence of D1A and '1A. Properties of the languages Accepted by 1inite Automata Unit ))( )ecursive Definitions, )egular E,pression, +ransition Graphs, =leene*s +heorem, )egular and 'on!regular language. Unit )))( $onte,t!free Grammar, )egular 0anguage and conte,t free language, $homs2y*s 'ormal 1orm, Pushdo%n Automata, Properties of $onte,t 1ree 0anguages, Determinism and Parsing. Unit )*( +uring machines .+ /: $omputing %ith + , Post machines, E,tension of the + , $homs2y*s 3ierarchy. Unit *( Primitive and n!)ecursive 1unction, $hurch*s thesis. +he 3alting problem, Unsolvability, $omputational $omple,ity. Text/References: 4. D.#.A $ohen : #ntroduction +o $omputer +heory .8. Ciley/. I. 3. ). 0e%is ? $.3. Papadimitriou : Elements of +he +heory of $omputation .P.3.#/ J. 8. E. 3opcroft ? 8. D. Ullman : #ntroduction +o Automata +heory, 0anguage and $omputation .P.3.#/ D. 8. $arroll ? D. 0ong : +heory of 1inite Automata 6. . Davis ? Ceyu2ur : $omputability, $omple,ity and 0anguages. >. . achtey ? 1.). Koung : #ntroduction +o General +heory of Algorithms. CS-:!%. A'vance' Data Base Mana$ement System Unit )( (bEect (riented Database: Persistent Programming 0anguage, (bEect identity and its implementation, $lustering #nde,ing, $lient Server (bEect "ases $oherence. Unit ))( Parallel database: Parallel Architectures, Performance measures, shared nothing@shared dis2@shared memory based architectures, Data partitioning, #ntra! operator parallelism, Pipelining, Scheduling, 0oad balancing, -uery optimi9ation %ith <olcano as a case study. Unit )))( Distributed Database: Auery processing, semi!Eoins, -uery optimi9ation, $oncurrency $ontrol 3eterogeneity issues. ins2yLs theorem,

Unit )*( Advanced +ransaction odels : Save points, Sagas, 'ested +ransactions, ultilevel +ransactions, recursive -uery processing : +op!do%n and bottom!up evaluation, agic optimi9ation. Unit *( )ecovery: ulti!level recovery, Shared dis2 system, Distributed system IP$, JP$, replication and hot spares. )ecursive -uery processing: +op!do%n and bottom!up evaluation, agic optimi9ation. Texts/References: 4. DA+A"ASE SKS+E $('$EP+S: =()+3 A'D S#0"E)S$3+; .+A+A cGra% 3#00/ I. 1U'DA E'+A0S (1 DA+A"ASE SKS+E : ). E0 AS)# A'D S. 'A<A+3E ."E'8A #' $U #'GS/ J. DA+A"ASE +)A'SA$+#(' (DE0S 1() AD<A'$ED APP0#$A+#('S: A3 ED =. E0 AGA) #D . ()GA' =AU1 A''/ D. +)A'SA$+#(' P)($ESS#'G, $('$EP+S A'D +E$3'#AUES: 8.G)AK A'D A. )EU+E) 6. #'+)(DU$+#(' +( ("8E$+ ()#E'+ED DA+A"ASE: C(' =# . #+ P)ESS/ >. )EAD#'GS #' ("8E$+ ()#E'+ED DA+A"ASE SKS+E : S.;D('#= A'D D. A#E) . ()GA' =AU11 A'/ B. )EAD#'G #' DA+A"ASE SKS+E S: m. S+('E")A=E) 7. D#S+)#"U+ED DA+A"ASE P)#'$#P0ES A'D SKS+E : S. $E)# A'D G. PE0AGGA+# . cGra% 3#00/ CS-:!+. Artificial )ntelli$ence Unit )( Definition, Short 3istory of Artificial #ntelligence .A#/, "rief Discussion of aEor +opics .E,pert System, 'atural 0anguage Processing, Speech and Pattern )ecognition etc./ of A#. Problem Definition as a State Space Search, Production System, $ontrol Strategies, Problem $haracteristics. Unit ))( 1or%ard <ersus "ac2%ard )easoning, atching, #nde,ing, Search +echni-ues, Depth!1irst and "readth!1irst Search +echni-ue "est 1irst Search, AM, A(M algorithms Adding 3euristics, 3ill!$limbing, Search +echni-ue, Problem )eduction, $onstraint Satisfaction, Game Playing. Unit )))( =no%ledge )epresentation in predicate and Prepositional 0ogic, )esolution in Predicate ? Prepositional 0ogic, Deduction and theorem Proving, Auestion Ans%ering, Structured )epresentation of 2no%ledge declarative representation semantic net%or2s conceptual dependencies frames and scripts procedural representation.

Unit )*( (vervie% of E,pert System, Design of )ural!"ased E,pert System, Selecting a problem for e,pert system development. +he 2no%ledge Engineering Process, $onceptual models and their role in =no%ledge ac-uisition. Unit *( A# language ? their important characteristics, (vervie% of 0#SP and P)(0(G, $omputer Architectures for A# Application, 0#SP achines ? Parallel achines. 3ote #mplementation in 0#SP or P)(0(G. Text/References : 4. E. )ich : Artificial #ntelligence . cGra% 3ill Pub/ I. P.3. Cinston ? ". P. 3orn : 0isp .Addison Cesley/ J. E. $harnia2 ? D. cDermott : #ntroduction to Artificial #ntelligence .Addison Cesley/ D. P.3. Cinston : Artificial #ntelligence .Addison Cesley/ 6. S. Garavaglia : P)(0(G Programming +echni-ues and Application .3arper/ >. A. "arr ? E. A. 1eigenbaum : +he 3andboo2 of Artificial #ntelligence J <ols. .0os Altos/ CS-:!-. 5aboratory Course in .a/ Practical on Advanced D" S .b/ Practical on Artificial #ntelligence

Semester-VIII
CS-;! . Soft/are #n$ineerin$ Unit )( #mportance of soft%are, $haracteristics, $omponents, Applications of Soft%are, Soft%are yths. Definition of the $lassic 0ife $ycle, Prototyping, +he Spiral odel, 1ourth! Generation +echni-ues. Planning and anagement of soft%are ProEect : People, problem and process, measures, matrices and indicators, matrices for soft%are -uality, scooping, soft%are proEect estimation, ma2e!buy decision, soft%are ac-uisition. Unit ))( Soft%are ris2s: #dentification, ProEection assessment, monitoring, ProEect scheduling and trac2ing tas2s@%or2 brea2do%n structures, timeline chart, proEect plan, $ASE tools. )e-uirement analysis: $ommunication techni-ues. 1AS+, -uality development, analysis principles, modeling, partitioning, prototyping, specifications, S)S and S)S revie%s, analysis models : data modeling, functional modeling and information flo%, Data flo% diagrams, e,tensions to real!time systems, behavioral models, mechanics of structured analysis, E) diagrams, control modeling, data dictionary $ASE tools.

Unit )))( Design 1undamentals: Soft%are design and soft%are design process, principles and concepts, abstraction, refinement and modularity, soft%are architecture, control hierarchy, partitioning, data structure, information hiding, effective modular design, cohesion, coupling, design module, design document. Design ethod: Architectural design and design process, transform and transaction flo%, design steps, #nterface design, procedural design, graphical and tabular design notations. Unit )*( Soft%are testing and testing strategies : Soft%are testing fundamentals, test case design, %hite!bo,, blac2!bo, testing, control structure testing, strategic approach to testing, strategic issues, unit testing, integrated testing, validation testing, system testing. Unit *( Soft%are -uality concepts, Soft%are -uality assurance .SAA/ and approaches, Soft%are )eliability, SAA plan, #S( 5FFF and SE# standards for soft%are, soft%are configuration management .S$ /, base lines, scan process, version control, change control, S$ audits. Texts/References: 4. )oger Pressman : Soft%are Engineering, A Practitioner*s Approach, Dth Ed., +ata cGra% 3ill pub. I. P. S. Pressman : Soft%are engineering . cGra% 3ill/ J. Pan2aE 8alote : An #ntegrated Approach of Soft%are Engineering .Galgotia/ D. . Shooman : Soft%are engineering . cGra% 3ill/ CS-;!%. Compiler Desi$n Unit )( (vervie% of process, some compiler structures. )egular e,pression, finite automata and 0e,ical Analysis, Synta, tress, ambiguity, conte,t free grammar ? derivation of parse trees, basic!parsing techni-ues, and deduction. Unit ))( Synta, & Direction +ranslation: +op!do%n and bottom!up parsing operator precedence parsing, 0) parsers, synta, direction definition, translation schemes, 0! attributed ? S!attributed definition. Unit )))( Symbol +ables: +he contents of a symbol table, Data structures for symbol table .S+/, design of S+, S+ for bloc2 structured languages. )un!time storage administration: Storage allocation strategies, static dynamic ? heap memory allocation, memory allocation in bloc2 structured languages, memory allocation in recursion, and memory allocation in 1()+)A'. Unit )*( $ode Generation: (bEect programs, Problems in code generation, a machine model, A machine model. A simple code generator, )egister allocation and assignment, Peephole optimi9ation.

U3)2 *( $ode Generation: (bEect programs, Problems in code generation, a machine model, A machine model, A simple code generator, )egister allocation and assignment, Peephole optimi9ation. Texts/References: 4. D. . Dhamdhere : $omplier $onstruction & principles ? practice . c illan/ I. A. <. Aho, ). Sethi ? 8. D. Ullman : compiler!principles, techni-ues ? tools .Addison Cesley/ J. 8. +rembley ? P. G. Sorenson : the theory and practice of compiler %riting . cGra%/ D. C. A. "arrett et al : compiler construction theory ? practice .Galgotia/ 6. D. Gries : compiler construction for digital computer .8C/ >. A. <. Aho and 8. D. Ullman : Principles of $omputer Design, .'arosa Publishing 3ouse/ CS-;!+. Mo'elin$ an' Simulation Unit )( System models and role of simulation: "asic concept and nomenclature, +ype of system & deterministic, stochastic, continuous and discrete system, System simulation & uses of simulation and its limitations, steps in simulation studies, )andom variate generation for Uniform, E,ponential, 'ormal and Poisson distributions, Sampling and estimation, a,imum Gli2elihood estimation, $onfidence interval estimation. Unit ))( Discrete Event Simulation : )epresentation of time, Approaches to discrete event simulation, Aueuing models & single and multi!server -ueues, steady state behavior of -ueues, net%or2 of -ueues, #nventory system simulation, Programming languages for discrete event system simulation & GPSS,S# S$)#P+ .brief overvie%/. Unit )))( odeling and performance evaluation of computer system : "ehavioral, data flo% and structure modeling, overvie% of hard%are modeling and simulation using <3D0, <3D0 description for design reuse, test generation and fault simulation for behavioral model, Single server $entre models, central server models of interactive systems, use of <3D0 in front!end and bac2!end system development, Evaluation of multiprocessor systems, %or2load characteri9ation ? benchmar2s. Unit )*( $ontinuous system simulation : $ontinuous system models! open and closed loop system, odels described by differential e-uations, System dynamics, Gro%th and decay models, Systems dynamics diagram, Simulation of aircraft models, "iological and sociological system simulation, Simulation languages overvie% & $S P. Unit *( <irtual reality modeling : (vervie% of <irtual reality modeling language <) 0 I.F, creating dynamic %orlds, #ntegrating 8ava scripts %ith <) 0, <erification and validation of simulation models! Goals of model verification and validation, #nput data analysis, (utput analysis, Sensitivity analysis, 3ypothesis testing, Performance measures and their estimation.

Text/References : 4. 8. E. "an2s and 8. S. $arson ## N Discrete System Simulation N, Prentice 3all, Engle%ood $liff, '8. I. G. Gordon NSystem Simulation, Prentice 3all, #nc., Engle%ood $liffs, '8. J. D. 1errari N$omputer System Performance Evaluation, Prentice 3all, '8O. D. 8. "has2er N $omputer System Performance Evaluation, Prentice 3all, '8. 6. Glenn <anderburg et. Al. N+ric2s of the 8ava Programming Gurus, Sams. 'et Publishing, 455>. >. 'arsing Deo NSystem Simulation %ith Digital $omputerO P3# pub. CS-;!-. 5aboratory Course in .a/ Practical on $omputer Design .b/ Practical on odeling ? Simulation

Semester-IX
CS-<! . A'vance' Computer Architecture Unit )( #ntroduction to parallel processing, parallel computer Structures, pipeline and Array $omputers, ultiprocessor System, Architectural $lassification Scheme. Unit ))( Principles of pipeline and <ector!Processing, ultifunction and Array Pipelines, Design of Pipelined Processors, Data buffering and busing System, <ector Processing )e-uirements, Pipeline $omputers and <ectori9ation ethods, Architecture of +ypical <ector Processors, <ectori9ation and (ptimi9ation ethods. Unit )))( Structures and Algorithms for Array Processors, S# D Array Processors, S# D #nterconnection 'et%or2s, +ypical Parallel Processors, ultiprocessor Architecture, 0oosely and tightly coupled ultiprocessor, #nterconnection 'et%or2s. Unit )*( Parallel emory (rgani9ation, Design of $ache emory, $ache coherence in ultiprocessor System, ultiprocessor (perating Systems, ultiprocessing $ontrol, System Deadloc2s and Protection, E,amples of ultiprocessors. Unit *( Data 1lo% $omputer Architecture, Architecture $haracteristics. Text/References: 4. =. 3%ang and 1. A. "riggs : $omputer Architecture and Parallel Processing . cGra% 3ill/ I. D. P. "ertse2as and 8. '. +sitsi2lis : Parallel and Distributed $omputation .P3#/ J. . S. Stone : #ntroduction to $omputer Architecture .Galgotia/ D. ). C. 3oc2ney and $. ). 8esshope : Parallel $omputer .Adam!3ilger/ )educed #nstruction Set $omputer and

6.

=. 3%ang : Super $omputer Design and Application .$omputer Society Press/

CS-<!%. .arallel , Distribute' Computin$ Unit )( #ntroduction, ins2y*s $onEecture, Amdahl*s 0a%, Gustafson*s 0a%, +ree, Diamond 'et%or2, esh, 0inear array, )ing, Star, 3ypercube, $horal ring, $ube! connected cycles, perfect shuffle net%or2, #00#A$ #<, +orus, P I4, "utterfly, esh of tree, Pyramid, Generali9ed 3yper bus, +%isted cube, 1olded 3ypercube, #ncomplete 3ypercube, Enhanced #ncomplete 3ypercube, $ross $onnection $ube, "anyan 3ypercube. Unit ))( 'on bloc2ing 'et%or2s: $0(S, )e!arrangable "enes 'et%or2, "loc2ing 'et%or2s: "aseline, (mega, 1lip .$ube/. P)A , $)$C, $)EC, E)EC, Simulating $)$C on $)EC ? E)EC. "oolean $ircuit odel, +heorem 4M .Pipepenger and 1isher/. +heorem IMM ."orodin/. '$= Problems, P & $omplete problems, P)A algorithms: 0ist )an2ing, Parallel Prefi, on a list, 1inding )oots of trees in a 1orest, a,imum of an Array, etc.M )elating se-uential +ime %ith Parallel Space.MM )elated Se-uential Space %ith Parallel time. Addition on +ree, $ube, esh, 0inear array, PS', etc. atri, multiplication on esh, $ube, +ours etc. Unit )))( Parallel Sorting : (dd & Even transportation sort on 0inear Array, erge Splitting sorting, +heorem of (dd!Even erging, ;ero! (ne Principle, "atcher net%or2s, "itonic sorting on PS', esh, +ree, 3ypercube, +ime and comparator re-uirement for odd!even and "itonic sorting. Unit )*( 1ourier transforms on "utterfly, $ube, PS' etc. Associative processing : E,amples systems li2e S+A)A' , PEPE, Associative algorithms such as Pattern atching, 1inding ma,imum and minimum elements, 'ot smaller!then search, Summation of <ector $omponents, etc. 0A', CA', '(S, D(S, Distributed 1ile Servers, Distributed )eal +ime System, $lient Server $omputing. Unit *( Procedure calls mechanism and message passing & e,ample D(S System such as A$$E'+ (.S. and S(DS@(.S. 1ile server and e,ample systems such as :ero,, $ambridge, Electronic ail Server and e,ample system such as Grapevine. Distributed Database, $oncurrency $ontrol in Distributed Database etc. Text/References: 4. 3%ang and "riggs : $omputer Architecture and Parallel processing .P3#/. I. $richlo% : #ntroduction to Distributed and Parallel $omputing. J. . 8. Auinn : Designing of efficient algorithms for Parallel $omputers . cGra%/. D. <. )aEaraman : Elements of Parallel $omputing .P3#/. 6. 8oseph 8a: #ntroduction to Parallel Algorithms. >. S.G. A2l : +he Design and Analysis of Parallel Algorithms. Prentice 3all, '8 4575 B. S.G. A2l N Parallel Sorting Algorithms N, Academic Press 4576 7. ). 3. Perrott, NParallel ProgrammingO, Addison & Cesley 457B

5. =ai 3%ang, NAdvanced $omputer Architecture & Parallelism, Scalability, ProgrammabilityO, cGra% 3ill #nc. 455J. 4F. ichael 8. Auinn, NParallel $omputing & +heory and Practice .second edition/ cGra% 3ill 455D CS-<!+. 0perations 1esearch Unit )( #ntroduction, conve,ity and related results, linear programming problem, Solution by Graphical and Simple, method. +heory of simple, method, optimality condition, Duality, 1undamental +heorem of duality. Unit ))( Study of transportation Problem & ethod for finding initial solutions .'orth!%est corner method, 0east cost method, <ogel*s Appro,imation ethod/, odi method for optimum solution, Assignment problems! athematical formulation and solutions of assignment problems, 3ungarian method, <ariations of Assignment problems, traveling salesman problem. Unit )))( )evised Simple, method, Sensitivity Analysis, #nteger programming formulation! types of integer programming, concepts of a cutting plane, Gomory*s all integer cutting plane method, Gomory*s mi,ed integer cutting plane method, "ranch and bound techni-ue. Unit )*( #ntroduction to game theory, a,imum!minimum Principle, games %ithout saddle point, reduction to 0PP, 'et%or2s Scheduling by PE)+ and $P , $ritical path analysis. )esource Analysis in 'et%or2 Scheduling, ProEect cost, +ime cost (ptimi9ation algorithm, Probability in PE)+ Analysis. Unit *( Aueuing theory, essential features of -ueuing system, operating characteristics of -ueuing, probability distribution in -ueuing system, classification of -ueuing models etc. Se-uencing problems: introduction, processing n Eobs through t%o machines, processing n Eobs through three machines, processing n Eobs through m machines, processing t%o Eobs through m machines. Text/References: 4. 8. ehdi : Stochastic Process, Ciley Eastern. I. 3. . Cagner : Principles of (perations )esearch, P3# J. 3. A. +aha : (perations )esearch, P3#. D. S.#. Gass : 0inear programming 6. 8. =. Sharma : (peration )esearch, theory and applications, c illan. >. C 1eller : An introduction to Probability theory ? its applications, Ciley Eastern. B. .). Spiegel : Probability and statistics, Schaum series. 7. $. C. $hurchman ? E0 Arnchoff : #ntroduction to (peration )esearch, Ciley. 5. E. Gillett : #ntroduction to (perations )esearch, +ata cGra% 3ill 4F. D. Gros ? $ 3arris : 1undamentals of Aueuing theory, Ciley.

CS-<!-. 5aboratory Course in .a/ Practical on (perations )esearch .b/ Practical on Parallel ? D. $omputing

Semester-X
CS- !! . #lective ( ) Di$ital )ma$e .rocessin$

Unit )( 0evels of $omputer <ision, )ole of $omputer, )elationship %ith 3uman <ision System. #mage 1ormation : #mage $apture, #maging Geometry, #mage 1unctions, Properties! Spatial ? $olor, Perspective & ProEective +ransform, $amera $alibration, )adiometric #mage 1ormation & "i!directional )eflectance Distribution 1unction. Unit ))( Early Processing: #mage Sampling ? Digiti9ation, #mage +ransforms .1ourier, Calsh! 3adamard, Discrete $osine, =arhunen!0oeve/, #mage 1iltering .0inear and 'onlinear (perators, 0o%pass, 3ighpass, edian 1iltering/, Gray 0evel to "inary $onversion .+hresholding, 3alftoning/, 3istogram E-uali9ation, #mage $ompression. Unit )))( #mage Segmentation : Edge "ased Approaches, +e,tural Segmentation, Use of 3ough +ransform, Geometrical feature E,traction, orphological ethod . in2o%s2i*s (perators/, Pyramidal Processing. Unit )*( #mage otion: #mage Se-uence Analysis, (ptical 1lo%, Spatio!+emporal )elationship, Dynamic #mage Analysis. +hree!Dimensional <ision : Shape from shading, Shape from +e,ture, Structure from otion, "inocular stereo .Epipolor Geometry, $orresponding Problem, Surface E,traction/. Unit *( (bEect recognition : Pattern )ecognition .'earest 'eighborhood +echni-ue, "ayes +heory/, Unsupervised 0earning and $lustering, I!D (bEect )ecognition, Polyhedral Surfaces .Understanding line Dra%ing/, J!D (bEect )ecognition. Text/References: 4. ). Schal2off, NDigital #mage Processing and $omputer <isionO, Ciley. I. D. 3. "allard and $. . "ro%n, N$omputer <isionO, Prentice 3all. J. ). $. Gon9ale9 and P. Cinte,, NDigital #mage ProcessingO, Addison Cesley. D. A. =. 8ain, N1undamentals of Digital #mage ProcessingO, Prentice 3all, #ndia. 6. 8. . "rady, Ed.O$omputer <isionO, 'orth 3olland 457D >. C. =. Pratt, NDigital #mage ProcessingO, 8ohn Ciley ? Sons 45B7 B. 8. Serra, N#mage Analysis and athematical orphologyO, Academic Press 457I.

(%). 3atural 5an$ua$e .rocessin$ Unit )( #ntroduction to '0P : Some e,ample application, Achievements and brief history, (pen problems, aEor Goals. #ntroduction to 0anguage Structure and 0anguage Analy9er : #ntroduction to 0anguage Structure, (vervie% of 0anguage Analy9er )e-uirement of $omputational Grammars. Unit ))( Preprocessor : (bEectives of Processor, Analy9ing a te,t, Discourse 0anguage, Punctuation*s, Abbreviations, names, special characters, 'eed for human Preprocessor. Unit )))( Cords and their Analy9er : #ntroduction, Chy orphological Analysis, orphological Generation using paradigms, orphological Analysis using Paradigms, Speedup orphological Analysis by compilation, orphological Analy9er & Some Additional #ssues. Unit )*( )ule "ase : Sentences and their analysis, Chy )ule "ase, Application in )ule "ase, <erb Groups, 'oun Group, Strategy for Grammar Development, Semantics in stages. Unit *( achine +ranslation : #ntroduction, Problems of achine +ranslation, #s achine +ranslationP, "rief 3istory, Possible Approaches, A'G0A"3A)+# and its importance. Text/References: 4. 'atural 0anguage Processing & A2shar "harati, <ineet $haitanya, )aEeev Sangal .P3#/ I. Abhayan2ar, =.<. and <.P. 0imaye, <a2yapadiya of "hartrhari <ol.I, Sans2rit and Pra2rit Series, University of Poona, Pune. J. Sangal, )aEeev, Programming Paradigms in 0#SP, cGra% 3ill, 'e% Kor2. D. )enu 8ain, ). .=. Sinha, 'atural 0anguage Processing. 6. Sangal, )aEeev, <ineet $haitanya and 3arish =arnic2, NAn Approach to achine +ranslation in #ndian 0anguagesO, Proc. (f #ndo & US Cor2shop on System and Signal Processing, ##Sc, "angalore. (+). 3eural 3et/or9s an' Applications Unit )( #ntroduction to 'eural 'et%or2s : "iological and Artificial 'eurons, Perceptrons classification and 0inear Separability :!() problem, 3opfield 'et%or2s, (vervie% of 'eural 'et%or2s Architectures! ultilayered feed for%ard and )ecurrent 'et%or2s. 0earning!Supervised, Unsupervised and )einforcement, Generali9ed Delta )ule. Unit ))( ultilayered 'et%or2s : "ac2propagation ."P/ 'et%or2s, "P +raining Algorithm and Derivation for Adaption of %eight, variations in "ac2 propagation and Alternative cost function, )adial "asis function .)"1/ 'et%or2s, Applications of "P and )"1 'et%or2s.

Unit )))( )ecurrent 'et%or2s and Unsupervised 0earning : $ounter "ac2 propagation 'et%or2s, "olt9mann achine, Unsupervised learning methods, 3ebbian learning =ohonen*s Self (rgani9ing feature maps, Adaptive )esonance +heory. Unit )*( Associative emories : atri,, Auto, 3etero and "idirectional Associative memories, Applications of Associative emories. 'euro 1u99y System : )elevance of #ntegration bet%een 1u99y Sets and 'eural 'et%or2s!pros and cons, 1u99y 'eurons, 1u99y 'euro $ontrollers. Unit *( 'euro $omputation : Domains of Application of 'eural 'et%or2s & E,pert System ? Decision a2ing system, Pattern )ecognition, 'euro $ontrollers and 1u99y 'euro $ontrollers. Text/References: 4. ". =os2o N'eural 'et%or2s and 1u99y System : A Dynamical System Approach to achine #ntelligenceO, Prentice 3all of #ndia .P3#/, 455B I. 0imin 1u, N'eural 'et%or2s in $omputer #ntelligenceO, cGra% 3ill #nternational, 455D J. 8ohn 3ert9, Anders =rogh and )ichard G. Palmer, N#ntroduction to the +heory of 'eural $omputationsO, Addison Cesley 4554 D. Koh!3an Pao, Adaptive Pattern )ecognition and 'eural 'et%or2sO, Addison Cesley 4575. (-) )nternet 2echnolo$ies an' Applications Unit )( 'et%or2 0ayer 1unction and Protocols : S%itching, )outing and congestion control, :. I6, #nternet Protocol .#P/. Unit ))( +ransport 0ayer 1unction and Protocols : Addressing flo% control, $onnection management, multiple,ing, +ransmission $ontrol Protocol .+$P/ and User Datagram Protocol .UDP/, Soc2et and +0# interface. Unit )))( Application 0ayer Services and Protocols : Domain 'ame Services, net%or2 anagement protocol , electronic mail and file transfer protocol , Corld Cide Ceb. Unit )* ( Survey of $ontemporary #nternet +echnologies : )ole, use and implementation of $urrent tools G "asic +$P@#P, name space, correctness and protocolsG Corld Cide Ceb@3+ 0 +echni-ues for te,t, images, lin2s and formsG #nde,ing methods : gopher, CA#SG Server site programming, $G# scriptsG Security issues. Unit *( Emphasis on understanding, e,ploring and e,tending internet technologies using 8ava or Perl.

Text/References: 4. $omputer 'et%or2s & by Andre% +enenbaum, P3# , +hird edition. I. $omputer and Data $ommunication & by Cilliam Stalling, P3#, 1ifth edition. J. Programming %ith 8ava : A Primer & by E. "alagurusamy, cGra% #nternational. D. 8ava I : +he $omplete )eference & by 'aughton Patric2 ? 3erbert Schildt, cGra% 3ill #nternational. CS- !!%. &u==y Set 2heory an' Applications Unit )( #ntroduction, "asic concepts on fu99y sets, 1u99y sets versus crisp sets, Properties of alpha!cuts, )epresentation of fu99y sets, E,tension principle, 1u99y arithmetic & 1u99y numbers, Arithmetic operations on fu99y numbers. Unit ))( (peration on fu99y sets, 1u99y union, intersection and complement, combinations of operations, 1u99y relations, ProEections ? cylindric e,tensions, "inary fu99y relations, 1u99y e-uivalence and compatibility relations, 1u99y ordering relations, 1u99y morphism. Unit )))( 1u99y measures, "elief and possibility measures, Evidence theory, Possibility theory versus Probability theory, 1u99y logic, ultivalued logic, 1u99y propositions, 1u99y -ualifiers. Unit )*( Appro,imate reasoning & 1u99y e,pert system .an overvie%/, 1u99y implications, Selection of fu99y implication, ulticonditional appro,imate reasoning, 1u99y system .general discussion/, 1u99y controllers .overvie% and e,ample/. Unit *( 1u99y system ? neural net%or2, 1u99y automata, Pattern recognition .introduction/, 1u99y clustering, 1u99y pattern recognition, 1u99y image processing. Text/References: 4. 4. 1u99y set theory ? application & by G. 8. =lir and 1olger I. I. 1u99y sets and 1u99y logic theory and application & by George 8. =lir and "o Kuan, P3# publication, 455B J. J. 'eural 'et%or2s and 1u99y Systems : A Dynamic Systems Approach to achine #ntelligence & by ". =os2o, P3# publication, 455B D. D. 'eutral 'et%or2s in $omputer #ntelligence & by 0imin 1u, cGra% 3ill #nternational, 455D 6. 6. #ntroduction to the +heory of 'eural $omputations & by 8ohn 3ert9, Addison Cesley, 4554 CS- !!+. .ro7ect +he ProEect gives an opportunity to the student to use the methodologies@techni-ues taught in several courses in the curriculum. +he topics for the proEect to be underta2en by the department, after deliberations among the faculty members, shall

be notified to the students. +he proEect is to be carried out under the guidance of a faculty member of the department. A student should submit J copies of dissertation for evaluation at the end of the semester and present his proEect as a seminar topic. +he e,ternal e,aminer in consultation %ith the internal e,aminer shall carry out the adEudication, after giving due %eightage to the %or2 carried out in the proEect, the presentation of the proEect, and viva voice. +he guide@supervisor %ill be the internal e,aminer and e,ternal shall be appointed from a panel of e,aminers. ar2s Distribution: #nternal Assessment & 6F mar2s Dissertation & 4FF mar2s <iva <oce ! 6F mar2s