M. Sc. (Computer Science) Department of Computer Science Assam University, Silchar
Course Structure for M.Sc. (Computer Science)5 years integrated ISemester
101. General English 102. Digital Electronics & Fundamentals Of computers 103. Statistical Methods and Applications 104. Programming Fundamentals and Problem Solving (with FORTRAN)
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
IISemester
201. Alternative English/MIL 202. Mathematics 203. Computer System Organization & Architecture 204. Programming with C
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
IIISemester
301. Environmental Studies 702. Scientific Computation 303. Data & File Structure 304. Laboratory Course in (a) Scientific Computation (b) Data & File Structure
Total Contact Hours: 27 Hours/Week
L
4 4 4 
T
1 1 1 
P
6 6
S
25 25 25 13 12
E
75 75 75 37 38
TM
100 100 100 50 50
IVSemester
401. Design and Analysis of Computer Algorithms 402. Microprocessor and Assembly Language 403. Data Base Management Systems 404. Laboratory Course in (a) Microprocessor and Assembly Language (b) Data Base Management Systems
Total Contact Hours: 27 Hours/Week
L
4 4 4 
T
1 1 1 
P
6 6
S
25 25 25 13 12
E
75 75 75 37 38
TM
100 100 100 50 50
VSemester
501. System Analysis and Design 502. Object oriented Design and Programming 503. Operating System and Architecture 504. Laboratory Course in (a) Object oriented Design and Programming (b) Operating System and Architecture
Total Contact Hours: 27 Hours/Week
L
4 4 4 
T
1 1 1 
P
6 6
S
25 25 25 13 12
E
75 75 75 37 38
TM
100 100 100 50 50
VISemester
601. Computer Networks and data communications 602. Computer Graphics 603. System programming 604. Project
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
VIISemester
701. Theory of Computation 702. Advanced Data Base Management System 703. Artificial Intelligence 704. Laboratory – IV (a) Practical on Advanced DBMS (b) Practical on Artificial Intelligence
Total Contact Hours: 27 Hours/Week
L
4 4 4 
T
1 1 1 
P
6 6
S
25 25 25 13 12
E
75 75 75 37 38
TM
100 100 100 50 50
VIIISemester
801. Software Engineering 802. Principles of Computer Design 803. Modeling and Simulation 804. Laboratory – V (a) Practical on Computer Design (b) Practical on Modeling & Simulation
Total Contact Hours: 27 Hours/Week
4 4 4 
1 1 1 
6 6
25 25 25 13 12
75 75 75 37 38
100 100 100 50 50
4. Project Total Contact Hours: 35 Hours/Week 4 4  1 1  25 25 25 50 75 75 150 100 100 200 Electives**: 1. Advanced Computer Architecture 902. Elective** 1002. Digital Image Processing Natural Language Processing Neural Networks and Applications Internet Technologies and Applications L: Lecturer Hrs/Week T: Tutorial P: Practical Hrs/Week S: Sessional Marks E: End Semester Marks TM: Total Marks Total Marks / Semester – 400 . 2. Computing Total Contact Hours: 35 Hours/Week 4 4 4  1 1 1  6 6 25 25 25 13 12 75 75 75 37 38 100 100 100 50 50 XSemester 1001. Parallel & Distributed Computing 904. 3. Laboratory – VI (a) Practical on Operations Research (b) Practical on Parallel & D.IXSemester 901. Fuzzy set theory and applications 1003. Operating Research 903.
BCS 102. selection of prime implicants. Unit V: Registers. registers. Timing Sequences.1995 Digital Principles and applications . the map method. simplification. Analysis procedure. FlipFlopExcitation table.SemesterI BCS.P. Read Only Memory(ROM). Basics of IC technology. determination of prime implicants. SMPS. Adders. The tabulation method.G department. Binary Parallel Adder. Text/References: AS prescribed in Assam University Undergraduate courses in the P. Unit III: Combinational logic: Introduction . Counters and the Memory Unit: Introduction.Malvino and Leach. McGraw Hill. Design with state Equations.T. NAND and NOR implementation. Amplifiers. Design Of counters. State Reduction and Assignment. other two level implementation. General English AS prescribed in Assam University Undergraduate courses in the P.C bate. Subtractors. Examples of Random Access memories. multivibrators. simplifications of Boolean functions. The memory Unit. two and three variable – maps. product of sums. Analysis of Clocked Sequential circuits. Magnitude Comparator. Decoders. Design Procedure. Fundamentals of Computers and Digital Electronics: Unit I: Electronics: Diode as a rectifier. Text/References: Digital Logic and computer design .Morris mano. Design procedures . TMH. Unit IV: Sequential Logic: Introduction. Boolean algebra and logic gates.101.1998 . Synchronous Counters.TMH. Don’tcare conditions.G department. multiplexers. transistor characteristics. Ripple Counters. Unit II: Binary Systems. Shift Registers. Code conversions. FlipFlops. Multi level NAND circuit.1991 Digital Computer Electronics . Programmable Logic Array(PLA). Exclusive –OR and Equivalence functions.1991 Digital Computer Fundamentals .PHI.Malvino A.
probability of function. Theory of probability. Joint distribution. Binomial. lines of regression. Arithmetic OperatorsIntegers and Real Arithmetic Assignment Statements. Variable Names(Names of Storage Location).BCS . partial and multiple correlations.Kapoor BCS .Gupta Statistics C. simple and complex regression. Numerical constants (numbers). Possible solution to system of linear equations by Lagrange’s principle squares. Programming Fundamentals and Problem Solving (with FORTRAN) Unit I: Introduction .Gupta and V.F.covariance analysis .Chand & Co . Laws of expectations. Texts/References: Fundamentals of Mathematical Statistics. regressive curves and coefficients. concept of events. standard errors. Unit II: Random variables. sampling of attributes. Unit III: Theoretical discrete and continuous distributions. sampling distribution. Additional multiplication theorem on probability. conditional probabilities. P. Axiomatic approach to probability.S. . Exponential distribution. Curve fitting by the least squares. sets.D. Moment Generating functions and variancecovariance matrix.analysis of variance –one way and two way classes . conditional distribution and marginal distribution.Gupta.Program Organization: Introduction.104.K.B. regression. S. Normal.C.Gupta Methods and Application Sanchetti and Kapoor Fundamentals of Applied Statistics S. New Delhi Mathematical statistics Kapoor and Saxena . Poisson. measures of dispersion. independent.C. other discrete distributions (Derivations not necessary). Overview of computer and Languages. Making Decision.V. Statistical Methods & Applications Unit I: Measures of location. Probability mass function. Arithmetic Statements: Introduction.1996. Testing of signal unitizing X.P. simple.New Delhi Statistical methods S.103. pair wise independent and mutual independent events and applications.Type statements –Integers. Beta. coefficient of skewness. Bay’s theorems and applications. Discrete and continuous.K Kapoor and Saxena .F and Zstatics . Unit IV: Correlation. skewness.T.S Chand & Co. Real.. Computer Arithmetic .1996. Storing Number Reading in Data. Unit V: Sampling.
simple uses of the DO statement. unformatted and formatted input output. examples using DO loops. FUNCTION subprograms. HField.Rajaraman. Arithmetic IF statement. programming techniques example. exit from a DO loop. assigning logical values. Introduction. subroutines. Programming techniques and numerical calculations: Introduction. 4th edition . slash. Arrays and Subscripted variables. . Mayo & Martin Computer Programming in FORTRAN 77.Unit II: Numerical Input/output: Introduction. Prentice Hall. Addison Wesley. Controlling a loop. logical constants and logical variables. LField. sorting character. simple complete program.1985 Computing System Fundamentals . Unit V: Character Information. logical operators and logical expressions. manipulating character information.Grover. subroutine Vs function. nested DO loops. variable dimensions. PHI Computer Programming in FORTRAN 90. Transfer of control. arithmetic statement function. CONTINUE statement. formatted input and input field specifications. transfer within and to a DO loop .William E. COMMON and EQUIVALANCE statements. DIMENSION statements. records. rules on the use of the DO loops.Ram Kumar. onedimensional arrays. arithmetic expressions for subscripts. PHI How to solve it by computer .Dromey G.Danhof. ASSIGN. unconditional transfer. 1981 Computer Programming with FORTRAN 77/90 . DO statement. linear equations. merging. update. calling FUNCTION Subprograms. Logical IF statement. vectors and matrices. executiontime format. TMH . literal field. multiple records. reception factor . AField. Computed GOTO statement algorithms Unit III: DO Loops Introduction . FUNCTION Subprograms computing several values. Allied Publishers Programming with FORTRAN 77 . Arrays and FUNCTION Subprograms. logical variables and operations: Introduction.Rajaraman. Necessity of the CONTINUE statement. relation expression. hierarchy of operation. sorting. searching. Unit IV: Functions and Subroutines: Introduction. flowcharts introduction. Texts/References: Theory and Problems of programming with FORTRAN77 .
quadrature.SemesterII BCS . graph theory. Texts/References: Vector Algebra . BCS .B.S. fields.Shanti Narain. Leibnitz theorem.201. Integral Calculus . Alternative English/MIL As prescribed in Assam University undergraduate courses in the PG Department. sphere. differentiation and partial differentiation of vector functions.S. rings. Unit V: Groups. volumes and surfaces of revolution. concativity points of inflection and tracing of Cartesian curves.J. General equations of second degree in two variables. reduction formulae. vector spaces. K. Mapa. asymptotes. Unit IV: Integration of irrational functions. tracing of conic section. Unit II: System of circles. Analytical Geometry and vector analysis . S. differential equation of first order. Orient Book Co. curvature. Chand & Co. singular points. Ashoka Prakashan Differential Calculus . ellipse and hyperbola. standard equations and properties of parabola. Manohar . P. Trembley & R. Texts/References: As prescribed in Assam University Undergraduate courses in the PG departments.202. Unit III: Successive differentiation. gradient. Discrete Mathematical Structures with Application to Computer Science .Das & Mukherjee Higher Algebra (Abstract & Linear) . partial differentiation.Das & Mukherjee Integral Calculus . L. Das. rectification. derivative of sum. Mathematics Unit I: Dot product and Cross product of two vectors. Loney. divergence of curl.Maity & Ghosh Coordinate Geometry .
division algorithms.W. Timing and control. Computer System Architecture Unit I: Register transfer and micro operations. program loops. array processors. input output processor (IOP). input output interrupts. cache coherence. and decimal arithmetic operations. microprogram example. instruction formats.Stones S. assembly language. stack organization. pipelining.John. 1985 . computer instruction. floatingpoint arithmetic operations. Unit V: Multiprocessors: Characteristics of multiprocessors. multiplication algorithms. Stallings. PHI Computer Engineering . Instruction cycle. basic computer organization and design: Instructions and instruction cases. bus and memory transfers. design of control unit. addressing modes. pipeline and vector processing. reduced instruction set computer. serial communication.BCS . Texts/References: Computer System Architecture .M. program control. Unit IV: Input Output Organization: Peripheral devices. Unit III: Central processing unit: general register organization. decimal arithmetic unit. 1998 Computer Organization and Architecture design for Performance. McGraw hill. PHI Computer Architecture and parallel processing .Kai Hwang & Faye Briggs. programming arithmetic and logic.Morris Mano. direct memory access (DMA). Computer arithmetic: addition and subtraction. 4th edition . vector processing. arithmetic pipeline. Unit II: Programming the basic computer: machine language. address sequencing. asynchronous data transfer. Galgotia Publication Computer Architecture and organization . memory reference instructions.203. parallel processing. priority interrupt. Hayes. input output interfaces. Micro programmed control: control memory. 1998 Introduction to computer architecture . McGraw Hill. the assembler. modes of transfer.Hardware Design . Prentice Hall. register transfer language. complete computer description. inter processor communications and synchronization. arithmetic logic micro operations. data transfer and manipulation. subroutines and input output programming. shift micro operations. interconnection structures inter processor arbitration. Morris Mano. P.
pointer declarations. command line parameters.PHI Programming with ANSI C . storage classes. function prototypes. programming with C unformatted data files.. Unit II: Functions: A brief overview. 1997. Arithmetic operator: Unary operators. Unit V: Data files: Opening and closing a data file.204. DOWHILE. FOR. processing an array. array of pointers.T. GOTO STATEMENTS. symbolic constants. Unit III: Pointers: Fundamental. declaration. processing a data file. Schaum’s Outline Series. BPB The C Programming Language . recursion. constants. data types.Gottfried. Arrays: Defining an array. self referential structure. user define data types. automatic variables.BCS .E. pointers and one dimensional arrays. pointer and multi dimensional arrays. expressions. SWITCH. passing structure to a function. Program structure. IFELSE. the C preprocessor.Rajaraman R.. library functions. external variables. McGraw Hill. defining a function. passing arrays to functions. Balagurusamy. static variables. PHI . 1991 Programming with C . passing pointers to a function. Enumeration. multi dimensional arrays. statements. union. data input/output. passing functions to other functions. arrays and strings. nested loops. macros. Unit IV: Structures and Unions: defining a structure. the COMMA operator. the WHILE. multi file programs. processing a structure. Programming with C . preparing and running complete C program. specifying arguments data types. identifiers and keywords.Kernighan & Ritchie. Texts/References: Programming with C . creating a data file. Holmes.B. more about pointer declaration. operations on pointers. CONTINUE. Control statements: preliminaries. accessing a function. variables and arrays. structures and pointers. passing arguments to a function. Programming with C Unit I: Introduction to C: The C character set. BREAK.
SemesterIII BCS 301. operations on all these structures and applications. sequential and linking structures. threaded lists. discrete. RungaKutta method. NewtonRaphson Methods. PHI Computer Oriented Numerical Methods Rajaraman. Unit III: Approximation: Uniform. inverted lists. . Unit IV: Numerical Integration and Differentiation: interpolation. implications of f finite precision. Scientific Computation Unit I: Floating Point Arithmetic: Basic concepts of floating point number systems. stacks. Springer Verlag. BCS 302. Fourier. Text /References: Numerical Analysis S. Euler method. least square. sparse arrays. Bullrich. Solution of ordinary differential equations. polynomial interpolation. circular lists. numerical differentiation. Unit II: Arrays: Multidimensional arrays. illustrations of errors due to round off. Data and File Structures Data Structures Unit I: Linear and List Structures: arrays. Sastry. fixed point iteration. Taylor series method. 1980 BCS 303.Venkataraman Computer Oriented Numerical Methods Stoer.S. Unit V: Solution of Nonlinear equations: Bisection. address calculations. Environmental Studies As prescribed in Assam University undergraduate courses in PG departments. polynomial. doubly linked lists. sequential allocation. simple lists. numerical integration. Unit II: Interpolation: Finite difference calculus. queues and lists. PHI Numerical Computations .
Aho. File Structures Unit IV: Physical storage devices and their characteristics. basic files system operation. 1996 Fundamentals of Data Structures Horowitz and Sahani. records.1978 Data structures and Algorithms . sequential. PHI. McGraw Hill. direct inverted. primary and secondary keys.Alfred V. An introduction to data structures with applications Jean Paul Trembley and Paul Sorenson. Btrees. indexed sequential. PHI publication.E. binary trees. 2nd edition R. constituents of a file viz. Hopcroft and J. John E. Unit V: File organization: serial. Text/References: Data structures using C Tenenbaum. threaded trees. binary search trees.1985 Data Structures . Kruse. multilist. BCS 304. trees in search algorithms. Fixed and variable length records.Unit III: Tree Structures: Trees. fields. Leung & Tondo. tree traversal algorithms. Computer Science Press. Ullman. International Student Edition.Rean Gold Data Structures and Program design in C. Laboratory Course in (a) Scientific Computation (b) Data & File Structures . B+ trees and applications. file operation. hashing functions and collision handling methods.
computer science press. strassen’s matrix multiplication. printer and index registers. Motorola 800 series. J.. 1974 Algorithms. memory and I/O interface. Unit II: Divide and conquer: the general method. all pair shortest paths. AddisonWesley.the construction. quick sort.E. DECalpha chip. finding the maximum and minimum merge sort. reliability design. P. analyzing algorithms. segment registers. Bizard. program invisible registers.SemesterIV BCS 401. Ullman. Unit II: Basic microprocessor architecture and interface: internal architecture. AND/OR graphs. 1986 BCS 402. Text/References: Fundamentals of computer algorithms Ellis Horowitz and Satraj Sahani. Unit III: Programming model: general purpose computers. john Wiley &sons.. Microprocessor And Assembly language Unit I: Evolution of microprocessor: overview of Intel 8085 to Intel pro Pentium. P. optimal binary search trees/I knapsack. game trees. biconnected components and depth search. heap and heap sort. multistage graphs. memory addressing and addressing models.Aho A. binary search. minimum spanning tree. tree. NPHARD and NP complete problems. power PC. Hopcroft. Unit V: Backtracking: Hamilton cycles. flags. the fast Fourier transform.1984 Design and analysis of computer algorithms Tenenbaum Design and analysis of computer algorithms .V. Designs and Analysis of Computer Algorithms Unit I: Introduction: writing structured programs. graphs and hashing. flow shop scheduling. RISC and CISC architecture. Unit IV: Basic search and traversal techniques: the techniques. proof and analysis of programs Berlionx. code generation. external system bus architecture. the traveling sales persons problem. stack and queues. Unit III: Dynamic programming : the general method. .
. realtime clock. operation and tanning . . An introduction to data base management system vol I &II Date C. cache memory and cache controllers. decomposition computing closures of a FD’s. Relational data manipulations. Unit IV: Query processing: general strategies for query processing query optimization.Unit IV: Memory interfacing: Memory address decoding. 8237/8257 DMA controllers video controller. networks. computer science . query processor.8279 programmable keyboard and display interface. the three levels architecture of a DBMS. 1991. testing and implementation.8285 programming peripheral interface. 1983 Principles of data base system Ullman J. concepts of security and recovery. Unit III: Relational database design: functional dependencies. TMH. Unit II: Data models and there implementation: Relational. 1995 MicroprocessorPrinciples and Applications Ajit Pal.1982. Addison Wesley. shared bus operations. 1994 Introduction to microprocessors Aditya P Mathur. relational calculus. basic input/output and handshaking. 1990 BCS 403. Goankar. Unit V: Basic I/O interfaces: I/O mapped I/O. Text/references: Data Base Management System Henry F. I/O port address decoding. Korth & Abraham Silberschatz. components of a DBMS. input/output. 1981.use of relational DBMS package for class project. abstraction and data integration. Unit V: Database design project: definition and analysis of existing systems.. SQL. relational algebra. hardware and software interrupts 8259 programmable interrupts controller.D. hierarchical. interruptsinterrupts vector. direct memory access . memory mapped I/O. Wiley eastern. Programming and Applications Ramesh S. McGraw hills. Text/References: Microprocessors Architecture. findings keys.J. Database Management Systems Unit I: Data modeling for a database: records and files. preliminary and final design. Vector tables. database management systems. TMH.
Unit V: System conversion and management : Planning consideration. modeling techniques. program specification. conversion methods. E Homewood. systems followup. tools of the systems analyst. comparative cost analysis processing cost.Cougger. project control. SemesterV BCS. Texts/References: System Analysis and Design. (b) Data base management systems. CRT screen design. Laboratory Course in (a) Microprocessors and assembly language. object Design.501. the system proposal. John Willey & Sons Publication System Analysis and Design . Unit III: A structured approach o systems design : Structured TopDown design. auditable systems : forms requirements and design.502. 2nd edition . Object oriented design. Macmillan Publication. Maura Shields & David Helmy. data administration and dictionaries. 1996 BCS. development complementation schedule. JSD) . logical design requirements. data collection and analysis. DP cost centre concept. System Analysis and Design Unit I: Introduction to system analysis and design : Effective communication in systems analysis. structured walkthrough.BCS 404. Selection of a system plan. system cost and system benefit. classification. Unit IV: Project management and control : Development of standards. OMT. problem definition. flexibility.Awad. System cost determination. Gantt chart PERT and CP/M. Unit II: System planning and alternative. Galgotia publications. quality assurance of a new systems. comparison of methodologies(SA/SD.Don Yeates. Object Oriented Design and Programming Unit I: Introduction to object oriented Modeling. 1998 System Analysis’s Techniques .
levels of schedules and scheduling algorithms. Osborne McGraw Hill ObjectOriented programming in C++ . memory management for multiuser operating systems. Operating System classification. attributes and operations. clock hardware. Osborne McGraw Hill ObjectOriented analysis and Design with applications . 1991 BCS. inheritance : Extending Classes. Tokens. Unit IV: Operator Overloading and Type Conversions. segmentation. Hierarchical directory system. micro kernel architecture. Balagurusamy. Texts/References: ObjectOriented Programming with C++ .503. Unit III: Function in C++. interrupt handlers. Beginning with C++. user user/Space I/O software. Constructors. multitasking.Stephen Prata. process states and transitions. Processor management functions : process model. software. device independent I/O Software. Destructors. Working with Files. Operating System architecture. Unit III: Device management Functions : I/O Device and controllers. virtual memory. multiprogramming. Unit IV: File management Functions : File naming structure. PHI C++ Primer Plus . access mechanism. partition. paging. Virtual Functions and polymorphism.E. Osborne McGraw Hill.Herbert Schildt. Unit V: Pointers. type. Directory structure and . Terminals I/O Software. Galgotia Publications. Expressions and Control structure. Disk scheduling. Operating System modes and system calls.Grady Booch C & C++ Complete reference Herbert Schildt.Unit II: Principles of Object Programming. multithreading. Classes and Objects. TMH Tech yourself C++ . software. Operating System Architecture Unit I: Operating System Architecture : Operating System as an extended machine and resource manager.Nabajyoti Barkakati.Herbert Schildt. swapping. 1996 C++ The Complete Reference . Unit II: Memory management functions : memory management of a single user operating system. hierarchies and implementation.
Fourier analysis. Unit III: Network classification and data communication Services : Local Area Network. Addition Wesley 1990 Modern Operating Systems . M. ISO/OSI reference models. file locking. symbolic links. bitrate bandrate. Maximum datarate of channel. McGraw Hill Principles of Operating Systems .directory operations. BCS. TI/EI carrier systems. classical coordination problem. protocol hierarchies. Unit IV: Network reference modes : Layered architecture. deadlock handling. Operating System Concepts. Novel Network Internet Protocol Stacks. Computer Networks and Data Communication Unit I: Data Communication : Concepts of data. Texts/References: An introduction to operating systems . Unit V: Concurrent programming. Transmission errors. frame relay.25. Bernstein’s conditions. asynchronous transfer modes. interface and service.Peterson & Silberschatz. Unit II: Multiplexing. File sharing.504. Transmission Medium. Laboratory Course in (a) Object Oriented Design and Programming.Madnick and Donovan. file protection and security. 2nd Edition . . channel. asynchronous and asynchronous transmission. Data encoding techniques. Wide Area Network.Andrew S Tenenbaum. inter network. narrow band and broad band ISDN. critical node selection. This course can be taught with UNIX operating system as a prototype. time dependency. (b) Operating Systems and Architecture. switched multimegabit data service. Dietel. Addison Wesley 1985 Operating Systems . Analog and digital communications. mutual exclusion problem. Modulation techniques. Sequential and concurrent process. distributed file system. interprocess communication. errordetection and correction codes. Galgotia Publications.H. Filespace allocations.601. SemesterVI BCS. TCP/IP reference models. precedence graph. signal. X.Ullman. bandwidth.
FDDI. McGraw Hill. raster scan and random scan graphics. antialiasing.F.Hearn D.1980 Fundamentals of Interactive Computer Graphics .Unit V: Data link Layer Functions and Protocols : Framing. IEEE standards for LAN and MAN. interactive picture construction techniques. Texts/References: Computer Networks . Introduction to network Programming. interactive input/ output devices. windowing and clipping. James. W. Computer Graphics Unit I: Development of computer graphics : basic graphics systems and standards. frame buffer and bit operation. 1986 Procedural Elements for Computer Graphics Rogers D. quad tree and octree data structure. polygon filling. line drawing algorithm. lines and curves. 1986 ObjectOriented programming in C++ .Newman. circle and ellipse generation. spline curve and surfaces. Van Dome. conic section generation. displays processor and character generator. satellite networks TDMA and VSAT. token ring. Tenenbaum.Foley J.Martin. 1985 BCS. flow control. fractals. PHI . scan conversion. Unit III: Twodimensional viewing : Basic transformations. 1995 Computer Networks and Distributed Processing . Sproul.. Baker. Addison Wesley. Medium Access Sub layer : CSMA/CD Ethernet. R. color display technique. sliding window protocol. hidden lines and surface rendering. algorithm for 3D volumes. Unit IV: Three dimensional concepts : 3D representation and transformation. F. continual refresh and storage displays. HDLC.602.. SLIP and PPP protocol. PHI. animation. PHI..Andrew S. errorcontrol. segments. coordinate systems. Unit V: 3D viewing.Nabajyoti Barkakati..D. Unit II: Points. PHI. Texts/References: Principles of Interactive Computer Graphics .1982 Computer Graphics . McGraw Hill. Introduction to graphics packages and applications. concept in raster graphics.
and viva voice. The group of students should submit 3 copies of dissertation for evaluation at the end of the semester and present their project as a seminar topic. the presentation of the project. Recognizing Basic Elements. Unit V: Compilers. BCS604.25 marks . Systems Programming Unit I: Introduction and machine structure Evolution of the component of a program system. features of micro Facility. The external examiner in consultation with the internal examiner shall carry out the adjudication.BCS. General model of compiler. The project is a group project and is to be carried out under the guidance of a faculty member of the department. Unit III: Micro instructions. code generation. The guide/supervisor will be the internal examiner and external shall be appointed from a panel of examiners. storage allocation. Evolution of operating system general machine structure with special reference to IBM 360 and 370 system. Marks Distribution: Internal Assessment – 25 marks Dissertation – 50 marks Viva Voce . shall be notified to the students. Project The Project gives an opportunity to the students to use the methodologies/techniques taught in several courses in the curriculum.603. after giving due weightage to the work carried out in the project. after deliberations among the faculty members. Unit IV: Different loader schemes design of an absolute loader. Unit II: Assemble : Assembler general design proceduresdesign of assembles – statements of problems formation of tablesformat of variables. Intermediate form. design of an Directlinking loader. Machines assembly languageexamples. Implementation. The topics for the project to be undertaken by the department.
I. query optimization with Volcano as a case study. Transition Graphs. Properties of Context Free Languages. Regular Expression. Regular Language and context free language. Clustering Indexing. Papadimitriou : Elements of The Theory of Computation (P. Minsky's theorem. Davis & Weyukur : Computability.A Cohen : Introduction To Computer Theory (J. Advanced Data Base Management System Unit I: Object Oriented Database: Persistent Programming Language. Object identity and its implementation.R. semijoins. Determinism and Parsing.H. Ullman : Introduction To Automata Theory. Long : Theory of Finite Automata 5. Data partitioning. H. Equivalence of DFA and NFA. Concurrency Control Heterogeneity issues. Language and Computation (P. Text/References: 1. Chomsky’s Normal Form. Hopcroft & J. Church’s thesis. Scheduling. Carroll & D. The Halting problem. CS702. Pipelining. Client Server Object Bases Coherence. R. D. Unit IV: Turing machines (TM): Computing with TM. . 6. Unit III: Distributed Database: Query processing. Unsolvability. Load balancing. Unit II: Parallel database: Parallel Architectures. Machtey & F. Unit III: Contextfree Grammar. Post machines. D. J. Pushdown Automata. M. Lewis & C. Wiley). Performance measures. Complexity and Languages.H. Intraoperator parallelism. Unit V: Primitive and nRecursive Function. Kleene’s Theorem. Regular and Nonregular language.H. query optimization. J. shared nothing/shared disk/shared memory based architectures. Computational Complexity. Extension of the TM. Young : Introduction To General Theory of Algorithms. E. Chomsky’s Hierarchy. Theory of Computation Unit I: Deterministic and Nondeterministic Finite Automata (DFA and EFA).SemesterVII CS701.I) 3.I) 4. Properties of the languages Accepted by Finite Automata Unit II: Recursive Definitions. M. 2.
FUNDAMENTALS OF DATABASE SYSTEM: R. Magic optimization. Indexing. Artificial Intelligence Unit I: Definition. Speech and Pattern Recognition etc. Nested Transactions. Problem Definition as a State Space Search. Brief Discussion of Major Topics (Expert System. CERI AND G. DepthFirst and BreadthFirst Search Technique Best First Search. REUTER 5. Texts/References: 1. recursive query processing : Topdown and bottomup evaluation. Question Answering. Multilevel Transactions. DATABASE SYSTEM CONCEPTS: KORTH AND SILBERSCHTZ (TATA McGraw HILL) 2.Unit IV: Advanced Transaction Models : Save points. HillClimbing. READINGS IN OBJECT ORIENTED DATABASE SYSTEM: S. Distributed system 2PC. Problem Characteristics. ELMAGARMID (MORGAN KAUFMANN) 4. Sagas.ZDONIK AND D. Search Technique. 3PC. Control Strategies. STONEBRAKER 8. INTRODUCTION TO OBJECT ORIENTED DATABASE: WON KIM (MIT PRESS) 6. Structured Representation of knowledge declarative representation semantic networks conceptual dependencies frames and scripts procedural representation. Natural Language Processing. PELAGGATI (McGraw HILL) CS703. Unit II: Forward Versus Backward Reasoning. CONCEPTS AND TECHNIQUES: J. Problem Reduction. Short History of Artificial Intelligence (AI). Deduction and theorem Proving. DISTRIBUTED DATABASE PRINCIPLES AND SYSTEM: S. Shared disk system. NAVATHE (BENJAMIN CUMMINGS) 3. . READING IN DATABASE SYSTEMS: m. Constraint Satisfaction. Recursive query processing: Topdown and bottomup evaluation. Unit III: Knowledge Representation in predicate and Prepositional Logic. Magic optimization. Production System. Resolution in Predicate & Prepositional Logic. Matching. MAIER (MORGAN KAUFFMAN) 7. Game Playing. Unit V: Recovery: Multilevel recovery. DATABASE TRANSACTION MODELS FOR ADVANCED APPLICATIONS: AHMED K.GRAY AND A. ELMASRI AND S. replication and hot spares. AO* algorithms Adding Heuristics. TRANSACTION PROCESSING.) of AI. Search Techniques. A*.
control modeling. Requirement analysis: Communication techniques. . Barr & E. scooping. Projection assessment. Note Implementation in LISP or PROLOG. functional modeling and information flow. SRS and SRS reviews. Data flow diagrams. Prototyping. A. analysis models : data modeling. Definition of the Classic Life Cycle. extensions to realtime systems. E. Feigenbaum : The Handbook of Artificial Intelligence 3 Vols. ER diagrams. Charniak & D. The Spiral Model. monitoring. Winston & B. modeling. Planning and Management of software Project : People. prototyping. FAST. P. software acquisition. Design of RuralBased Expert System. Laboratory Course in (a) Practical on Advanced DBMS (b) Practical on Artificial Intelligence SemesterVIII CS801. LISP Machines & Parallel Machines. timeline chart. mechanics of structured analysis. CASE tools. measures. Unit II: Software risks: Identification. behavioral models. Horn : Lisp (Addison Wesley) 3. makebuy decision. Computer Architectures for AI Application. Rich : Artificial Intelligence (McGraw Hill Pub) 2. partitioning. Garavaglia : PROLOG Programming Techniques and Application (Harper) 6. Software Myths. (Los Altos) CS704. Overview of LISP and PROLOG. Text/References : 1. analysis principles. Winston : Artificial Intelligence (Addison Wesley) 5.H. S. Characteristics. problem and process. P. The knowledge Engineering Process. data dictionary CASE tools.Unit IV: Overview of Expert System. P. matrices and indicators. Components. McDermott : Introduction to Artificial Intelligence (Addison Wesley) 4. Project scheduling and tracking tasks/work breakdown structures. quality development. A.Generation Techniques. Unit V: AI language & their important characteristics. Fourth.H. E. Software Engineering Unit I: Importance of software. project plan. Selecting a problem for expert system development. software project estimation. specifications. Conceptual models and their role in Knowledge acquisition. matrices for software quality. Applications of Software.
memory allocation in block structured languages. P. A Practitioner’s Approach. strategic approach to testing. abstraction. Tata 2. a machine model. Unit III: Symbol Tables: The contents of a symbol table. information hiding. Runtime storage administration: Storage allocation strategies. S. design steps. Syntax tress. principles and concepts. Unit II: Syntax – Direction Translation: Topdown and bottomup parsing operator precedence parsing. 4. Register allocation and assignment. Unit IV: Code Generation: Object programs. whitebox. ambiguity. some compiler structures. Pressman : Software engineering (McGraw Hill) Pankaj Jalote : An Integrated Approach of Software Engineering (Galgotia) M. partitioning. strategic issues. . design of ST. McGraw Hill pub. Design Method: Architectural design and design process. SQA plan. Software quality assurance (SQA) and approaches. Regular expression. 3. system testing. basicparsing techniques. context free grammar & derivation of parse trees. Peephole optimization. and deduction. Software Reliability. A machine model. design document. ISO 9000 and SEI standards for software. and memory allocation in FORTRAN. cohesion. design module. version control. Compiler Design Unit I: Overview of process. effective modular design. A simple code generator. software architecture. transform and transaction flow. Unit IV: Software testing and testing strategies : Software testing fundamentals. LR parsers. memory allocation in recursion. test case design.Unit III: Design Fundamentals: Software design and software design process. software configuration management (SCM). coupling. 4th Ed. scan process. Lattributed & Sattributed definition. ST for block structured languages. base lines. Roger Pressman : Software Engineering.. integrated testing. change control. control structure testing. procedural design. control hierarchy. validation testing. data structure. Interface design. unit testing. static dynamic & heap memory allocation. finite automata and Lexical Analysis. Texts/References: 1. Problems in code generation. Unit V: Software quality concepts. blackbox testing. graphical and tabular design notations. Shooman : Software engineering (McGraw Hill) CS802. translation schemes. syntax direction definition. refinement and modularity. SCM audits. Data structures for symbol table (ST).
Sorenson : the theory and practice of compiler writing (McGraw) 4. use of VHDL in frontend and backend system development. central server models of interactive systems.0. a machine model. Input data analysis. Performance measures and their estimation. A simple code generator.likelihood estimation. V. Confidence interval estimation. Normal and Poisson distributions. data flow and structure modeling. Ullman : compilerprinciples. V. Maximum . Output analysis. A. network of queues. Type of system – deterministic. Unit III: Modeling and performance evaluation of computer system : Behavioral. Dhamdhere : Complier Construction – principles & practice (McMillan) 2. Peephole optimization. Ullman : Principles of Computer Design. System dynamics. W.UNIT V: Code Generation: Object programs. Aho and J. Single server Centre models. continuous and discrete system. Random variate generation for Uniform. J. Queuing models – single and multiserver queues. Aho. Register allocation and assignment. Growth and decay models. Sensitivity analysis. Sampling and estimation. . Barrett et al : compiler construction theory & practice (Galgotia) 5. Simulation of aircraft models. Trembley & P. overview of hardware modeling and simulation using VHDL. Inventory system simulation. Problems in code generation. D. Exponential. Approaches to discrete event simulation.SIMSCRIPT (brief overview). workload characterization & benchmarks. techniques & tools (Addison Wesley) 3. stochastic. System simulation – uses of simulation and its limitations. Programming languages for discrete event system simulation – GPSS. creating dynamic worlds. Modeling and Simulation Unit I: System models and role of simulation: Basic concept and nomenclature. (Narosa Publishing House) CS803. Biological and sociological system simulation. Unit V: Virtual reality modeling : Overview of Virtual reality modeling language VRML 2. Evaluation of multiprocessor systems. Systems dynamics diagram.Goals of model verification and validation. Sethi & J. Gries : compiler construction for digital computer (JW) 6. M. Models described by differential equations. A machine model. test generation and fault simulation for behavioral model. Verification and validation of simulation models. Integrating Java scripts with VRML. steps in simulation studies. A. D. Unit II: Discrete Event Simulation : Representation of time. R. G. A. Simulation languages overview – CSMP.open and closed loop system. D. D. steady state behavior of queues. Texts/References: 1. Hypothesis testing. VHDL description for design reuse. Unit IV: Continuous system simulation : Continuous system models.
Architecture of Typical Vector Processors. Architecture Characteristics. 3. Banks and J. J. W. pipeline and Array Computers. Prentice Hall. D. Advanced Computer Architecture Unit I: Introduction to parallel processing. Loosely and tightly coupled Multiprocessor. Englewood Cliff. E. SIMD Array Processors. Englewood Cliffs. Unit V: Data Flow Computer Architecture. Unit IV: Parallel Memory Organization. parallel computer Structures. Stone : Introduction to Computer Architecture (Galgotia) 4. S. Multiprocessor Operating Systems. Bhasker “ Computer System Performance Evaluation. Prentice Hall. Prentice Hall. NJ”. Tsitsiklis : Parallel and Distributed Computation (PHI) 3. Sams. Typical Parallel Processors. 5. N. Architectural Classification Scheme. Briggs : Computer Architecture and Parallel Processing (McGraw Hill) 2. R. Glenn Vanderburg et. Pipeline Computers and Vectorization Methods. NJ. D. SIMD Interconnection Networks. K. Vector Processing Requirements. Interconnection Networks. Unit II: Principles of pipeline and VectorProcessing. System Deadlocks and Protection. Examples of Multiprocessors. A. Jesshope : Parallel Computer (AdamHilger) Reduced Instruction Set Computer and . Multiprocessor Architecture. Hockney and C.Text/References : 1. Narsing Deo “System Simulation with Digital Computer” PHI pub. 2. Hwang and F. Prentice Hall. Multifunction and Array Pipelines. Unit III: Structures and Algorithms for Array Processors. 6. M. P. Design of Cache Memory. Ferrari “Computer System Performance Evaluation. Gordon “System Simulation. Vectorization and Optimization Methods. Text/References: 1. Net Publishing. Data buffering and busing System. S. Multiprocessing Control. 1996. Inc. J. “Tricks of the Java Programming Gurus. Bertsekas and J.. Al. Multiprocessor System. G. NJ. CS804. Cache coherence in Multiprocessor System. Design of Pipelined Processors. Laboratory Course in (a) Practical on Computer Design (b) Practical on Modeling & Simulation SemesterIX CS901. Carson II “ Discrete System Simulation “. NJ. 4. R.
Torus. DOS. 2. Distributed File Servers. Theorem 2** (Borodin). Zero. Rearrangable Benes Network. Mesh. Cambridge. Diamond Network. J. Addition on Tree. Matrix multiplication on Mesh. Cross Connection Cube. Tours etc. Unit V: Procedure calls mechanism and message passing – example DOS System such as ACCENT O.* Relating sequential Time with Parallel Space. Theorem of OddEven Merging. Summation of Vector Components. Hwang and Briggs : Computer Architecture and Parallel processing (PHI). Addison – Wesley 1987 . S. Electronic Mail Server and example system such as Grapevine. 5. Choral ring. Parallel & Distributed Computing Unit I: Introduction. Hypercube. EREW. Bitonic sorting on PSN. Mesh. P – Complete problems. perfect shuffle network. Prentice Hall. Academic Press 1985 8.S. Simulating CRCW on CREW & EREW. Quinn : Designing of efficient algorithms for Parallel Computers (McGraw).G. Blocking Networks: Baseline. PRAM algorithms: List Ranking. PSN. PSN etc. Theorem 1* (Pipepenger and Fisher). Joseph Ja: Introduction to Parallel Algorithms. WAN. 4. Unit IV: Fourier transforms on Butterfly. Omega. R. Tree. PM 21. Cube. Flip (Cube). Linear array. CRCW. Finding maximum and minimum elements. “Parallel Programming”.G. Cube. LAN. K.5. Boolean Circuit Model. Amdahl’s Law. PRAM. Hwang : Super Computer Design and Application (Computer Society Press) CS902. Akl “ Parallel Sorting Algorithms “. Mesh of tree. Cube. 3. etc. Pyramid. Text/References: 1.One Principle. Banyan Hypercube. Generalized Hyper bus.connected cycles. Folded Hypercube. Incomplete Hypercube. Time and comparator requirement for oddeven and Bitonic sorting. Perrott. PEPE. Enhanced Incomplete Hypercube. Unit III: Parallel Sorting : Odd – Even transportation sort on Linear Array. Rajaraman : Elements of Parallel Computing (PHI). Batcher networks.** Related Sequential Space with Parallel time. Akl : The Design and Analysis of Parallel Algorithms. V. Twisted cube. H. Butterfly. Minsky’s Conjecture. Gustafson’s Law. NOS. Client Server Computing. Parallel Prefix on a list. ILLIAC IV. Concurrency Control in Distributed Database etc. M. and SODS/O. Associative processing : Examples systems like STARAN . Merge Splitting sorting. Not smallerthen search. Cube. Linear array. NJ 1989 7. Mesh. Tree. Ring. NCK Problems. CREW. Finding Roots of trees in a Forest. File server and example systems such as Xerox. Associative algorithms such as Pattern Matching. 6. Distributed Database. Unit II: Non blocking Networks: CLOS. etc. S.S. Crichlow : Introduction to Distributed and Parallel Computing. Hypercube. etc. Star. Distributed Real Time System. Maximum of an Array.
reduction to LPP. McGraw Hill Inc. Variations of Assignment problems. Duality. Hungarian method. probability distribution in queuing system. “Parallel Computing – Theory and Practice (second edition) McGraw Hill 1994 CS903. convexity and related results. J. Tata McGraw Hill 10. 8. Scalability. 4. C.R. theory and applications. D. traveling salesman problem. 1993. H.Mathematical formulation and solutions of assignment problems. Time cost Optimization algorithm. Resource Analysis in Network Scheduling. W. McMillan. PHI 3. Fundamental Theorem of duality. Sequencing problems: introduction. Sharma : Operation Research. processing n jobs through three machines. A. Taha : Operations Research. 7. Integer programming formulationtypes of integer programming. K. Spiegel : Probability and statistics. 6. Networks Scheduling by PERT and CPM. concepts of a cutting plane. optimality condition. Critical path analysis. W Feller : An introduction to Probability theory & its applications. Branch and bound technique. classification of queuing models etc. Unit IV: Introduction to game theory. Quinn. M. processing two jobs through m machines. Kai Hwang. Gillett : Introduction to Operations Research. Churchman & EL Arnchoff : Introduction to Operation Research. operating characteristics of queuing. Project cost. S. Gros & C M Harris : Fundamentals of Queuing theory. Unit V: Queuing theory. Mehdi : Stochastic Process. Sensitivity Analysis. games without saddle point. Wiley Eastern. processing n jobs through two machines. Gomory’s all integer cutting plane method. Vogel’s Approximation Method). Modi method for optimum solution. Schaum series. Gass : Linear programming 5. M. Assignment problems. Michael J. Wiley. Unit III: Revised Simplex method. Unit II: Study of transportation Problem – Method for finding initial solutions (Northwest corner method. Text/References: 1. Gomory’s mixed integer cutting plane method.I. E. Least cost method. Programmability”. Wagner : Principles of Operations Research. 9. J. Wiley. Probability in PERT Analysis. Theory of simplex method. H. . processing n jobs through m machines. Operations Research Unit I: Introduction. 10. “Advanced Computer Architecture – Parallelism. linear programming problem. 2. Wiley Eastern. PHI.9. Solution by Graphical and Simplex method. essential features of queuing system. Maximumminimum Principle.
Bayes Theory). K. 3. J. John Wiley & Sons 1978 7. Schalkoff. Structure from Motion. A. Shape from Texture. H. Wintex.Spatial & Color. Use of Hough Transform. M. Polyhedral Surfaces (Understanding line Drawing). Unit III: Image Segmentation : Edge Based Approaches. Unit II: Early Processing: Image Sampling & Digitization. Image Transforms (Fourier. Histogram Equalization. 4. Lowpass. Camera Calibration. Prentice Hall. Gonzalez and P. 2D Object Recognition. 2. Pratt. R. Discrete Cosine. “Image Analysis and Mathematical Morphology”. . J. Surface Extraction). Radiometric Image Formation – Bidirectional Reflectance Distribution Function. Text/References: 1. “Fundamentals of Digital Image Processing”. Properties.CS904. Laboratory Course in (a) Practical on Operations Research (b) Practical on Parallel & D. Image Formation : Image Capture. Serra. Optical Flow. Highpass. Geometrical feature Extraction. Binocular stereo (Epipolor Geometry. Addison Wesley. Gray Level to Binary Conversion (Thresholding. SpatioTemporal Relationship. Unit V: Object recognition : Pattern Recognition (Nearest Neighborhood Technique. Prentice Hall. Image Filtering (Linear and Nonlinear Operators. Role of Computer. India. North Holland 1984 6. 5. ThreeDimensional Vision : Shape from shading. Morphological Method (Minkowski’s Operators). Unsupervised Learning and Clustering. Wiley. Unit IV: Image Motion: Image Sequence Analysis. Brown. Dynamic Image Analysis. Image Functions. Perspective – Projective Transform. Image Compression. Elective (1) Digital Image Processing Unit I: Levels of Computer Vision. “Computer Vision”. Corresponding Problem. K. Ballard and C. Textural Segmentation. D. Ed. “Digital Image Processing”. Computing SemesterX CS1001. M. R. C. KarhunenLoeve). W. Jain. Relationship with Human Vision System.”Computer Vision”. Halftoning). Brady. WalshHadamard. “Digital Image Processing and Computer Vision”. Pyramidal Processing. Academic Press 1982. Median Filtering). “Digital Image Processing”. 3D Object Recognition. Imaging Geometry.
2. Unit II: Preprocessor : Objectives of Processor. . Open problems. Of Indo – US Workshop on System and Signal Processing. Semantics in stages. Noun Group. 5. and V. Rajeev. Speedup Morphological Analysis by compilation. Vakyapadiya of Bhartrhari Vol. Why Morphological Analysis. special characters. Sangal. Overview of Neural Networks ArchitecturesMultilayered feed forward and Recurrent Networks. Proc. Natural Language Processing Unit I: Introduction to NLP : Some example application. Introduction to Language Structure and Language Analyzer : Introduction to Language Structure. Punctuation’s. Generalized Delta Rule. Is Machine Translation?. 4.V. BP Training Algorithm and Derivation for Adaption of weight. Abhayankar. Why Rule Base. Application in Rule Base. Rajeev. Sinha. 3. Unit IV: Rule Base : Sentences and their analysis. Abbreviations. R. Unit III: Words and their Analyzer : Introduction. Need for human Preprocessor. IISc. variations in Back propagation and Alternative cost function. Morphological Generation using paradigms. K. ANGLABHARTI and its importance. Sangal. Unsupervised and Reinforcement.P. Rajeev Sangal (PHI) 2. Radial Basis function (RBF) Networks. Unit V: Machine Translation : Introduction. Perceptrons classification and Linear Separability XOR problem. McGraw Hill. Natural Language Processing – Akshar Bharati. Strategy for Grammar Development. Possible Approaches. names. Natural Language Processing. Vineet Chaitanya and Harish Karnick. Pune. Limaye. Analyzing a text. “An Approach to Machine Translation in Indian Languages”. Vineet Chaitanya. New York.(2). Discourse Language. Bangalore. Programming Paradigms in LISP. Neural Networks and Applications Unit I: Introduction to Neural Networks : Biological and Artificial Neurons.K. University of Poona.M. (3). LearningSupervised. Verb Groups. Overview of Language Analyzer Requirement of Computational Grammars. Applications of BP and RBF Networks. Morphological Analyzer – Some Additional Issues. Problems of Machine Translation. Major Goals. Unit II: Multilayered Networks : Backpropagation (BP) Networks. Text/References: 1. Sanskrit and Prakrit Series. Brief History. Achievements and brief history. Renu Jain. Hopfield Networks. Morphological Analysis using Paradigms.
“Neural Networks in Computer Intelligence”. multiplexing. exploring and extending internet technologies using Java or Perl. images. Auto. network Management protocol . Neuro Fuzzy System : Relevance of Integration between Fuzzy Sets and Neural Networkspros and cons. use and implementation of Current tools . Text/References: 1. Connection management. Kosko “Neural Networks and Fuzzy System : A Dynamical System Approach to Machine Intelligence”. Addison Wesley 1991 4. Hetero and Bidirectional Associative memories. Unit V: Neuro Computation : Domains of Application of Neural Networks – Expert System & Decision Making system. correctness and protocols. YohHan Pao. B. Anders Krogh and Richard G. Adaptive Resonance Theory. 1994 3. Security issues. World Wide Web. 25. Indexing methods : gopher. Socket and TLI interface. (4) Internet Technologies and Applications Unit I: Network Layer Function and Protocols : Switching. Unit IV: Associative Memories : Matrix. Limin Fu. Applications of Associative Memories. Palmer. Adaptive Pattern Recognition and Neural Networks”. Unit IV : Survey of Contemporary Internet Technologies : Role. Neuro Controllers and Fuzzy Neuro Controllers. Fuzzy Neuro Controllers. Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). World Wide Web/HTML Techniques for text. Basic TCP/IP. Unit II: Transport Layer Function and Protocols : Addressing flow control. CGI scripts. Fuzzy Neurons. Server site programming. WAIS. Addison Wesley 1989. . name space.Unit III: Recurrent Networks and Unsupervised Learning : Counter Back propagation Networks. Hebbian learning Kohonen’s Self Organizing feature maps. Routing and congestion control. McGraw Hill International. 1997 2. Boltzmann Machine. links and forms. Unit V: Emphasis on understanding. X. Prentice Hall of India (PHI). Internet Protocol (IP). electronic mail and file transfer protocol . Unit III: Application Layer Services and Protocols : Domain Name Services. Unsupervised learning methods. Pattern Recognition. “Introduction to the Theory of Neural Computations”. John Hertz.
1991 CS1003. Possibility theory versus Probability theory. Unit V: Fuzzy system & neural network. Introduction to the Theory of Neural Computations – by John Hertz. Programming with Java : A Primer – by E. Fuzzy image processing. Fuzzy morphism. McGraw International. 3. Unit IV: Approximate reasoning – Fuzzy expert system (an overview). Kosko. Neutral Networks in Computer Intelligence – by Limin Fu. PHI publication. 2. after deliberations among the faculty members. McGraw Hill International. Fuzzy controllers (overview and example). 2. PHI. Fuzzy pattern recognition. Fuzzy logic. Fuzzy system (general discussion). Fuzzy Set Theory and Applications Unit I: Introduction. Fuzzy arithmetic – Fuzzy numbers. Pattern recognition (introduction). Extension principle. Binary fuzzy relations. PHI publication. Fuzzy relations. Addison Wesley. Fuzzy equivalence and compatibility relations. Multiconditional approximate reasoning. 1997 4. Klir and Bo Yuan. 1. Fuzzy propositions. Fifth edition. Fuzzy set theory & application – by G. 5. Fuzzy qualifiers. Properties of alphacuts. Belief and possibility measures. Fuzzy implications. Third edition. Unit III: Fuzzy measures. Multivalued logic. 1997 3. Fuzzy clustering. Evidence theory. Unit II: Operation on fuzzy sets. Neural Networks and Fuzzy Systems : A Dynamic Systems Approach to Machine Intelligence – by B. 4. Fuzzy sets versus crisp sets. Klir and Folger 2. J. intersection and complement. Fuzzy union. Selection of fuzzy implication. 4. CS1002. Fuzzy ordering relations. Projections & cylindric extensions. 3. Basic concepts on fuzzy sets. Computer and Data Communication – by William Stalling. 1994 5. Java 2 : The Complete Reference – by Naughton Patrick & Herbert Schildt. Project The Project gives an opportunity to the student to use the methodologies/techniques taught in several courses in the curriculum. Arithmetic operations on fuzzy numbers. Text/References: 1. Fuzzy sets and Fuzzy logic theory and application – by George J. shall . Representation of fuzzy sets.Text/References: 1. combinations of operations. Balagurusamy. Fuzzy automata. The topics for the project to be undertaken by the department. McGraw Hill International. Computer Networks – by Andrew Tenenbaum. PHI .
and viva voice.50 marks . Marks Distribution: Internal Assessment – 50 marks Dissertation – 100 marks Viva Voce .be notified to the students. The external examiner in consultation with the internal examiner shall carry out the adjudication. the presentation of the project. A student should submit 3 copies of dissertation for evaluation at the end of the semester and present his project as a seminar topic. The project is to be carried out under the guidance of a faculty member of the department. after giving due weightage to the work carried out in the project. The guide/supervisor will be the internal examiner and external shall be appointed from a panel of examiners.