DIVISION OF

COMPUTER SCIENCE & ENGINEERING

a K

n u r

a y

i n U

s r e v

y it

Code No. CS201 CS202 CS203 CS204 CS205 CS206 CS207 CS208 CS209 CS210 CS211 CS212 CS213 CS214 CS215 CS216 CS217 CS218 CS301 CS302 CS303 CS304 CS305 CS306 CS307 CS308 CS309 CS310

Subject Name Computer Programming in C Software and Computer Programming Lab (CS201 P) Data Structures and Algorithms I Data Structures and Algorithms II Operating System System Software Object Oriented Analysis and Design Java Programming Java Programming Lab Windows Programming Windows Programming Lab Distributed Computing Database Management Systems Database Management Systems Lab Principles of Compiler Design Unix Architecture Unix and Linux Lab Data Structures Lab Data Mining and Warehousing Object Oriented Systems Development Distributed Operating Systems Cryptography and Network Security Software Project Management Computer Architecture and Organization Genetic Algorithm Real Time Systems Discrete Structures Software Development Lab

Credit 3:0:0 0:0:2 3:1:0 3:1:0 4:0:0 4:0:0 4:0:0 3:1:0 0:0:2 3:1:0 0:0:2 3:1:0 3:1:0 0:0:2 4:0:0 4:0:0 0:0:2 0:0:2 4:0:0 3:1:0 4:0:0 3:1:0 3:1:0 4:0:0 4:0:0 4:0:0 3:1:0 0:0:2

a K

n u r

a y

i n U

s r e v

y it

CS201 COMPUTER PROGRAMMING IN C Credit : 3:0:0 Marks : 40+60

Unit I : Introduction to Computers What is a computer? Hardware – software types of software system utility and application, Elementary Computer Organization Block diagram. Introduction to Computing : What are algorithms, types of algorithm finite, deterministic algorithms and computer program? Why we need programming languages? Levels of languages compiler. Programming Language C.

Division of Computer Science & Engineering

1

Basic Notations: Variables, Expressions, Assignments Iterative Instructions. Out First C Program : A program for insertion sort, full-fledged C program. Constants, Variables and Types : Variables, types and constants in C, names in C, Basic types in C, Qualified types, constants, declarations. Operators, Expressions and Statements: Operators, Expressions, Statements, Type Conversions.

Unit II : Input and Output Function printf, scanf, getchar and putchar. Control Statements : Control flow statements, the execution flow, the if-statement, the ifelse statement, the else-if ladder, the switch statement, the break statement, the ?: operator, loops, the continue statement, the goto statement. Unit III : Arrays Arrays, one dimensional array, two dimensional arrays, multidimensional arrays. Strings : Reading strings, writing strings, character and integer, combining two strings. Unit IV : Functions Function definition, statement return, the exit statement, functions of type void, declaration and definition, internal and external variables, scope, blocks. Stepwise Refinement Through Functions: A program through stepwise refinement, overall idea, broad idea, data structure issues, example. Recursion: Recursion, definitions leading to recursive programs, some computing best described recursively, Towers of Hanoi problem.

Unit V : Pointers & Structures Address of a variable, operators and pointers, declaring pointers, operations with pointers, pointers as function arguments. Address of an array, address of a string. Pointers to functions, structures and pointers, dynamic memory allocation, unions. Data Files : File operations, file handling functions organization, Blodk I/O, modifying records, advanced I/O. C Processor and other Features: Introduction, macro expansion, file inclusion, conditional compilation, miscellaneous directives, command line arguments, defining new data types, other features.

a K

Text Book 1. IBM Publication C complete reference by Herbert Schildt Reference Books 1. Programming language by Kezninghan & Ritchie 2. Schaums Outline series C Programming by Byran Gotfried

n u r

a y

i n U

s r e v

y it

Division of Computer Science & Engineering

2

CS202 (CS201 P) SOFTWARE AND COMPUTER PROGRAMMING LAB Credit 0:0:2 Marks: (50 + 50) 1. 2. 3. 4. 5. Microsoft Windows 98 Microsoft Word 2000 Microsoft Excel 2000 Microsoft Power Point 2000 Programming With C i) Generating Fibonacci series ii) Finding a number is armstrong number or not iii) Solving a quadratic equation iv) To check a number for prime v) Towers of Hanoi problem

CS203 DATA STRUCTURES AND ALGORITHMS I

Unit I : Introduction Structure and problem solving, Algorithmic notation, Introduction to algorithm analysis for time and space requirements and Primitive data structures. (Chapter 0) Unit II : Representation And Manipulation Of Strings Definitions and concepts, String manipulation and pattern matching, Markov algorithms, Primitive and composite functions, Grammars, Storage representation of strings and String manipulation applications. (Chapter 2) Unit III : Linear Data Structures Sequential Storage Representation Storage structures for arrays, structures and arrays of structures, Stacks Applications of stacks, Queues, priority queues. (Chapter 3) Unit IV : Linked Storage Representation Pointers and linked allocation linked linear lists, Operations, Circularly and doubly linked list applications, Associative lists. (Chapter 4) Unit V : Non-Linear Data Structures Trees Definitions and concepts operations, Storage representation and manipulation of binary trees, conversion of general trees, Sequential and other representation of trees, Applications of trees Multi linked structures, Graphs and their representations, Applications of graphs, Dynamic storage management. (Chapter 5) Text Book 1. Jean-Paul Tremblay and Paul G Sorenson, An Introduction to Data structures with Applications, Second Edition, McGraw Hill, 1994.(chapters 0,2-5) Division of Computer Science & Engineering 3

a K

n u r

a y

i n U

s r e v

y it

Credit: 3:1:0 Marks (40 + 60)

CS204 DATA STRUCTURES AND ALGORITHMS II Credit: 3:1:0 Marks (40 + 60) Pre-requisite: CS203 DATA STRUCTURES AND ALGORITHMS I

Unit I : Sorting Techniques Selection sort, bubble sort, merge sorting tree sort, partition, exchange sort, radix sort, address calculation sort. (Sections 6.1.1 to 6.1.9)

Unit II : Searching Techniques Sequential searching, binary searching, search trees, height balanced trees, weight balanced trees, tree structures, Hash functions, collision, Resolution techniques. (Sections 6.2.1 to 6.2.4.3)

Unit III : File Structures External and intermediate storage devices, sequential files in structure and processing, sorting on disks, indexed sequential files, structure and processing of indexed sequential files, class record retrieval system, direct files, An on line banking system. (Sections 7.1 to 7.10) Unit IV : External Sorting Dynamic hashing techniques, linear and virtual hashing, multiple key access and data base systems. (Sections 7.11 to 7.14) Unit V : Algorithm Design Model The Greedy method, Divide and conquer, Dynamic programming, Backtracking, Branch and bound. Text book 1. Jean-Paul Tremblay and Paul G Sorenson, An Introduction to Data structures with Applications, Second Edition, McGraw Hill Book Company, 1984. Reference book 1. Sartaj Sahni, Data Structures, Algorithms and Applications in C++, McGraw Hill, 1998. CS205 OPERATING SYSTEM Credit: 4:0:0 Marks (40 + 60)

a K

n u r

a y

i n U

s r e v

y it

Unit I Generations and history of operating systems - performance factors utilisation - throughput response time - multiprogramming and time sharing concepts -, process states - state transition - pcb - suspend and resume - interrupt processing - job and processor scheduling levels, objectives and criteria for scheduling - pre emptive and non - pre emptive scheduling Division of Computer Science & Engineering

4

- interval timer - priorities - deadline scheduling - FIFO - round robin - quantum size - SJF SRT - HRT scheduling - multilevel feedback queries. Unit : II storage organisation - management strategies - contiguous and non- - contiguous storage allocation - fixed partition multi - programming - variable partitions - swapping. Virtual storage, multilevel organisation, Block mapping, paging, m segmentation, paging /segmentation systems - page replacement Locality, Working sets - Lemand paging Anticipatory paging - page release - page size - program behaviour under paging.

Unit : III File systems, Data hierarchy, Blocking and Buffering, Files organisation, Queued and basic access methods - file characteristics - File system - Allocating and freeing space, file descriptor Access control matrix - User classes - Back up and recovery - Data page systems. Security - Pass word protection - Security kernels OS penetration. Disk scheduling - seek optimisation rotational optimisation - systems considerations.

Unit : IV Parallel processing - parbeging - parend - mutal exclusion - Critical sections - Implementing mutual exclusion primitives - Dekker's algorithm - Test and set instruction - Semaphores Process synchronisation with semaphores - Producer consumer relationship - counting semaphores. Communication between computer - Elements of Computer networks Network operating systems. Unit : V Monitors - Resource allocation with monitors - Ring buffer - Readers and writers - Ada Multi testing - Rendezvous - Accept - producer - consumer - select ads examples. Deadlock - conditions for deadlock prevention Avoidance - Banker's algorithm - Detection and Recovery. Performance measurement, monitoring and evaluation. The UNIX operating system. Text Book: 1. An introduction to operating systems, Harvey M.Deital-Addis6n - Wesley publishing company - Revised edition, 1984.

a K

Reference Book: 1. Operating systems concepts - James L.Paterson, Abraham Silberschatz, Addison wesley Publishing Co., Second Eciition, 1 985 2. Operating Systems - S.Tanenbaum. 3. Milen Milan Kovic - Operating Systems Concepts and Design Mc Graw Hill ISE, 1987. 4. M.Bach - Design of Unix Operating Systems - Prentice Hall of India. 1988.

n u r

a y

i n U

s r e v

y it

Division of Computer Science & Engineering

5

J. encapsulation and information hiding. class hierarchy. 1996. Tat McGraw Hill Publishing Co. System programming. Software Tools: Software tools program development – editors – debug monitor.compilation of control structure code optimization – interpreters. a K Pre-requisite: CS201 OBJECT ORIENTED PROGRAMMING IN C++ Unit I : An Overview Of Object Oriented Systems Development Object Basics . Dhamdhere – System programming & operating system.. D. Unit : IV Compilers and Interpreters: Aspects of compilation – memory allocation – compilation of expressions. persistence. object relationships and associations. Text Book 1. object behavior and methods. Language processing activities – fundamentales of language processing –specification – languages processor development tooling – scanning and parsing. Division of Computer Science & Engineering n u r a y i n U s r e v y it CS207 OBJECT ORIENTED ANALYSIS AND DESIGN Credit: 4:0:0 Marks (40 + 60) 6 . Reference Books 1. 1997. aggregations and object containment. Tata McGraw Hill . classes. object identity. polymorphism. Unit II : Assemblers Elements of assembly language programming – pass structure of assembles – design of twopass assemblers – single pass assembler for PCs.J. attributes.Donovan. Unit III : Macros And Macro Processors Macro definition and Call macro expression – nested macro calls – advanced macro facilities – design of macro processors.CS206 SYSTEM SOFTWARE Credit: 4:0:0 Marks (40 + 60) Unit : I Language processors. Unit : V Loaders and Linkers: Functions – various loading schemes – design loaders – relocation and linking concepts – design of linker – self recating programs – linking for overlays. objects. case study.M. Object oriented philosophy.

and collaborators. super-subclass relationships. Bernd Oestereich.case driven approach. Classification: Classification theory.Object oriented systems development life cycle: Software development process. the unified approach. a K n u r a y i n U s r e v y it CS208 JAVA PROGRAMMING Credit: 3:1:0 Marks (40 + 60) Unit I : Introduction to JAVA Object oriented language – The JAVA environment – comparing JAVA C and C++– Keywords & operators – Identifiers – Literal – Expressions – Control flow – Arrays & Strings – Functions – Command line Arguments .11. common class patterns approach. 2000. defining methods for vianet bank objects Design process and design axioms: Corollaries. use-case driven approach. UML diagrams.3 . Jacobson et al methodologies.11. designing methods and protocols. classes. use. Object-Oriented Analysis and Design in Practice. (chapters 6&7) Unit IV : Identifying Object Relationships. case study. 12. macro level process. design patterns. defining attributes for vianet bank objects.11. patterns. use-case driven object oriented analysis. packages. Attributes And Methods Association.(chapters 4 & 5) Unit III : Object Oriented Analysis Process Business object analysis. UML extensibility and UML metamodel.3. (chapter 10) Designing access layer. (chapters 8 & 9) Unit V : Designing Classes UML object constraint languages.(chapters 1-3) Unit II : Object Oriented Methodologies Rumbaugh et al. 1999 (chapters 1-10 & sections 11. Developing Software with UML. Ali Bahrami.Data members – methods – Overloading Division of Computer Science & Engineering 7 . use-case diagrams.4 only). Booch methodology. class visibility.4 ) Text-Book 1. designing methods for the vianet bank objects. naming classes. UML dynamic modeling. responsibilities. Reference Book 1. developing effective documentation. McGraw Hill. object responsibility. packages and managing classes. Object Oriented Systems Development using the Unified Modeling Language. case study.10.'s object modeling technique. UML class diagrams. use-case model.12. building high quality software.12. Unified modeling language: Static and dynamic models. case study. frameworks.( sections 12. a-part of relationships. refining attributes for the vianet bank objects. Addison-Wesley. business process modeling. designing classes. noun phrase approach.11) Designing view layer. class responsibility. (sections 11. reusability.10.

JDBC: ODBC – RDBMS Concepts – Setting up a database – Setting up tables – Establishing connection – Getting Data from a table –Prepated Statements–Callable Statements – Stored Procedures – DastabaseMetadata –ResultsetMetadata. Unit IV : A Tour of Swing_ Japplet –Icons and Labels – Text fields –Buttons – Combo Boxes – Tabbed Panes – Scroll -Panes – Tables–Trees. Maydene Fisher . Graham Hamilton . 2.http Package – Handling HTTP Request and response –Using Cookies.AWT Classes –Windows fundamentals – Creating frame Window– Handing events in frame window Working with graphics – Working with Color – Working with font –Layout Managers – MenuBars and menus –Dialog Boxes.”JDBC Database access with java”.TMH. Balaguruswamy. Servlets : Life cycle of servlet – jsdk – A simple servlet – Servlet API – javax. E. Reference Books: 1. Unit II : The JAVA Standard Library Overview – interfaces – packages – Exploring java.Lang–Simple type Wrappers.1999. Unit III : The Applet class HTML – Programming– applet initialization and terminatipon – Applet skeleton – Simple Applet Display method – Passing parameters to applet .Third edition Tata Mc Graw Hills .Events – Classes – Handling AWT Controls – Sources of events –Event Listener interfaces–Handling the events . Creating multiple thread– Thread Priority . Second Edition. Rick Cattell. Multithreaded Programming: Thread model –Creating a thread .servlet Package Reading servlet parameters – Reading initialisation parameters– javax.constructors – Class Assignment – This – Static members & methods -Inheritance – Abstract classes – exceptions . Patric Naughton .servlet. Input Output: Exploring java .1999. a K n u r a y i n U s r e v y it Division of Computer Science & Engineering 8 . io_Java I/O classes and Interfaces – The Character Stream – BufferedReader –BufferedWriter . Text Book 1. Unit V : Networking _Basis Java and Net – InetAddress –TCP/IP Client socket – URL Connection –TCP/IP Server socket – Datagrams. The Complete Reference “Java 2 “.Programming with java . Herbert Schildt.

valid and invalid rectangles. Unit : III Child window controls: button class. GDI bitmap object . Division of Computer Science & Engineering a K n u r a y i n U s r e v y it Credit: 3:1:0 Marks (40 + 60) 9 . WM_DESTROY messages. controls and message layout managers 8. caret. mouse wheel. capturing the mouse. Program to create a simple applet and application 2. Using package. Using threads (Synchronization. MDI: Concepts. GDI: Introduction. Mouse: Basics. regions and clipping. client area mouse messages. device context drawing dots and lines. playing a sound file. window procedure. Create a simple web page for college information system 11. cursors. rectangles. Unit V : Bitmaps Basics. printing graphics and text. Using inheritance and interface 4. list box class. Unit II : Keyboard Basics. modeless and common dialog boxes. keystroke messages.net 9. creating & displaying window. static class. menus. Clipboard: Use of clipboard Printer : Fundamentals. Using Java Classes and Objects 3. scrollbar class. WM_PAINT. implementation. drawing filled areas. keyboard accelerators Unit IV : Dialog boxes Modal. Using exceptions 6. critical section) 7. using the timer. character messages. Menus and Resources: Icons. edit class. custom resources. Bit block transfer. controls and colors. GDI mapping mode. processing the windows. communication. Using arrays in Java 5.CS209 JAVA PROGRAMMING LAB Credit: 0:0:2 Marks: (50 + 50) 1. Create a web page for to implement of searching technique CS210 WINDOWS PROGRAMMING Unit I : Windows & Messages Architectural overview. Program using AWT packages: Windows. message loop. scrollbars. dimensions. Using I/O package (files and streams) 10. strings. registering the window class . structure of GDI. queued and non-queued messages. Timer: Basics.

Galgotia Publications Ltd.Models for distributed computing – Load balancing – Remote Procedure Calls – Process migration – Concurrency issues on databases – Hardware Concepts – Bus based multiprocessors – Switched multicomputers – Software Concepts – Network Operating systems and NFS – Time distributed systems – Multiprocessor time sharing system – Design issue – Transparency – Flexibility – Reliability – Performance and scalability. Developing an Application which scrolls the text vertically . Internet : Windows sockets. Developing a program that works on different fonts over a text. 1996. Text Book 1... Microsoft press. a K Unit I : Introduction Distributed Processing . Windows API Bible – Programmer’s reference. Mouse UP. thread synchronization. 8. Charles Petzold. Programming Windows. ellipse etc.Multitasking and Multithreading: modes of multitasking. File Open File. Paste. 6.Blocking Vs Non Blocking primitives – Buffered versus Unbuffered primitives – Implementation of ClientServer model. Left Click. James L. 3. 9. Division of Computer Science & Engineering n u r CS212 DISTRIBUTED COMPUTING Credit: 3:1:0 Marks (40 + 60) a y i n U s r e v y it Credit: 0:0:2 Marks (50 + 50) 10 .Conger. 2. 5th edition.. Copy. Unit II : Communications Communications in distributed systems – The Client-Server model . win Inet and FTP. CS211 WINDOWS PROGRAMMING LAB 1. event signaling. 4.File concept could be used Creation of an editor performing all the operations like Cut. windows multithreading. 7. Mouse Down etc.. Close File Save etc. 1998 Reference Book 1. 5. Middle Click. Developing an Application supporting Graphical objects like arc. Working with simple window operations – Creation and basic manipulations in window Creation of child windows from a Parent window Developing an Application revealingthe usage of the “Scroll Bar” Developing an Application that works with Models and Models dialog Box Working with simple mouse functions – Right Click.

DBMS architecture and data independence. a K Unit II : Record Storage and Primary File Organizations Secondary storage devices. indexes. Naming conventions. relational constraints and relational Database schemas. implications of the Database approach. relationship types . “Advanced Concepts in Operating System “. Database system environment. the network database model Division of Computer Science & Engineering n u r a y i n U s r e v y it Credit: 3:1:0 Marks (40 + 60) 11 . Mukesh Singal and Shivaratri N. sets attributes. Database System Concepts and Architecture: Data models. and the Relational Algebra: Relational model concepts. placing file records. refining the ER design for the company Database.G. Index Structures fir Files. heap files. Hashing techniques. “Modern Operating Systems”. sorted files.data abstraction and knowledge representation (Chapters 1 to 4). buffering of blocks. classification of DBMS. Relational Constraints.1994. Unit V : Software Concepts: Distributed Programming Languages – Issues – Applications – Review of Distributed Databases. ER diagrams. relational operations (Chapters 5 to 7). B+ trees.. Database languages and interfaces. The Relational Data model. modeling. Conceptual object modeling using UML class. Tanenbaum A.. advantages of using DBMS. Database models: The hierarchical database model. Unit IV : Distributed File Systems File service interface – Semantics of the sharing – Distributed file systems. operation on files. specialization and generalization. Types of single-level ordered index. constraints and characteristics of specialization and generalization. Enhanced Entity-Relationship and Object Modeling: Subclasses. roles and structural constraints.Unit III : Synchronization Synchronization in distributed systems – Clock synchronization – Mutual exclusion – Electron Algorithms – Atomic transactions –Dead Locks in distributed systems – Threads – Thread usage and Implementation of thread packages – Processor allocation. CS213 DATA BASE MANAGEMENT SYSTEMS Unit I : Databases And Database Users Characteristics of the Database approach. multilevel indexes. McGraw Hill.New York.. schemas and instances. Data Modeling using the Entity-Relationship: conceptual Data models for Database design. Entity types. 2. Text Books 1.S.Prentice Hall.

2000. WCB/McGraw Hill. and Design: overview of the Object model of ODMG. object structure. normal forms based on primary keys . the domain relational calculus (Chapters 8 to 9) Unit IV : Concepts For Object-Oriented Databases Object identity. Raghu Ramakrishnan.Boyce. an overview of SQL 3. complex objects. other dependencies (Chapters 13 to 15). Third Edition. The tuple relational calculus. overview of the C++ language binding. Fundamentals of Database Systems. Ramez Elmasri.Addison Wesley. Database Management Systems. methods. 3.Codd normal form. implementation and related issues for extended type systems. 4. Reference Book 1. other object-oriented concepts. specifying general constraints as assertion. object database conceptual design (Chapters 11 to 12). and persistence. Insert. 1998. object query language. Shamkant B. Encapsulation of operations. Navathe. Galgotia publications private limited . Functional dependencies and Normalization for relational databases: informal design guidelines for relation schemas.1998 2. Object database standards. multivalued dependencies. 8. Usage of DDL commands Usage of DML and DCL commands Usage of TCL commands Multiple sub-queries Correlated sub-queries Usage of REF and OID Object creation Arrays manipulation 12 n u r a y i n U s r e v y it CS214 DATA BASE MANAGEMENT SYSTEMS LAB Credit: 0:0:2 Marks (50 + 50) Division of Computer Science & Engineering . Text Book 1. a K 1. delete update statements in SQL. ER-and EER-to-Relational Mapping and other Relational Languages: Relational Database design using ER-to-relational mapping. Relational database design algorithms and further dependencies: Algorithms for relational database. 7. Constraints and schema changes in SQL2. 5. Unit V : Object Relational And Extended Relations Database Systems Object-relational features of Oracle 8. Data base systems . 6. and type constructors. mapping EER model concepts to relations. Languages. Queries. object definition language. functional dependencies.Unit III : SQL – The Relational Database Standard Data definition. 2. join dependencies. Suneel galgotia .

Inventory control 18. procedure calls. parse trees and syntax treesMethods of translating assignment statements. expressions control statements. quadruples and triples. Personnel management system 17. Unit IV : Syntax Directed Translation Syntax directed translation scheme – Semantic actions – Implementation – Intermediate code generation – Address codes.Recursive descent Parser – Operator precedence and predictive Parse. declarations.9. Packages (Oracle forms) 16. Unit II : Lexical Analysis Role of a lexical analyzer – Finite automats –Regular expressions to finite automata – Minimizing the number of states of DFA – Implementation of a lexical analyzer – Illustrations. Division of Computer Science & Engineering a K n u r a y i n U s r e v y it Credit: 4:0:0 Marks (40 + 60) 13 . case statements – Record structures. Election Processing CS215 PRINCIPLES OF COMPILER DESIGN Unit I : Programming Language Grammar Definition of programming language – Lexical and syntactic structure of a language – Elements of a format lan – guage grammar – Derivation. Unit III : Parsing Techniques Parse trees – Left most and right most Parsing techniques. BFILE management 10. Student Information System 19. Usage of explicit cursors & implicit cursors 11. Symbol tables and error handling: Representation of information in symbol tables – Data structures for symbol tables – Errors. Exception handling 14.Lexical phase errors – Syntactic phase errors. Unit V : Code Optimization And Code Generation Principal sources of optimization – Loop optimization – The DAG representation of basic blooks – Introduction to code generation. Usage of procedures 13. Usage of functions 12. reduction and syntax trees – A ambiguity – context free grammars – Capabilities of a context free grammar – Regular expressions. Automatic Parsing techniques: LR grammars – LR Parsing – Canonical – collection of LR (0) items – construction of ACTION and GO TO table – Introduction to SLR – canonical and LALR Parsing. Usage of database triggers 15.Top down and bottom up parsing – Handles – Shift reduce Parse.Array references.

other file types. directories.Text Book 1. D. demand paging. disk drivers. System calls for the file system: Open. unlink. file system abstractions. changing the size of a process. structure of a regular file. creation of special files. Principles of compiler design . allocation of disk blocks. system administration. 1993. mounting and unmounting file systems. file system maintenance. sleep. Reference Book 1. pipes. stat and fstat.Second Edition. link. adjusting the position of the file I/O – lseek. INODE assignment to a new file. change directory and change root. operating system services. CS216 UNIX ARCHITECTURE Unit : I General Overview of the system: History. Compiler Construction. structure of the buffer pool. The buffer cache: Buffer headers. Naroton Publishing House. terminal drivers streams. Unit : III Process control: Process creation. scenarios for retrieval of a buffer. process termination. Introduction to the kernel: Architecture of the UNIX operating system. user perspective. Process scheduling and time: process scheduling. write.V. a hybrid system with swapping and demand paging. the context of a process. Aho. system boot and the init process. DUP. layout of system memory. Unit : II The internal representation of files: INODE. J. read. invoking other programs. super block.D. signals.Ullman . introduction to system concepts kernel data structures. A. The I/O subsystem:Driver interfaces. change owner and change mode. 1997. system structure. shell. Dhamdhere. advantages and disadvantages of the buffer cache.. conversion of a path name to an INODE. Macmillan India Ltd.M. system calls for time. close. clock. Unit : IV Memory Management policies: Swapping.. The structure of processes: Process states and transitions. awaiting process termination. and assumptions about hardware. file and record locking. reading and writing disk blocks. manipulation of the process address space. file creation. a K n u r a y i n U s r e v Credit: 4:0:0 Marks (40 + 60) y it Division of Computer Science & Engineering 14 . the user ID of a process. saving the context of a process.

Write a shell script to count number of words. Prentice-Hall of India. Write a shell script to check whether the given string is Palindrome or not. Basic commands 2. network communications. (chapters 1 to 11 only) CS217 UNIX AND LINUX LAB UNIX 1. The Design of the UNIX Operating System. Write a shell script for students evaluation 4. 6. a K 1. 2. Write a shell script for the following a) To find whether the given input is file / directory b) To delete a particular pattern in file LINUX 1. 3. 7. Write a shell script to convert the decimal number to binary number. Write a shell script for employee details using files. Write a shell script to find the user login 3. Write a C++ program to implement quick sort Write a C++ program to implement radix sort Write a C++ program to implement bubble sort Write a C++ program to implement selection sort Write a C++ program to implement shell sort Write a C++ program to implement address calculation sort. Basic UNIX commands. To delete a particular pattern from a line in a file. Bach. lines in a given file. 7. 5. 5. 15 Division of Computer Science & Engineering . Write a shell script to do the following a) Fibonaci series b) Factorial of given number c) To find whether given number is Armstrong or not d) To reverse the given number 4. 4. Write shell script to simulate a calculator. system V IPC. 5. Text book Maruice J. 2. 6. 1986. 3. n u r a y i n U s r e v Credit: 0:0:2 Marks (50 + 50) y it CS218 DATA STRUCTURES LAB Credit: 0:0:2 Marks (50 + 50) Write a C++ program to implement binary search technique. sockets.Unit : V Interprocess communication: Process tracing.

Unit .” Data Warehousing in the Real Word”. Text Books 1. “data Mining . Sam anahory. Unit – IV Hardware and operational design of data warehouses – Hardware architecture – Physical layout – security – Backup and recovery – service level agreement – operating the data warehouse. Write a C++ program to implement queue operation 10. deletion. insertion in all positions). Write a C++ program to convert the tree to binary tree. Pieter Adriaans.Addison Wesley. Write a C++ program to implement stack operation 9.1996. Write a C++ program to implement singly linked list(addition. Dennis Murray. Division of Computer Science & Engineering n u r a y i n U s r e v y it Credit 4:0:0 Marks 40 +60 16 . a K Unit – V Planning.1996 2. Write a C++ program to implement doubly linked list(addition. deletion.8. CS301 DATA MINING AND WAREHOUSING Unit – I Data mining – introduction – Information and production factor – Data mining Vs query tools – Data mining in marketing – self learning computer systems – concept learning – data mining and the data warehouse. 14. Write a C++ program to convert the given infix expression to postfix and prefix form. 11. Tuning and Testing: Capacity planning – Tuning the data warehouse – Testing the data warehouse – data warehouse features. Unit – II Knowledge discovery process – Data selection – cleaning – Enrichment – coding – Preliminary analysis of the data set using traditional query tools – Visualization techniques – OLAP tools – Decision trees – Neural networks – Genetic algorithms – KDD (Knowledge Discover in Databases ) environment. Addison Wesley. insertion in all positions). Dolf Zantinge. Write a C++ program to convert the given expression to ALP using stack 12.III Data warehouse architecture – system process – process architecture – Design – database schema – partitioning strategy – aggregations – data marting – meta data – System and data warehouse process managers. 13.

Berry. a K Reference 1. Unit – IV OBJECT-ORIENTED METHODOLOGIES : Introduction – Survey of some of the object oriented methodologies – Rumbaugh object modeling technique – The Booch methodology – The Jacobson methodology. “Object Oriented Analysis and Design”..Reference Book 1. Unit – III APPLICATIONS ( Case Study Approach ) : Client-Server Computing – ATM Banking – Inventory Tracking System – System Requirements – Analysis – Design – Evolution – Maintenance. Michael J. The Benjamin /Cummings publishing Company. 2. James Rumbaugh. Gordon S. Prentice Hall of India. 1994. 1997. Linoff. Grady Booch. “Object Oriented Systems Development” McGraw Hill. “Object Oriented Modelling and Design”. Unit – II THE OBJECT : Importance of classification – Key abstractions and mechanism .Elements of Notation – Class diagrams – State Transition Diagrams – Object Diagrams – Interaction Diagrams – Module Diagrams – Process Diagrams – Applying Notation. Ali Bahrami.. Unit – V UNIFIED MODELLING LANGUAGE : Introduction – Static and Dynamic models – UML Diagrams – UML class Diagram – Use Case Driven – UML Dynamic Modelling Model Management – UML Meta Model Text Book 1. “Mastering Data Mining”. n u r a y i n U s r e v y it Division of Computer Science & Engineering 17 . 1999. CS302 OBJECT ORIENTED SYSTEMS DEVELOPMENT Credit 3:1:0 Marks 40 +60 Unit – I THE OBJECT MODEL : The structure of complex systems – The models of object-oriented development – Major and Minor elements in object model – Classes and Objects – Relationships among classes and objects – Building classes and Objects.

Introduction to Distributed Systems: Goals – Advantages of Distributed Systems over Centralized ones – Advantages of Distributed Systems over Independent PCs – Disadvantages of Distributed Systems – Hardware Concepts – Bus-Based Multiprocessors – Switched Multiprocessors – Bus-Based Multicomputers – Switched Multicomputers – Software Concepts – Network Operating Systems and N FS – True Distributed Systems – Multiprocessor Timesharing Systems – Design Issues – Transparency – Flexibility – Reliability – Performance – Scalability – Summary. Distributed File Systems : Distributed File System Design – The File server interface – The directory server interface –Semantics of file sharing – Distributed File System Division of Computer Science & Engineering 18 n u r a y i n U s r e v y it .Summary.CS303 DISTRIBUTED OPERATING SYSTEMS Credit 4:0:0 Marks 40 +60 Unit-I Introduction to O.S: What is an operating system – Operating system? – History of operating system concepts – operating system structure.A Token Ring Algorithm – A Comparison of the Three Algorithms – Election Algorithms – The Bully Algorithm – A Ring Algorithm – Atomic Transactions – Introduction to Atomic Transactions – The Transactions Model – Implementation – Concurrency Control – Deadlocks In Distributed Systems – Distributed Deadlock Detection – Distributed Deadlock Prevention – Summary. Unit-III Synchronization in Distributed Systems : Clock Synchronization -Logical Clocks – Physical clocks – Clock Synchronization Algorithms – Mutual Exclusion – A Centralized Algorithm – A Distributed Algorithm . Unit-II Communication In Distributed Systems : Layered Protocols – The physical Layer – The data Link Layer – The Network Layer – The Transport Layer – The Session Layer – Presentation Layer – Application Layer – The Client Server Model . a K Unit-IV Processes And Processors In Distributed Systems: Threads – Introduction to Threads – Thread Usage – Design Issues for Threads packages – Implementing a Threads package – Threads and RPC – An Example Threads Package – System Models – The Workstation Model – Using the Workstations – The Processor Pool Model – A Hybird Model –Processor Allocation – Allocation Models – Design Issues for Processor Allocation Algorithms – Implementation Issues for Processor Allocation Algorithms – Example Processor Allocation Algorithms – Scheduling In Distributed Systems.Client and Servers – An Example Client and server – Addressing – Blocking versus Nonblocking Primitives – Buffered versus Unbuffered primitives – Reliable versus Unreliable primitives – Implementing the Client server model – Remote Procedure Call – Basic RPC operation – Parameter passing – Dynamic Binding – RPC semantics in the presence failures – Implementation Issues – Problem areas – Group Communication – Introduction to Group communication – Design issues – Group Communication in ISIS – Summary.

. Harvey M.I Conventional Encryption: Convention Encryption : Conventional Encryption Model – Steganography – Classical Encryption Techniques – Simplified DES – Block Cipher Principles – The Data Encryption Standard – The Strength of DES – Differential and Linear Cryptanalysis – Block Cipher Design Principles – Block Cipher Modes of operation – Conventional Encryption algorithms Unit . Andrew S. Prentice. Reference Book 1.II Public Key Encryption and Hash Functions Public Key Cryptography – Principles of Public Key Cryptosystems – The RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Elliptic Curve Cryptography Message Authentication and Hash Functions Authentication Requirements – Authentication Functions – Message Authentication Codes – Hash Functions – Security of Hash Functions Unit . CS304 CRYPTOGRAPHY AND NETWORK SECURITY Unit .Hall of India.Fault Tolerance – Summary. Tanenbaum. Unit-V Case Study : AMOEBA : Introduction to AMOEBA – History of Amoeba – Research goals – The Amoeba System Architecture – The Amoeba Microkernel – The Amoeba Servers – Objects and Capabilities In Amoeba – Capabilities – Object Protection – Standard Operations – Process Management In Amoeba – Processes – Threads – Memory Management in Amoeba – Segments – Mapped Segments – Communication in Amoeba – Remote Procedure call – Group Communication in Amoeba – The Fast Local Internet Protocol – The Amoeba Servers –The Bullet Server – The Directory Server – The Replication Server – The Run server – The Boot server – The TCP/IP server – Other servers – Summary Text Book 1..Implementation – File Usage – System Structure – Caching – Replication – An Example: The Andrew File System – Lessons Learned –Trends In Distributed File Systems – New Hardware – Scalability –Wide Area Networking – Mobile Users.Addison – Wesley Publishing Company – Revised edition – 1984. Deital “ An Introduction to Operating Systems”.III Hash and Mac Algorithms MD5 Message Digest Algorithm – Secure Hash Algorithm (SHA-I) – RIPEMD – HMAC Digital Signatures and Authentication Protocols Division of Computer Science & Engineering 19 a K n u r a y i n U s r e v y it Credit 3:1:0 Marks 40 +60 . : “ Modern Operating Systems”.

Prentice Hall.IV Authentication Applications – IP Security – Web Security Unit . CS305 SOFTWARE PROJECT MANAGEMENT Unit-I Software Management Renaissance : Conventional Software Management – The Waterfall Model – In Theory – In Practice – Conventional Software Management performance – Evolution of Software Economics – Software Economics – Pragmatic Software Cost Estimation – Reducing Software product Size – Reducing software product size – languages – Object – Oriented Method and Visual Modeling – Reuse – Commercial Components – Improving Software Processes – Improving Team Effectiveness – Improving Automation through software environments .1999 Reference Book 1.V Intruders. “ Cryptography and Network Security”. Division of Computer Science & Engineering 20 a K n u r a y i n U s r e v y it Credit 3:1:0 Marks 40 +60 . William Stallings. “ Applied Cryptography”.Digital Signatures – Authentication Protocols – Digital Signature Standard Unit .Engineering and Production stages – Inception Phase – Elaboration Phase – Construction Phase – Transition Phase – Artifacts of the process – The Artifacts of the process – The Artifact sets – The Management set – The Engineering set – Artifact Evolution over the life cycle – Test Artifact – Management Artifacts – Engineering Artifacts – pragmatic Artifacts Unit-III Model-Based Software Architectures – Architecture: A Management Perspective – Architecture : A Technical Perspective – Workflows of the Process – Software process Workflows – Iteration workflows – Checkpoints of the process – Major milestones – Minor milestones –Periodic status Assessments. Second edition. Bruce Schneier. Second Edition – 1996.Achieving Required Quality – Peer Inspections A pragmatic View – The Old way and the New – The principles of Conventional Software Engineering – The Principles of Modern Software management – Transitioning to an Iterative process Unit-II A Software management Process Framework: Life-Cycle Phases. Viruses and Worms Intruders – Viruses and Related Threats Firewalls Firewall Design Principles – Trusted Systems Text Book 1.

a K Design Methodology: System Design – System representation – Design process – The Gate Level – The register level – Register –Level Components – Programmable Logic Devices – Register Level Design – The Processor – Level Components – Processor –Level Design – Summary – Problems – References. Fifth Edition. Addison Wesley Longman. Roger S Pressman. “ Software Project Management”. Unit-I Computing and Computers : The Nature of Computing – The elements of computers – Limitations of computes – The Evolution of Computers – The mechanical Era – Electronic Computers – The Later Generations – The VLSI Era – Integrated Circuits – Processor Architecture. Addison Wesley publications..Business Organizations – project organizations – Evolution of organizations – Process Automation – Tools: Automation Building Blocks – The project Environment .Unit-IV Software Management Disciplines : Iterative Process Planning – work breakdown structures – Conventional WBS Issues – Evolutionary work Breakdown Structures – Planning Guidelines – The cost and schedule Estimating process – The Iteration planning process – Pragmatic planning – Project Organizations and Responsibilities – Line –of. Unit-II Processor Basics : CPU origination – Fundamentals – Additional Features – Data Representation – Basic Formats – Fixed –Point Numbers – Floating – Point Numbers – Instruction Formats – Instruction Types – Programming Considerations – Summary – Problems – References Division of Computer Science & Engineering 21 n u r CS306 COMPUTER ARCHITECTURE AND ORGANISATION Credit 4:0:0 Marks 40 +60 a y i n U s r e v y it .. 2000. “Software Engineering A Practitioner’s approach” . Walker Royce. 1996. Lan Somerville.Trip Engineering –Change Management – Infrastructures – Stakeholder Environments Unit-V Project Control and process Instrumentation – The seven Core Metrics – Management Indicators – Work and progress. Reference Book 1.Round.System Architecture – summary – problems – references. McGraw Hill International. 2.Budgeted Cost and Expenditures – Staffing and Team Dynamics – Quality Indicators – Change Traffic and Stability – Breakage and Modularity – Rework and Adaptability – MTBF and Maturity – Life –cycle Expectations – Pragmatic Software metrics – Metrics Automation. Text Book 1. “Software Engineering”. Fourth Edition. Inc.

Unit – II Theoretical foundations of Genetic algorithms – Fundamental theorem – Schema processing – Building block hypothesis – Minimal deceptive problem – Statistical mechanics approaches. 1996 a K Unit – I Introduction to Genetic algorithms – History of evolutionary computation. Prentice Hall of India. John P. n u r CS307 GENETIC ALGORITHM Credit 4:0:0 Marks 40 +60 a y i n U s r e v y it Division of Computer Science & Engineering 22 . Text Book 1.CPU control unit – Pipeline Control – Instruction Pipelines – Pipelines Performance – Superscalar Processing – Summary – Problems – references.Unit-III Control Design : Basic Concepts – Introduction – Hardwired Control – Design Examples – Microprogrammed Control – Basic Concepts – Multiplier Control Unit. William Stallings. Hayes. Unit-IV Datapath Design: Fixed. Fourth Edition. Reference Book 1. “ Computer Organization and Architecture”. biological terminology – Robustness of traditional optimization and search methods – Goal of optimization – Elemant of genetic algorithms – A simple genetic algorithm.Point Arithmetic – Addition and Subtraction – Multiplication – Division – Arithmetic – Logic Units – Combinational ALUs – Sequential ALUs – Advanced Topics – Floating – point Arithmetic – Pipeline Processing – summary – problems – References – Memory Organization – Memory Technology – Memory Device Characteristics – Random – Access memories – Serial – Access memories – Memory Systems –Multilevel Memories – Address Translation – memory Allocation – Caches – Main Features – Address mapping – Structure versus performance – summary – problems – references. “Computer Architecture and Organization” McGraw Hill International Editions.. Unit-V System Organization: Communication Methods – Basic concepts – Bus Control – IO And System Control – Programmed IO – DMA and Interrupts – IO processors – Operating systems – Parallel processing – Processor – Level parallelism – Multiprocessors – Fault Tolerance – Summary – Problems – References.

Addison Wesley. 2. optimizing and machine learning. David E. Examples – Structure of a RTS – Task classes Real – time system issues : Architecture issues – OS issues – other issues . FSA. 1998. Unit – II Programming languages and tools : Language features – survey of commonly used programming languages – programming environments – run – time support Real –Time Systems life cycle. Goldberg. DFD – Petri Nets – Warnier – Orr notation – state charts. Unit-III Real –Time OS : Task – control block model – Task states – Task management . Text Books 1. n u r a y i n U s r e v y it Credit 4:0:0 Marks 40 +60 Division of Computer Science & Engineering 23 .Performance measure for real –time systems. Types. Melanie Mitchell. 1989.POSIX. Genetic algorithms in search. Unit – IV Applications of Genetic Algorithms – Dejong and function optimization – Advanced operators and techniques in genetic search – dominance diploidy – obeyance – inversion and reordering operators – multi-objective optimization. CS308 REAL TIME SYSTEMS Unit-I Introduction: Real – time Definitions. An introduction to Genetic Algorithms. a K Real –time Specification and Design Techniques : Natural languages – mathematical specification – Flow charts – structure charts – Pseudocode and PDL. Prentice hall of India. Unit – V Genetic based machine Learning – Introduction to genetic based machine learning – classified systems – rule and message system – application of genetic based machine learning – GBML – development of CS-1 first classifier systems – Smith poker player.Unit – III Implementing a Genetic algorithm – Encoding a problem for the Genetic algorithm – Adopting the encoding – Selection methods – genetic operators – Crossover mutation – Mapping objective function – Fitness scaling parameters for genetic algorithms. Task assignment and scheduling : classical uniprocessor scheduling Algorithms – Task assignment – Fault Tolerance scheduling.

regular) – definitions – context free grammar derivation tree – ambiguity.arrangements and selections with repetition. Laplante . Testing and Fault Tolerance: Faults. Unit–II : Combinatorics Counting Methods for arrangement and selections. Formal Languages: Four classes of grammars (Phrase structure. Shin: “Real –Time Systems”. Failures. context free.logical operator – truth tables – Equivalence and implication – laws of logic normal forms – proofs in prepositional calculus – Quantifiers. Unit –V Real – Time Applications : The first real – time application – Real – time database – real – time image processing – real –time UNIX. C. covering of a set – Equivalence relation – partial ordering – Hasse diagram – Composition of binary relations. Graph Theory : Introduction – basic terminology – representation of graphs – connectivity – Eulerian and Hamiltonian graphs. Generating functions – calculating coefficients of generating functions. Phillip A. Kang G. CS309 DISCRETE STRUCTURES Unit–I : Mathematical Logic Prepositions.– homogeneous linear relations. a K n u r a y i n U s r e v y it Credit 3:1:0 Marks 40 +60 Division of Computer Science & Engineering 24 .two basic counting principles. . Reliability. McGraw –Hill International 1997.2nd Edition. Ltd. Unit–III : Recurrence Relations Recurrence relation models – solution linear recurrence relations – solution of non. Unit–IV : Trees Binary tree – traversals of a binary tree – Expansion trees. Text Books 1.: “ Real –Time Systems Design and Analysis” – Prentice Hall of India Pvt.Unit-IV Real -time communication: Network Topologies – Protocols. 2.M.Simple arrangements and selections.. Bugs and effects – reliability – Testing – Fault Tolerance. context sensitive. Krishna .. RELATIONS AND FUNCTIONS: Definition and properties of binary relations Relation matrix and Graph of relation – partition.

2.PDA – Equivalence of acceptance by final state and empty stack – Equivalence of PDA’s and context free languages. Reference Books 1. Data Structure & Algorithm Design Networking Data Base Systems Multimedia and Virtual Reality Computer Graphics Internet and JAVA a K n u r a y i n U s r e v y it Credit 0:0:2 Marks 50 +50 Division of Computer Science & Engineering 25 . 4. Doerr Alan and Levasseur Kenneth. Ullman. Push Down Automata: Informal description – Definition – Deterministic . 6. 5. “Introduction to automata theory. Galgotia Publication (P) Ltd.Unit –V : Finite Automata Definition of deterministic finite state automation. Text Books 1. Non deterministic finite state automaton – equivalence of DFA and NFA – Equivalence of regular grammars and finite automata. Tata McGraw Hill Companies Inc.Hopcroft and Jeffrey D. “Applied Combinatorics”. Alan Tucker. 1997. 1984. 2.Martin. “Introduction to languages and the theory of computation”. John Wiley & Sons. 2. 3. John E. John C.. Narosa publishing house 1995. CS310 SOFTWARE DEVELOPMENT LAB Suitable Laboratory assignments on System Design may be given on the following topics 1. languages and computation”. “Applied Discrete Structures for Computer Science”.

ADDITIONAL SUBJECTS Code No. CS219 CS220 CS221 CS222 CS223 CS224 CS225 CS226 CS227 CS228 CS229 CS230 CS231 CS232 CS233 CS234 CS235 CS236 CS237 CS238 CS239 CS240 CS241 CS242 CS243 CS244 CS245 CS311 CS312 CS313 CS314 CS315 CS316 CS317 CS318 CS319 CS320 CS321 CS322 CS323 CS324 Subject Name Data Structures Data Structures Lab Operating Systems Java Programming Data and Computer Communication Design and Analysis of Algorithms Java Programming Lab Database Systems Unix Architecture System Software Database Systems Lab Unix and Linux Lab Web Technology & Multimedia Lab Cryptography and Network Security Principles of Compiler Design Software Engineering System Software and Compiler Lab Windows Programming Lab Case Tools and Networking Lab Enterprise Java (J2EE) Enterprise Java (J2EE) Lab Principles of Real Time Systems Soft Computing Computer Hardware Peripherals & Networking Lab Distributed Systems Natural Language Processing Programming in C Theory of Computation Advanced Computer Architecture Advanced Operating Systems High Performance Networks Real Time Systems Computer Lab I Speech and Language Processing Parallel Processing Software Agents Computer Lab II C# and  Platform Net C# and  Programming Lab Net Mobile Communication and Computing Network Management Credit 3:0:0 0:0:2 3:0:0 3:1:0 4:0:0 3:0:0 0:0:2 4:0:0 4:0:0 3:0:0 0:0:2 0:0:2 0:0:2 4:0:0 3:1:0 3:0:0 0:0:2 0:0:2 0:0:2 4:0:0 0:0:2 4:0:0 4:0:0 0:0:2 4:0:0 4:0:0 3:1:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 0:0:2 4:0:0 4:0:0 4:0:0 0:0:2 4:0:0 0:0:2 5:0:0 5:0:0 a K n u r a y i n U s r e v y it Division of Computer Science and Engineering 1 .

Doubly linked circular list . implementation of graphs .Garbage collection .Fixed length string method . Bhagat Singh and Thomas L. C.linked representation of a binary tree.linear representation of a binary tree . Variables and expressions.Introductory Considerations .postfix. UNIT IV Implementing a multidimensional array .Recursion.The 8 queens problem UNIT III Tree structures .Linked list implementation of a queue.Linked list implementation of a sparse matrix.Parsing and Evaluation of Arithmetic expressions using stacks . UNIT V Data structures and Data Management . constants. Reference Book: 1. Robert Kruse.pre-order.Data types.linked list implementation of a stack .General trees.Minimum spanning tree .Deletion algorithm for lists maintained with binary tree . 1997.insertions into a binary tree . Introduction to Data Structures.Recursive Algorithms . Graphs and networks.Naps.workspace/Index table method Processing efficiency considerations of the workspace/Index talk method .Linked list method.sparse matrices and generalized Dope vector implementation . Towers of Hanoi Problem .balanced trees.Garbage Collections Data Base Management .L. priority queues stacks .Implementing non –recursively – recursion .CS219 DATA STRUCTURES Credits: 3: 0 : 0 Marks: (40 + 60) UNIT I Algorithms for Data Structures .Tondo and Bruce Leung. Depth-first search. In orderpost order traversals of a binary tree . Program modules in PSEUDO Logic and Control structures in PSEUDO Linked lists. singly linked lists .Array implementations of a stack .height . prefix and infix notations converting to infix expressions to postfix . Dummy Headers. arrays.variations on linked list structures.Binary trees. Second Edition. Prentice-Hall India. n u r a y i n U s r e v y it Division of Computer Science and Engineering 2 . AVL rotations . Circular linked lists. implementation of Binary trees .the adjacency matrix.binary tree traversals . Data Structures and Program Design in C.Threaded binary trees . UNIT II Circular implementation of a queue .Evaluating post fix expressions . breadth-first search.Insertions and deletions . Networks .stacks and backtracking .Topological ordering.Data Base Management Systems a K Text Book: 1.The shortest path algorithm . Tata McGrawHill 1986.Specifics of PSEUDO .

UNIT IV Introduction to Virtual Memory – Demand Paging – Process Creation – Page Replacement – Allocation of Frames – Thrashing – Operating System Examples – Other Considerations – File Concept – Access Methods – Directory Structure – File-System Mounting – File Sharing – Protection.CS220 DATA STRUCTURES LAB Credits: 0 : 0 : 2 Marks: (50 + 50) 12 experiments will be notified by the HOD from time to time CS221 OPERATING SYSTEMS Credits: 3 : 0 : 0 UNIT I Introduction – Overview of different types of systems – Feature Migration – Computing Environments – Computer-System Operation – I/O Structure – Storage Structure – Storage Hierarchy – Hardware Protection – Network Structure – System Components – Operating System Services – System Calls – System Programs – System Structure – Virtual Machines – System design and Implementation – System generation UNIT II Process Concept – Process Scheduling – Operation on Processes – Cooperating Processes – Interprocess Communication – Communication in Client Server Systems – Threads – Multithreading Models – Threading Issues – Pthreads – Solaris 2 Threads – Window 2000 Threads – Linux Threads – Java Threads – Basic Concepts of CPU Scheduling – Scheduling Criteria – Scheduling Algorithms – Multiple Processor Scheduling – Real-Time Scheduling – Algorithm Evaluation – Process Scheduling Models UNIT III Process Synchronization – The Critical Section Problem – Synchronization Hardware – Semaphores – Classic Problems of Synchronization – Critical Regions – Monitors – OS Synchronization – Atomic Transaction – System Model – Deadlock Characterization – Methods for handling deadlocks. UNIT V File-System Structure – File-System Implementation – Directory Implementation – Allocation Methods – Free-Space Management – Efficiency and Performance – Recovery – Log-Structured File System –NFS – Overview of I/O systems – I/O Hardware – Application .Deadlock Prevention – Deadlock Avoidance –Deadlock Detection – Recovery from deadlock .I/O Interface – Kernel I/O Subsystem – Transforming I/O to Hardware Operations – Streams – Performance – Disk Structure – Disk Scheduling –Disk Management – SwapDivision of Computer Science and Engineering 3 a K n u r a y i n U s r e v Marks: (40 + 60) y it .Memory Management Background – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with Paging.

New I/O. Graphics and Text .Data Types.Packages and Interfaces .lang . Fifth Edition.Exploring java.An Overview of Java . Greg Gagne. Regular Expressions and Other Packages Text Book: 1.Using AWT Controls.Networking . Applets and Other Topics . (Chapters 1-24) a K Credits: 4 : 0 : 0 n u r a y i n U s r e v Marks: (40 + 60) y it CS223 DATA AND COMPUTER COMMUNICATION Marks: (40 + 60) UNIT I Data communication and networking overview: A communication model-data communication-data communication networking-protocol architecture-the need for a protocol architecture-a simple protocol architecture . Sixth Edition. (Chapters 1-14) CS222 JAVA PROGRAMMING Credits: 3 : 1 : 0 UNIT I The Genesis of Java . Variables and Arrays – Operators Control Statements .The Applet Class . Data transmission-Concepts and terminology-Analog and Digital data transmissionTransmission Impairments – channel capacity Division of Computer Science and Engineering 4 . Peter Baer Galvin.Event Handling UNIT V Introducing the AWT: Working with Windows. Abraham Silberschatz. John Wiley and Sons.java. Text Book: 1.space Management – RAID Structure – Disk Attachment – Stable-Storage Implementation – Tertiary-Storage Structure.util Part 1:The Collection Framework. Java2 . Tata McGraw-Hill.Input/Output: Exploring java. 2002. Layout Managers. UNIT IV java.String Handling .util Part2: More Utility Classes .Exceptions Handling Multithreaded Programming UNIT III I/O.The Complete Reference.Inheritance .OSI – TCP/IP protocol architecture. Operating System Concepts.Introducing Classes UNIT II Methods and Classes . and Menus – Images . 2002. Herbert Schildt.io .

soft switch architecture-Packet switching principles-X. Data and Computer Communication. Internet work operation: multicasting – routing protocols – integrated services architecture – differentiated services.control signaling . (Chapters 1 – 4) UNIT II Signal encoding techniques: Digital data. High speed LANs: the emergence of High-speed LAN’s – Ethernet – token ring – fibre channel. (Chapter 13.1-13.25-Frame Relay. Tata McGraw-Hill. Forouzan. Digital signals & analog signals – analog data digital signal and analog signals. Data Communications and Networking. 10. Data link Control -Flow control-Error Control-HDLC. Prentice Hall of India. Transport protocol: connection – oriented TCP – TCP – Congestion control . (Chapters 18-20) Text Book: 1.Interfacing. a K n u r a y i n U s r e v y it Reference Book: 1. Local Area Network: Background – Topologies and transmission media – LAN protocol architecture – bridges – layer2 and layer3 switches. (Chapters 8.Frame Relay congestion control. Behrouz A. William Stallings. 2000. 2003. (Chapters 5-7) UNIT III Multiplexing-FDM – Synchronous TDM – statistical TDM – Asymmetric DSL – xDSL Circuit Switching and packet switching: switching networks . Routing in Switched Networks: routing in circuit switched network – routing in packet switched network – least cost algorithms. 15.Guided and Wireless transmission – guided transmission media – wireless transmission – wireless propagation.Congestion control in packet switching networks . Digital data communication techniques: Asynchronous and synchronous transmission -Types of Error -Error Detection -Error Correction-Line configuration. Seventh Edition. 12) UNIT IV Congestion control in switched Data network: Effect of congestion .5. 16) UNIT V Internet work protocols: basic protocol functions – principles of internetworking – connectionless internetworking – Internet Protocol. Sections 13.circuit switching networks circuit switching concepts .Congestion control Traffic management .UDP. Division of Computer Science and Engineering 5 . Second Edition.

Analysis of Algorithms. Pearson Education. Reference Books: 1.CS224 DESIGN AND ANALYSIS OF ALGORITHMS Credits: 3 : 0 : 0 Marks: (40 + 60) UNIT I Analysis Basics: what is analysis what to count and consider – mathematical backgroundrates of growth – divide and conquer algorithms – recurrence relations Searching and selection algorithms: sequential search – Binary search – Selection UNIT II Sorting Algorithms: Insertion sort – Bubble sort-Shell sort-Radix sort – Heap sort – Merge sort – Quick sort – External poly phase merge sort Numeric Algorithms: Calculating polynomials – Matrix Multiplication – Linear Equations UNIT III Matching algorithms: String matching – approximate string matching Graph Algorithms: Graph background and terminology – Data structure methods for graphs – Depth-First search and Breadth-First Traversal algorithms – Minimum spanning tree algorithms – Shortest-path algorithm – Bi connected component algorithm UNIT IV Parallel Algorithms: Parallelism Introduction – The PRAM Model – Simple parallel operations – parallel searching – parallel sorting – parallel numerical algorithms – parallel graph algorithms UNIT V Non-Deterministic Algorithms: NP – Typical NP Problems – What makes something NP – Testing possible solutions Other Algorithmic Techniques Text Book: 1. 2. Algorithm Design: Foundations.McConnell. 2002. Jeffrey J. Michael T. a K n u r a y i n U s r e v y it CS225 JAVA PROGRAMMING LAB Marks: (50 + 50) 12 experiments will be notified by the HOD from time to time Credits 0:0:2 Division of Computer Science and Engineering 6 . Johnwiley and Sons. Sara Baase and Allen Van Gelder. 2000. Analysis and Internet Examples. Narosa publishing House. 2002. Computer Algorithms – Introduction to Design and Analysis. Goodrich and Roberto Tamassia.

7) UNIT IV Need for Complex Data types – Object Oriented Data Model – Object Oriented languages Persistent Programming languages – Persistent C++ Systems – Persistent Java Systems – Nested Relations – Complex Types –Inheritance – Reference Types – Querying with Complex Types – Functions and procedures – Object Oriented versus Object Relational (Chapters 8.6-11. 9) UNIT V File Organization – Organization of records in Files – Data Dictionary Storage – Storage for Object Oriented Databases – Indexing and Hashing Basic Concepts – Ordered Indicies .B+ Tree Index Files – B Tree Index Files – Static Hashing – Dynamic Hashing – Comparison of ordered Indexing and hashing – Index Definition in SQL – Multiple Key Access (Chapters 11.9. 12) a K n u r a y i n U s r e v y it Division of Computer Science and Engineering 7 .CS226 DATABASE SYSTEMS Credits: 4 : 0 : 0 Marks: (40 + 60) UNIT I Database System Applications – Database System versus File Systems – View of Data – Data Models – Database Languages – Database Users and Administrators – Transaction Management – Database System Architecture – Application Architectures – History of Database Management Systems – ER Model Basic Concepts – Constraints – Keys – Design Issues – ER Diagram – Weak Entity Sets – Extended ER Features – Design of an ER Database Schema – Reduction of an ER Schema to Tables – UML (Chapters 1. 2) UNIT II Structure of Relational Databases – The Relational Algebra – Extended Relational Algebra Operations – Modification of the Databases – Views – Tuple Relational Calculus – Domain Relational Calculus – Relational Databases Basic Structure – Set Operations – Aggregate Functions – Null Values – Nested Sub queries – Views – Complex Queries – Modification of Database – Joined Relations – Data Definition Language – Embedded SQL – Dynamic SQL – Other SQL Features – Query by Example – Data log user Interfaces and Tools (Chapters 35) UNIT III Domain Constraints – Referential Integrity – Assertions – Triggers – Security and Authorization – Authorization in SQL – Encryption and Authentication – First Normal Form – Pitfalls in Relational Database Design – Functional Dependencies – Decomposition – Desirable Properties of Decomposition – Boyce Codd Normal Form – Third Normal Form – Fourth Normal Form – More Normal Forms – Overall Database Design Process (Chapters 6.

Text Book: 1. Abraham Silberschatz, Henry.F.Korth, S. Sudharshan, Database System Concepts, Fourth Edition, McGraw-Hill, 2002. Reference Book: 1. Ramez Elmasri and Shamkant B. Navathe, Fundamentals of Database Systems, Third Edition, Pearson Education, 2000.

CS227 UNIX ARCHITECTURE Credits: 4 : 0 : 0

UNIT I UNIX Operating System – History – Commands – essential Unix commands – vi editor – shell programming – The First Step – Taking Decisions – The Loop Control structure. Introduction to Kernel: Architecture of the UNIX operating system - introduction to system concepts. The buffer cache - Buffer headers - structure of the buffer pool - scenarios for retrieval of a buffer - Reading and writing disk blocks -advantages and disadvantages of the buffer cache.

UNIT II The internal representation of Files – INODE - structure of a regular file - directories conversion of a path name to an INODE - Super block - INODE assignment to a new file. System calls for the file system: Open - read – write – file - record locking - Adjusting the position of the file I/O-lseek – close - File creation - creation of special files - change directory change root - Change owner and change mode - Stat and fstat - pipes - DUP file Systems - link and unlink UNIT III The structure of processes: process states and transitions - Layout of system memory - The context of a process - saving the context of a process - Manipulation of the process address space - sleep - Process Control: Process Creation - signals - Process termination - Awaiting process termination – invoking other programs - the user ID of a process - Changing the size of a process. Process Scheduling and time: process scheduling - System calls for time- clock.

a K

UNIT IV Memory Management policies: Swapping - Demand Paging - The I/O subsystem: driver interfaces - Disk drivers. Terminal drivers stream. UNIT V Interprocess Communication: Process Tracing - System V IPC - Network Communications Sockets. Text Book: 1. Maruice J. Bach, The design of the UNIX operating system, Prentice Hall of India, 1986. (Chapters 2-11)
Division of Computer Science and Engineering 8

n u r

a y

i n U

s r e v

Marks: (40 + 60)

y it

Reference Book: 1. Kenneth Rosen, Douglas Host, James Farber, Richard Rosinki, Unix-The Complete Reference, Mc-Graw Hill, 1999.

CS228 SYSTEM SOFTWARE Credits: 3 : 0 : 0

Marks: (40 + 60)

UNIT I Introduction - Basic concepts - Machine structure - Instruction formats - Addressing modes Typical Architectures. (Chapter 1)

UNIT II Assemblers: Functions - Features - Machine dependent - Machine independent - Design options - One pass – Multi pass - Implementation - Examples. (Chapter 2) UNIT III Loaders and Linkers: Functions - Features - Relocation - Program Linking - Linking loader implementation -Automatic library search - Loader option - Linkage editors - Dynamic linking - Bootstrap loaders - Examples. (Chapter 3) UNIT IV Macroprocessors: Functions-Macro parameters -Using labels - Conditional macro expansion - Recursive macro expansion - General-purpose macro processors - Examples. (Chapter 4) UNIT V Compilers and Utilities: System Software tools -Implementation of editors - Debuggers. (Sections 7.2, 7.3) Text Book: 1. L.Beck, System Software, An Introduction to System Programming, Addison Wesley, 1999. Reference Book: 1. D.M.Dhamdhere, Systems Programming and Operating Systems, Tata McGraw-Hill Company, 1999.

a K

n u r

a y

i n U

s r e v

y it

CS229 DATABASE SYSTEMS LAB Marks: (50 + 50)

Credits: 0 : 0 : 2

12 experiments will be notified by the HOD from time to time
Division of Computer Science and Engineering 9

CS230 UNIX AND LINUX LAB Credits: 0 : 0 : 2 Marks: (50 + 50)

12 experiments will be notified by the HOD from time to time

CS231 WEB TECHNOLOGY AND MULTIMEDIA LAB Credits: 0 : 0 : 2

12 experiments will be notified by the HOD from time to time

CS232 CRYPTOGRAPHY AND NETWORK SECURITY Credits: 4 : 0 : 0

UNIT I Services, Mechanisms and Attacks – Block Cipher principles – Data Encryption Standard – Strength of DES – Evaluation criteria for AES – AES Cipher. (Sections: 1.1, 3.2, 3.3, 3.4, 5.1, 5.2) UNIT II Principles of Public Key Cryptosystems – RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Elliptic Curve Arithmetic – Elliptic Curve Cryptography. (Sections: 9.1, 9.2, 10.1, 10.2, 10.3, 10.4) UNIT III MD5 Message Digest Algorithm – Secure Hash Algorithm – HMAC – Digital signature Standard – Kerberos – X.509 Authentication Service. (Sections: 12.1, 12.2, 12.4, 13.3, 14.1, 14.2) UNIT IV Pretty Good Privacy – S/MIME – IP Security Overview – IP Security Architecture – Authentication Header – Encapsulating Security Payload – Combining Security Associations – Key Management. (Sections: 15.1, 15.2, 16.1, 16.2, 16.3, 16.4, 16.5, and 16.6) UNIT V Web Security considerations – Secure Sockets Layer and Transport Layer Security – Secure Electronic Transactions – Intruders – Intrusion Detection – Password Management – Firewall design principles – Trusted systems. (Sections: 17.1, 17.2, 17.3, 18.1, 18.2, 18.3, 20.1, 20.2)

a K

n u r

a y

i n U

s r e v

Marks: (50 + 50)

y it

Marks: (40 + 60)

Division of Computer Science and Engineering

10

2003. Josef Piepryzyk.Incorporating a Symbol table – Symbol tables (Sections: 2. 4.1-2. 6.5. 2003.1-7.1-8. Applied Cryptography. Cryptography and Network Security. and 10.1-9.4.1-3.3.1-5.8) UNIT IV Syntax directed definitions – Construction of Syntax trees – Bottom up Evaluation of Sattributed definitions – L attributed definitions .Issues in the design of Code generator – The target machine – Runtime storage management – Basic Blocks and Flow graphs – Introduction to Code Optimization – The principal sources of Optimization (Sections: 8.Text Book: 1. and 7. Thomas Hardjono and Jennifer Seberry. Second Edition.1-10. CS233 PRINCIPLES OF COMPILER DESIGN Marks: (40 + 60) Credits: 3 : 1 : 0 UNIT I Compilers – Analysis of Source Program – The phases of a compiler – Cousins of the compiler – The grouping of phases – Compiler Construction tools – Overview of a Simple one-pass compiler – Syntax Definition – Syntax Directed Translation – Parsing – A translator for Simple Expressions (Chapter 1 and Sections: 2. Reference Books: 1. Bruce Schneier.9) UNIT III Parsing – The role of a Parser – Context Free Grammar – Writing a grammar – Top down Parsing – Bottom up Parsing – Operator Precedence parsing – LR Parsers – Using Ambiguous Grammars (Sections: 2. 6. Prentice Hall. 1996. 3.4.1. 2. Springer.Top down Translation – Type systems – specification of a simple type checker .3) UNIT V Intermediate Languages – Declarations – Assignment Statements .1-4. William Stallings.Source Language Issues – Storage Organization – Storage Allocation Strategies (Sections: 5. Fundamentals of Computer Security.6.2) a K n u r a y i n U s r e v y it Division of Computer Science and Engineering 11 . Third Edition. 9.5) UNIT II Lexical Analysis – The role of Lexical Analyzer – Input Buffering – Specification of Tokens – Recognition of Tokens – Finite Automata – From a regular expression to NFA – design of a lexical analyzer generator – Optimization of DFA based pattern matchers .2.

Morgan Kauffmann Publishers. Ullman. products.Principles. Louden.Practical Process modeling – Planning and Managing the project – tracking Progress – project personnel – Effort Estimation – Risk management – the project plan – process models and project management.Cooper and Linda Torczon. Compiler s. UNIT IV Testing the system – principles of system testing – function testing – performance testing – reliability. Aho. availability. Reference Books: 1. Engineering A Compiler. Pearson Education Private Limited. processes. Compiler Construction – Principles and Practice. 1997. Kenneth C. Vikas Publishing House. Keith D. 1986. Alfred V. processes. Jeffrey D. CS234 SOFTWARE ENGINEERING Credits: 3 : 0 : 0 UNIT I Software Engineering . and resources – approaches to evaluation – selecting an evaluation techniques – assessment vs prediction – evaluating products – evaluating processes – evaluating resources – Improving predictions. UNIT II Capturing the requirements – The Requirements process – types – Characteristics – prototyping requirements – requirements documentation – participants in the process – requirements validation – measuring – choosing a requirements specification – Designing the system – decomposition and modularity – architectural styles – issues – characteristics – techniques – evaluation and validation – documenting UNIT III Concerning Objects – What is OO – the OO development process – use cases – UML – OO system design – OO program design – OO measurement – Writing the programs – standards and procedures – guidelines – documentation – Testing the programs – Software faults and failures – Testing issues – unit testing – integration testing – testing OO systems – test planning – automated testing tools .Introduction – A system Approach – An Engineering Approach – Members of the development team . Techniques and Tools. 2.Modeling the Process and Life Cycle – the meaning – Software Process Models – Tools and Techniques . 2004. Ravi Sethi. and maintainability – acceptance testing – installation testing – automated system testing – test documentation – testing safety–critical systems – delivering the system – training – documentation – maintaining the system – the changing system – nature – problems –measuring maintenance characteristics – techniques and tools – software rejuvenation UNIT V Evaluating products. and resources Division of Computer Science and Engineering 12 a K n u r a y i n U s r e v Marks: (40 + 60) y it .Text Book: 1.

James F. Software Engineering – Theory and Practice. 2000. John Wiley and Sons.Databases . Software Engineering – An Engineering Approach.The Birth of J2EE .J2EE Design Patterns and Frameworks UNIT II J2EE FOUNDATION .The Maturing of Java .Java Beans and Java Message Service . (Chapters 1-13) Reference Book: 1. Third Edition. 2001. Pearson Education.– improving prediction – improving products – improving processes – general improvement guidelines Text Book: 1.Why J2EE? J2EE Multi-Tier Architecture . Shari Lawrence Pfleeger.Java Server Pages n u r 12 experiments will be notified by the HOD from time to time CS238 ENTERPRISE JAVA (J2EE) Marks: (40 + 60) a y i n U s r e v y it Marks: (50 + 50) Marks: (50 + 50) Marks: (50 + 50) Division of Computer Science and Engineering 13 .Java servlets . CS235 SYSTEM SOFTWARE AND COMPILER LAB Credits: 0 : 0 : 2 12 experiments will be notified by the HOD from time to time CS236 WINDOWS PROGRAMMING LAB Credits: 0 : 0 : 2 12 experiments will be notified by the HOD from time to time CS237 CASE TOOLS AND NETWORKING LAB Credit: 0 : 0 : 2 a K Credits: 4 : 0 : 0 UNIT I J2EE and J2SE .Peters.J2EE Best Practices . Witold Pedrycz.

2002. Mc-Graw Hill. 2) UNIT II Task Assignment and Scheduling: Uniprocessor Scheduling – IRIS Tasks – Tasks Assignment Mode charges – Fault tolerant scheduling (Chapter 3) UNIT III Programming Languages and Tools: Desired characteristics based on ADA – Data typing – Control Structures – Packages – Exception Handling – Overloading – Multitasking – Timing specification – Task Scheduling – Just-in-time Compilation – Runtime support (Chapter 4) a K n u r a y i n U s r e v y it Marks: (50 + 50) Marks: (40 + 60) Division of Computer Science and Engineering 14 . CS239 ENTERPRISE JAVA (J2EE) LAB Credits: 0 : 0 : 2 12 experiments will be notified by HOD from time to time CS240 PRINCIPLES OF REAL TIME SYSTEMS Credits: 3:1:0 UNIT I Introduction: Architecture of Real time Systems / Embedded Systems – Operating Systems issues – Performance Measures – Estimating Program runtimes (Chapters 1.Universal Description.Java Naming and Directory Interface API UNIT V WEB SERVICES . James Keogh. “J2EE .The complete Reference”.Java Message Service – Security . UNIT IV Java Remote Method Invocation .Web Services Description Language (WSDL) Text Book 1. Discovery.Java Interface Definition Language and CORBA.The Java API for XML Registries (JAXR) .SOAP .JavaMail API . and Integration (UDDI) Electronic Business XML .UNIT III Enterprise JavaBeans .

Back Propagation Networks .LR-type Fuzzy numbers . McGraw-Hill.The Hopfield Memory .Predicate Logic .Applications UNIT III Fuzzy Logic .Variations of Standard Propagation Algorithm UNIT II Associative Memory – Autocorrelators – HeteroCorrelators . C. Division of Computer Science and Engineering 15 a K n u r a y i n U s r e v y it Marks: (40 + 60) . 1999.Fuzzy Sets .Crisp Sets .Back propagation Learning – Applications .Learning Methods . Shin.Defuzzification Methods – Applications . An Introduction To Real Time Systems. Krishna.Basic concepts of Neural networks .Selection of various parameters in BPN . CS241 SOFT COMPUTING Credits: 4 : 0 : 0 UNIT I Introduction to Artificial intelligence Systems . Bailey.Exponential BAM – Applications .Model of an Artificial Neuron .Applications.Fuzzy BP Architecture Learning in Fuzzy BP . Reference Book: 1.Neural Network Architectures .Fuzzy versus Crisp .Fundamentals of Neural Networks .A. 1997.Early Neural Network Architectures .Fuzzy Neuron .Characteristics of Neural Networks .Inference by Fuzzy BP . Buhr. Prentice Hall International.Fuzzy Set Theory .Adaptive Resonance Theory – Introduction . Reliability and Synchronization: Fault types – Fault detection and containment – Redundancy – Data diversity – Reversal checks – Obtaining parameter values – Reliability models for hardware redundancy – Software error models – Clocks – Fault tolerant synchronization – Synchronization in software (Chapters 7-9) Text Book: 1.Fuzzy Relations .ART1 ART2 .Fuzzy Logic Fuzzy Rule Based System .Architecture of a back Propagation Network .Effect of Tuning Parameters of the BPN .Single Layer Artificial Neural Network .Human Brain .Fuzzy Back propagation Networks .Crisp Logic .Taxonomy of Neural Network Architectures .M. Real Time Systems. Donald L. Kang G.UNIT IV Real Time Databases: Basic Networking principles – Real time databases – Transaction processing – Concurrency control – Disk scheduling algorithms – Serialization and Consistency (Chapter 5) UNIT V Fault Tolerance.Crisp Relations .Fuzzy Systems . Raymond J.

Neural Networks.Generational Cycle . (Chapters 1-12.UNIT IV Genetic Algorithms .Differences and similarities between GA and other traditional methods .Rajasekaran and G.Advances in GA . An introduction . Fuzzy Logic and Genetic Algorithms Fuzzy Associative Memories .Real life problem . Operating system support: introduction – the operating system layer – protection – process and threads – communication and invocation .FAM Rules with Multiple Antecedents/Consequents – Applications . Distributed file systems: introduction – file service architecture – sun network file system – the Andrew File system – recent advances.Fuzzy Hebb FAMs . 14. 2003.Multilevel Optimization . System Model: introduction – architectural models – fundamental models.GA in Fuzzy Logic Controller Design . UNIT II Distributed objects and remote invocation: introduction – communication between distributed objects – RPC – events and notifications. Prentice Hall India.Integration of Neural Networks.Inheritance operators – Crossover .Soft Computing Tools . S.Applications Text Book: 1.Inversion and Deletion .Fuzzy Logic Controlled Genetic Algorithms .FAM.operating system architecture.Mutation operator .A. Fuzzy Logic.GA Based Weight Determination .Single Association FAM . Interprocess Communication: introduction – the API for the Internet protocol – external data representation and marshaling – client –server communication – group communication. And Genetic Algorithms Synthesis and Applications.Fuzzy Logic Controller .Working Principle – Encoding .Applications UNIT V Hybrid Systems . 15) CS242 COMPUTER HARDWARE PERIPHERALS AND NETWORKING LAB Credits: 0 : 0 : 2 12 experiments will be notified by HOD from time to time Credits: 4 : 0 : 0 a K UNIT I Characterization of Distributed Systems: introduction – examples of distributed systems – resource sharing and the web – challenges.Convergence of Genetic Algorithm – Applications . Vijayalakshmi Pai.Bitwise Operators .Problem Description of Optimum Design .Creation of Offsprings .FAM involving a Rule Base .Genetic Modeling .Fitness Function – Reproduction .Genetic Algorithm History Basic Concepts .Fuzzy Constraints .Fundamentals of Genetic Algorithms .Genetic algorithm based BPN . Division of Computer Science and Engineering 16 n u r CS243 DISTRIBUTED SYSTEMS Marks: (40 + 60) a y i n U s r e v y it Marks: (50 + 50) .

UNIT III Name Services: introduction – name services and the DNS – directory and discovery services. Time and Global states: introduction – clock, events and process states – synchronizing physical clocks – logical time and logical clocks – global states – distributed debugging. Co-ordination and Agreement: introduction – distributed mutual exclusion – elections – multicast communication – consensus and related problems.

UNIT IV Transactions and Concurrency control: introduction – transactions – nested transaction – locks – optimistic concurrency control – timestamp ordering – comparison of methods for concurrency control. Distributed Transactions: introduction – flat and nested distributed transactions – atomic commit protocols – concurrency control in distributed transactions – distributed deadlocks – transaction recovery. UNIT V Replication: Introduction – system model and group communication – fault tolerant services – highly available services – transactions with replicate data. Distributed Shared Memory: introduction – design and implementation issues – sequential consistency and Ivy – release consistency and Munin – other consistency models. Text Book: 1. George Coulouris, Jean Dollimore, Tim Kindberg, Distributed Systems – Concepts and Design, Third Edition, Pearson Education, 2001. (Chapters 1, 2, 4-6, 8-14, 16, Case Studies not included) Reference Book: 1. Andrew S. Tanenbaum, Maartenvan Steen, Distributed Systems – Principles and Paradigms , Pearson Education, 2002.

Credits: 4 : 0 : 0

a K

UNIT I Introduction: Knowledge in Speech and Language Processing-Ambiguity-Models and Algorithms-Language, Thought and Understanding-The state of the Art and the Near-Term Future-History-Regular Expressions and Automata: Regular Expressions-Finite -State Automata-Regular Languages and FSAs. UNIT II Word Classes And Part-of-Speech Tagging: English Word Classes-Tagsets for English- Partof-Speech Tagging-Rule-Based Part-of-Speech Tagging-Stochastic-Part-of-Speech TaggingTransformation-Based Tagging-Other Issues-Context-Free Grammars for English: Constituency-Context-Free Rules and Trees-Sentence level construction-The Noun PhraseDivision of Computer Science and Engineering 17

n u r

CS244 NATURAL LANGUAGE PROCESSING Marks: (40 + 60)

a y

i n U

s r e v

y it

Coordination-Agreement-The Verb phase and subcategorization-Auxiliaries-Spoken Language Syntax-Grammar Equivalence and Normal Form-Finite-State and Context-Free Grammars-Grammars and Human Processing. UNIT III Parsing with Context-Free Grammars: Parsing as search-Basic Top-Down Parser-ProblemsThe Earley Algorithm-Finite-State Parsing Methods-Features and Unification: Feature Structures- Unification of Feature Structures- Feature Structures in the GrammarImplementing Unification-Parsing with Unification Constrains-Types and Inheritance.

UNIT IV Representing Meaning: Computational Desiderata for Representations-Meaning Structure of language-First Order Predicate Calculus-Some Linguistically relevant concepts-Related representational Approaches-Alternative approaches to meanings-Semantic analysis-SyntaxDriven Semantic analysis-Attachments for a Fragment of English-Integrating Semantic analysis into the Early Parser-Idioms and Compositionality-Robust Semantic analysis. UNIT V Pragmatic: Discourse-Reference Resolution-Text Coherence-Discourse StructurePsycholinguistic Studies of Reference and Coherence-Natural Language Generation: Introduction to Language Generation-An architecture for generation-Surface RealizationDiscourse Planning-Other Issues. Text Book: 1. Daniel Jurafsky and James H.Martin, Speech and Language Processing, Pearson Education, 2002. (Chapters 1, 2, 8-11, 14, 15, 18, 20)

Credits 3:1:0

a K

UNIT I Introduction - Software, Hardware, Types of software - Computer Organization - Block diagram, Computing – Algorithms – Types - Finite & Deterministic Algorithms - Finite & Non-Deterministic Algorithms - Levels of languages - Compiler. Introduction – C Fundamentals: The C Character Set – Identifiers and Keywords – Data Types – Constants – Variables – Declarations – Expressions – Statements – Symbolic Constants – Operations and Expressions: Arithmetic Operators – Unary Operators – Relational and Logical Operators – Assignment Operators – The Conditional Operator – Library Functions – Data Input and Output: Single Character Input & Output – Entering Input Data – Writing Output Data. UNIT II Control Statements: Branching – Looping – Nested Control Structures – The switch, break, continue, comma statements – The Goto Statement – Functions: Defining a Function – Accessing a Function – Function Prototypes – Passing Arguments to a Function – Recursion.
Division of Computer Science and Engineering 18

n u r

a y

i n U

s r e v

y it

CS245 PROGRAMMING IN C Marks (40+60)

UNIT III Program Structure: Storage Classes – Automatic Variables – External Variables. Arrays: Defining an Array – Processing an Array – Passing Arrays to Functions – Multidimensional Arrays – Arrays and Strings.

UNIT IV Pointers: Fundaments – Pointer Declarations – Pointers and One-Dimensional Arrays – Operations on Pointers - Dynamic Memory Allocation. Structures & Unions: Defining a Structure – Processing a Structure – User-Defined Data Types – Structures and Pointers – Self Referential Structures.

UNIT V Data Files: Opening and Closing a Data File – Creating a Data File – Processing a Data File – Command Line Arguments. Text Book 1. Karunya Notes on “Computer Programming in C”.

References 1. Byron S. Gottfried, Theory and Problems of Programming With C, Second Edition, Tata McGraw Hill, 1996 2. E. Balaguruswamy, Programming in ANSI C , Edition 2.1, Tata McGraw Hill, 2003 Reprint. 3. Herbert Schildt, C: complete reference 4th Edition, Tata McGraw Hill, 2000 4. Yaswant Kanitkat, Let us C 5. Venugopal & Sudeep, Programming with C

Credits: 4 : 0 : 0

a K

UNIT I Introduction to the Theory of computation - Finite Automata - Deterministic Finite Accepters – Non-deterministic Finite Accepters - Equivalence of Deterministic and Non- deterministic Finite Accepters - Reduction of the number of states in Finite Automata - Regular Languages and regular grammars - Regular Expressions - Connection between Regular expressions an regular languages - Regular Grammars UNIT II Properties of Regular Languages - Context-free Languages - Context-free Grammars Parsing and ambiguity - Parsing an Membership - Context-Free grammars - Programming Methods for transforming grammars - Important Normal Forms - Membership algorithm for Context-free Grammars

n u r

CS311 THEORY OF COMPUTATION Marks: (40 + 60)

a y

i n U

s r e v

y it

Division of Computer Science and Engineering

19

Memory Addressing .Dynamic scheduling: Examples and the Algorithm .Free Languages .operations in the instruction set . 2001. Price and their trends .Cost.pipeline Hazards Implementation .Type and size of operands -Operands for media and signal processing .Grammars for Deterministic Context free languages . Narosa Publishing House.Deterministic Pushdown Automata . An Introduction to Formal Languages and Automata.Measuring and Reporting performance . Christos H.Turing thesis UNIT IV Other models of Turing machine-Recursive and Recursively enumerable Languages Unrestricted Grammars Context-Sensitive Grammars and Languages .Post Systems . 2) UNIT II Pipelining: Introduction .Deterministic Context .The Complexity Classes P and NP. Harry R.overcoming data Hazards with Dynamic scheduling . Peter Linz.Performance and Price Instruction set Principles and Examples: Introduction . Papadimitriou.Quantitative Principles of computer design .High Performance instruction delivery . Elements of Theory of Computation.Taking Division of Computer Science and Engineering 20 n u r a y i n U s r e v y it .Technology Trends . (Chapters 1-14) Reference Book 1. UNIT V Other Models of Computation .Language family and Complexity Classes .UNIT III Pushdown Automata – Non-deterministic Pushdown Automata . 2002.free Languages .Two pumping Lemmas Closure properties and decision Algorithms for Context free Languages .Addressing Modes for signal processing .The changing face of computing and the task of the computer designer .Rewriting Systems Efficiency of Computation . CS312 ADVANCED COMPUTER ARCHITECTURE Credits: 4 : 0 : 0 Marks: (60 + 40) a K UNIT I Fundamentals of Computer Design: Introduction .Classifying Instruction set Architectures .Encoding an instruction set (Chapter 1. Text Book 1.The Major Hurdle of pipelining .Reducing Branch costs with Dynamic Hardware Prediction .Turing machines an Complexity .Instruction for control flow .Extending the MIPS pipeline to handle multicycle operations Instruction Level parallelism: concepts and challenges .Recursive Functions .Pushdown Automata and context .Lewis. Prentice Hall.Chomsky Hierarchy Limits of Algorithmic Computation.Combining Turing machine for Complicated task.The Standard Turing machine .

advantage of More ILP with Multiple Issue .Hardware support for Exposing more parallelism at compile Time . A Quantitative Approach.Static Multiple issue: The VLIW approach .advanced compiler support for Exposing and Exploiting ILP .performance of symmetric shared memory multiprocessors Distributed shared .Distributed Scheduling n u r CS313 ADVANCED OPERATING SYSTEMS Marks: (40 + 60) a y i n U s r e v y it Division of Computer Science and Engineering 21 .Review of the ABCs of the caches .Hardware . Third Edition.Reducing Cache Miss Penalty or Miss Rate via Parallelism .memory architectures . 2003.memory multiprocessors .Theoretical Foundations .Cache Performance .Reducing Hit Time .Reducing Miss Rate .Distributed Deadlock Detection .performance of distributed shared .Agreement Protocols UNIT II Distributed Resource Management .crosscutting issues: Hardware versus software speculation mechanisms (Chapter 4) UNIT IV Multiprocessors and Thread .Studies of the Limitations of ILP .Static Branch Prediction .synchronization .Limitations of ILP for Realizable processors (Appendix A and Chapter 3) UNIT III Exploiting Instruction .Level parallelism within a processor (Chapter 6) UNIT V Memory Hierarchy Design: Introduction .models of memory consistency: Introduction .Multithreading: Exploiting Thread .Main Memory and Organizations for Improving Performance .symmetric shared .Distributed File Systems . Elsevier. Computer Architecture.Architectures of Distributed Systems .Characteristics of Application domains .Distributed Mutual Exclusion .Reducing Cache Miss Penalty . Credits: 4 : 0 : 0 a K UNIT I Distributed Operating Systems .Protection and Examples of Virtual Memory (Chapter 5) Text Book: 1. John L.Level Parallelism with Software Approaches: Basic compiler Techniques for Exposing ILP . Hennessy and David Patterson.memory architectures .Level Parallelism: Introduction .Based speculation .Virtual Memory .Distributed Shared Memory .Memory Technology .

CATV (Chapter 5) a K UNIT III ATM: Main Features of ATM .Internet Success and Limitation . CS314 HIGH PERFORMANCE NETWORKS Credits: 4 : 0 : 0 Marks: (40 + 60) UNIT I Packet .Digital Subscriber Line (DSL) Intelligent Networks .Switched Networks: OSI and IP models .BISDN .Link level design . Advanced Concepts in Operating Systems Distributed. Tata McGraw-Hill Edition 2001.Future and standards (Chapter 7) Division of Computer Science and Engineering 22 n u r a y i n U s r e v y it . 2001.Shivaratri.Header Structure .UNIT III Failure Recovery and Fault Tolerance .The wireless channel . Introduction to Operating Systems: Advanced Course.SONET .Performance of TCP/IP Network.Recovery .Fiber to the Home .Introduction to Database Operating Systems . Gorman. (Chapters 3.Token Ring FDDI . 4) UNIT II Circuit Switched Networks: Performance of Circuit Switched Networks .DQDB .Internet Protocol .Internet and TCP/IP Networks: The Internet Overview of Internet Protocols .Concurrency Control Algorithms Text Book 1.Management control .Frame Delay .SMDS . and Multiprocessor Operating Systems.TCP and UDP .Channel access . Mary S. Mukesh Singhal. S.Internetworking with ATM (Chapter 6) UNIT IV Wireless Networks: Introduction .16-20) Reference Book: 1.Wireless Networks . Niranjan G.ATM Adaptation layer . Database.Resource Security and Protection: Access and Flow Control Multiprocessor Operating Systems .Addressing Signaling & Routing .Network design . (Chapters 4-14.Fault Tolerance UNIT IV Protection and Security .Multiprocessor System Architectures -Multiprocessor Operating Systems UNIT V Database Operating systems . Course Technology.Ethernet (IEEE802.Concurrency Control: Theoretical Aspects .5) .Dense Wave Division Multiplexing (DWDM) . Todd Stubbs.

. J.S. Second Edition. Pearson Publications. Real-Time Systems. Morgan Kaufmann.Priority Driven Scheduling of Periodic Tasks UNIT III Scheduling Aperiodic and Sporadic Jobs in priority driven Systems .UNIT V Optical Networks: Optical Links .Resources and source access control UNIT IV Multiprocessor Scheduling. Prentice Hall of India Pvt..Commonly used approaches to Real time scheduling UNIT II Clock driven Scheduling . Second Edition.Reference model of Real time System . Jane W.DWDM Systems . High Performance Communication Network.Liu. Laplante.. Ltd. Walrand.Scheduling flexible computations . Ltd. CS315 REAL TIME SYSTEMS Credits: 4 : 0 : 0 UNIT I Typical Real-Time Application . Phillip A.Hard Versus Soft Real Time System . 2000.Harcourt Asia Pvt. Varaiya.Optical Cross Connects .Synchronization . Real-Time Systems Design and Analysis.Optical LANs-Optical paths and Networks (Chapter 11) Text Book: 1. 2000. Resource access control . 2001. (Chapters 1-12) Reference Book: 1.Tasks with temporal distance constraints UNIT V Real time communication .Operating Systems Text Book: 1. a K Credit 0:0:2 n u r a y i n U s r e v Marks: (40 + 60) y it CS316 COMPUTER LAB I Marks 50 + 50 12 experiments will be notified by HOD from time to time Division of Computer Science and Engineering 23 .

Models and Algorithms .Sentence-Level Constructions .Language.Grammar Equivalence and Normal Form .N-grams for Spelling and pronunciation – Entropy (Chapter 4-6) UNIT III HMM’s & Speech Recognition Speech Recognition Architecture .Human Processing of Phonology and Morphology Probabilistic models of pronunciation and Spelling – Dealing with spelling Errors .Constituency .error patterns .Regular language and FSAs .Combining FST lexicon and rules .The State of art and near term futurehistory .Parsing as Search .Tagsets for English Part of Speech Tagging .Phonological Rules and Transducers .Bayesian model to spelling .Morphology .Spoken Language Syntax .Deleted Interpolation .Overview of a Speech Recognition Architecture .Advanced Methods of Decoding .Probabilistic Models .Problems with PCFGs .Coordination Conjunction . and Understanding .Knowledge in Speech and Language processing – Ambiguity .English Pronunciation Variation .Bayesian model for Pronunciation Weighted Automata .Back off .Lexicon free FSTs The porter Stemmer .Regular Expressions and automata – Finite State Automata .Top-down Parsing .Training a Recognizer Word Classes and Part-of-Speech Tagging .How to Interpret a Waveform Spectra . Thought.English Word Classes .Counting Words in corpora Simple N-grams – Smoothing .Stochastic Part of Speech Tagging – Transformation Based Tagging .Computing Acoustic Probabilities .Advanced issues in computational Phonology .A Basic Top-Down Parser .Minimum Edit Distance .Bottom-Up Parsing .The Verb Phrase and Sub categorization .Agreement .Dependency Grammars .A Decoding Acoustic Processing of Speech Sound Waves .Prosody in TTS .English Morphology .Grammars and Human Processing (Chapters 7-9) a K n u r a y i n U s r e v y it UNIT IV Passing with Context free grammars .Representing Meaning Division of Computer Science and Engineering 24 .Rule-Based Part of Speech Tagging .Human Morphological Processing (Chapter 1-3) UNIT II Computational Phonology and Text to Speech – Speech sounds and Phonetic Transcription – The phoneme and Phonological Rules .Other Issues .Context Free Grammars for English Syntax .Problems with the Simple Top-Down Parser -The Earley Algorithm .Human Parsing – Semantics .Finite state Morphological Parsing .Finite-State Grammars and Context-Free Grammars .CS317 SPEECH AND LANGUAGE PROCESSING Credits: 4 : 0 : 0 Marks: (40 + 60) UNIT I Introduction .non Word Errors .Overview of Hidden Markov Models .Mapping Text to phones for TTS .The Noun Phrase .Pronunciation in Humans-N-Grams.Finite State Transducers .Probabilistic Lexicalized CFGs .Context-Free Rules and Trees .The Viterbi Algorithms Revisited .Machine learning of Phonological Rules .Feature Extraction .Lexicalized and Probabilistic Parsing Probabilistic Context-Free Grammars .Finite-State Parsing Methods .

The Interlingua Idea: Using Meaning .Meaning Structure of Language .Alternative Conceptions of Meaning . UNIT II Vector Algorithms and Architecture: Vector and matrix algorithms – a vector architecturethe prime memory system-use of PE index to solve storage layout problems-SIMD language constructs-pipelined SIMD vector computers MIMD Computers and Multiprocessors: Shared memory and message passing architectureoverview of shared memory multiprocessor programming . 12.characterizing algorithm behavior for large problem size-programming parallel prefix-speedup and efficiency of parallel algorithms .Dialog Acts -Automatic Interpretation of Dialog Acts .the OpenMP language extension-pipelined MIMD-multithreading.Dialog Managers and Conversational Agents .parallel prefix algorithms .Introduction . Pearson Publications.Robust Analysis . 2000.Martin.The Design of a Syntax-Driven Analyzer .Machine translation-Language Similarities and Differences . James H.prefix problem . 21) Text Book: 1.the performance perspective. 14) UNIT V Semantic Analysis – Syntax-Driven Semantic Analysis .Dialog Structure and Coherence . UNIT III Distributed Memory Multiprocessors: Distributing data and operations among processor/memory pairs programming with message passing .Semantic Attachments for a Fragment of English . Daniel Jurafsky.Representing Linguistically Relevant Concepts Related Representational Approaches .Idioms and Compositionality .getting started in SIMD and MIMD programming-parallelism in algorithms.Quantifier Scoping and Complex Terms .shared memory programming alternatives and scope-a shared memory multiprocessor programming language .Dialogue &Conversational Agents . (Chapters 10.The Transfer Metaphor .Semantic Augmentations to CFG Rules . CS318 PARALLEL PROCESSING Credits: 4 : 0 : 0 Marks: (40 + 60) UNIT I Parallel Machines and Computations: Evolution of parallel architectures-interconnection networks-application of architectural parallelism .First Order Predicate Calculus .characterization of Division of Computer Science and Engineering 25 a K n u r a y i n U s r e v y it .Direct Translation .Computational Requirements for Representations . 19. Speech and Language processing. Potential for Parallel Computations: Parameters characterizing algorithm parallelism .Using Statistical Techniques Usability and System Development (Chapters 15.

Reactive and Hybrid Agents – Brook’s and Subsumption architecture .ontologies for Agent communication .Hybrid agents . Harry F.synchronizing different kinds of cooperative computations-waiting mechanisms-mutual exclusion using atomic read and write. Pearson Education.concurrent MetateM UNIT II Practical Reasoning Agents .Intelligent Agents . John Wiley & Sons Ltd.the message .Speech acts . UNIT V Implementing Synchronization and Data Sharing: The character of information conveyed by synchronization . 2003.task sharing and result sharing coordination-multiagent planning and synchronization .Multiagent interactions UNIT III Reaching Agreements – mechanism design – auctions – negotiations – argumentation Communication. An Introduction to Multi Agent Systems. 6.communication . 8) CS319 SOFTWARE AGENTS Credits: 4 : 0 : 0 UNIT I Introduction .Agent communication languages . 2002.data flow principles-data flow architectures.logics for multiagent system .formal methods in Agent . Text Book: 1. MPI -hardware managed communicationdistributed cache.coordination languages UNIT IV Working together cooperative distributed problem solving .Deductive reasoning Agents .Limitations of reactive agents .methodologies Unit -V Applications .Agents as theorem provers Agent oriented programming .passing interface. UNIT IV Data dependence and Parallelism: Discovering parallel operations in sequential code variables with complex names-sample compiler techniques . Fundamentals Of Parallel Processing. (Chapters 1-5. Michael Wooldridge. . Jordan and Gita Alaghband.oriented software engineering Text Book: 1. (Chapters 1-12) Division of Computer Science and Engineering 26 a K n u r a y i n U s r e v y it Marks: (40 + 60) .

and Events UNIT III Advanced C# Type Construction Techniques . and Threads . 16) Credits: 0: 0: 2 a K n u r a y i n U s r e v Marks: (40 + 60) y it CS322 C# AND  NET PROGRAMMING LAB Marks: (50 +50) 12 experiments will be notified by HOD from time to time CS323 MOBILE COMMUNICATION AND COMPUTING Credits: 5 : 0 : 0 Marks: (40 + 60) UNIT I Introduction .Type Reflection.Wireless transmission-frequencies for radio transmission – Signals – Antennas . Andrew Troelsen.NET Assemblies UNIT IV Processes.IO Namespace Text Book: 1. 2003.Understanding . AppDomains.Object-Oriented Programming with C# UNIT II Exceptions and Object Lifetime . Second Edition.NET Platform. Springer (India) Private Limited. Contexts. FDMA.Cellular systems Medium access control-SDMA.Interfaces and Collections . TDMA. Late Binding.Callback Interfaces. Delegates.Spread Spectrum .NET Remoting Layer .The System. CDMA – Comparison of S/T/F/CDMA Division of Computer Science and Engineering 27 . and Attribute-Based Programming UNIT V Object Serialization and the . (Chapters: 3-12. C# and the .CS320 COMPUTER LAB II Credit 0:0:2 Marks 50 + 50 12 experiments will be notified by HOD from time to time CS321 C# AND  NET PLATFORM Credits: 4 : 0 : 0 UNIT I C# Language Fundamentals .Signal propagation – Multiplexing – Modulation .

Radio access layer – Handover .Interactive Advertisements – Loyalty .Transmission/ time-out freezing .Wireless application protocol UNIT IV Pervasive Computing – Devices .Smart Sensors and Actuators .Home Automation – Energy Services .Access point control protocol UNIT III Mobile network layer .Snooping TCP .DECT – TETRA .Messaging Components – Database Components-Security Cryptographic Patterns and Methods . Mobile Communication.IEEE 802.Screen Phones .Entertainment Systems – Television Systems Game Consoles.Broadcast systems Cyclic repetition of data .Smart Appliances . 6-9.Digital video broadcasting UNIT II Wireless LAN . 21-23) 2.Mobile TCP .Indirect TCP . (Chapters 1-5.Infrastructure and adhoc networks .Travel And Business Services – Consumer Services .Smart Identification – Smart Cards-Smart Labels . Second Edition. Pearson Education. Lothar Merk.Fast retransmit/ fast recovery .11 – HIPERLAN – Bluetooth .Wireless ATM .Secure Socket Layer – New Services . Springer International Edition. 2000.Remote Home Health Care Services .Infrared Vs Radio transmission .Telecommunication systems – GSM .Smart tokens .Nicklous and Thomas Stober. 1.UMTS – IMT 2000 . Reference Book 1.Operating Systems Windows CE – Palm OS – Symbian OS – Java card – Client Middleware-Programming APIs-Smart Card Programming .Traditional TCP .adhoc networks Mobile transport layer . UNIT V Software – Java – Language Characteristics-Java Class Library-Java Edition –Micro Edition – Personal Java and Embedded Java – Development tools for Java.Windows CE-based Handheld Computer . 2003.Satellite systems-Applications – Basics – Routing – Localization – Handover .Support for mobility ..World Wide Web .Mobile IP . Wireless and Mobile Network Architecture. John Wiley and Sons Inc.Dynamic host configuration protocol .Appliances and Home Networking .System View. Principles of Mobile Computing.Selective retransmission Transaction oriented TCP .Communication Services .Jochen Schiller.EPOC based – Handheld Computer-Sub-Notebooks-Phones-Data transmission Capabilities-Smart Phones . Division of Computer Science and Engineering 28 a K n u r a y i n U s r e v y it .Home Services .Security Services .File systems .Information Access Devices – Handheld Computer -Palm OS-Based Devices .Digital audio broadcasting . Uwe Hansmann.Reference modelfunctions .WATM services .Automotive Computing .Location Management – Addressing -Mobile quality of service .Cryptographic tools.Shopping Payments Services Text Books: 1.Embedded Controls . Yi-Bing Lin and Imrich Chlamtac. 2001. Martin S.

Network and System Management.ATM Network ManagementBroadband Access networks and Technologies-HFC Technology-Data over Cable Reference Architecture-HFC Management-DSL Technologies-ADSL technology-ADSL ManagementTelecommunication Management Network-Operation Systems-TMN Conceptual ModelTMN Standard-TMN Architecture-TMN Management Service Architecture-An Integrated view of TMN-Implementation Issues.Case HistoriesChallenges of Information Technology Managers.Communication Protocols and Standards. SNMPv1 Network Management: Communication Model and Functional Models.encoding Structure.Performance management.Access Control.Compatibility with SNMPv1.Current Status and Future of Network Management.Remote Monitoring.System Management-Enterprise Management Solutions.CS324 NETWORK MANAGEMENT Credits: 5 : 0 : 0 Marks: (40 + 60) UNIT I Data Communication and Network Management Overview: Analogy of Telephone Network Management.Accounting Management.The History of SNMP Management.Commercial Network Management Systems.Service level ManagementDivision of Computer Science and Engineering 29 a K n u r a y i n U s r e v y it .Network Management: Goals.SNMP Management: RMON. Network Management Model.Fundamental of Computer Network Technology: Network Topology.The Information Model.SNMPv2 Structure of Management Information.Integrated Services: ISDN. UNIT IV Broadband Networks and services.SNMPv3.Network Management System Platform. LAN.SNMPv3 DocumentationSNMPv3 Documentation Architecture.ATM Remote Monitoring-Case Study.Data and Telecommunication Network.System Overview.Policy Based Management. UNIT V Network Management Tools and Systems.Transmission Technology.Security Management. Frame Relay. Organization and Functions.SNMPv3 Management Information Base.SNMPv2 System Architecture.Security. Network Node componentsWAN .History of Enterprise Management.Functional Model.Based Security Model. UNIT III SNMP Management: Major Changes in SNMPv2.Network Statistic Measurement Systems.Network Management Applications: Configuration management.Fault Management.Distributed Computing EnvironmentsTCP/IP.RMON2.Basic Foundations: Network Management Standards. Broadband and TMN Management.SNMPv3 User. UNIT II SNMP. and Broadband.SNMPv3 Applications.Report Management.Event correlation Techniques.Based Networks.Network Management Systems.SNMPv1 Network Management: Organization and Information Models.The Organization Model.Management Network.The SNMPv2 Management Information BaseSNMPv2 Protocol.ATM Technology.Organization Model.Architecture.Information ModelCommunication model.RMON SMI and MIBRMON1.Internet Organizations and Standards.Macros.The SNMP Model.

Network Management – MIBs and MPLS.Principles and Practice. 2000.NMS with Web Interface and Web Based Management. Network Management . Reference Book 1. a K n u r a y i n U s r e v y it Division of Computer Science and Engineering 30 .Management of a Storage Area Network. 2003. Stephen B. New York.Desktop Management Interface. Pearson Education.Web Interface to SNMP Management. Morris.Web-Based Management. Mani Subramanian. Text Book 1.Web Based Enterprise Management.WBEM: Windows Management Instrumentation.Embedded Web Based Management.Java Management Extensions. Addison Wesley.

s r e DEPARTMENT iv OF n COMPUTER SCIENCE U AND TECHNOLOGY a y n u r a K Division of Computer Science & Engineering y it AN-18 .

Program modules in PSEUDO Logic and Control structures in PSEUDO Linked lists. singly linked lists .Fixed length string method . Circular linked lists. Variables and expressions. constants.Linked list method.2.Garbage collection . Dummy Headers.Insertions and deletions . arrays.3) Division of Computer Science & Engineering AN-19 .variations on linked list structures.ADDITIONAL SUBJECTS Code CS246 CS247 CS248 CS249 CS250 CS251 CS252 CS325 CS326 CS327 CS328 CS329 CS330 CS331 CS332 CS333 CS334 CS335 CS336 CS337 CS338 CS339 CS340 CS341 CS342 CS343 CS344 CS345 CS346 CS347 Subject Name Data Structures Operating Systems Data and Computer Communication Design and Analysis of Algorithms System Software Cryptography and Network Security Software Engineering Advanced Computer Architecture Real Time Systems Parallel Processing Theory of Computation Soft Computing Biometrics J2ME Programming Software Engineering Principles Software Architecture Object Oriented Software Engineering Requirements Engineering Object Oriented Case Tools Lab Software Metrics and Quality Management Security in Computing User Interface Design Real Time System Software Software Testing Software Testing Lab System Development Lab Advanced Database Lab Operating Systems and Networking Lab Case Tools Lab Advanced Technologies Lab Credit 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 0:0:2 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 0:0:2 0:0:2 0:0:2 0:0:2 0:0:2 0:0:2 a K Credits: 4: 0 : 0 n u r a y i n U s r e v y it CS246 DATA STRUCTURES Marks: (40 + 60) UNIT I Algorithms for Data Structures . Doubly linked circular list .Specifics of PSEUDO .Data types.workspace/Index table method Processing efficiency considerations of the workspace/Index talk method .(Chapters1.

breadth-first search.pre-order. implementation of Binary trees . Second Edition.Binary trees. priority queues stacks .Search Strategies: Quantity-Dependent search techniques: Sequential Search. ch 4.L.Process Concept – Process Scheduling – Operation on Processes – Cooperating Processes – Interprocess Communication (ch 1.Array implementations of a stack . Networks .Minimum spanning tree . Introduction to Data Structures.height .the adjacency matrix.sparse matrices and generalized Dope vector implementation .linear representation of a binary tree .Linked list implementation of a sparse matrix.1-4. Binary Tree Search (Chapters 10.9) UNIT V Sorting: Internal sorts.Recursive Algorithms . Binary Search.linked representation of a binary tree. Graphs and networks.7. ch 3.Parsing and Evaluation of Arithmetic expressions using stacks .5) UNIT III Tree structures .Evaluating post fix expressions . implementation of graphs . The selection sort. ISBN-81-203-2097-2 a K Credits: 4 : 0 : 0 UNIT I Introduction – Overview of different types of systems – System Components . Prentice-Hall India 1997.Linked list implementation of a queue.11) Text Book: Bhagat Singh and Thomas L.5) n u r a y i n U s r e v y it CS247 OPERATING SYSTEMS Marks: (40 + 60) Division of Computer Science & Engineering AN-20 . Reference Book: Robert Kruse.The shortest path algorithm . The shell sort.UNIT II Circular implementation of a queue .linked list implementation of a stack .1-3.insertions into a binary tree .Implementing non –recursively – recursion .Operating System Services – System Calls – System Programs – System Structure – Virtual Machines – System design and Implementation .balanced trees. (Chapters 8. In orderpost order traversals of a binary tree .Threaded binary trees . The Insertion sort. (Chapters 4. The Heap sort External sorting or File sorting:The Merge sort -. The Quick sort. prefix and infix notations converting to infix expressions to postfix .Deletion algorithm for lists maintained with binary tree .General trees.Recursion.postfix.(Chapters 6.Topological ordering. The Bubble sort. Towers of Hanoi Problem .Naps.stacks and backtracking . AVL rotations . . Depth-first search. C.Tondo and Bruce Leung.7) UNIT IV Implementing a multidimensional array . Data Structures and Program Design in C.The 8 queens problem.binary tree traversals . Tata McGraw-Hill 1986.

8) UNIT III Deadlock Characterization – Methods for handling deadlocks.OSI – TCP/IP protocol architecture.1-12. (ch 10.2.16. ISBN 9971-51-388-9 (Chapters 1-14) CS248 DATA AND COMPUTER COMMUNICATION Credits: 4 : 0 : 0 a K UNIT I Data communication and networking overview: A communication model-data communication-data communication networking.4-12. Data link Control: Flow control-Error Control-HDLC.Deadlock Prevention – Deadlock Avoidance –Deadlock Detection – Recovery from deadlock . John Wiley and Sons.4. Peter Baer Galvin. Sixth Edition. Digital signals & analog signals – analog data digital signals and analog signals.1-13. Data transmission: Concepts and terminology-Analog and Digital data transmissionTransmission Impairments – channel capacity. ch 14. 2002. Operating System Concepts.6. Digital data communication techniques: Asynchronous and synchronous transmission -Types of Error -Error Detection -Error Correction-Line configurations.UNIT II Threads – Multithreading Models – Threading Issues – Java Threads – Basic Concepts of CPU Scheduling – Scheduling Criteria – Scheduling Algorithms .3.1-14.3.1-7. (Chapters 5-7) n u r a y i n U s r e v y it Marks: (40 + 60) Division of Computer Science & Engineering AN-21 .7.1-10. ch 13.Memory Management Background – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with Paging. ch 9) UNIT IV Introduction to Virtual Memory – Demand Paging – Process Creation – Page Replacement – Allocation of Frames – Thrashing – File Concept – Access Methods – Directory Structure – File-System Mounting – File Sharing – Protection. (Chapters:1-3) UNIT II Signal encoding techniques: Digital data.1-5.Process Synchronization – The Critical Section Problem – Synchronization Hardware – Semaphores – Classic Problems of Synchronization – Critical Regions – Monitors – OS Synchronization (ch 5. ch 11) UNIT V File-System Structure – File-System Implementation – Allocation Methods – Free-Space Management – Efficiency and Performance – Recovery – I/O Hardware – Application .4) Text Book: Abraham Silberschatz. 12. (ch 12.Interfacing. ch 7. ch 6. (ch 8. Greg Gagne. Protocol architecture: The need for a protocol architecture-a simple protocol architecture .I/O Interface – Kernel I/O Subsystem – Disk Structure – Disk Scheduling –Disk Management – Swap-space Management.

UDP. 2003.Frame Relay congestion control. Transport protocols: Connection – oriented TCP – TCP – Congestion control . 15) UNIT V Internet work protocols: Basic protocol functions – principles of internetworking – connectionless internetworking – Internet Protocol. Sections 13.circuit switching networks circuit switching concepts . Forouzan.113. Routing in Switched Networks: Routing in circuit switched network – Routing in packet switched network – least cost algorithms.Congestion control in packet switching networks . 12) UNIT IV Congestion control in switched Data network: Effect of congestion .control signaling .soft switch architecture-Packet switching principles-X.what to count and consider – mathematical backgroundrates of growth – divide and conquer algorithms – recurrence relations Searching and selection algorithms: sequential search – Binary search – Selection UNIT II Sorting Algorithms: Insertion sort – Bubble sort-Shell sort-Radix sort – Heap sort – Merge sort – Quick sort – External poly phase merge sort Numeric Algorithms: Calculating polynomials – Matrix Multiplication – Linear Equations n u r CS249 DESIGN AND ANALYSIS OF ALGORITHMS Marks: (40 + 60) a y i n U s r e v y it Division of Computer Science & Engineering AN-22 . Tata McGraw-Hill. ISBN: 0-07-058408-7.20) Text Book: 1. (Chapters 18. Local Area Network Overview: Background – Topologies and transmission media – LAN protocol architecture – bridges – layer2 and layer3 switches. (Chapters 13. Seventh Edition. Behrouz A.UNIT III Multiplexing: FDM – Synchronous TDM – statistical TDM – Asymmetric DSL – xDSL Circuit Switching and packet switching: switching networks . (Chapters 8. Data and Computer Communication. ISBN: 81-203-2355-6 Reference Book: 1. William Stallings. Credits: 4 : 0 : 0 a K UNIT I Analysis Basics: what is analysis.5. 10. 2004. Third Edition.25-Frame Relay. Data Communications and Networking.Congestion control Traffic management . Prentice Hall of India.

Analysis of Algorithms. (Chapter 1) UNIT II Assemblers: Basic Assembler Functions – Machine Dependent Assembler Features – Machine Independent Assembler Features – Assembler Design Options – Implementation Examples. (Chapter 2) UNIT III Loaders and Linkers: Basic Loader Functions – Machine Dependent Loader Features – Machine Independent Loader Features – Loader Design Options – Implementation Examples. 2002. (Chapter 3) UNIT IV Macro Processors: Basic Macro Processor Functions – Machine Independent Macro Processor Features – Macro Processor Design Options – Implementation Examples. Narosa publishing House. Credits: 4 : 0 : 0 UNIT I Background: Introduction – System Software and Machine Architecture – The Simplified Instructional Computer (SIC) – Traditional (CISC) Machines – RISC Machines. Jeffrey J.UNIT III Matching algorithms: String matching . 2.Graph Algorithms: Graph background and terminology – Data structure methods for graphs – Depth-First search and Breadth-First Traversal algorithms – Minimum spanning tree algorithms – Shortest-path algorithm – Bi connected component algorithm UNIT IV Parallel Algorithms: Parallelism Introduction – The PRAM Model – Simple parallel operations – parallel searching – parallel sorting – parallel numerical algorithms – parallel graph algorithms UNIT V Non-Deterministic Algorithms: NP – Typical NP Problems – What makes something NP – Testing possible solutions Other Algorithmic Techniques Text Book: 1.McConnell. Analysis and Internet Examples. (Chapter 4) Division of Computer Science & Engineering AN-23 a K n u r a y CS250 SYSTEM SOFTWARE i n U s r e v y it Marks: (40 + 60) . Sara Baase and Allen Van Gelder. 2000. Johnwiley and Sons. Algorithm Design: Foundations. Pearson Education. Reference Books: 1. 2002. Michael T. Computer Algorithms – Introduction to Design and Analysis. Goodrich and Roberto Tamassia.

2.3.20.14.UNIT V Other System Software: Text Editors – Interactive Debugging Systems.18.17.1.509 Authentication Service.12.5. CS251 CRYPTOGRAPHY AND NETWORK SECURITY Credits 4:0:0 UNIT I Services.2. System Software.20.2] UNIT II Principles of public Key Cryptosystems – RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Basics of Elliptic Curve Cryptography.3.16.2.12.7.18.1. 1999.2.4. (Chapter 7 : Sections 7.4.5. [Sections: 15.Dhamdhere.1.3.2.3. Reference Book: D.16.2.4] UNIT III MD5 Message Digest Algorithm – Secure Hash Algorithm – HMAC – Digital signature Standard – Kerberos Version 5 – X.6] UNIT V Web Security considerations – Secure Sockets Layer and Transport Layer Security – Secure Electronic Transactions – Intruders – Intrusion Detection – Password Management – Firewall design principles – Trusted systems.1. Systems Programming and Operating Systems.1.2.9.10. Tata McGraw-Hill Company. Mechanisms and Attacks – Block Cipher principles – Data Encryption Standard – Strength of DES – Evaluation criteria for AES – AES Cipher.3) Text Book: L. [Sections: 12.3.10.2] a K UNIT IV Pretty Good Privacy – S/MIME – IP Security Overview – IP Security Architecture – Authentication Header – Encapsulating Security Payload – Combining Security Associations – Key Management. ISBN : 0-07-463579-4. An Introduction to System Programming. 1999.10.3.2] Division of Computer Science & Engineering AN-24 n u r a y i n U s r e v y it Marks(40+60) .2.2.15.16.16. ISBN : 81-7808-036-2. [Sections: 17.3.4. [Sections: 9.18.1. Addison Wesley.16.14.1.5.3.1.1. [Sections: 1.1.1.17.Beck.16.13.M.

Text Book: 1. processes.902-5 Reference Book: 1. UNIT III Concerning Objects – What is OO – the OO development process – use cases – UML – OO system design – OO program design – OO measurement – Writing the programs – standards and procedures – guidelines – documentation – Testing the programs – Software faults and failures – Testing issues – unit testing – integration testing – testing OO systems – test planning – automated testing tools. n u r a y i n U s r e v Marks: (40 + 60) y it performance testing – installation testing – system – training – nature – problems – UNIT V Evaluating products.Practical Process modeling – Planning and Managing the project – tracking Progress – project personnel – Effort Estimation – Risk management – the project plan – process models and project management. products. availability. Charlie Kaufman. processes. and resources Division of Computer Science & Engineering AN-25 . 2003.ISBN:81-203-2213-4.Radia Perlman. 2002.Modeling the Process and Life Cycle – the meaning – Software Process Models – Tools and Techniques . Prentice Hall. Prentice-hall. Second edition. Third Edition. and resources – approaches to evaluation – selecting an evaluation techniques – assessment vs prediction – evaluating products – evaluating processes – evaluating resources – Improving predictions. Network security. a K UNIT IV Testing the system – principles of system testing – function testing – reliability.decomposition and modularity – architectural styles – issues – characteristics – techniques – evaluation and validation – documenting the design. ISBN No: 81-7808 . Cryptography and Network Security. William Stallings. CS252 SOFTWARE ENGINEERING Credits: 4: 0: 0 UNIT I Software Engineering – A system Approach – An Engineering Approach – Members of the development team . and maintainability – acceptance testing – automated system testing – test documentation –– delivering the documentation – maintaining the system – the changing system – measuring maintenance characteristics – techniques and tools.Mike Speciner. UNIT II Capturing the requirements – The Requirements process – types – Characteristics – prototyping requirements – requirements documentation – participants in the process – requirements validation – measuring – choosing a requirements specification Technique – Designing the system – What is Design? .

Text Book: 1.Level parallelism: concepts and challenges .operations in the instruction set .The future of software engineering. Software Engineering – An Engineering Approach.crosscutting issues: Hardware versus software speculation mechanisms. James F. (Chapter 1.Level Parallelism with Software Approaches: Basic compiler Techniques for Exposing ILP .Encoding an instruction set – the role of compiler.Static Branch Prediction . (Appendix A) UNIT III Instruction . 2000.Peters. Witold Pedrycz.ISBN 81-7808-459-7(Chapters 1-13. ISBN 9971-51-309-9 CS325 ADVANCED COMPUTER ARCHITECTURE Credits: 4 : 0 : 0 UNIT I Fundamentals of Computer Design: Introduction .Memory Addressing .4) Reference Book: 1.The Major Hurdle of pipelining . Software Engineering – Theory and Practice.Addressing Modes for signal processing .overcoming data Hazards with Dynamic scheduling .Hardware .Instruction for control flow .– improving prediction – improving products – improving processes.Taking advantage of More ILP with Multiple Issue .Static Multiple issue: The VLIW approach .High Performance instruction delivery . 2001 .advanced compiler support for Exposing and Exploiting ILP .Extending the MIPS pipeline to handle multicycle operations crosscutting issues.Classifying Instruction set Architectures . Instruction set Principles and Examples: Introduction .Type and size of operands -Operands for media and signal processing .14. John Wiley and Sons.Based speculation .pipeline Hazards Implementation . Pearson Education. Third Edition.Studies of the Limitations of ILP .Hardware support for Exposing more parallelism at compile Time .Dynamic scheduling: Examples and the Algorithm .Measuring and Reporting performance Quantitative Principles of computer design.Reducing Branch costs with Dynamic Hardware Prediction . (Chapter 4) a K n u r a y i n U s r e v y it Marks: (40 + 60) Division of Computer Science & Engineering AN-26 .Limitations of ILP for Realizable processors – thread level parallelism – crosscutting issues. 2) UNIT II Pipelining: Introduction . Shari Lawrence Pfleeger. (Chapter 3) UNIT IV Exploiting Instruction .

2001. John L.Cache Performance .Virtual Memory . ISBN : 1-55860 – 596 – 7.Clock driven Scheduling. 2nd Edition. ISBN NO: 81-7808-4635 (Chapters 1-8). (Chapter 5) Text Book: 1.Review of the ABCs of the caches .Protection and Examples of Virtual Memory. Pearson Education. Real –Time Systems Design and Analysis – Prentice Hall of India.UNIT V Memory Hierarchy Design: Introduction . Jane W. (Chapter 7) UNIT V Resources and source access control. Phillip A.Reducing Cache Miss Penalty or Miss Rate via Parallelism . (Chapter 8) (NOTE: Derivations / Proofs of algorithms not included) Text Book: 1. 2000.A Reference model of Real Time Systems. 2003.2 and 3) UNIT II Commonly used approaches to Real time scheduling . (Chapters 4 and 5) UNIT III Priority Driven Scheduling of Periodic Tasks. CS326 REAL TIME SYSTEMS Credits: 4:0:0 UNIT I Typical Real Time Applications .Main Memory and Organizations for Improving Performance . Hennessy and David Patterson. a K n u r a y i n U s r e v y it Marks: (40+60) Division of Computer Science & Engineering AN-27 . ISBN NO: 81-203-1684-3.Reducing Miss Rate . (Chapter 6) UNIT IV Scheduling Aperiodic and Sporadic Jobs in priority driven Systems. Computer Architecture. Real-Time Systems.Reducing Hit Time . Elsevier.Reducing Cache Miss Penalty .Hard Versus Soft Real Time Systems .Liu. Laplante. Reference: 1. Third Edition. A Quantitative Approach. (Chapters 1.S.Memory Technology .

MPI -hardware managed communicationdistributed cache. Temporal behaviour of parallel programs: temporal characterization of cache behaviour – read sharing in multiprocessors with distributed caches – message waiting in message passing multiprocessors – conclusion. UNIT IV Data dependence and Parallelism: Discovering parallel operations in sequential code variables with complex names-sample compiler techniques .CS327 PARALLEL PROCESSING Credits: 4 : 0 : 0 Marks: (40 + 60) UNIT I Parallel Machines and Computations: Evolution of parallel architectures-interconnection networks-application of architectural parallelism . 2003.data flow principles-data flow architectures. MIMD Computers and Multiprocessors: Shared memory and message passing architecture-overview of shared memory multiprocessor programming . Text Book: Harry F.shared memory programming alternatives and scope-a shared memory multiprocessor programming language . Fundamentals Of Parallel Processing.parallel prefix algorithms characterizing algorithm behavior for large problem size-programming parallel prefixspeedup and efficiency of parallel algorithms .passing interface.the message .getting started in SIMD and MIMD programming-parallelism in algorithms. Pearson Education. Jordan and Gita Alaghband. Potential for Parallel Computations: Parameters characterizing algorithm parallelism . UNIT III Distributed Memory Multiprocessors: Distributing data and operations among processor/memory pairs programming with message passing . UNIT II Vector Algorithms and Architecture: Vector and matrix algorithms – a vector architecturethe prime memory system-use of PE index to solve storage layout problems-SIMD language constructs-pipelined SIMD vector computers.characterization of communication . UNIT V Implementing Synchronization and Data Sharing: The character of information conveyed by synchronization .the OpenMP language extension-pipelined MIMD-multithreading.prefix problem . Interconnection Networks : network characteristics – permutations – static networks – dynamic networks – combining networks – performance.synchronizing different kinds of cooperative computations-waiting mechanisms-mutual exclusion using atomic read and write. a K n u r a y i n U s r e v y it Division of Computer Science & Engineering AN-28 .the performance perspective.

Reduction of the number of states in Finite Automata .Characteristics of Neural Networks .free Languages . An Introduction to Formal Languages and Automata.Taxonomy of Neural Network Architectures .Effect of Tuning Parameters of the n u r a y i n U s r e v y it CS329 SOFT COMPUTING Marks: (40 + 60) Division of Computer Science & Engineering AN-29 . 2001.Early Neural Network Architectures . Narosa Publishing House.10) UNIT V A Hierarchy of Formal Languages and Automata – An Introduction to Computational Complexity: Efficiency of Computation – Turing Machines and Complexity .Neural Network Architectures .Model of an Artificial Neuron .Combining Turing machine for complicated task.Deterministic Context . (Chapters 4. a K Credits: 4: 0: 0 UNIT I Introduction to Artificial intelligence Systems .Deterministic Pushdown Automata .The Complexity Classes P and NP.Membership algorithm for Context-free Grammars.Human Brain .Other models of Turing machine.Basic concepts of Neural networks .Language family and Complexity Classes . (Chapters 7. Peter Linz.Equivalence of Deterministic and Non.Pushdown Automata and context .deterministic Finite Accepters . (Chapters 11.Regular Grammars.8) UNIT IV Turing Machines: The Standard Turing machine.Single Layer Artificial Neural Network .Connection between Regular expressions an regular languages .Back Propagation Networks .Turing thesis .Learning Methods . (Chapters 9. .3) UNIT II Properties of Regular Languages .Context-free Languages : Context-free Grammars Parsing and ambiguity .Regular Languages and regular grammars: Regular Expressions .Finite Automata: Deterministic Finite Accepters – Non-deterministic Finite Accepters .14) Text Book: 1.Architecture of a back Propagation Network .Important Normal Forms .Free Languages .5.6) UNIT III Pushdown Automata: Non-deterministic Pushdown Automata . (Chapters 1.2.Fundamentals of Neural Networks .ISBN: 81-7319-460-2.Programming – Simplification of Context Free Grammars: Methods for transforming grammars .CS328 THEORY OF COMPUTATION Credits: 4: 0: 0 Marks: (40 + 60) UNIT I Introduction to the Theory of computation .Parsing an Membership .Grammars for Deterministic Context free languages –Properties of Context Free Languages.Back propagation Learning – Applications .Context-Free grammars .

FAM involving a Rule Base .ISBN-81203-2186-3.FAM Rules with Multiple Antecedents/Consequents – Applications .The Hopfield Memory . Vijayalakshmi Pai.Integration of Neural Networks.Crisp Logic .Inference by Fuzzy BP . 2003.Variations of Standard Propagation Algorithm.Fundamentals of Genetic Algorithms . UNIT IV Genetic Algorithms .Adaptive Resonance Theory – Introduction .Applications UNIT V Hybrid Systems .Crisp Sets . Fuzzy Logic and Genetic Algorithms – Simplified fuzzy ART map-Working of Simplified fuzzy ART map-Application-Recent trends.Applications.Fuzzy Logic Controller . (Chapters 1.3) Division of Computer Science & Engineering AN-30 . Prentice Hall India.Fuzzy Back propagation Networks . (Chapters 1 . Neural Networks.Defuzzification Methods – Applications .GA in Fuzzy Logic Controller Design .15) CS330 BIOMETRICS Marks (40+60) a K n u r a y i n U s r e v y it Credit 4:0:0 Unit –I Introduction to biometrics – Fingerprint verification – Face recognition.Convergence of Genetic Algorithm – Applications .Multilevel Optimization .ART1 ART2 .Generational Cycle .Fuzzy Sets .Fuzzy Set Theory .Single Association FAM Fuzzy Hebb FAMs .Fuzzy versus Crisp .Fuzzy Neuron .Predicate Logic . An introduction .Inversion and Deletion .Soft Computing Tools .Fuzzy Associative Memories .A.Working Principle – Encoding .BPN .Applications Text Book: 1.Crisp Relations .Problem Description of Optimum Design .Applications UNIT III Fuzzy Logic . UNIT II Associative Memory – Autocorrelators – HeteroCorrelators .Fuzzy Systems .Fuzzy Constraints . And Genetic Algorithms Synthesis and Applications.Genetic Algorithm History Basic Concepts .Exponential BAM – Applications .Fitness Function – Reproduction .Real life problem . Fuzzy Logic.Inheritance operators – Crossover .Fuzzy BP Architecture Learning in Fuzzy BP .Genetic Modeling .Selection of various parameters in BPN .FAM.Mutation operator .Bitwise Operators .Genetic algorithm based BPN .GA Based Weight Determination . S.Creation of Offsprings .Rajasekaran and G.LR-type Fuzzy numbers .Fuzzy Logic Fuzzy Rule Based System .Advances in GA .Fuzzy Logic Controlled Genetic Algorithms .Differences and similarities between GA and other traditional methods .Fuzzy Relations .

14) Unit – V Large scale systems – Multimodal biometrics – Smartcard based authentication. CS331 J2ME PROGRAMMING Credit: 4:0:0 UNIT I J2ME Overview – Small Computing Technology – J2ME Architecture and Development Environment UNIT II J2ME User Interface – Command.Infrared identification of faces and body parts – Keystroke dynamics based authentication. Wiley. 18). 2002.10) Unit – IV Automatic gait recognition – Objective odour measurements . Kluwer Academic Publishers. Biometrics – Personal Identification in Networked Society. ISBN: 81.Recognizing persons by their Iris pattern – Retina identification. Items and Event Processing – High Level Display Screens – Low Level Display: Canvas UNIT III J2ME Data Management – Record Management System – J2ME Database Concepts UNIT IV JDBC and Embedded SQL – J2ME Personal Information Manger Profile UNIT V J2ME Networking and Web Services – Generic Connection Framework – Web Services a K n u r a y i n U s r e v y it Marks (40+60) Division of Computer Science & Engineering AN-31 . 1999. Anil Jain.265. Reference: 1. (Chapters 11 . 16 and 18) Text Book: 1. Samir Nanavati.0273 – 8. Raj Nanavati. (Chapters 15. Ruud Bolle. Sharath Pankanti. (Chapters 4 – 6) Unit – III Automatic online signature verification.Unit – II Hand geometry based verification . Micheal Thieme. ISBN: 0-7923-8345-1 (Chapters 1-16. (Chapters 7 .Ear biometrics – DNA based identification.Speaker recognition . Biometrics – Identity Verification in a Networked World.

Verification and Validation. On Managing Software Quality: Measures and Numbers.Manual test Techniques. J2ME – In a Nutshell. 2003. ISBN: 81-7366343-2 CS332 SOFTWARE ENGINEERING PRINCIPLES Credits 4:0:0 UNIT I Introduction to Software Engineering Management: Planning and Controlling a Software Development project. Software Design: Design Considerations – Design Methods.Design Documentation .Producing a KWIC-Index-Architectural Styles. UNIT II People Management and Team Organization. UNIT III Requirements Engineering: Requirement Elicitation.Thou Shalt Formalize. Software Architecture: An Example.Text Book: 1. ISBN: 0-07-053415-2 Reference Book: 1. 2002.Fault Based Test Techniques-Error Base Test Techniques-Comparison of test techniques – Different test Stages. Configuration Management: Tasks and Responsibilities.Verification and Validation.Requirements Specification DocumentRequirements Specification Techniques-A Modeling Framework.Design Patterns.Specification by Pre – and Post Conditions.Organizational and Managerial issues. Kim Topley. Software Maintenance: Major Causes of Maintenance Problems – Reverse Engineering and Restructuring. Cost Estimation: How not to estimate costEarly Algorithmic models. The Software Life Cycle Revisited: Waterfall model. Tata McGraw Hill Edition. O’Reilly publications.Notations that support the Design Process.Prototyping – Incremental Development-Rapid Application Development-Intermezzo. UNIT V User interface design: What/Where is User Interface? . a K UNIT IV Software Testing: Test Objectives.Human Factors in Human–Computer Interaction –Role of Models in Human–Computer Interaction – Design of Interactive Division of Computer Science & Engineering AN-32 n u r a y i n U s r e v Marks (40+60) y it .Spiral Modeltowards a Software factory-Process modeling. Project Planning and Control: System view of Project control – Taxonomy of Software Development projects-Risk Management-Techniques for Project planning and Control.Testing and the Software Life Cycle-Verification and Validation Planning and Documentation. J2ME – The Complete Reference.distribution of Manpower over time. Formal Specification: Informal Specification Techniques – Model Oriented Specifications – Algebraic Specifications.Verification and Validation.Taxonomy of Quality Attributes-Perspectives on Quality-Quality system-Software Quality Assurance-Capability Maturity Model.Coverage Based Test Techniques.Configuration Management Plan. James Koegh.Later Algorithmic Models.

UML Quick tour: UML diagram summary-General diagramming conventions-The diagram-managing complexity. Process and deployment design: Physical data viewpoint-process viewpoint-deployment viewpoint.ISBN: 9971-51-51-357-9. (Chapters 6-7) UNIT IV Subsystem Design: Terminology.Systems – Task analysis. a K n u r a y i n U s r e v y it Marks: 40+60 Division of Computer Science & Engineering AN-33 . Roles of software architect: Relationship to other key roles in development organization-skills and background for the architect-Injecting architecture experience Structuring the architecture team-Traps and pitfalls associated with the role of software architect. (Chapters 1-11. Hans van Vliet.Non-Technical Aspects of Software Reuse.Reuse Tools and Techniques-perspectives of Software reuse. Software Tools: Toolkits – Language Centered Environments. John Wiley and Sons. Software Engineering Principles and Practice. Software Reusability: Reuse Dimensions – Reuse of Intermediate products. 13-19). and layers-Mapping subsystem and layers to implementation. 2002. CS333 SOFTWARE ARCHITECTURE Credit: 4:0:0 UNIT I Introduction: what is software architecture-why architect-other software architecture approaches. Software architecture and development process: Overview of iterative development-Requirements management-Management of technology road map-Effective technical meetings-Traps and pitfalls of software architecture process activities-computeraided software engineering. Software Reliability: An Example – Fault – Tolerant DisksEstimating Software Reliability. interface.Modeling subsystems. (Chapters 4 – 5) UNIT III System context and domain analysis: Conceptual diagram-context view points-domain analysis techniques-analysis view points Component design and modeling: overviewcomponent viewpoint-component interaction viewpoint-component state modeling-modeling highly configurable component architectures. Transactionn and data design: Logical data architecture-logical data viewpoint-data model design-transaction design. (Chapters 1-3) UNIT II Example system Overview: System overview-overview of system interfaces-constraintsmajor operational requirements and software requirements . (Chapters 8-10). Second Edition.Reuse and the software life cycle. Text Book: 1.Specifications of the User Interface details-Evaluation.Process Centered Environments.

) UNIT III Object Design: Reusing Pattern Solutions: Introduction: Bloopers-An Overview of Object Design-Reuse Concepts: Solution Objects Inheritance and Design Patterns-Reuse Activities: Selecting Design Patterns and Components-Managing Reuse. (Chapters 11. ISBN-81-265-0363-7. System Design: Decomposing the System: Introduction: A Floor Plan Example-An Overview of System Design-System Design Concepts-System Design Activities: From Objects to Subsystems.7808 – 546 . Modeling with UML: Introduction-An Overview of UML-Modeling Concepts-A Deeper View into UML. Applying the viewpoints: Bottom-up architecture development-top-down architecture development-message protocol and interface development-reengineering existing systemsdocumenting the architecture-conclusion. Large – Scale Software Architecture-A Practical Guide Using UML. Pearson Education. ISBN 81 . (Chapters: 1-4. Wiley.) UNIT II Analysis: Introduction: An Optical Illusion-An Overview of Analysis-Analysis ConceptsAnalysis Activities: From Use Cases to Objects-Managing Analysis.UNIT V Architecture techniques: Architecture development techniques-software partitioning strategies-separation of concerns-software changeability and dependency management-using architectural patterns-integration strategies-establishing architecture to support development. Object Design: Specifying Division of Computer Science & Engineering AN-34 a K n u r a y i n U s r e v y it Marks (40+60) . Edition 1998. Requirements Elicitation: Introduction: Usability Examples-An Overview of Requirements Elicitation-Requirements Elicitation Concepts-Requirements Elicitation Activities-Managing Requirements Elicitation.12). 2003. System Design: Addressing Design Goals: Introduction: A Redundancy Example-An Overview of System Design Activities-Concepts: UML Deployment Diagrams-System Design Activities: Addressing Design Goals-Managing System Design. Reference Book: 1. Text book: 1. Paul Clements and Rick Kazman. Jeff Garland and Richard Anthony.1 CS334 OBJECT-ORIENTED SOFTWARE ENGINEERING Credit 4:0:0 UNIT I Introduction to Software Engineering: Introduction: Software Engineering Failures-What is Software Engineering? -Software Engineering Concepts-Software Engineering Development Activities-Managing Software Development.Project Organization and Communication: Introduction: A Rocket Example-An Overview of Projects-Project Organization Concepts-Project Communication Concepts-Organizational Activities. Len Bass. (Chapters: 5-7. Software Architecture in Practice.

ISBN: 81-7808-549-6.) Text Book: 1.Commitment and Recommendations (Chapter 1. Second Edition. Applying UML and Patterns. ISBN: 81-297-0433-1. Object-Oriented Software Engineering. (Chapters: 14-16. Second Edition. (Chapters: 8-10. Rationale Management: Introduction: Slicing HamAn Overview of Rationale-Rationale Concepts-Rationale Activities: From Issues to Decisions-Managing Rationale. (Chapters: 1113.) UNIT V Project Management: Introduction: The STS-51L Launch Decision-An Overview of Project Management-Project Management Concepts-Project Management Activities. Credits 4:0:0 a K UNIT I Introduction. 2004. and 2003. Software Life Cycle: Introduction: Polynesian Navigation-IEEE 1074:Standard for Developing Life Cycle Processes-Characterizing the Maturity of Software Life Cycle Models-Life Cycle Models.Dutoit.Requirements Process –Benefits of a Process Approach-Pitfalls of using a Process Approach .The State of the Industry Today –The Need to use Effective Requirements Practices. Methodologies: Putting It All Together: Introduction: The First Ascent of K2-Project Environment-Methodology Issues-A Spectrum of Methodologies.) UNIT IV Testing: Introduction: Testing the Space Shuttle-An Overview of Testing-Testing ConceptsTesting Activities-Managing Testing. Reference Book: 1. Pearson Education. Craig Larman. Mapping Models to Code: Introduction: A Book Example-An Overview of MappingMapping Concepts-Mapping Activities-Managing Implementation.Define the Real Customer Needs -Recommendations.Train Developers –Variety of techniques –Train Requirements-Document-automated tools –collect requirements –Formal methods Chapter (3-4 ) n u r CS335 REQUIREMENTS ENGINEERING Marks (40+60) a y i n U s r e v y it Division of Computer Science & Engineering AN-35 . Bernd Bruegge.2) UNIT II Establish and utilize : A joint Team Responsible for the Requirements -What is a Joint teamCreated – Joint team meet –Metrics-ROI-Customer and supplier roles.Interfaces: Introduction: A Railroad Example-An Overview of Interface SpecificationInterface Specification Concepts-Interface Specification Activities-Managing Object Design.Commited to the approach. Configuration Management: Introduction: An Aircraft Example-An Overview of Configuration Management-Configuration Management ConceptsConfiguration Management Activities-Managing Configuration Management. Allen H. Pearson Education.

Effective Requirements Practices. Applying the Seven Basic Quality Tools in Software Development: Ishikawa’s Seven Basic tools – Checklist – Pareto Diagram – Histogram – Run charts – Scatter Diagram – Control chart – Cause-and-Effect Diagram – Relations Diagram. CS336 OBJECT ORIENTED CASE TOOLS LAB Credits 0:0:2 12 experiments will be notified by the HOD from time to time.Process Designed . Ralph R. 2. 2001. Addison Wesley.Young. CS337 SOFTWARE METRICS AND QUALITY MANAGEMENT Credits: 4:0:0 Marks: (40+60) a K UNIT I Software Quality: Total Quality Management.In-Process Quality Metrics – Metrics for Software Maintenance – Collecting software Engineering Data.The Prototyping Approach – The spiral Model – The iterative Development Process Model – The object-oriented Development Process – The cleanroom Methodology – The Defect Prevention Process – Process Maturity Framework and Quality Standards. Defect Removal Effectiveness: A closer Look at defect removal Effectiveness – Defect Removal Effectiveness and Quality Planning Division of Computer Science & Engineering AN-36 n u r a y i n U s r e v y it Marks (50+50) . Software Development Process Models: The waterfall Development model . Organizational and Project best practices-How to proceed (Chapter 10-12 ) Text Book: 1. Familiar Proven industry . ISBN :0-201-70912-0.NeededGoals –sample requirements-Organizations create or tailor – Tailoring of process –web support -Iterate the system requirements and architecture repeatedly-The System Engineering Process -Recommendations –Guidelines Chapter (5-6 ) UNIT IV Use A Mechanism To Maintain Project Communication -Select Familiar methods and maintain a set of work products-Perform Requirements Verification and validation Chapter (7-9 ) UNIT V Provide an Effective Mechanism to Accommodate Requirements Changes -Perform the Development Effort Using Known. Fundamentals of Measurement Theory: Definition – Level of Measurement – Some Basic Measures – Reliability and Validity – Measurement Errors Criteria for causality (Ch :1-3) UNIT II Software Quality Metrics Overview: Product Quality Metrics .UNIT III Use and Continually improve a Requirements Process -Process.

Division of Computer Science & Engineering AN-37 .Satisfaction with Company. Conducting Software Project Assessments: Audit and Assessment .Quality and Quality Management Metrics .Reliability.In-Process Metrics for Software Testing – Quality management – Possible metrics for acceptance testing to evaluate vendor developed software.Halstead's Software Science .Cyclomatic Complexity . (Ch :15-19) a K n u r a y i n U s r e v y it Text Book: 1.Software Process Assessment Cycle .Syntactic Constructs .Establishing the Alignment Principle .Design and Complexity Metrics -Productivity Metrics .Keep It Simple—or Face Decomplexification . Metrics and Models in Software Quality Engineering. Measuring Process Compliance . 2003. and Defect Rate Collecting Customer Outage Data for Quality Improvement .In-Process Metrics for Outage Availability.Celebrate the Journey.Measuring the Value of Process Improvement Measuring Process Adoption. Pearson Education. Concluding Remarks. Function Point Metrics to Measure Software Process Improvement: Software Process Improvement Sequences . Second Edition. Complexity Metrics and Models: Lines of Code .Kan. ISBN: 81-297-0175-8. Do's and Don'ts of Software Process Improvement: Measuring Process Maturity .Recommendations and Risk Mitigation.– Cost Effectiveness of Phase Defect Removal – Defect Removal Effectiveness and Process Maturity Level (Ch :4-6) UNIT III The Rayleigh Model: Reliability Models – The Rayleigh Model – Basic assumptions – Implementation – Reliability and Predictive Validity.Lessons learned for OO projects. (Ch :7-9) UNIT IV In-Process Metrics and Reports: Orthogonal defeat classification .A Proposed Software Project Assessment Method.Take Time Getting Faster .Process Improvement Economics – Measuring Process improvements at activity levels.Structure Metrics. Stephen H. Metrics and Lessons Learned for Object-Oriented Projects: Object-Oriented Concepts and Constructs .Analyzing Satisfaction Data . not just the destination. Availability Metrics: Definition and Measurements of System Availability . Availability. Exponential Distribution and Reliability Growth Models: The Exponential Model –Reliability Growth Models – Model Assumptions – Criteria for Model Evaluation – Modeling Process – Test Compression Factor – Estimating the distribution of total defects over time. Quality Management Models: The Rayleigh Model Framework – The code Integration pattern – The PTR Submodel – The PTR Arrival / Backlog Projection Model – Reliability Growth Models – criteria for model evaluation. (Ch :10-14) UNIT V Conducting In-Process Quality Assessments: Preparation Phase -Evaluation Phase Summarization Phase . Measuring and Analyzing Customer Satisfaction: Customer Satisfaction Surveys .Measuring Process Capability .Software Process Maturity Assessment and Software Project Assessment .Staged versus Continuous Debating Religion .

a K n u r a y i n U s r e v y it CS339 USER INTERFACE DESIGN Marks (40+60) Credits 4:0:0 UNIT I Human Factors of Interactive Software: Introduction .Physical Security.Reference Book: 1.Security Requirements .Nonmalicious Program Errors .Accommodating Human Diversity – Goal for our Profession . 2003. (Chapter: 3) UNIT II Protection in General . Charles P.Sensitive Data – Inference . (Chapter: 5) UNIT IV Database Security: Introduction to Databases . (Chapter : 6) UNIT V Administering Security: Security Planning .Organizational Security Policies .Targeted Malicious Code .File Protection Mechanisms . CS338 SECURITY IN COMPUTING Credits : 4:0:0 Marks: (40+60) UNIT I Program Security: Secure Programs .Implementation Examples.Security Policies Models of Security .Purpose Operating Systems: Protected Objects and Methods of Protection .Goals of System Engineering . 2003. Pfleeger & Shari Lawrence Pfleeger. (Chapter : 8) Text Book: 1. Principles.Controls Against Program Threats.Third Edition. Alan C.Assurance in Trusted Operating Systems .User Authentication (Chapter: 4) UNIT III Designing Trusted Operating Systems: What Is a Trusted System? .User Interface Design Goals . Gillies.Risk Analysis .Multilevel Databases . Second Edition. Software Quality Theory and Management. ISBN: 981-243-859-9.Pearson Education.Control of Access to General Objects . ISBN : 81-297-0042-5.Reliability and Integrity .Memory and Address Protection . Security in Computing. Thomson.Proposals for Multilevel Security.Motivations for Human Factors in Design .Trusted Operating System Design .Theories. and Guidelines: High-Level Division of Computer Science & Engineering AN-38 .Viruses and Other Malicious Code .

Applying CSCW to Education. (Chapters 15.Form Fillin . (Chapters 3 .Evaluation During Active Use .Fast Movement Through Menus .Hypermedia and the World Wide Web: Introduction . Rain Tree . Usability Testing.Database Query and Phrase Search in Textual Documents – Multimedia Document Searchs-Information Visualization – Advanced Filtering .Dialog Boxes.Goals of Cooperation .Theories .Organizational Design to Support Usability .Third Edition. Designing the User Interface.Computer-Supported Cooperative Work: Introduction .Synchronous Distributed: Different Place. (Chapters 13.Visual Thinking and Icons Direct-Manipulation Programming .Hypertext and Hypermedia . Same Time . (Chapters 6. Same Time Face to Face: Same Place.16) a K Text Book: 1. Form Fillin. User Interface Design.World Wide Web .Menu Layout .7) UNIT IV Multiple-Window Strategies:Introduction – Individual -Window Design -Multiple-Window Design -Coordination by Tightly-Coupled Windows .Controlled Psychologically-Oriented Experiments .Expert Reviews . Pearson Education .Genres and Goals for Designers . Surveys. 2004. (Chapters 1.Response Time and Display Rate . and Dialog Boxes: Task-Related Organization .5) UNIT III Direct Manipulation and Virtual Environments: Introduction .Object/Action Interface Model – Principles . 13-16). Different Place . 2) UNIT II Managing Design Processes: Introduction .14) UNIT V Information Search and Visualization: Introduction .Users and Their Tasks . ISBN :1 903337 19 4.Examples of DirectManipulation Systems . Ben Shneiderman. Reference: 1. and Continuing Assessments: Introduction .The Three Pillars of Design .Legal Issues Expert Reviews.ObjectAction Interface Model for Web Site Design.Ethnographic Observation Participatory Design Scenario Development . Jenny Le Peuple.Social Impact Statement for Early Design Review . Robert Scane. 2004.Asynchronous Interactions: Different Time.Usability Testing and Laboratories -Surveys Acceptance Tests .Explanations of Direct Manipulation . n u r a y i n U s r e v y it Division of Computer Science & Engineering AN-39 .Item Presentation Sequence . ISBN : 81-7808-262-4 (Chapters 1-7.Home Automation -Remote Direct Manipulation Virtual Environments Menu Selection.Interface-Building Tools Evaluation and Critiquing Tools.Guidelines for Data Display Guidelines for Data Entry .Development Methodologies .Software Tools: Specification Methods .Balance of Automation and Human Control.Image Browsing and Tightly-Coupled Windows -Personal Role Management and Elastic Windows .

ISBN : 81-7808-463-5.S. (Chapters 1. (Chapters 1 .6) UNIT IV Execution Time Prediction-Measurement of Software by software-Program Analysis with Timing Schema-Prediction by optimization-System Interferences and architectural-Keeping Time on computers-Timer applications-properties of real and Ideal Clocks-Clock ServersClock synchronization. and tests – Strategies and methods for test case design I. Reference Book: 1.4) Division of Computer Science & Engineering AN-40 .10) Text Book: 1.Real time Language features-Ada-Java and real time extensionsCSP and Occam-Estherel Concepts-Operating Systems Real time functions and services-OS architectures-Issues in Task Management-Interrupts and the OS. Shaw.2) UNIT II Requirements and Design Specifications-Survey and Classifications of Notations-Data Flow Diagrams-Tabular Languages-State Machines-Systems of State Machines-Communicating Real Time State Machines-State chart. 2001. Pearson Education. Jane W. Wiley . a K Credits 4:0:0 n u r a y i n U s r e v y it CS341 SOFTWARE TESTING Marks (40+60) UNIT I Introduction to testing as an Engineering activity – Testing Fundamentals – Defects. Chapters (1-10). Real–Time Systems and Software. Hypotheses. (Chapters 3.4) UNIT III Declarative Specifications-Regular Expressions and Extensions-Traditional Logics-RealTime Logic-Deterministic Scheduling –Assumptions and Candidate Algorithms-Basic RM and EDF Results-Relaxing the Assumptions-Process Interactions.8) UNIT V Programming Languages. 2000. ISBN :9814-12-6578. Real-Time Systems. (Chapters 5.Liu. Alan C. (Chapters 9. (Chapters 7.CS340 REAL TIME SYSTEM SOFTWARE Credits 4:0:0 Marks (40+60) UNIT I The World of Real Time Systems-Software Architecture-Process and State Based Systems Model-Cyclic Executives.

2003. (Chapters 14 -16) Text Book: 1. Ilene Burnstein. CS345 OPERATING SYSTEMS AND NETWORKING LAB Marks (50+50) 12 experiments will be notified by the HOD from time to time. ISBN NO: 81-8128089-X (Chapters 1-16). Springer .7) UNIT III The test organization – Controlling and monitoring the testing process – Reviews as a testing activity.UNIT II Strategies and methods for test case design II – Levels of testing – Test goals. (Chapters 8 . (Chapters 11 . and documentation. CS344 ADVANCED DATABASE LAB Marks (50+50) a y i n U s r e v y it Marks (50+50) 12 experiments will be notified by the HOD from time to time. policies plans.10) UNIT IV A measurement program to support product and process quality – Evaluating software quality: A quantitative approach – Defect analysis and prevention. CS342 SOFTWARE TESTING LAB Credits 0:0:2 12 experiments will be notified by the HOD from time to time. Practical Software Testing. CS343 SYSTEM DEVELOPMENT LAB Credits 0:0:2 Marks (50+50) Credits 0:0:2 a K n u r 12 experiments will be notified by the HOD from time to time. Credits 0:0:2 Division of Computer Science & Engineering AN-41 .13) UNIT V The testers’ workbench – Process control and optimization – The testing maturity model and test process assessment. (Chapters 5 .

CS347 ADVANCED TECHNOLOGIES LAB Credits 0:0:2 Marks (50+50) 12 experiments will be notified by the HOD from time to time. a K n u r a y i n U s r e v y it Division of Computer Science & Engineering AN-42 .CS346 CASE TOOLS LAB Credits 0:0:2 Marks (50+50) 12 experiments will be notified by the HOD from time to time.

(Chapter 4) UNIT IV Real Time Databases .Task Assignment Mode Charges .ADDITIONAL SUBJECTS Code Subject Name CS253 Real Time Systems CS254 Web Services CS255 C# Programming CS256 Database Systems CS257 Introduction to Database Management Systems CS258 Database Management systems Lab CS259 Introduction to Algorithms CS260 Object oriented Programming – C++ and Java CS261 Data mining and warehousing CS262 Machine learning In Bioinformatics CS263 C++ and Java Lab CS348 Windows Programming (CS210)* CS349 Java Programming (CS222)* CS350 Windows Programming Lab (CS236)* CS351 Data and Computer Communication (CS223)* CS352 Advanced Database Technologies CS353 Advanced Operating Systems CS354 Cryptography and Network Security CS355 Distributed Systems * new codes only Credit 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 0:0:2 4:0:0 4:0:0 4:0:0 4:0:0 0:0:2 3:1:0 3:1:0 0:0:2 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 Credits: 4:0:0 UNIT I Introduction: Architecture of Real time Systems / Embedded Systems – Operating Systems issues – performances Measures .Transaction Processing .Data Typing Control Structures – Packages .Concurrency Control .Timing Specification .Exception Handling – Overloading – Multitasking .Runtime Support.Fault Tolerant Scheduling (Chapter 3) UNIT III Programming Languages and Tools: Desired Characteristics based on ADA .Estimating Program runtime (Chapter 1.Disk Scheduling Department of Computer Science and Engineering 1 a K n u r a y CS253 REAL TIME SYSTEMS i n U s r e v y it Marks: 40 + 60 . 2) UNIT II Task Assignment and Scheduling: Uniprocessor Scheduling .IRIS Tasks .Task Scheduling .

Processing XML (Chapters 1 and 2 ) UNIT II SOAP and WSDL-The SOAP Model. WSDL Structure.M. SOAP RPC. Workflows and Workflow management Systems. (Chapters 7 and 8) a K n u r a y i n U s r e v y it Marks: 40 + 60 Department of Computer Science and Engineering 2 . SOAP Web Services. Reliability and Synchronization: Fault Types . other Web Services Transaction Protocols. XML Namespaces. Shin. CS254 WEB SERVICES Credits: 4: 0: 0 UNIT I Introduction-What are Web services? Why Web Services Are Important. UDDI-Universal Description. WS-security. Security Is An End-to-End Process. The Bar Scenario conversation. Accessing UDDI. Moving Forward. Real Time Systems. Krishna. Types of Security Attacks and Threats. (Chapters 5 and 6) UNIT IV Transactions-ACID Transaction.XML Fundamentals-XML:The Lingua Franca of Wed Services. Business process Execution language for Web Services (BPEL). (Chapters 3 and 4) UNIT III Conversations-Conversation Overview. Web Service Security Issues. WSFL. Discovery. Web Services and Enterprises. looking back to SOAP 1. WSCI.1997. BPEL and Its Relation to BPML. BPEL 1.Reversal Checks . SOAP. The UDDI Business Registry.Reliability models for Hardware Redundancy .Data Diversity . SOAP Messages. Kang G.Algorithms . scaling transactions to Web Services.Fault Detection and Containment – Redundancy .1. Xlang. Using SOAP and WSDL.Obtaining Parameter values . web Services Conversation language. UDDI Under the Covers. Encoded. ISBN 0-07-114243-6 Note: Theorems and proofs are not included. and Integration-UDDI at a glance. and the REST Architecture. Security-Everyday Security Basics. Web Services Security Roadmap. Using Alternative SOAP Encodings. Document. McGraw-Hill. SOAP Encoding. RPC..Serialization and Consistency (Chapter 5) UNIT V Fault Tolerance. Distributed Transactions and Two-Phase Commit.Software Error Models (Chapter 7 & 8) Text Book C. and others. Literal.XML Documents. Dealing with Heuristic Outcomes. XML Schema. How UDDI Is Playing out.1 and OASIS WSBPEL. Workflow-Business process Management. WSCL Interface Components. OASIS Business transaction Protocol. relationship Between WSCL and WSDL.

QoS-Enabled Applications. Developing Enterprise Web Services. properties. Proxy-Based Mobile Systems. 2004.NET and Databases: Connections – Data Adapters – Datasets – Data Application – Working with relational databases – Multiple tables in a single dataset – Data views – Data Binding – Complex Binding – Navigating through datasets using bound controls..net – data types – operators – statements. Direct Mobile Web Service Access. Challenges with Mobile. (Chapter 9) n u r a y i n U s r e v y it Marks: 40 + 60 Department of Computer Science and Engineering 3 .8) UNIT IV ADO. J2ME Web Services. Web applications: web applications – web programming skills – web server controls – advanced windows control. Collection and indexers: collections – arrays – array list – queues – stacks – hash tables. ISBN: 81-297-0491-9 (Chapters 1 – 11). Robert Skoczylas and Rima Patel Sriganesh. (Chapters: 4. Wiley Publishing Inc. C# programming: loops – creating methods – exception handling – working with strings – working with regular expressions. Building QoS into Web Services and Applications. 2004. Reference Book: Ramesh Nagappan.Mobile Web Services. QoS-Enabled Web Services. (Chapters 9.creating objects – using access modifiers – creating fields. James Webber. methods. constructors – structs – static members – destructors – overloading (Chapter 1 . Portals and Services Management-Portals. 10 and 11) Text Book: Sandeep Chatterjee. 6) a K UNIT III Windows applications: basic windows controls – advanced controls – multi window applications. QoS Metrics foe Web Services.ISBN: 81-265-0499-4. C# object oriented programming: creating classes . Pearson Education. Developing Java Web Services. CS255 C# PROGRAMMING Credits: 4: 0: 0 UNIT I Essential C#: Visual C#. Design Patterns and Best practices. (Chapters: 7. Mobile and Wireless. Where Are the Holes?.3) UNIT II Handling inheritance and delegates: working with inheritance – overriding virtual methods – abstract classes – polymorphism – boxing and unboxing – nested classes and interfaces – delegates. Web Services management.UNIT V Quality of Service-What Is QoS? Why Is QoS Important for Web Services?.

7) UNIT II The Relational Data model and Relational database constraints: Relational model concepts . Intertech Instructor Series. Basic Constraints and Queries: SQL data definition and data types – Specifying basic constraints in SQL – Schema change statements in SQL – Basic queries in SQL – More Complex SQL queries – Insert.Security in c#. UNIT III SQL 99: Schema Definition. Data modeling using the Entity. 2005. aborting. Second Edition.Relational model constraints and Relational database schemas –Update operations and dealing with constraint violations. Views and Programming Techniques: Specifying general constraints as Assertions – Views in SQL – Database a K n u r a y i n U s r e v y it Marks: 40 + 60 Department of Computer Science and Engineering 4 . More SQL: Assertions.UNIT V Assemblies: Creating an assembly – multiple modules in an assembly – Creating Shared assembles. Attributes and keys – Relationships types. Entity sets. “C# and the .2.Relationship model: Using high level conceptual data models for database design – Entity types.NET 2003. The relational algebra and Relational calculus: Unary relational operations: SELECT and PROJECT – Relational Algebra operations from set theory – Binary relational operations : JOIN and DIVISION – Additional relational operations – Examples of queries in relational algebra – The tuple Relational calculus – The Domain relational calculus (Chapters: 5. 3. Roles and Structural Constraints – Weak entity sets – Refining the ER design for the COMPANY database. ISBN: 81-297-0235-5. resuming and joining threads – Synchronizing threads – Remoting – SOAP for remoting (Chapter 13. ISBN: 81-8128-062-8. Reference Book: Andrew Troelson.Net Platform”. Schemas and instances – Three Schema architecture and data independence – Database languages and interfaces – The Database System Environment – Centeralized and Client/Server architecture for DBMSs – Classification of DBMS. CS256 DATABASE SYSTEMS Credits: 4: 0: 0 UNIT I Databases and Database Users: Introduction – An Example – Characteristics of the database approach – Actors on the scene – Workers behind the scene – Advantages of using the DBMS approach. First Indian reprint. Microsoft Visual C#. 2004. Database Systems Concepts and Architecture: Data models.15) Text Book: Steven Holzner. suspending. Multithreading & Remoting: multiple threads – sleeping.1 –3. Pearson Education. (Chapters : 1. Delete and Update statements in SQL – Additional Features of SQL.6). relationship sets.

primary keys . n u r a y i n U s r e v y it Department of Computer Science and Engineering 5 . 2002. Henry. ISBN: 81-297-0228-2 Reference Book: Abraham Silberschatz.F. Navathe.1 – 9.E.4. Indexing Structures for Files: Types of single level indexed ordered indexes – Multilevel indexes – + Dynamic Multilevel indexes using B-Trees and B Trees – Indexes on multiple keys – Other Types of Indexes (Chapter 13. Sudharshan.mappings constraints . UNIT II : Relational Model Structure .Commercial Query languages – SQL.R diagram.Other dependencies and normal forms. Text Book: Ramez Elmasri and Shamkant B.overall system structure . Fourth Edition. QUEL. 9.Formal Query languages . McGraw-Hill.Korth.11) UNIT V Disk Storage. S. Database System Concepts. Pearson Education.Entity relationship model: entities and entity sets relationships .9.14). ISBN:0072283637 CS257 INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS Credit : 4:0:0 Marks (40+60) a K UNIT I : Introduction Purpose of Database systems . Relational Database Design Algorithms and Further dependencies: Properties of Relational decompositions.Programming: Issues and Techniques – Database Stored Procedures (Chapter 8.Algorithms for relational database Schema design – Multi valued dependencies and Fourth Normal form – Join dependencies and Fifth Normal form – Inclusion dependencies. 2004.Relational Algebra . Forth Edition. Basic File structures and Hashing: Introduction – Secondary Storage devices – Buffering of Blocks – Placing file records on Disk – Operations on Files – Files of unordered records . Fundamentals of Database Systems.6) UNIT IV Functional dependencies and Normalization for Relational databases: Informal design guidelines for relation schemas – Functional dependencies – Normal forms based on primary keys – General definitions of Second and Third Normal Forms – Boyce-Codd Normal Forms. (Chapters : 10.Files of ordered records – Hashing Techniques – Other Primary File organizations – Parallelizing disk access using RAID – Storage Area Networks.

Introduction to random algorithms .Complexity analysis .Tree vertex splitting . SQL variation and extension. sorting. operation.Finding maximum and minimum .Job sequencing with dead lines Shortest path .2004. Henry K Korth. Sudarshan S. selection. join operation. Database concepts. normalisation using join dependencies . system architecture. UNIT IV : Query Processing and Query Optimisation Query processing .Decomposition . Fourth edition. distribution and external data Text book Abraham Silberschatz. Shamkant B. evaluation of operations Query optimisation . Reference book Ramesh Elmasri.fourth normal form. CS258 DATABASE MANAGEMENT SYSTEMS LAB Credit : 0:0:2 Marks (50+50) Credit : 4:0:0 a K UNIT I Introduction and Divide and Conquer: Algorithm . Fundamentals of Database systems.Normalisation using functional dependencies .Quick sort .General Method . UNIT V : Oracle ORACLE . Transformation. storage and indexing.selection sort UNIT II Greedy method: General method .Boyce-codd Normal form . other operation. Addison – Wesley Publications.Knapsack n u r 12 experiments will be notified by the HOD from time to time CS259 INTRODUCTION TO ALGORITHMS Marks (40+60) a y i n U s r e v y it Department of Computer Science and Engineering 6 . concurrency control and recovery.UNIT III : Relational Database Design Pitfalls . Fourth edition.domain-key normal form. materialised views Distributed data base.Database design and querying tool. Navathe.Strassens's matrix multiplication . replication.Estimating statistics of expression.third normal form . Mc Graw Hill International publications.Overview.

Graph coloring . Computational Molecular Biology – An Algorithmic Approach. manipulation. classes. constructors in derived class Pointers – to objects.Morris Pratt .Fundamentals of Algorthmics – Prentice Hall India -1997 CS260 OBJECT ORIENTED PROGRAMMING . Applications. C++ program. Pevzner PA. Basic concepts.Travelling Salesperson. features . Functions.Introduction.Brassard and P.Multistage graphs .Horowitz.Bratley . Text Book E. to virtual functions Working with files – File stream operation.Karp algorithm . S.UNIT III Dynamic Programming: General method .Key concepts. control structures – tokens.The Knutter . Constructors and Destructors String manipulation – creating string objects.Depth First search Breadth first search UNIT V Branch and Bound: General Method .Moore algorithm UNIT IV Back Tracking : General Method . The Boyer. Object oriented programming system – C++ . relational operation. File updation a K n u r a y i n U s r e v y it Marks (40+60) Department of Computer Science and Engineering 7 . accessing character in strings UNIT III Operator overloading – Defining unary and binary operators Inheritance – Defining derived class.Rajasekaran – Fundamentals of Computer Algorithms – Galgotia publications . operators. expressions. single inheritance. functions. file pointers and their manipulation. PHI 2004 2. Multiple inheritance. keywords.Sum of Subsets .C++ AND JAVA Credit : 4:0:0 UNIT I Object oriented programming . G. Data types. structures UNIT II Tokens. Object oriented Languages.String matching algorithm The Rabin . variables. to derived classes.algorithm.0/1 knapsack Problem . Identifiers and constants.1999 Reference books 1.Sahni and S. classes and objects.String matching with finite automation .

Balaguruswamy.2001 2. hypothesis testing. classes &J Objects. From data warehousing to Data mining UNIT III OLAP – need guidelines. data mining & OLAP.Overall Architecture of Data warehouse . OOPS in C++. Object oriented programming with C++. string and vectors UNIT V Managing errors and exception handling. Java applets programming. Statistics – Data counting and probability. Mapping the Data warehouse to a multiprocessor architecture – relational database technology.UNIT IV Java features. Patterns and models. Tata McGraw Hill Publications.Definition. constants.2004 a K n u r a y i n U s r e v y it Marks (40+60) Department of Computer Science and Engineering 8 . Multithreading. E. Prediction UNIT IV Data mining models .Introduction – Decision trees – nearest neighbor and clustering. Access tools. Data marts. Packages. Data warehouse administration & management. Java program structures.Balaguruswamy. repository. selecting and using right technique. Data visualization UNIT V Applications of Data warehousing and Data Mining in Bioinformatics Text book Alex Berson. Tata Mc Graw Hill publications. Stephen J. contingency tables. Tata McGraw Hill publications. E. Galgotia publications CS261 DATAMINING AND WAREHOUSING Credit : 4:0:0 UNIT I Data warehouse. OLAP tools and internet. . management and trends. Sample Java program in Bioinformatics Text book 1. Programming with Java. variables. & data types. Second edition.2000 Reference Book Robert Lafore. categorization. Arrays. database architecture for parallel processing UNIT II Metadata . Data warehousing .Smith. I / O streams. Third edition. second edition.

Reference book Sushmita Mitra.Prediction performance evaluation Different performance measures UNIT IV Hidden Markov Models: The Theory .Statistical mechanics UNIT II Machine Learning Algorithms .2003. David W. Mount. Learning algorithms: miscellaneous aspects UNIT III Neural Networks: The Theory -Introduction .Universal approximation properties – Priors & likelihoods . John Wiley & Sons. Bioinformatics: Sequence and Genome Analysis Department of Computer Science and Engineering 9 . Soft computing and Bioinformatics.Introduction -Prior information & initialization Likelihood & basic algorithms .Hybrid models & neural network parameterization of graphical models -The single-model case . 2. Data mining – Multimedia.Applications for DNA & RNA nucleotide sequences .1998.Bayesian inference & induction -Model structures: graphical models & other tricks .Neural Networks: Applications Sequence encoding & output interpretation.Introduction -Dynamic programming -Gradient descent EM/GEM algorithms –Markov chain Monte-Carlo methods .Simulated annealing – Evolutionary & genetic algorithms.Bi-directional recurrent neural networks for protein secondary structure prediction n u r a y i n U s r e v y it Reference books 1. CS262 MACHINE LEARNING IN BIOINFORMATICS Credit : 4:0:0 Marks (40+60) UNIT I Machine-Learning Foundations: The Probabilistic Framework -Introduction: Bayesian modeling The Cox Jaynes axioms . Pierre Baldi and Søren Brunak.Advantages & limitations of HMMs a K UNIT V Probabilistic Graphical Models in Bioinformatics .Markov models & DNA symmetries Markov models & gene finders . Tinku Acharya.Sequence correlations & neural networks – Prediction of protein secondary structure .Learning algorithms: backpropagation .Prediction of signal peptides & their cleavage sites . Bioinformatics: the Machine Learning Approach – Publisher: MIT Press.DNA & RNA applications .Learning algorithms -Applications of HMMs: general aspects -Protein applications .Probabilistic Modeling & Inference: Examples -The simplest sequence models .

n u r a y i n U s r e v Marks: 40 + 60 y it Department of Computer Science and Engineering 10 . UNIT II Physical Database Design and Tuning : Introduction to Physical Database Design – Guidelines for Index Selection-Clustering and Indexing –Tools to Assist Index Selection – Overview of Database Tuning –Choices in Tuning the Conceptual Schema-Choices in Tuning Queries and Views –Impact of Concurrency.Parallelizing Individual Operations-Parallel Query Optimization-Types of Distributed Databases –Distributed DBMS Architecture-Storing Data in Distributed DBMSDistributed Catalog Management-Distributed Query Processing-Updating Distributed DataDistributed Transaction-Distributed Concurrency Control-Distributed Recovery. (Chapter 16-18). Crash Recovery: Introduction To ARIES –The Log: Other RecoveryRelated Structures-The Write-ahead Log Protocol –Check Pointing-Recovering from a System Crash –Media Recovery. UNIT IV Information retrieval and XML Data: Colliding Worlds: Databases.CS263 C++ and JAVA LAB Credit : 0:0:2 12 experiments will be notified by the HOD from time to time Marks (50+50) CS352 ADVANCED DATABASE TECHNOLOGIES Credits: 4 : 0 : 0 UNIT I Overview of Transaction Management: The ACID Properties-Transactions and SchedulesConcurrent Execution of Transaction-Lock-Based Concurrency Control-Performance of Locking-Transaction Support in SQL-Introduction to Crash Recovery Concurrency Control: 2PL. a K UNIT III Parallel and Distributed Databases: Architecture for Parallel Databases-Parallel Query Evaluation. Serializability and Recoverability-Introduction to Lock Management-Lock Conversion-Dealing with Deadlock-Specialized Locking Techniques-Concurrency Control without Locking. IR and XML – Introduction to Information retrieval –Indexing for Text Search-Web Search EnginesManaging Text in a DBMS-A Data Model for XML –X Queries: Querying XML Data – Efficient Evaluation of XML Queries. (Chapter 27). 21). (Chapter 20. (Chapter 22).Case Study: The Internet Shop. Security and Authorization: Introduction to Database Security-Access ControlDiscretionary and Mandatory Access Control-Security for Internet Application –Additional Issues Related to Security.

Pearson Education. Further Reading: Advanced Transaction Processing-Data Integration-Mobile Databases –Main Memory DatabasesMultimedia Databases-Geographic Information System-Temporal Databases –Biological Databases –Information Visualization. UNIT V Database Operating Systems-Introduction to Database Operating systems. Theoretical Foundations(upto 5.7 only ).3 only).5. Third Edition. Fundamentals of Database Systems.7. Concurrency Control Algorithms. a K UNIT IV Protection and Security-Resource Security and protection(upto 14.4 only).1 only). Concurrency Control. Database Management Systems.1 only). UNIT II Distributed Resource Management-Distributed File Systems(upto 9. 2003. Distributed Mutual Exclusion(upto 6. ISBN: 81-297-0228-2w. Fault Tolerance(upto 13. Distributed Deadlock detection( upto 7.5 only).4. Distributed Shared memory(upto 10.6. Multiprocessor Operating systems-Multiprocessor System Architectures. 2004. UNIT III Failure Recovery and Fault Tolerance-Recovery(upto 12. Distributed Operating Systems-Architectures of Distributed Systems.9 only). (Chapter 28. Theoretical Aspects.3 only). n u r a y i n U s r e v y it Marks: 40 + 60 Department of Computer Science and Engineering 11 . ISBN : 0-07-115110-9(ISE) Reference Book: Elmasri & Navathae. third edition TataMcGrawHill.7 only).5. Agreement Protocols(upto 8. Text Book: Raghu Ramakrishnan & Johannes Gehrke.7 only).4. Distributed Scheduling(upto 11.3 only).UNIT V Spatial Data Management: Types of Spatial Data and Queries-Application involving Spatial Data-Introduction to Spatial Indexes-Indexing Based on Space Filling Curves-Grid files –R-Trees –Issues in High Dimensional Indexing.29). CS353 ADVANCED OPERATING SYSTEMS Credits: 4 : 0 : 0 UNIT I Synchronization Mechanisms (upto 2.4.

17.2. 2003.3. [Sections: 17.1.2.1.2. S.16.10. 1994.Text Book: Mukesh Singhal. Todd Stubbs. Introduction to Operating Systems: Advanced Course. Cryptography and Network Security.16.12.13.2.1. CS354 CRYPTOGRAPHY AND NETWORK SECURITY Credits 4:0:0 Marks (40+60) UNIT I Services.9.1.10.18-20) ISBN : 0-07-047268-8 Reference Book: Mary S.2.12.] Text Book: William Stallings.2.5.16.16.2.2 . [Sections: 12. Department of Computer Science and Engineering 12 a K n u r a y i n U s r e v y it .1.] UNIT V Web Security considerations – Secure Sockets Layer and Transport Layer Security – Secure Electronic Transactions – Intruders – Intrusion Detection – Password Management – Firewall design principles – Trusted systems. Second Edition. Radia Perlman.18. Reference Book: Charlie Kaufman. Advanced Concepts in Operating Systems Distributed.6.10.4.3.16.] UNIT II Principles of Public Key Cryptosystems – RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Basics of Elliptic Curve Cryptography [Sections: 9. Third Edition.4. Niranjan G. Network Security.1. 2002.17.2. Mike Speciner. ISBN 81-7808-902-5.16.2.1.5. Database. Prentice Hall.20.16.RC4 Stream Cipher.15. and Multiprocessor Operating Systems. Prentice Hall.3. [Sections: 15.4.1. Gorman. (Chapters 4-14.14. Course Technology. ISBN 81-203-2213-4.14.509 Authentication Service.20. Mechanisms and Attacks – Block Cipher principles – Data Encryption Standard – Strength of DES – Evaluation criteria for AES – AES Cipher.5.1.3.18.3. Tata McGraw-Hill.18. UNIT IV Pretty Good Privacy – S/MIME – IP Security Overview – IP Security Architecture – Authentication Header – Encapsulating Security Payload – Combining Security Associations – Key Management.Shivaratri.3.[Sections: 1.5.1.3.2. 2001.3.6.4.1.] UNIT III MD5 Message Digest Algorithm – Secure Hash Algorithm – HMAC – Digital signature Standard – Kerberos Version 5 – X.] .

Third Edition. Distributed Shared Memory: introduction – design and implementation issues – sequential consistency and Ivy – release consistency and Munin – other consistency models. 2002. Distributed Systems – Principles and Paradigms.CS355 DISTRIBUTED SYSTEMS Credits: 4: 0: 0 Marks: (40 + 60) UNIT I Characterization of Distributed Systems: introduction – examples of distributed systems – resource sharing and the web – challenges. Distributed Transactions: introduction – flat and nested distributed transactions – atomic commit protocols – concurrency control in distributed transactions – distributed deadlocks – transaction recovery. Distributed Systems – Concepts and Design. Operating system support: introduction – the operating system layer – protection – process and threads – communication and invocation . Time and Global states: introduction – clock. Text Book: George Coulouris.operating system architecture. System Model: introduction – architectural models – fundamental models. Tanenbaum. Tim Kindberg. Inter process Communication: introduction – the API for the Internet protocol – external data representation and marshaling – client –server communication – group communication. Pearson Education. Maartenvan Steen. UNIT IV Transactions and Concurrency control: introduction – transactions – nested transaction – locks – optimistic concurrency control – timestamp ordering – comparison of methods for concurrency control. 2001. UNIT III Name Services: introduction – name services and the DNS – directory and discovery services. events and process states – synchronizing physical clocks – logical time and logical clocks – global states – distributed debugging. (Chapters 1. Pearson Education. Distributed file systems: introduction – file service architecture – sun network file system – the Andrew File system – recent advances. Jean Dollimore.4-6. Department of Computer Science and Engineering 13 a K n u r a y i n U s r e v y it . Distributed Multimedia Systems: Introduction – Characteristics of Multimedia data – Quality of service management – Resource management – Stream adaptation. UNIT II Distributed objects and remote invocation: introduction – communication between distributed objects – RPC – events and notifications. UNIT V Replication: Introduction – system model and group communication – fault tolerant services – highly available services – transactions with replicate data.2. Case Studies not included) Reference Book: Andrew S. 8-16. Co-ordination and Agreement: introduction – distributed mutual exclusion – elections – multicast communication – consensus and related problems.

Writing Output Data – More About printf Function – The Gets and Puts Functions – Interactive Programming – Preparing and Running a Complete C Program – Planning a C Program.2) Unit II Operators and Expressions .Introduction to Computers– What is a Computer – Block Diagram of Computer – Computer Characteristics – Hardware vs Software – How to Develop a Program – Modes of Operation – Types of Programming Languages – Introduction to C – Desirable Program Characteristics Introduction to C Programming .Nested Control Structures – The switch.ADDITIONAL SUBJECTS CS101 CS264 CS265 CS266 CS267 CS268 CS269 CS270 CS356 CS357 CS358 CS359 Programming in C Programming in C++ Windows Programming Java Programming Database Systems Operating Systems Analysis of Algorithms C# Programming Real Time Systems Design and Analysis of Algorithms Cryptography and Network Security Parallel Processing CS101 PROGRAMMING IN C Credits: 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 Unit I Introductory Concepts .Storage Classes – Automatic Variables – External Variables – Static Variables – Multifile Programs – More About Library Functions Arrays: Defining an Array – Processing an Array – Passing Arrays to Functions – Multidimensional Arrays – Arrays and School of Computer Science and Technology AN-23 a K n u r a y i n U s r e v y it Marks (40+60) .Data Types – Constants – Variables and Arrays – Declarations – Expressions – Statements – Symbolic Constants (Chapters 1.Branching – Looping – More Looping – Still More Looping . break.7) Unit IV Program Structure . continue.Writing a C Program – Error Diagnostics – Debugging Techniques (Chapters 3-5) Unit III Control Statements – Preliminaries .The C Character Set – Writing First Program in C Identifiers and Keywords – A More Useful C Program – Entering the Program into the Computer – Compiling and Executing the Program .Arithmetic Operators – Unary Operators – Relational and Logical Operators – Assignment Operators – The Conditional Operator – Library Functions – Data Input and Output – Preliminaries .Single Character Input & Output – Entering Input Data – More About scanf Function . comma statements – The Goto Statement – Functions Defining a Function – Accessing a Function – Function Prototypes – Passing Arguments to a Function – Recursion (Chapters 6.

and pitfalls. const and classes.1. 1996 (Indian Adapted Edition 2006). object as function argument. derived class constructors. reference arguments.Operations on Pointers – Pointers and Multidimensional Arrays – Arrays of Pointers – Passing Functions to other Functions (Chapters 8-10) Unit V Structures & Unions . inheritance. and library function. Basic program construction. escape sequence. (Chapters 6. polymorphism and overloading. Functions: passing arguments to functions. returning objects from functions. Structures. classes. character. 14. (Chapters 3-5) Unit III A simple class. arithmetic logical and relational operators.2) Text Book: Byron S. switch & other control statements. Pointers: address and pointers. Second Edition. while loop & do loop and if. double. manipulators.Defining a Structure – Processing a Structure – User-Defined Data Types – Structures and Pointers – Passing Structures to Functions – Self Referential Structures – Unions. c++ objects as physical objects. ISBN 0-07-059369-8. (Chapters 8-10) a K n u r a y i n U s r e v y it Marks: (40+60) School of Computer Science and Technology AN-24 . level of inheritance. Programming with C.Pointers . static class data. overloading member functions. inline functions. cout. (Chapters 1. if…else. new and delete operator.Additional Features of C – Enumerations – Command Line Parameters (Chapters 11. data types: integer. CS264 PROGRAMMING IN C++ Credits: 4:0:0 Unit I Objects. overloaded constructors. Enumeration. long double and Boolean. Input output statements: cin. Gottfried. default arguments. public and private inheritance. variables and storage class and returning by reference.7) Unit IV Overloading unary and binary operator.Opening and Closing a Data File – Reading and Writing a Data File – Processing a Data File – Unformatted Data Files – Concept of Binary Files . 2) Unit II For loop. type conversion. constructors. copy constructors. Tata McGraw Hill. as function argument. Data Files – Why Files .14. multiple inheritance. comments. class hierarchies. overloaded functions. data conversion. pointer and c-type strings.Fundamentals – Pointer Declarations – Passing Pointers to Functions – Pointers and One-Dimensional Arrays – Dynamic Memory Allocation . creating new data types. c++ objects and data types.Strings. reusability. pointers and arrays. Inheritance: derived class and base class. pointers to pointer. float. 12. Arrays and Strings. returning values from functions. structures and classes.

edit class. GDI mapping mode. using the timer. controls and colors. registering the window class. caret. friend functions. 12. (Chapters 3. static functions. capturing the mouse. custom resources. stream errors. processing the windows. 8) Unit III Child window controls: button class. windows multithreading. 7. (Chapters 9. thread synchronization. menus. playing a sound file. strings. exceptions. disk file I/O with streams. GDI: Introduction. (Chapters 11. file pointers. Fourth Edition. scrollbar class. (Chapters 11. Robert Lafore. 5 Edition. 5) Unit II Keyboard: Basics. modeless and common dialog boxes. CS265 WINDOWS PROGRAMMING Credits: 4:0:0 Unit I Windows & Messages: Architectural overview. character messages. Streams and files: stream classes. list box class. Tech Media. event signaling. creating & displaying window. static class. error handling in file I/O. WM_PAINT. keyboard accelerators. 20. Templates and exception: function templates. Clipboard: Use of clipboard. client area mouse messages. Mouse: Basics. implementation.Unit V Virtual functions. scrollbars. drawing filled areas. 1998. 2002. Reference Book: 1. (Chapters 6. WM_DESTROY messages. valid and invalid rectangles. n u r a y i n U s r e v y it Marks: (40 + 60) School of Computer Science and Technology AN-25 . class templates. Timer: Basics. cursors. 4. keystroke messages. Menus and Resources: Icons. queued and non-queued messages. ISBN 0-672-32308-7. regions and clipping. this pointer. (Chapters 19. 2003 ISBN 0-07-053246-X. C++: The Complete Reference. Fourth Edition. Microsoft press. Programming Windows. device context drawing dots and lines. window procedure. Charles Petzold. structure of GDI. mouse wheel. Herbert Schildt. Object Oriented Programming In C++. 21) Text Book: th 1. rectangles. 14) Text Book: 1. Multitasking and Multithreading: modes of multitasking. 12) Unit V MDI:Concepts. Tata McGraw – Hill. 10) a K Unit IV Dialog boxes: Modal. message loop.

14) Unit IV String Handling . Fundamental Relational-Algebra operations.1-1. Complex Queries. Relational Database. Layout Managers. 1996. ISBN-0-07-059878-9 Credits: 4:0:0 a K Unit I Introduction: Database-System Application. Database Users and Administrators.1-2.Reference Book: 1. Database Design. 2.Input/Output: Exploring java.Networking .Conger. Transaction Management. Basic Structure of SQL Queries. Autoboxing and Metadata.Packages and Interfaces . (Chapters 1. Herbert Schildt.An Overview of Java . James L. Aggregate functions. Galgotia Publications Ltd. Null values. View of Data. J2SE.19-21) Unit V Event Handling-Introducing the AWT: Working with Windows. Tata McGrawHill. Relational Model: Structure of Relational Databases.Generics (Chapters 11. Database Architecture.The Applet Class. Graphics and Text . Additional Relational-Algebra operations. Extended Relational Algebra.Exceptions Handling (Chapters 6-10) Unit III Multithreaded Programming –Enumerations. CS266 JAVA PROGRAMMING Credits: 4:0:0 Marks: (40 + 60) Unit I The History and evolution of Java .Inheritance . Nested sub queries. Data Definition. Data Storage and Querying. School of Computer Science and Technology AN-26 n u r a y i n U s r e v y it CS267 DATABASE SYSTEMS Marks: (40 + 60) .Control Statements (Chapters 1-5) Unit II Introducing Classes –A Closer look at Methods and Classes . Database Language.6) Unit II SQL: Background. Fifth Edition. 2005. Null value. Set Operations. (Chapters 22-24) Text Book: 1.12.Using AWT Controls. Object-Based and Semi structured Databases. Variables and Arrays – Operators .io .The Complete Reference.. Windows API Bible – Programmer’s reference. Purpose of Database System. Java . Data mining and Analysis. Modification of the database. Views. (Chapters 15.Data Types.12. and Menus.

20. 8. Extended E-R Features. Transaction: Transaction concepts.2) n u r a y i n U s r e v y it CS268 OPERATING SYSTEMS Marks: (40 + 60) School of Computer Science and Technology AN-27 . (Chapters 6.L.11. Dynamic SQL. Authorization in SQL. Storage and File Structure: File organization.5) Text Book: 1.8. 4. Ordered Indices.8) Unit V Indexing and Hashing: Basic Concept. Modeling Temporal data.1-12.1. Atomic Domains and First Normal Form. Concurrent executions. Advanced SQL: SQL Data Types and Schema.1-7. Integrity Constraint.7. Decomposition Using Functional Dependencies. Database Design for Banking Enterprise. Implementation of atomicity and durability. Multivalued Dependencies. B-Tree Index Files. 8. 2006.Dependency Theory. ISBN 007-124476-X.6-11. E-R model. Transaction State. Serialization. More Normal form. (Chapters 12. Database-Design Process. ISBN 81-7758476-6 a K Credits: 4:0:0 Unit I Introduction .5) Unit III Database Design and E-R Model: Overview of the design process. Reduction to Relational Schema.N. Fundamentals of Database Systems.6. Somayajulu. (Chapters 3. Pearson Education. Decomposition Using Functional dependencies. Ramez Elmasri. 2006. Henry F. 15. Multiple-Key Access. Weak Entity. 20. Application Design and Development: Triggers. Database System Concepts. Embedded SQL. Comparison of Ordered Indexing and Hashing.1-15.1-6. Database-System Architecture: Centralized and Client-Server Architecture. Mc Graw-Hill International Edition. B+ Tree Index Files. Organization of records in files. Authorization.1-4.9. (Chapters 7. Durvasula V. Reference Book: 1.What Operating Systems Do – Computer System Organization Computer System Architecture – Operating System Structure – Operating System Operations – Process Management – Memory Management – Storage Management – Protection and Security – Distributed Systems – Special Purpose Systems .1-3. Server System Architecture. Dynamic Hashing. Navathi and Shyam K. E-R Diagram. Functional. Abraham Silberschatz.(Chapters 1.Modification of Database. Shamkant B. E-R Design Issues. Gupta.10. Static Hashing.9.Computing Environments – Operating System Services – User Operating System Interface – System Calls – Types of System Calls – System Programs – Operating System Design and Implementation – Operating System Structure – Virtual Machines – Operating System Generation – System Boot. Fifth Edition. Sudarshan.2) Unit IV Relational Database Design: Features of good Relational Design. Korth and S. Data Dictionary Storage. Constraints.

4.Synchronization Hardware – Semaphores – Classic Problems of Synchronization – Monitors Synchronization Examples – Atomic Transactions – System Model – Deadlock Characterization – Methods for Handling Deadlocks – Deadlock Prevention – Deadlock avoidance – Deadlock detection – Recovery from Deadlock – Memory management Strategies – Swapping – Contiguous memory Allocation – Paging – Structure of the Page Table – Segmentation.1-4. a K n u r a y i n U s r e v y it CS269 ANALYSIS OF ALGORITHMS Marks: (40 + 60) Credits: 4:0:0 Unit I Introduction – Notion of algorithm. 2006 ISBN 9812-53-176-9.I/O Systems – I/O Hardware – Application I/O interface – Kernel I/O Subsystem – Transforming I/O Requests to Hardware Operations – Streams – Performance. Abraham Silberschatz. (Chapters 9. 7. Greg Gagne.1-9.1 – 2. Important problem types Fundamentals of The Analysis of Algorithm Efficiency – Analysis framework. Fundamentals of algorithmic problem solving. Peter Baer Galvin. (Chapters 6. 3.1-8. John Wiley & Sons. 2.Threading Issues – Process Scheduling .9) Unit V Secondary Storage Structure – Overview of Mass Storage Structure – Disk Structure – Disk Attachment .4.13.13) Text Book: 1. Mathematical analysis of non-recursive algorithms.3. Operating System Principles. (Chapters 3. 10.4) School of Computer Science and Technology AN-28 . 8. (Chapters 12.File Concepts – Access Methods – Directory Structure – File System Mounting – File Sharing – Protection – Implementing File Systems File System Structure – File System Implementation – Directory Implementation – Allocation Methods – Free Space Management – Efficiency and Performance – Recovery – Log Structured File Systems – NFS. 11.1 – 1.6) Unit IV Virtual Memory Management – Demand Paging – Copy-on-Write . 4. Seventh Edition. Asymptotic notations and basic efficiency classes.6. 5) Unit III Synchronization – The Critical Section Problem – Peterson’s Solution .Disk Scheduling – Disk Management – Swap-Space Mnagement – RAID Structure – Stable-Storage Implementation – Tertiary Storage Structure .Basic concepts – Scheduling Criteria – Scheduling Algorithms – Multiple Processor Scheduling – Thread Scheduling – Operating System Examples – Algorithm Evaluation.9. Mathematical analysis of recursive algorithms.Page Replacement – Allocation of Frames – Thrashing – Memory-mapped Files – Allocating Kernel Memory Other Considerations – Storage Management .1-11. (Chapters: 1.Unit II Process Concept – Process Scheduling – Operation on Processes – Interprocess Communication –Communication in Client Server Systems – Multithreaded Programming – Multithreading models – Thread Libraries .

17 and 18) n u r a y i n U s r e v y it CS270 C# PROGRAMMING Marks: (40 + 60) School of Computer Science and Technology AN-29 .1 – 9. Dynamic Programming – Computing a binomial coefficient. Introduction to the Design & Analysis of Algorithms. 6.3) Text Book: 1. B-trees.NET Assemblies (up to Configuring Shared Assemblies).1. 10. 14.1. (Chapters 1. Depth-first search and breadth-first search. Contexts and CLR Hosts and Building Multithreaded ApplicationsUnderstanding Object Serialization-The . Anany Levitin. Topological sorting. 8. and Events-Advanced C# Type Construction Techniques-Introducing . Limitations of Algorithm Power – P.8.NET Remoting Layer (up to Building Your First Distributed Application) (Chapters 13.2.4.NET – C# Language Fundamentals – Object Oriented Programming. (Chapters: 3.3. Input enhancement in string matching. 3.1.complete problems. NP and NP.1 – 7.1 – 4. Transform-and-Conquer – Presorting. (Chapters: 7. (Chapters: 9. Balanced search trees. Credits 4: 0: 0 Unit I The Philosophy of . 2003.Unit II Brute Force – Selection sort and bubble sort.9 and 11) Unit III Processes. 3 and 4) a K Unit II Understanding Object Life Time-Understanding Structured Exception Handling-Interfaces and Collections-Callback Interfaces Delegates. Warshall’s and Floyd’s algorithms. (Chapters: 5.1 – 5. Divide-and-Conquer – Merge sort. Dijkstra’s algorithm. AppDomains.4) Unit III Decrease-and-Conquer – Insertion sort. 6. Huffman trees.3. Hashing. Binary search. 6. Quick sort. Heaps and heap sort. 6.7. Pearson Education. Sequential search and brute-force string matching.4.4) Unit IV Space and Time Tradeoffs – Sorting by counting.2) Unit V Greedy Technique – Prim’s algorithm. 4. Kruskal’s algorithm. (Chapters 5. ISBN: 81-7808-984-X. Binary tree traversals and related properties. 8.

and 3) Unit II Commonly used approaches to Real time scheduling: Clock driven approach – Weighted round robin approach – Priority Driven approach – Dynamic versus Static systems – Effective Release times and Deadlines – Optimality of EDF and LST – Challenges in validating timing constraints in Priority driven systems – Offline versus Online scheduling – Clock driven scheduling: Notations and assumptions – Static Timer driven scheduler – General structure of Cyclic schedules – Cyclic executives – Improving average response time of Aperiodic jobs – Scheduling Sporadic jobs – Practical considerations – Algorithm for constructing Static schedules – Pros and Cons of Clock driven scheduling. Springer Private Limited.4) n u r a y i n U s r e v y it Marks: (40 + 60) School of Computer Science and Technology AN-30 . (Chapter 6) Unit IV Scheduling Aperiodic and Sporadic Jobs in Priority Driven Systems: Assumptions and Approaches – Deferrable servers – Sporadic servers – Constant Utilization. (Chapters 4 and 5) a K Unit III Priority driven scheduling of Periodic jobs: Static assumptions – Fixed priority versus Dynamic priority algorithms – Maximum schedulable utilization – Optimality of RM and DM algorithms – Schedulability test for Fixed priority tasks with Short response times – Schedulability Test for Fixed priority tasks with arbitrary response times – Sufficient Schedulability conditions for RM and DM algorithms – Practical factors. Andrew Troelsen. (Chapters 19 and 21) Unit V Database Access with ADO. Deadlines and Timing constraints – Hard and Soft timing constraints – Hard Real time systems – Soft Real time systems – A reference model of Real time systems: Processors and resources – Temporal parameters of Real time workload – Periodic task model – Precedence constraints and data dependency – Other types of dependencies – Functional Parameters – Resource Parameters of Jobs and Parameters of resources – Scheduling hierarchy. (Sections: 7. 2005.1 – 7.Unit IV Building a Better Window with System.0 Platform. ISBN: 81-8128-376-7 CS356 REAL TIME SYSTEMS Credits 4: 0: 0 Unit I Typical Real Time Applications: Digital Control – High level controls – Signal Processing – Other Real Time Applications – Hard Versus Soft Real time Systems: Jobs and Processors – Real times. 2. Total bandwidth and weighted fair – queuing servers. (Chapters 1.Windows.NET (Chapter 22) Text Book: 1.NET 2. Pro C# 2005 and the .Forms-Programming with Windows Forms Controls.

4. Mathematical analysis of recursive algorithms. 7. Prentice Hall of India.5. Jane W. Decrease-by-a-constant-factor algorithms.Unit V Resources and Resource Access Control: Assumptions on resources and their usage – Effects of resource contention and resource access control – Nonpreemptive Critical Sections – Basic Priority Inheritance Protocol – Basic Priority Ceiling Protocol . Problem reduction. Real-Time Systems. 8. Binary search. 3. (Chapters: 1.2. B-trees. Example. Kruskal’s algorithm. Sequential search and brute-force string matching. Fundamentals of algorithmic problem solving.4. 3. Balanced search trees.1 – 2. 8.6. Laplante. Hashing. ISBN NO: 81–7758– 575-4 (Chapters 1-8) Reference Book: 1. (Chapters: 3.1. Depth-first search and breadth-first search. Important problem types Fundamentals of the Analysis of Algorithm Efficiency – Analysis framework. 9. Exhaustive search.6) a K Unit III Transform-and-Conquer – Presorting. Mathematical analysis of non-recursive algorithms. Gaussian elimination. Space and Time Tradeoffs – Input enhancement in string matching.4) Unit IV Dynamic Programming – Computing a binomial coefficient. Asymptotic notations and basic efficiency classes. 5. Second Edition. (Chapter 8) Text Book: 1.3. Decrease-and-Conquer – Insertion sort.1. 2. Heaps and heapsort. 2000.Stack Based Priority ceiling Protocol – Use of Priority Ceiling Protocol in Dynamic Priority System – Preemption Ceiling Protocol – Controlling Access to Multiple Unit Resources – Controlling Concurrent Access to Data Objects.1 – 5. Divide-and-Conquer – Merge sort.4) School of Computer Science and Technology AN-31 n u r a y i n U s r e v y it . Binary tree traversals and related properties. Warshall’s and Floyd’s algorithms.1 -1. ISBN NO: 81-203-1684-3 Credits 4: 0: 0 CS357 DESIGN AND ANALYSIS OF ALGORITHMS Marks: (40 + 60) Unit I Introduction – Notion of algorithm.4.3. 5.5) Unit II Brute Force – Selection sort and bubble sort. Liu. Phillip A.1 – 4. (Chapters: 6. 5. 2001.1 – 6. Huffman trees. Variable-size-decrease algorithms. Greedy Technique – Prim’s algorithm.2 – 7.1 – 9. Topological sorting. Dijkstra’s algorithm. (Chapters: 8.S.2. The knapsack problem and memory functions. Quick sort. Horner’s rule and binary exponentiation. Real-Time Systems Design and Analysis. Pearson Education. 4.

9. Pearson Education. ISBN: 81-7808-984-X.2.NP and NPcomplete problems. 14.5] Unit V Web Security Considerations – Secure Socket Layer and Transport Layer Security – Secure Electronic Transaction – Intruders – Intrusion Detection – Password Management – Viruses and related threads – Virus countermeasures – Distributed denial of services attack . 20. 10. 16. [Sections: 6.3. 10. Reference Book: 1. 15.3) Text Book: 1. Decision trees.3.1. P. 5.2. [Sections: Ch 1. Pearson Education. Anany Levitin.3. 13.1 – 16. ISBN: 81-7808-171-7. Approximation algorithms for NP-hard problems.4. [Sections: 15.1 – 20. 9. Challenges of numerical algorithms. Branch-and-bound. (Chapters: 10.1(Version 5 only). 18.Unit V Limitations of Algorithm Power – Lower-bound arguments. 11.3. Computer Algorithms – Introduction to Design & Analysis. [Sections: 17.1 – 3.509 Authentication Service – Public Key Infrastructure. 14.IP Security Architecture – Authentication Header – Encapsulating Security Payload – Combining Security Associations.3.4.3] a K Unit IV Pretty Good Privacy – S/MIME – IP Security Overview .1 – 6.1 – 12.1 – 10. 2. 14.2.1 – 11. CS358 CRYPTOGRAPHY AND NETWORK SECURITY Credits 4: 0: 0 Unit I Security trends – OSI Security Architecture – Security Attacks – Security Services – Security mechanisms – A Model for Network Security – Symmetric Cipher Model – Block Cipher Principles – The Data Encryption Standard – The Strength of DES – The AES Cipher.Firewall Design principles – Trusted System – Common Criteria for Information Technology Security Evaluation. 3.1 – 18.4] Unit III Secure hash Algorithm – Whirlpool – HMAC – CMAC – Digital Signature Standard – Kerberos version 5(Only) – X. 2003.1 – 19.2. Coping with the Limitations of Algorithm Power – Backtracking. Sara Baase & Allen Van Gelder.3] n u r a y i n U s r e v y it Marks: (40 + 60) School of Computer Science and Technology AN-32 .2] Unit II Multiple Encryption and Triple DES – Block Cipher Modes of Operation – Stream cipher and RC4 – Principle of Public Key Cryptosystems – The RSA Algorithm – Diffie Hellman Key Exchange – Elliptic curve cryptography.1. 19. [Sections: 12.1. Introduction to the Design & Analysis of Algorithms. 2000.1 – 17.3.

shared memory programming alternatives and scope.1-2. CS359 PARALLEL PROCESSING Credits: 4:0:0 Unit I Parallel Machines and Computations: Evolution of parallel architectures-interconnection networks-application of architectural parallelism . (Chapter 3.barrier.parallel prefix algorithms.2) Unit II Vector Algorithms and Architecture: A vector architecture –A SIMD Instruction Set . (Chapter 8) Text Book: 1. Jordan and Gita Alaghband.programming with message passing .waiting mechanisms .sample compiler techniques .synchronizing different kinds of cooperative computations . MIMD Computers or Multiprocessors: Shared memory and message passing architecture-overview of shared memory multiprocessor programming . 2006. ISBN 0-470-85285-2.6. 5. (Chapter 1. Harry F.data flow principles-data flow architectures – systolic arrays.1-4.3. 2.characterization of communication . Wiley.hardware managed communication-distributed cache – conclusion Shared versus distributed memory multiprocessor. Cryptography and Network Security.3. 2003. Interconnection Networks : network characteristics – permutations – static networks – dynamic networks .getting started in SIMD and MIMD programming-parallelism in algorithms.5-5. Man Young Rhee.prefix problem .1 –3. Potential for Parallel Computations: Parameters characterizing algorithm parallelism .1 – 5.3) Unit III Distributed Memory Multiprocessors: Distributing data and operations among processor/memory pairs . William Stallings.the prime memory system – use of the PE Index to solve storage layout problems. . Pearson Education. School of Computer Science and Technology AN-33 a K n u r a y i n U s r e v Marks: (40 + 60) y it .5. Fourth Edition. (Chapter 5. 6) Unit IV Data dependence and Parallelism: Discovering parallel operations in sequential code variables with complex names .3. Internet Security. (Chapter 7) Unit V Implementing Synchronization and Data Sharing: The character of information conveyed by synchronization . Prentice Hall.mutual exclusion using atomic read and write .Text Book: 1. ISBN No: 81-203-3018-8 Reference Book: 1. 4. 2003.Proving a synchronization implementation correct – alternative implementation of synchronization . Fundamentals of Parallel Processing.

The buffer cache .structure of a regular file .link and unlink Unit III The structure of processes: process states and transitions .INODE assignment to a new file.pipes .The context of a process .DUP file Systems .Reading and writing disk blocks -advantages and disadvantages of the buffer cache.directories conversion of a path name to an INODE .File creation .change directory change root . System calls for the file system: Open .record locking .introduction to system concepts.structure of the buffer pool .Buffer headers .Change owner and change mode .Layout of system memory .NET Mainframe Systems Data Warehouse Advanced Data Mining Parallel Computing Digital Image Processing Web Technology Pervasive Computing Microwave Engineering Credits 3:0:0 0:0:1 0:0:1 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 0:0:2 0:0:2 0:0:2 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 4:0:0 CS271 INTRODUCTION TO UNIX & LINUX Credits: 3 : 0 : 0 Unit I UNIX Operating System – History – Commands – essential Unix commands – vi editor – shell programming – The First Step – Taking Decisions – The Loop Control structure. Unit II The internal representation of Files – INODE .Super block .Manipulation of the process address space .read – write – file .saving the context of a process .ADDITIONAL SUBJECTS Code CS271 CS272 CS273 CS274 CS360 CS361 CS362 CS363 CS364 CS365 CS366 CS367 CS368 CS369 CS370 CS371 CS372 CS373 CS374 CS375 Name of Course Introduction to UNIX & LINUX Unix & Linux Lab Database Management Systems Lab C++ and Data Structures Graphs Random Processes and Queues Communication and Switching Techniques Advanced Digital Signal Processing Optical Fiber Communication Digital Signal Processing lab Internetworking lab Computer Communication lab ASP .scenarios for retrieval of a buffer .Stat and fstat .Adjusting the position of the file I/O-lseek – close .creation of special files . Introduction to Kernel: Architecture of the UNIX operating system .

Unix-The Complete Reference. Bubble sort. Unit IV Linux Administration – GNOME and KDE – Managing users – The command line – Booting and Shutting down .signals . Roderick W Smith.Changing the size of a process.Process Control: Process Creation .System calls for time. Dreamtech. 2003. Circular Linked list. Richard Rosinki.Process termination . Merge Sort. 1986. Prentice Hall of India. Stack. Linear Search.clock. NewDelhi. Trees Unit II: Sorting And Searching Techniques Sorting.Awaiting process termination – invoking other programs . Maruice J. Kenneth Rosen. Insertion Sort. Binary Search. Bach. Printing – Network configuration. Intranet services in Linux – NFS and NIS. (Chapters 2-11) 2.. Linux Administration. Heap Sort. CS 272 UNIX & LINUX LAB Credit: 0:0:1 6 experiments will be notified by the HOD from time to time CS273 DATABASE MANAGEMENT SYSTEMS LAB Credit: 0:0:1 6 experiments will be notified by the HOD from time to time CS274 C++ AND DATA STRUCTURES Credits 4:0:0 Unit I: Introduction To Data Structures Linked list. Oreilly. Process Scheduling and time: process scheduling .sleep . 1999. Mc-Graw Hill. Text Books: 1. Queue. Doubly linked list. 2. Binary Tree Search. Reference Books: 1. Selection Sort.the user ID of a process . Linux in a Windows world. Steven Graham & Steve Shah. James Farber. Quick Sort. Douglas Host.File systems – Compiling the Linux Kernel Unit V Linux Internet services – DNS – Setting up web server using Apache – the secure shell. Third Edition. 2005. Searching. Single linked list. Unit III: Objects And Classes . The Design of the UNIX operating system.

error handling in file I/O. CS360 GRAPHS RANDOM PROCESSES AND QUEUES Credits 4:0:0 Unit I Trees: Trees-Labeled Trees-Tree Searching-Undirected Trees-Minimal Spanning Trees. class hierarchies. pointers and arrays. McGraw-Hill Publishing Company Limited. constructors. Unit V: Virtual Functions Virtual functions. new and delete operator. Robert Lafore. const and classes. multiple inheritance. C++. McGraw. Text Books 1. Pune. Unit IV: Operator Overloading Overloading Unary and Binary Operator. Object Oriented Programming in C++. “Data Structures. data conversion. Streams and files: stream classes. (Chapters 7 and 8 of Text Book 1) Unit II Probability Theory: Random Experiment.A Simple class. Jean-Paul Tremblay and Paul G Sorenson. 1994. Copy Constructors. level of inheritance. 2. 2. Pointers: address and pointers.Two Dimensional Random Variables-Probability Function of (X.CDF. as function argument. stream errors. Static class data. Friend functions. and Pitfalls. 1998.Properties- . 1999. file pointers. Returning objects from functions. An Introduction to Data Structures with Applications. New Delhi. Arrays and Strings. Y)-Joint PDF. pointers to pointer. 1999. New York. Random Variables: Discrete Random Variable-Probability Function-Continuous Random Variable-Probability Density Function (PDF)-Cumulative Distribution Function (CDF) and its Properties –Special Distributions-Discrete Distributions-Continuous Distributions. exceptions. Herbert Schmidt. Object as function argument. McGraw-Hill Publishing Company Limited. New Delhi.Definitions of Probability. C++ Objects and Data types. derived class constructors.Laplace Approximation-Generalisation of Bernoulli’s Theorem Multinomial Distribution. The Complete Reference. Templates and exception: function templates. this pointer. Inheritance: derived class and base class. Sartaj Sahni. class templates. Third Edition. Galgotia Publishers. Overloaded Constructors. Static functions. C++ objects as physical objects. public and private inheritance. Algorithms and Applications in C++”. Topics in Graph Theory: Graphs-Euler Paths and Circuits-Hamiltonian Paths and Circuits-Transport Networks-Matching Problems-Coloring Graphs. structures and classes.Conditional ProbabilityIndependent Events-Theorem of Total Probability-Baye’s Theorem -Bernoulli’s Trials DeMoivre . References 1. disk file I/O with streams.Hill Publishing Company Limited. pointer and c-type strings. 2. Overloading member functions.

Discrete Mathematical Structures. 2nd Edition. Mean Ergodic Theorem. 2006. T.G. Veerarajan. E(Ws) and E(Wq) -Characteristics of Infinite Capacity.Binomial Distribution as Limiting Form of Hyper Geometric Distribution-M. Poisson. Multiple Server Poisson Queue Model II Characteristics of Finite Capacity. E(Nq). Single Server Poisson Queue Model I .Properties-Ergodicity-Mean Ergodic Process.Correlation and Distribution of Ergodic Process-Power Spectral Density and its Properties -System in the Form of Convolution-Unit Impulse Response Properties (Chapter 6 of Text Book 2) Unit V Queueing Theory: Symbolic Representation of Queueing Model-Difference Equations Related to Poisson Queue Systems-Values of Po and Pn for Poisson Queue Systems-Characteristics of Infinite Capacity. Recurrence Formula for Binomial and Poisson Distribution -Poisson Distribution as Limiting Form of Binomial Distribution. Robert C. pi*} and Y: {j. Single Server Poisson Queue Model III . Probability.Standard Normal Distribution-Normal Probability Curve-Properties and Importance of Normal Distribution (Chapter 5 of Text Book 2) Unit IV Random Processes: Classification -Methods of Description -Special Classes -Average Values Stationary-Example of a SSS Process. Telecommunications Transmission: Power levels-Four wire circuits-Digital transmission- . ISBN: 81-297-0465-X 2.Properties of R(τ)-Cross correlation . Relations Among E(Ns). 5th Edition. 2004. Pearson Education.Analytical Representations -Wiener Process Function Autocorrelation . Busby and Sharon Ross. of Negative Binomial Distribution-Special Continuous DistributionMoments of Uniform Distribution . Multiple Server Poisson Queue Model IV -Non Markovian Queuing Model V (Chapter 8 of Text Book 2) Text Books: 1. CS361 COMMUNICATION AND SWITCHING TECHNIQUES Credits 4:0:0 Unit I Introduction: The development of telecommunications-Network structures-Network servicesRegulation-Standards-The OSI reference model for open systems interconnection. Geometric. Statistics and Random Processes.F. Bernad Kolman.Marginal Probability Distribution.Memoryless Property of Exponential DistributionReproductive Property of gamma Distribution-Relation Between Distribution Function of Erlang Distribution -Density Function of Weibull Distribution.Conditional Probability Distribution-Independent RVsRandom Vectors-Marginal Probability Distribution of X: {i. pj*} (Chapters 1 and 2 of Text Book 2) Unit III Some Special Probability Distribution: Special Discrete Distribution-Mean & Variance for Binomial. Tata McGrawHill.Characteristics of Finite Queue. Weibull and Exponential Distribution. Erlang. ISBN: 0-07-060170-4. Hyper Geometric.

Prentice Hall of India. 1992. Unit III Switching Networks: Single stage networks-Gradings-Link systems-Grades of service of link systems-Application of graph theory to link systems-Use of expansion-Call packingRearrangeable networks-Strict sense nonblocking networks-Sectionalized switching networks. ISBN 81-203-0713-5.Frequency division multiplexing-Time division multiplexing-Transmission performanceTransmission systems Unit II Evolution of Switching systems: Message switching-Circuit switching-Manual systemsFunctions of a switching system-The Strowger step by step system-Register translator sendersDistribution frames-Crossbar systems-A general trunking –Electronic switching-Reed electronic systems-Digital switching systems. 1999. Telecommunication Switching Systems and Networks. ISBN 81-7808-457-0. Networks: Analog networks-Integrated digital networksIntegrated services digital networks-Cellular radio networks-Intelligent networks-Private networks-Numbering-Charging-Routing-Network Management. CS362 ADVANCED DIGITAL SIGNAL PROCESSING Credits 4:0:0 Unit I . Unit V Packet switching: Statistical multiplexing-Local area and wide area networks-Large scale networks-Broadband networks.Flood. 6-CCITT signaling system no. Time division switching: Space and time switching-Time division switching networks-Grades of service of time division switching networks-Non blocking networks-Synchronization. Telecommunications Switching.E. 7-Digital customer line signaling. Traffic and Networks. Signalling: Customer line signaling-Audio frequency junctions and trunk circuits-FDM carrier systems-PCM signaling-Inter register signaling-Common channel signaling principles-CCITT signaling system no. Pearson Education. Text Book J. Unit IV Control of switching systems: Call processing functions-common control-Reliability. Reference Book Thiagarajan Viswanathan. Telecommunications traffic: The unit of trafficCongestion-Traffic measurement-A mathematical model-Lost call systems-Queuing systemsSimulation. availability and security-Stored program control.

Minimum Variance Spectrum Estimation . Optical Sources –Light – Emitting Diodes (LEDs)-Laser Diodes [3. (Text book 1 Chapters 5. 4.Random Processes – Filtering Random Processes – Spectral Factorization – Special Types of Random Processes – Least Squares Method .3) Unit IV Non-Parametric Methods .3) Unit II The Levinson . and Applications. 4.Durbin Recursion .6) Unit V Decimation by a Factor D . 2.The IIR Wiener Filter . 9.FIR Adaptive Filters Adaptive Recursive Filters.2-4.(Text Book1 Chapters 8.1-2.3] Unit III .Interpolation by a Factor I . ISBN 9814-12-646-2.The Maximum Entropy Method .[1. CS363 OPTICAL FIBER COMMUNICATION Credits 4:0:0 Unit I Overview of Optical Fiber Communication: Basic Network Information Rates – The Evolution of Fiber Optic Systems – Elements of an Optical Fiber Transmission Link – Simulation and Modeling Tools.1-7.4. (Text book 1 Chapters 7. Hayes.2.4.The Levinson Recursion .Multistage Implementation of Sampling Rate Conversion . Monson H.Frequency Estimation.1-3.4) Unit III The FIR Wiener Filter . 3.Implementation of Sampling Rate Conversion . Wave guiding. Manolakis.Parametric Methods .Sampling Rate Conversion of Bandpass Signals .1-5. and Fabrication: The Nature of Light – Basic Optical laws and definitions – Optical fiber modes and configurations –Mode theory for circular waveguides – single –mode fibers – Graded-Index fiber structure. Optical Fibers: Structures.Applications of Sampling Rate Conversion. Proakis and D.6 ] Unit II Signal Degeneration in Optical Fibers. J. (Text Book 2 Chapters 11.G.1 -1.9) Text books: 1.6.Sampling Rate conversion by an Arbitrary Factor . Fourth Edition.Pade’ Approximation .1-8. John Wiley and Sons. ISBN 0-13-187374-1. 2002.G.Discrete Kalman Filter .   2. Algorithms.3-3. Prentice-Hall.(Text book 1 chapters 2.1 . 2007.The Split Levinson Recursion.4.Attenuation – Signal distortion in optical waveguides – Pulse broadening in graded-index waveguides-Mode coupling. Digital Signal Processing: Principles. Statistical Digital Signal Processing and Modeling.Sampling Rate Conversion by a Rational Factor I/D .1-11.Discrete-Time Signal Processing .1-9.4.

1.3. 7. 6) . 12.4.] Unit V Optical Amplifiers: Basic Applications and Types of Optical Amplifiers – Semiconductor Optical Amplifiers – Erbium-Doped Fiber Amplifiers Optical Networks: Basic Networks – SONET/SDH.4. Agarwal. [8. McGraw Hill. 12. (Chapter 1. Fiber Optic Communication Systems. CS364 DIGITAL SIGNAL PROCESSING LAB Credit: 0:0:2 12 Experiments will be notified by the HOD from time to time CS365 INTERNETWORKING LAB Credit: 0:0:2 12 Experiments will be notified by the HOD from time to time CS366 COMPUTER COMMUNICATION LAB Credit: 0:0:2 12 Experiments will be notified by the HOD from time to time CS367 ASP. 7.4. Reference Book: G.[11.NET Server Controls and Client.ASP. 8.Net2.Side Scripts .ASP. Optical Fiber Communications.Noise Effects on System Performance WDM Concepts and Components: Operational principles of WDM-Passive Components – Tunable sources – Tunable Filters.NET Credits 4:0:0 Unit I Hello ASP.NET 2. (Chapters 4. New York.2. 7. ISBN 0-07-1164685.Wavelength-Routed Networks-Optical CDMA. Keiser.4. 3rd Edition.NET Web Server controls .[6.1. John Wiley & Sons.0 – Applications and Page Frameworks.1-11.8] Text Book: G.1-12.1-10.Broadcast-and-Select WDM Networks.P.4. ISBN: 0-471-21571-6. Optical Receiver Operation: Fundamental receiver operation – Digital receiver performance –Preamplifier Types – Analog receivers. 1997.Photodetectors: Physical principles of photodiodes-Photodetector Noise-Detector response time-Avalanche multiple noise. 7. 5. 10. Second Edition. 3) Unit II ASP.1-6. 2000.5] Unit IV Digital Transmission Systems: Point-to-Point links – Line coding.0 Web Server controls.

Introduction to virtualization & z/vm .6.History of z/vm .Performance . (Chapters 7.0. CS368 MAINFRAME SYSTEMS Credits :4:0:0 Unit .Sample configuration (Chapters 1. 2006. Wiley Dreamtech India(P) Ltd.NET 2.0. Farhan Muhammad.9 of Text Book 3) Unit V (SECURITY) z/OS System Authorization Facility & security managers . (Chapters 9.3. Chris Hart.4 of Text Book 1) Unit II (Z/VM Basics) System administration tasks . (Chapters 1. 3. Reference Book: Chris Ullman. ISBN: 81–265– 0669–5 .Hardware connectivity. 10) Unit V Data Binding in ASP.Unit III Validation Server Controls . Wiley Dreamtech.NET 2. (Chapters 11. 11of Text Book 1) Unit III (NETWORKING) Introduction to Mainframe networking . 13) Text Book: Bill Evjen. Scott Hanselman.z/OS system integrity (Chapters 5. John Kauffman. First Edition.Security in z/OS UNIX .Working with XML: The Basics of XML. ISBN 81-265-0672-5. Beginning ASP.10. 8) Unit IV Themes and Skins – Collections and Lists. Using Bound List Controls with Data Source Controls .I (Z/VM Basics) Introduction to Mainframe hardware systems . XmlReader and XmlWriter.0: Data Source Controls.NET 2. Devin Rader.System z virtualization & its challenges .2.z/vm security (Chapters 9. Srinivasa Sivakumar.Working with Master Pages. Professional ASP. 4 of Text Book 2) Unit IV (SECURITY) System z architecture & security .z/vm basic concepts.. 2006.

(Chapters 1. Per Fremstad. (Chapters 10. 5. 2007 . 2005. 3. ISBN: 81-7808-387-6. 8. CS370 ADVANCED DATA MINING Credits: 4:0:0 Unit I . Dow. Herne. 2. (Chapters 13. 2. Ross Clements. Fifteenth Indian Reprint 2005. Pearson Education (P) Ltd. Fourth Edition. 11.The Data Warehouse and Technology – The Distributed Data Warehouse. IBM RedBooks. Wiley Dreamtech (P) Ltd. (Chapters 4. (Chapters 1 – 14). March 2007. Rica Weller. First Edition 1997.(Chapters 10. Reference Book: Sam Anahory.Edi Lopes Alves. Building the datawarehouse. Dennis Murray. IBM RedBooks. Matt Nuttall. Data Warehousing in the Real World. (Chapters 7.Klaus Egeler. Lydia Parziale. Micky Reichenberg.Ken Dugdale.The Data Warehouse Environment – The Data Warehouse and Design. Christopher Hastings. November. IBM RedBooks. 3) Unit II Granularity in the Data Warehouse . Introduction to the New Mainframe: Networking. 11 of Text Book 3) Text Books: 1. 12) Unit V The Relational and the Multidimensional Models as a Basis for Database and design – Advanced Topics in the Data Warehouse. CS369 DATA WAREHOUSE Credits :4:0:0 Unit I Evolution of Decision Support Systems .Jason J. 6) Unit III Executive Information Systems and The Data Warehouse – External Data and The Data Warehouse – Migration to the architectural Environment. Mike Ebbers.. 9) Unit IV The Data Warehouse and the Web – Unstructured Data and The Data Warehouse – The Really Large Data Warehouse.Eli M.Inmon. 14) Text Book: William H. Introduction to the New Mainframe: Z/VM Basics. ISBN:81-265-0645-8. August 2006. Introduction to the New Mainframe: Security.

machine learning and statistics . (Chapter 6. CS371 PARALLEL COMPUTING Credits: 4:0:0 Unit I Introduction to Parallel Computing: Motivating Parallelism -Scope of Parallel Computing.2.Decomposition Techniques Characteristics of Tasks and Interactions .Preliminaries . Data Mining Concepts and Techniques. Data Mining Practical Machine Learning Tools and Techniques. Input: Concepts.Linear model . ISBN 81 – 8147 – 049 – 4.The minimum description length principle . Extension and applications.cross-validation .6) Unit II Principles of Parallel Algorithm Design .Mining association rules .2. Witten.Fielded applications . instances. .Instance-based learning .predicting performance. Morgan Kaufmann Publishers. (Chapters 1.1. 11) Text Book: Ian H.Parallel Algorithm Models-Basic Communication Operations :One-to-All Broadcast and All-to-One Reduction -All-to-All Broadcast and . and attributes. Second Edition. Eibe Frank. 2005. 10.Data mining and ethics.1 .Bayesian networks.1.Divide-and-conquer . ISBN 81 – 312 – 0050 – 7.Mapping Techniques for Load Balancing .evaluating numeric prediction . Reference Book: Jiawei Han. Micheline Kamber. Output: Knowledge representation. Elsevier.Applying the MDL principle to clustering. (Chapter 4) Unit III Credibility: Training and testing .Dichotomy of Parallel Computing Platforms Physical Organization of Parallel Platforms -Communication Costs in Parallel Machines Routing Mechanisms for Interconnection Networks.1. Chris Ullman. Parallel Programming Platforms: Implicit Parallelism: Trends in Microprocessor Architectures Limitations of Memory System Performance. 8).Generalization as search . Unit V The Weka Machine Learning Workbench: Introduction to Weka – The Explorer – The Knowledge Flow Interface (Chapters 9.6.Data mining and machine learning .counting cost .Classification rules – Clustering .Methods for Containing Interaction Overheads .clustering.Simple examples .2.Covering algorithm . 6. (Chapters 1.2. 3) Unit II Algorithms: Inferring rudimentary rules . 2.other estimates comparing data mining methods .7.Statistical modeling . 6. 6.predicting probabilities . (Chapter 5) Unit IV Implementations: Real machine learning schemes: Decision trees . 2001.

Linear Array and Ring.Controlling Thread and Synchronization Attributes .Fundamental Steps in Digital Image Processing -Components of an Image Processing System .Transitive Closure.1. 4.Connected Components .4.A Simple Image Formation Model-Image Sampling and Quantization-Basic Relationships between Pixels-Image Enhancement in the spatial domain.2. 8.Minimum Spanning Tree: Prim’s Algorithm .2.4.4.Composite Synchronization Constructs .The Building Blocks: Send and Receive Operations .5) Unit III Image Restoration – Introduction to Wavelets and Multiresolution Processing . 1.3.Image compression: Fundamentals . 7. Second Edition. 4.All-to-All Personalized Communication-Circular Shift .1. 8.Tips for Designing Asynchronous Programs OpenMP: a Standard for Directive Based Parallel Programming.Synchronization Primitives in Pthreads . 2.Improving the Speed of Some Communication Operations (Chapters 3.5) .Thread Cancellation . Vipin Kumar.5. 1. 4.Quicksort .Groups and Communicators (Chapter 6) Unit IV Programming Shared Address Space: Thread Basics -Why Threads? The POSIX Thread API Thread Basics: Creation and Termination .Bubble Sort and its Variants . 2.1. 8. 8. (Chapters1.Overlapping Communication with Computation.4. Pearson Education. George Karypis.3. 4.Single-Source Shortest Paths: Dijkstra’s Algorithm – All-Pairs Shortest Paths.Other Sorting Algorithms Graph Algorithms: Definitions and Representation .Reduction . 3) Unit II Image enhancement in the Frequency Domain: Introduction to the fourier transform and Frequency Domain –Smoothing Frequency Domain Filters . 8.4) Unit III Programming Using the Message-Passing: Principles of Message-Passing Programming .5.Bucket and Sample Sort . Anshul Gupta.Algorithms for Sparse Graphs.4.Sorting Networks . Introduction to Parallel Computing.Scatter and Gather . ( Chapters 5. (Chapter 7) Unit V Sorting: Issues in Sorting on Parallel Computers .ISBN 81-297-0407-2 CS372 DIGITAL IMAGE PROCESSING Credits: 4:0:0 Unit I Introduction. 2003.All-Reduce and Prefix-Sum Operations . 2.Image compression models-Error free compression-Lossy compression.3.MPI: the Message Passing Interface Topologies and Embedding .Sharpening Frequency Domain Filters-Homomorphic filtering (Chapters 4. Collective Communication and Computation Operations .1.(Chapter 9.10) Text Book Ananth Grama.

1.3.Gonzalez and Richard. Session. Digital Image Processing.Pratt.asa file.Looping and Decision Structures. 11. Addison Wesley.A Brief History of JavaScriptGetting Started with JavaScript-Creating JavaScript Functions-Storing Your Data in VariablesOperating on Your Data with Operators-Making Decisions with the If Statement-Executing different Code in Different Browsers-Working with Loops-Connecting JavaScript to HTML .Learning the SSI Directives – Creating Modular ASP Code. Third Edition.Logical Operators . 5 and 6 of Textbook 1) Unit III Using Cookies: Introduction to Cookies – Cookies and Your Browser – Creating a Cookie – Modifying and removing Cookies – Tracking Preferences with Cookies.Variables and Data Types .3) Text Book: Rafael .E.Boundary Descriptors .The Session Object – The Server Object – Using the global . 10.C. Using the Response Object: Create Output – Managing Output – Managing the Connection. 2002.Text Manipulation Functions . 10. and Server Objects: The application Object .6) Unit V Representation and Description: Representation . ISBN 81-7758-168-6. 11. (Chapters: 7.Unit IV Image Segmentation: Detection of discontinuities-Edge Linking and Boundary Detection Thresholding -Region-Based Segmentation -The Use of Motion in Segmentation (Chapters 10.4. Digital Image Processing. 10. 2002. (Chapter 11.Mathematical Functions .Woods. VBScript Functions and Objects: Data Conversion Functions .2. 10.Regional Descriptors. (Chapters: 2 and 3 of Textbook 1) Unit II ASP fundamentals: Using Server – Side Includes.Using Query String Information – Using Server Variables. 8 and 10 of Textbook1) Unit IV Know your JavaScript: What Is JavaScript’s Place in Ajax?. Active Data Objects Essentials: Microsoft’s Universal Data Access Strategy – The Connection Object – The Record set and Field Objects – The Command and Parameter Objects – Using the Errors Collection.2.Mathematical Operations . Second Edition.Data Formatting Functions . John Wiley. Reference Book: William K. CS373 WEB TECHNOLOGY Credits: 4:0:0 Unit I VBScript Language Elements: Constants .Using the Application.1. ISBN 9-81412620-9.Built-in Objects. (Chapters: 4. Using the Request Object: Using Form Information .Date and Time Functions .

Using Dynamic HTML Methods to Update Part of a Page -Using Dynamic HTML Properties to Update Part of a Page-Using Text Ranges to Update Part of a Page-Using createElement to Create New Elements on the FlyCreating Dynamic Tables-Catching the User’s Attention with Animation. (Chapters: 1 . 8) Unit III WAP: The WAP Architecture-Wireless Application Environment. Wiley-Dreamtech. Netscape. Connectivity: Wireless Wide Area Networks-Short Range Wireless Communication-Home Networks. Wiley India Pvt. 3 and 4 of Textbook2) Unit V XML and Ajax: Creating XML-Handling XML with JavaScript-Retrieving Data from an XML Document-Handling White Space in the Mozilla.Side Scripts-Using Ajax with XML.Buttons. (Chapters: 5. Devices: Information Access Devices-Handheld Computers-Sub-NotebooksPhones. Middleware Components: Programming Consumer Devices-Smart Card Programming-Messaging Components-Database Components. Embedded Controls: Smart sensors and Actuators-Smart Appliances-Appliances and Home Networking-Automotive Computing. Ltd. Operating Systems: Windows CEPalm OS-Symbian EPOC-Java Card-Windows for Smart Cards. (Chapters: 9.13) . Smith. 2007.4) Unit II Entertainment Systems: Television Systems-Game Consoles. Ajax Bible. (Chapters: 11 . Dynamic HTML and Ajax. ASP 3 Programming Bible.Styling Colors and Backgrounds Using CSS-Styling Locations in Web Pages. 7. Creating Mouseovers-Using Dynamic Styles-Using document. Smart Identification: Smart Cards-Smart Labels. Eric A.Styling Text Using CSS. Cascading Style Sheets and Ajax: Ajax-Enabled Menus-Getting Text Noticed in Ajax Applications-Scrolling Text.write. 2002. Serious Ajax Programming: Working with Multiple Concurrent XMLHttpRequest Requests-Handling JavaScript Sent from the ServerConnecting to Google Suggest-Calling Another Domain in Ajax-A Login Example-Working with Ajax and Head Requests-Eliminate Caching. Creating Ajax Applications: Writing Ajax-Interacting with Server-Side Code-Passing Data to Server. (Chapters: 2. 10 and 11 of Textbook 2) Text Books: 1. ISBN 81-265-0049-2 2. and Firefox Web Browsers-Handling White Space in a Cross-Browser Way-Accessing XML Data Directly-Accessing XML Attributes Values-Validating Your XML. Service Discovery: Universal Plug and Play-Jini-Salutation. Steve Holzner. ISBN 81-265-1217-2 CS374 PERVASIVE COMPUTING Credits: 4:0:0 Unit I What Pervasive Computing is all About: Times are Changing-Decentralization continuesApplied Pervasive computing-Pervasive computing principles-Pervasive Information Technology.

Energy and Power Flow – Poynting Theorem – Equivalent Circuit Parameters of Propagation Lines – Boundary Conditions – Polarization of Waves – Plane Waves in Unbounded medium – Lossy Dielectric – Lossless Dielectric – Good Conductor – Plane Waves at the Interface of two Media – Propagation of Microwaves in Ferrite – Faraday Rotation in Ferrites. Synchronization: What Synchronization is all About-The Challenge of Synchronizing DataIndustry Data Synchronization Standards-Today’s Synchronization Solution. Web Application Servers: Architecture and Components-WebSphere Application ServerWebSphere Everyplace Suite-Oracle Portal-to-Go.Narrow Band and Broad Band Matching – Tapered Transmission Lines. Circular. (Chapters 4 and 5) Unit III Microwave Network Theory and Passive Devices: Symmetrical Z and Y Matrices for Reciprocal Network – Scattering or S Matrix Representation of Multiport Network – Microwave Passive Devices. Travel and Business Services: Travel Services-Business Services. Springer. Lothar Merk. ISBN 3-540-6712 CS375 MICROWAVE ENGINEERING Credits 4:0:0 Unit I Introduction to Microwave-Basic Transmission Line theory: Transmission Line EquationsCharacteristic and Input Impedances – Reflection and Transmission Coefficients – Standing Wave – Mismatch Losses in Transmission Lines . Consumer Services: Interactive Advertisement-Loyalty-ShoppingPayment Services.Smith Chart – High Frequency Lines.17) Unit V Portals and Access Services: Internet Portals-Wireless Portal-Broadcasting Portal. Impedance Transformations for Matching: General Condition.21) Text Book: Uwe Hansmann. Propagation of Electromagnetic Waves: Wave Impedance and Propagation – Electromagnetic Wave . Nicklous. Martin S. Pervasive Computing Handbook. Surface – Power Handling Capability of Microwave Transmission Lines. (Chapters: 18 . 2001. Ridge.Equation. (Chapters 1 – 3) Unit II Microwave Transmission Lines: Ideal Coaxial Line – Planar Transmission Lines – Wave Guides Types: Rectangular. Home Services: The System View-Communication Services-Home Automation-Energy ServicesSecurity Services-Remote Home Healthcare Services. (Chapters: 14 . (Chapter 6) Unit IV . Thomas Stober. Device Management: Tasks of Device Mangement Systems-Tivoli Device Support Infrastructure-User Profiles and Directory Services.Unit IV Gateways: Connectivity Gateway-Wireless Gateway-Transcoding-Residential Gateway.

ISBN 0-07-463577-8. 2005. (Chapter 7) Unit V Microwave Filter: Filter Parameters – Mismatch Effects – Microwave Realization of the Filter Elements – Filter Design – Microwave filters: Low-pass. Collin. (Chapter 8 and 11) Text Book: Annapurna Das and Sisir K Das. . Microwave Engineering. ISBN 0-47117096-8. Pozar. Third Edition. Foundations for Microwave Engineering. Second Edition. Tata McGraw Hill Publishing Company Ltd. John Wiley. ISBN 0-07-112569-8. Reference Books: 1. High-pass. 1992. Robert E. Microwave Engineering. 2000. Band-pass and Band-stop filters. 2. Applications of Microwaves: Microwave Radar Systems – Microwave Communication Systems – Industrial Application of Microwaves. David M.Microwave Resonators: Coaxial Resonators – Waveguide Cavity Resonators – Cavity Excitation and Tuning – Q-Factor of Microwave Cavities – Loaded and External Q – Coupled Cavities – Re-Entrant Cavity – Hole and Slot Cavity – Microstrip Resonators. McGraw Hill International Edition.

Sign up to vote on this title
UsefulNot useful