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

polymorphism. Object oriented philosophy.J. classes. case study. 1997.M. object identity. class hierarchy. encapsulation and information hiding. 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 .CS206 SYSTEM SOFTWARE Credit: 4:0:0 Marks (40 + 60) Unit : I Language processors. Dhamdhere – System programming & operating system. object relationships and associations. J. Language processing activities – fundamentales of language processing –specification – languages processor development tooling – scanning and parsing. Software Tools: Software tools program development – editors – debug monitor. attributes. Unit III : Macros And Macro Processors Macro definition and Call macro expression – nested macro calls – advanced macro facilities – design of macro 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. aggregations and object containment. System programming. objects. D. Reference Books 1. Unit : IV Compilers and Interpreters: Aspects of compilation – memory allocation – compilation of expressions.Donovan.. Text Book 1. a K Pre-requisite: CS201 OBJECT ORIENTED PROGRAMMING IN C++ Unit I : An Overview Of Object Oriented Systems Development Object Basics . 1996. object behavior and methods. Tata McGraw Hill . Tat McGraw Hill Publishing Co. persistence.compilation of control structure code optimization – interpreters. Unit II : Assemblers Elements of assembly language programming – pass structure of assembles – design of twopass assemblers – single pass assembler for PCs.

developing effective documentation.4 only). (chapter 10) Designing access layer.10. refining attributes for the vianet bank objects. class visibility. UML diagrams. defining attributes for vianet bank objects. reusability.(chapters 1-3) Unit II : Object Oriented Methodologies Rumbaugh et al. Ali Bahrami. designing methods for the vianet bank objects. frameworks.12.3 . class responsibility. 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 . Bernd Oestereich.Object oriented systems development life cycle: Software development process. Addison-Wesley. case study. designing methods and protocols.11. the unified approach. and collaborators. 2000. Classification: Classification theory. Developing Software with UML. UML dynamic modeling. UML extensibility and UML metamodel.case driven approach. (sections 11. packages and managing classes. use-case model. (chapters 6&7) Unit IV : Identifying Object Relationships. (chapters 8 & 9) Unit V : Designing Classes UML object constraint languages. building high quality software. common class patterns approach. business process modeling. McGraw Hill. 12. case study.( sections 12.(chapters 4 & 5) Unit III : Object Oriented Analysis Process Business object analysis.Data members – methods – Overloading Division of Computer Science & Engineering 7 . case study.4 ) Text-Book 1. responsibilities. super-subclass relationships.11) Designing view layer. Object-Oriented Analysis and Design in Practice.11. Booch methodology.3. object responsibility. a-part of relationships.'s object modeling technique. classes. UML class diagrams. use-case driven approach. use-case diagrams. packages. macro level process. defining methods for vianet bank objects Design process and design axioms: Corollaries. noun phrase approach. design patterns.12.10. use. Object Oriented Systems Development using the Unified Modeling Language. Attributes And Methods Association. designing classes. 1999 (chapters 1-10 & sections 11. use-case driven object oriented analysis. Jacobson et al methodologies. Reference Book 1. Unified modeling language: Static and dynamic models.11. patterns. naming classes.

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

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

windows multithreading.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. Programming Windows..Conger.. Left Click.Multitasking and Multithreading: modes of multitasking. Charles Petzold. Text Book 1. Developing a program that works on different fonts over a text.Blocking Vs Non Blocking primitives – Buffered versus Unbuffered primitives – Implementation of ClientServer model. 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. Copy. win Inet and FTP. 9. 2. Paste. File Open File. 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 . Developing an Application supporting Graphical objects like arc. CS211 WINDOWS PROGRAMMING LAB 1. ellipse etc. Mouse UP. Galgotia Publications Ltd. a K Unit I : Introduction Distributed Processing .File concept could be used Creation of an editor performing all the operations like Cut. event signaling. Mouse Down etc. Microsoft press. Unit II : Communications Communications in distributed systems – The Client-Server model . 7. Close File Save etc. 8. Developing an Application which scrolls the text vertically .. 1998 Reference Book 1. Internet : Windows sockets. 4. 1996. Middle Click. 6. 3. Windows API Bible – Programmer’s reference. James L. 5th edition.. 5. thread synchronization.

Entity types. relationship types .New York.. DBMS architecture and data independence.G. B+ trees. Database System Concepts and Architecture: Data models. a K Unit II : Record Storage and Primary File Organizations Secondary storage devices. McGraw Hill..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. schemas and instances. Data Modeling using the Entity-Relationship: conceptual Data models for Database design. specialization and generalization. placing file records.S. CS213 DATA BASE MANAGEMENT SYSTEMS Unit I : Databases And Database Users Characteristics of the Database approach. 2.. Hashing techniques.1994. multilevel indexes. Types of single-level ordered index. Unit IV : Distributed File Systems File service interface – Semantics of the sharing – Distributed file systems. Mukesh Singal and Shivaratri N. Conceptual object modeling using UML class. “Advanced Concepts in Operating System “. 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 . modeling. and the Relational Algebra: Relational model concepts. implications of the Database approach. “Modern Operating Systems”. Database languages and interfaces. roles and structural constraints. heap files. ER diagrams. buffering of blocks. Text Books 1. indexes. Tanenbaum A. The Relational Data model. Database models: The hierarchical database model. Relational Constraints. Naming conventions. Database system environment. Enhanced Entity-Relationship and Object Modeling: Subclasses. constraints and characteristics of specialization and generalization. refining the ER design for the company Database.data abstraction and knowledge representation (Chapters 1 to 4). Index Structures fir Files. Unit V : Software Concepts: Distributed Programming Languages – Issues – Applications – Review of Distributed Databases. sorted files. relational constraints and relational Database schemas. sets attributes. advantages of using DBMS. operation on files.Prentice Hall. classification of DBMS. relational operations (Chapters 5 to 7).

Languages. multivalued dependencies. 2000. Fundamentals of Database Systems. object query language. an overview of SQL 3. other object-oriented concepts. and Design: overview of the Object model of ODMG. Third Edition. Shamkant B. Data base systems . Object database standards. object structure. Raghu Ramakrishnan. WCB/McGraw Hill.Unit III : SQL – The Relational Database Standard Data definition.Codd normal form. mapping EER model concepts to relations. Queries. Database Management Systems. 1998. the domain relational calculus (Chapters 8 to 9) Unit IV : Concepts For Object-Oriented Databases Object identity. Relational database design algorithms and further dependencies: Algorithms for relational database. Constraints and schema changes in SQL2. functional dependencies. 3. delete update statements in SQL. ER-and EER-to-Relational Mapping and other Relational Languages: Relational Database design using ER-to-relational mapping. complex objects. Unit V : Object Relational And Extended Relations Database Systems Object-relational features of Oracle 8. Reference Book 1. specifying general constraints as assertion. object definition language. a K 1. Ramez Elmasri. Suneel galgotia . Functional dependencies and Normalization for relational databases: informal design guidelines for relation schemas. object database conceptual design (Chapters 11 to 12).1998 2. Navathe. 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 . implementation and related issues for extended type systems. Galgotia publications private limited . normal forms based on primary keys . 6. 7. other dependencies (Chapters 13 to 15). join dependencies. Text Book 1. Encapsulation of operations. and type constructors. 4. 2. methods. 8. The tuple relational calculus. Insert.Addison Wesley. 5. overview of the C++ language binding.Boyce. and persistence.

Exception handling 14. Unit IV : Syntax Directed Translation Syntax directed translation scheme – Semantic actions – Implementation – Intermediate code generation – Address codes. procedure calls. Usage of functions 12. Unit III : Parsing Techniques Parse trees – Left most and right most Parsing techniques. declarations.Array references.Top down and bottom up parsing – Handles – Shift reduce Parse. Usage of database triggers 15.9. 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 . expressions control statements. BFILE management 10. Student Information System 19. 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. Usage of explicit cursors & implicit cursors 11. Packages (Oracle forms) 16. parse trees and syntax treesMethods of translating assignment statements.Recursive descent Parser – Operator precedence and predictive Parse. case statements – Record structures. quadruples and triples. reduction and syntax trees – A ambiguity – context free grammars – Capabilities of a context free grammar – Regular expressions. Symbol tables and error handling: Representation of information in symbol tables – Data structures for symbol tables – Errors.Lexical phase errors – Syntactic phase errors. Usage of procedures 13. Unit V : Code Optimization And Code Generation Principal sources of optimization – Loop optimization – The DAG representation of basic blooks – Introduction to code generation. Inventory control 18. 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. 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. Personnel management system 17.

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

Text book Maruice J. Bach. Basic commands 2. Write a shell script to convert the decimal number to binary number. 4. 2. a K 1. 5. Write a shell script to check whether the given string is Palindrome or not. 6. (chapters 1 to 11 only) CS217 UNIX AND LINUX LAB UNIX 1. 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. To delete a particular pattern from a line in a file.Unit : V Interprocess communication: Process tracing. Write a shell script for students evaluation 4. 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. Write shell script to simulate a calculator. network communications. lines in a given file. 5. 3. Prentice-Hall of India. 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. 3. 5. 15 Division of Computer Science & Engineering . system V IPC. Write a shell script to count number of words. The Design of the UNIX Operating System. 2. 7. Write a shell script to find the user login 3. 7. 1986. 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. Write a shell script for employee details using files. sockets. Basic UNIX commands. 6.

Write a C++ program to implement doubly linked list(addition. insertion in all positions). Dennis Murray. insertion in all positions). 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 . Tuning and Testing: Capacity planning – Tuning the data warehouse – Testing the data warehouse – data warehouse features. 11. Pieter Adriaans. “data Mining .Addison Wesley. Write a C++ program to implement stack operation 9. 13. Write a C++ program to convert the tree to binary tree.” Data Warehousing in the Real Word”. 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.1996 2. Text Books 1. Addison Wesley. Write a C++ program to convert the given infix expression to postfix and prefix form. Write a C++ program to implement queue operation 10.1996. deletion.8. a K Unit – V Planning. Dolf Zantinge. Write a C++ program to implement singly linked list(addition.III Data warehouse architecture – system process – process architecture – Design – database schema – partitioning strategy – aggregations – data marting – meta data – System and data warehouse process managers. 14. Write a C++ program to convert the given expression to ALP using stack 12. Sam anahory. deletion. Unit . Unit – IV Hardware and operational design of data warehouses – Hardware architecture – Physical layout – security – Backup and recovery – service level agreement – operating the data warehouse. 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.

Grady Booch. Unit – II THE OBJECT : Importance of classification – Key abstractions and mechanism . 1997. Berry. Ali Bahrami. “Object Oriented Analysis and Design”.. Unit – III APPLICATIONS ( Case Study Approach ) : Client-Server Computing – ATM Banking – Inventory Tracking System – System Requirements – Analysis – Design – Evolution – Maintenance. a K Reference 1. 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. 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.Reference Book 1. “Object Oriented Systems Development” McGraw Hill. Prentice Hall of India. 2. Gordon S. The Benjamin /Cummings publishing Company..Elements of Notation – Class diagrams – State Transition Diagrams – Object Diagrams – Interaction Diagrams – Module Diagrams – Process Diagrams – Applying Notation. Michael J. Unit – IV OBJECT-ORIENTED METHODOLOGIES : Introduction – Survey of some of the object oriented methodologies – Rumbaugh object modeling technique – The Booch methodology – The Jacobson methodology. Linoff. 1994. James Rumbaugh. n u r a y i n U s r e v y it Division of Computer Science & Engineering 17 . “Mastering Data Mining”. 1999. “Object Oriented Modelling and Design”.

CS303 DISTRIBUTED OPERATING SYSTEMS Credit 4:0:0 Marks 40 +60 Unit-I Introduction to O. 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.Summary.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. 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 .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. 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 . 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.S: What is an operating system – Operating system? – History of operating system concepts – operating system structure. Unit-III Synchronization in Distributed Systems : Clock Synchronization -Logical Clocks – Physical clocks – Clock Synchronization Algorithms – Mutual Exclusion – A Centralized Algorithm – A Distributed Algorithm .

.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. Deital “ An Introduction to Operating Systems”. : “ Modern Operating Systems”. Harvey M.Hall of India.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 . Prentice. Reference Book 1. 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. Tanenbaum.Addison – Wesley Publishing Company – Revised edition – 1984.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 .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. .Fault Tolerance – Summary.

Second edition. “ Cryptography and Network Security”. 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 . Bruce Schneier. 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 . Second Edition – 1996.1999 Reference Book 1.V Intruders.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. Prentice Hall. “ Applied Cryptography”.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. William Stallings. Viruses and Worms Intruders – Viruses and Related Threats Firewalls Firewall Design Principles – Trusted Systems Text Book 1.IV Authentication Applications – IP Security – Web Security Unit .

Text Book 1. McGraw Hill International. Inc. Roger S Pressman. Walker Royce.. 2000.Business Organizations – project organizations – Evolution of organizations – Process Automation – Tools: Automation Building Blocks – The project Environment .Round. “ Software Project Management”. “Software Engineering”. 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. Fourth Edition. Addison Wesley publications. 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 . 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.Trip Engineering –Change Management – Infrastructures – Stakeholder Environments Unit-V Project Control and process Instrumentation – The seven Core Metrics – Management Indicators – Work and progress. 1996. 2.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.System Architecture – summary – problems – references.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. Lan Somerville. Addison Wesley Longman.. Reference Book 1. “Software Engineering A Practitioner’s approach” .

. 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 .CPU control unit – Pipeline Control – Instruction Pipelines – Pipelines Performance – Superscalar Processing – Summary – Problems – references. John P. William Stallings.Unit-III Control Design : Basic Concepts – Introduction – Hardwired Control – Design Examples – Microprogrammed Control – Basic Concepts – Multiplier Control Unit. “ Computer Organization and Architecture”. 1996 a K Unit – I Introduction to Genetic algorithms – History of evolutionary computation. Text Book 1. Unit – II Theoretical foundations of Genetic algorithms – Fundamental theorem – Schema processing – Building block hypothesis – Minimal deceptive problem – Statistical mechanics approaches. Unit-IV Datapath Design: Fixed. Reference Book 1. 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. “Computer Architecture and Organization” McGraw Hill International Editions.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. Hayes. Prentice Hall of India. biological terminology – Robustness of traditional optimization and search methods – Goal of optimization – Elemant of genetic algorithms – A simple genetic algorithm. Fourth Edition.

Genetic algorithms in search. Melanie Mitchell. David E. 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. a K Real –time Specification and Design Techniques : Natural languages – mathematical specification – Flow charts – structure charts – Pseudocode and PDL. 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. Types.POSIX. DFD – Petri Nets – Warnier – Orr notation – state charts. FSA. Unit – II Programming languages and tools : Language features – survey of commonly used programming languages – programming environments – run – time support Real –Time Systems life cycle.Performance measure for real –time systems. 1989. An introduction to Genetic Algorithms. Unit-III Real –Time OS : Task – control block model – Task states – Task management . CS308 REAL TIME SYSTEMS Unit-I Introduction: Real – time Definitions. optimizing and machine learning. 2. 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 . Prentice hall of India.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. Examples – Structure of a RTS – Task classes Real – time system issues : Architecture issues – OS issues – other issues . Task assignment and scheduling : classical uniprocessor scheduling Algorithms – Task assignment – Fault Tolerance scheduling. Addison Wesley. 1998. Goldberg.

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

Tata McGraw Hill Companies Inc. John Wiley & Sons. John E. Doerr Alan and Levasseur Kenneth.PDA – Equivalence of acceptance by final state and empty stack – Equivalence of PDA’s and context free languages. 2. 2. 6. “Introduction to automata theory. 2. Ullman.Martin. John C. Galgotia Publication (P) Ltd. “Introduction to languages and the theory of computation”. 4. “Applied Discrete Structures for Computer Science”. Non deterministic finite state automaton – equivalence of DFA and NFA – Equivalence of regular grammars and finite automata. Narosa publishing house 1995..Unit –V : Finite Automata Definition of deterministic finite state automation. 5. Text Books 1.Hopcroft and Jeffrey D. CS310 SOFTWARE DEVELOPMENT LAB Suitable Laboratory assignments on System Design may be given on the following topics 1. “Applied Combinatorics”. Push Down Automata: Informal description – Definition – Deterministic . Reference Books 1. 1984. Alan Tucker. 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 . languages and computation”. 1997. 3.

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 .ADDITIONAL SUBJECTS Code No.

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

Deadlock Prevention – Deadlock Avoidance –Deadlock Detection – Recovery from deadlock . 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. 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 .Memory Management Background – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with Paging.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 .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.

Using AWT Controls. and Menus – Images . Regular Expressions and Other Packages Text Book: 1. Data transmission-Concepts and terminology-Analog and Digital data transmissionTransmission Impairments – channel capacity Division of Computer Science and Engineering 4 . John Wiley and Sons.Networking . Layout Managers.Exploring java. Peter Baer Galvin. UNIT IV java.util Part 1:The Collection Framework. Greg Gagne. Graphics and Text .Data Types. (Chapters 1-14) CS222 JAVA PROGRAMMING Credits: 3 : 1 : 0 UNIT I The Genesis of Java .space Management – RAID Structure – Disk Attachment – Stable-Storage Implementation – Tertiary-Storage Structure. (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 .Input/Output: Exploring java.The Complete Reference.util Part2: More Utility Classes . 2002.Inheritance . Java2 .Packages and Interfaces .io . Operating System Concepts.java.New I/O.String Handling . Tata McGraw-Hill.Event Handling UNIT V Introducing the AWT: Working with Windows. Text Book: 1.Introducing Classes UNIT II Methods and Classes . Herbert Schildt. 2002.Exceptions Handling Multithreaded Programming UNIT III I/O.lang . Variables and Arrays – Operators Control Statements .OSI – TCP/IP protocol architecture.The Applet Class . Sixth Edition. Fifth Edition. Applets and Other Topics . Abraham Silberschatz.An Overview of Java .

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

2002. 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 . Michael T. 2000.McConnell.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. Sara Baase and Allen Van Gelder. Analysis of Algorithms. Reference Books: 1. Analysis and Internet Examples. Algorithm Design: Foundations. Pearson Education. Goodrich and Roberto Tamassia. Jeffrey J. Johnwiley and Sons. Narosa publishing House. 2002. 2. Computer Algorithms – Introduction to Design and Analysis.

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.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. 12) a K n u r a y i n U s r e v y it Division of Computer Science and Engineering 7 .9. 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. 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.

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

1-3.8) UNIT IV Syntax directed definitions – Construction of Syntax trees – Bottom up Evaluation of Sattributed definitions – L attributed definitions . Cryptography and Network Security. 2003.4.3.4.5. 2003. Prentice Hall. 2. 3.1-10. Reference Books: 1.2. 6. Thomas Hardjono and Jennifer Seberry. Springer.Incorporating a Symbol table – Symbol tables (Sections: 2. 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.3) UNIT V Intermediate Languages – Declarations – Assignment Statements .2) a K n u r a y i n U s r e v y it Division of Computer Science and Engineering 11 .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. 1996. 4. Josef Piepryzyk.Source Language Issues – Storage Organization – Storage Allocation Strategies (Sections: 5.1-8.1-2.1-7. Fundamentals of Computer Security.Text Book: 1. and 7. Second Edition. Applied Cryptography. William Stallings. 6.Top down Translation – Type systems – specification of a simple type checker .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.1-4. 9.6.1-9. and 10.1. Bruce Schneier.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 .1-5. Third Edition.

CS234 SOFTWARE ENGINEERING Credits: 3 : 0 : 0 UNIT I Software Engineering .Principles. Compiler s. 2. Kenneth C. 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 . 1986. 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 . Aho. Compiler Construction – Principles and Practice. Morgan Kauffmann Publishers. Ravi Sethi.Text Book: 1. 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. Techniques and Tools. Reference Books: 1. 2004.Cooper and Linda Torczon.Introduction – A system Approach – An Engineering Approach – Members of the development team . 1997. processes. 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. Pearson Education Private Limited. Vikas Publishing House. Jeffrey D.Modeling the Process and Life Cycle – the meaning – Software Process Models – Tools and Techniques . products. Engineering A Compiler. processes. Alfred V. Keith D. UNIT IV Testing the system – principles of system testing – function testing – performance testing – reliability. availability. and resources – approaches to evaluation – selecting an evaluation techniques – assessment vs prediction – evaluating products – evaluating processes – evaluating resources – Improving predictions. Ullman.

Java servlets .The Maturing of Java .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 .The Birth of J2EE .Why J2EE? J2EE Multi-Tier Architecture . 2001. Third Edition. James F. Witold Pedrycz. Software Engineering – An Engineering Approach.Databases .J2EE Best Practices . John Wiley and Sons.– improving prediction – improving products – improving processes – general improvement guidelines Text Book: 1. Software Engineering – Theory and Practice.J2EE Design Patterns and Frameworks UNIT II J2EE FOUNDATION .Peters. 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 .Java Beans and Java Message Service . Shari Lawrence Pfleeger. (Chapters 1-13) Reference Book: 1. Pearson Education. 2000.

Web Services Description Language (WSDL) Text Book 1. Mc-Graw Hill. and Integration (UDDI) Electronic Business XML .Universal Description.Java Message Service – Security . 2002.SOAP .Java Interface Definition Language and CORBA.The complete Reference”. UNIT IV Java Remote Method Invocation .The Java API for XML Registries (JAXR) . 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.JavaMail API . James Keogh. Discovery.Java Naming and Directory Interface API UNIT V WEB SERVICES . “J2EE .UNIT III Enterprise JavaBeans .

Predicate Logic .Fuzzy Logic Fuzzy Rule Based System .Selection of various parameters in BPN . Shin.Crisp Logic .Fuzzy Relations .Single Layer Artificial Neural Network .Effect of Tuning Parameters of the BPN . Real Time Systems.Taxonomy of Neural Network Architectures .Fuzzy Set Theory .LR-type Fuzzy numbers .Applications.Inference by Fuzzy BP .Defuzzification Methods – Applications .Fuzzy Systems .M.Back Propagation Networks .The Hopfield Memory .Fuzzy Back propagation Networks . Bailey.A.Variations of Standard Propagation Algorithm UNIT II Associative Memory – Autocorrelators – HeteroCorrelators . 1999. An Introduction To Real Time Systems. McGraw-Hill.Fuzzy BP Architecture Learning in Fuzzy BP .Applications UNIT III Fuzzy Logic . C.Early Neural Network Architectures . Reference Book: 1. Kang G.Neural Network Architectures . Buhr.Fuzzy Neuron . 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. 1997.Fuzzy versus Crisp . Raymond J.Crisp Sets .Model of an Artificial Neuron .Architecture of a back Propagation Network .Back propagation Learning – Applications . 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) .Fundamentals of Neural Networks .Human Brain .Fuzzy Sets .Adaptive Resonance Theory – Introduction .Exponential BAM – Applications .Basic concepts of Neural networks .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.Learning Methods .Crisp Relations .Characteristics of Neural Networks . CS241 SOFT COMPUTING Credits: 4 : 0 : 0 UNIT I Introduction to Artificial intelligence Systems . Donald L. Krishna.ART1 ART2 . Prentice Hall International.

Interprocess Communication: introduction – the API for the Internet protocol – external data representation and marshaling – client –server communication – group communication. Fuzzy Logic and Genetic Algorithms Fuzzy Associative Memories .GA in Fuzzy Logic Controller Design .Problem Description of Optimum Design . And Genetic Algorithms Synthesis and Applications. Operating system support: introduction – the operating system layer – protection – process and threads – communication and invocation .Generational Cycle .FAM.Applications Text Book: 1.Mutation operator .GA Based Weight Determination .Differences and similarities between GA and other traditional methods .Advances in GA . 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) . (Chapters 1-12.UNIT IV Genetic Algorithms .Genetic Modeling .Multilevel Optimization . UNIT II Distributed objects and remote invocation: introduction – communication between distributed objects – RPC – events and notifications. Neural Networks. Fuzzy Logic.A.Inversion and Deletion . S.Bitwise Operators . 2003.Fundamentals of Genetic Algorithms .Single Association FAM . An introduction . Distributed file systems: introduction – file service architecture – sun network file system – the Andrew File system – recent advances.Fitness Function – Reproduction . System Model: introduction – architectural models – fundamental models.Creation of Offsprings . 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.Genetic algorithm based BPN .Real life problem .Soft Computing Tools .Fuzzy Hebb FAMs .FAM involving a Rule Base .FAM Rules with Multiple Antecedents/Consequents – Applications .Fuzzy Logic Controller .Genetic Algorithm History Basic Concepts .operating system architecture.Integration of Neural Networks.Inheritance operators – Crossover . 14.Applications UNIT V Hybrid Systems .Rajasekaran and G. Prentice Hall India.Fuzzy Logic Controlled Genetic Algorithms .Convergence of Genetic Algorithm – Applications . Vijayalakshmi Pai.Fuzzy Constraints .Working Principle – Encoding .

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

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

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

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

Laplante. Second Edition.Harcourt Asia Pvt.Resources and source access control UNIT IV Multiprocessor Scheduling.Scheduling flexible computations . Real-Time Systems Design and Analysis. Varaiya.Optical LANs-Optical paths and Networks (Chapter 11) Text Book: 1. J.S. Walrand. Phillip A. Ltd. High Performance Communication Network.Optical Cross Connects .. Resource access control .DWDM Systems . Prentice Hall of India Pvt.. 2000.Synchronization . Second Edition. Jane W.Priority Driven Scheduling of Periodic Tasks UNIT III Scheduling Aperiodic and Sporadic Jobs in priority driven Systems .Liu. (Chapters 1-12) Reference Book: 1.UNIT V Optical Networks: Optical Links . 2001. CS315 REAL TIME SYSTEMS Credits: 4 : 0 : 0 UNIT I Typical Real-Time Application .Tasks with temporal distance constraints UNIT V Real time communication .Commonly used approaches to Real time scheduling UNIT II Clock driven Scheduling .Reference model of Real time System . Morgan Kaufmann. Real-Time Systems. Pearson Publications. 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 . 2000. Ltd.Hard Versus Soft Real Time System ..Operating Systems Text Book: 1.

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

Semantic Augmentations to CFG Rules .the OpenMP language extension-pipelined MIMD-multithreading.Introduction . 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 .Representing Linguistically Relevant Concepts Related Representational Approaches .Alternative Conceptions of Meaning . Pearson Publications.Dialog Managers and Conversational Agents .Dialog Structure and Coherence .prefix problem . 2000. 21) Text Book: 1.the performance perspective.Idioms and Compositionality . UNIT III Distributed Memory Multiprocessors: Distributing data and operations among processor/memory pairs programming with message passing .shared memory programming alternatives and scope-a shared memory multiprocessor programming language . Daniel Jurafsky.Martin.First Order Predicate Calculus . 19.Semantic Attachments for a Fragment of English . 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 .Quantifier Scoping and Complex Terms . 14) UNIT V Semantic Analysis – Syntax-Driven Semantic Analysis . Speech and Language processing.characterizing algorithm behavior for large problem size-programming parallel prefix-speedup and efficiency of parallel algorithms .The Design of a Syntax-Driven Analyzer .parallel prefix algorithms .Using Statistical Techniques Usability and System Development (Chapters 15.Meaning Structure of Language .Direct Translation .Computational Requirements for Representations . 12.Machine translation-Language Similarities and Differences .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 .Dialog Acts -Automatic Interpretation of Dialog Acts .The Interlingua Idea: Using Meaning .Robust Analysis .getting started in SIMD and MIMD programming-parallelism in algorithms.Dialogue &Conversational Agents . James H. Potential for Parallel Computations: Parameters characterizing algorithm parallelism . (Chapters 10.The Transfer Metaphor .

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

and Threads . AppDomains. Contexts. Late Binding. Second Edition.Object-Oriented Programming with C# UNIT II Exceptions and Object Lifetime .NET Remoting Layer .NET Platform.Understanding .Wireless transmission-frequencies for radio transmission – Signals – Antennas . Andrew Troelsen. (Chapters: 3-12.Interfaces and Collections . C# and the .Cellular systems Medium access control-SDMA. TDMA. FDMA. Delegates.Spread Spectrum . 2003.The System.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 .Callback Interfaces.NET Assemblies UNIT IV Processes. Springer (India) Private Limited. 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 . and Attribute-Based Programming UNIT V Object Serialization and the .IO Namespace Text Book: 1. and Events UNIT III Advanced C# Type Construction Techniques . CDMA – Comparison of S/T/F/CDMA Division of Computer Science and Engineering 27 .Type Reflection.

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

Network and System Management. and Broadband.Network Statistic Measurement Systems.The Information Model.Integrated Services: ISDN.Functional Model.The SNMP Model.Based Networks.Distributed Computing EnvironmentsTCP/IP.History of Enterprise Management.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 . SNMPv1 Network Management: Communication Model and Functional Models.Basic Foundations: Network Management Standards. Organization and Functions.Information ModelCommunication model.Network Management Applications: Configuration management.SNMPv1 Network Management: Organization and Information Models.Organization Model. Network Node componentsWAN .The History of SNMP Management.Fundamental of Computer Network Technology: Network Topology.Accounting Management. UNIT V Network Management Tools and Systems.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.Compatibility with SNMPv1. UNIT II SNMP.SNMPv3 Applications.RMON SMI and MIBRMON1.Event correlation Techniques. Network Management Model.Security Management. UNIT IV Broadband Networks and services.Communication Protocols and Standards.encoding Structure.System Management-Enterprise Management Solutions.Transmission Technology.Current Status and Future of Network Management.System Overview.Network Management Systems.Network Management: Goals.Internet Organizations and Standards.Remote Monitoring.Security. Frame Relay.ATM Technology.SNMPv3 Management Information Base.Management Network.SNMPv3 User.Performance management.SNMPv3 DocumentationSNMPv3 Documentation Architecture.Commercial Network Management Systems.The SNMPv2 Management Information BaseSNMPv2 Protocol.Fault Management.Macros.ATM Remote Monitoring-Case Study.CS324 NETWORK MANAGEMENT Credits: 5 : 0 : 0 Marks: (40 + 60) UNIT I Data Communication and Network Management Overview: Analogy of Telephone Network Management.Data and Telecommunication Network.Access Control.Architecture.The Organization Model. UNIT III SNMP Management: Major Changes in SNMPv2.SNMPv2 Structure of Management Information.SNMPv3.SNMP Management: RMON.Report Management.Based Security Model.RMON2.Case HistoriesChallenges of Information Technology Managers. LAN.SNMPv2 System Architecture.Policy Based Management.Network Management System Platform. Broadband and TMN Management.

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

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 .

Circular linked lists. Variables and expressions.Insertions and deletions .Garbage collection .Data types.Fixed length string method . arrays.variations on linked list structures. Program modules in PSEUDO Logic and Control structures in PSEUDO Linked lists. Doubly linked circular list .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 .workspace/Index table method Processing efficiency considerations of the workspace/Index talk method .Specifics of PSEUDO .2.(Chapters1.Linked list method. Dummy Headers.3) Division of Computer Science & Engineering AN-19 . constants. singly linked lists .

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

1-12.8) UNIT III Deadlock Characterization – Methods for handling deadlocks. Sixth Edition. ch 11) UNIT V File-System Structure – File-System Implementation – Allocation Methods – Free-Space Management – Efficiency and Performance – Recovery – I/O Hardware – Application . (ch 10. Protocol architecture: The need for a protocol architecture-a simple protocol architecture . Peter Baer Galvin. 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.6.7.1-13. (ch 8.1-7.3. Digital data communication techniques: Asynchronous and synchronous transmission -Types of Error -Error Detection -Error Correction-Line configurations. ch 7. Data transmission: Concepts and terminology-Analog and Digital data transmissionTransmission Impairments – channel capacity.1-10. ch 13.Interfacing.3. Digital signals & analog signals – analog data digital signals and analog signals. 12. ch 6. Greg Gagne.4) Text Book: Abraham Silberschatz. Data link Control: Flow control-Error Control-HDLC. (ch 12.1-5.I/O Interface – Kernel I/O Subsystem – Disk Structure – Disk Scheduling –Disk Management – Swap-space Management. Operating System Concepts.Memory Management Background – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with Paging.UNIT II Threads – Multithreading Models – Threading Issues – Java Threads – Basic Concepts of CPU Scheduling – Scheduling Criteria – Scheduling Algorithms .4-12. (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 . John Wiley and Sons.2.Process Synchronization – The Critical Section Problem – Synchronization Hardware – Semaphores – Classic Problems of Synchronization – Critical Regions – Monitors – OS Synchronization (ch 5. ch 14. (Chapters:1-3) UNIT II Signal encoding techniques: Digital data.Deadlock Prevention – Deadlock Avoidance –Deadlock Detection – Recovery from deadlock .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.OSI – TCP/IP protocol architecture. 2002.4.1-14.

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 . Third Edition. (Chapters 13. Data and Computer Communication. 2003.circuit switching networks circuit switching concepts . 10. Transport protocols: Connection – oriented TCP – TCP – Congestion control .Congestion control Traffic management .control signaling . Tata McGraw-Hill.113. William Stallings. (Chapters 18. (Chapters 8.Congestion control in packet switching networks . Seventh Edition. Sections 13.UNIT III Multiplexing: FDM – Synchronous TDM – statistical TDM – Asymmetric DSL – xDSL Circuit Switching and packet switching: switching networks . 15) UNIT V Internet work protocols: Basic protocol functions – principles of internetworking – connectionless internetworking – Internet Protocol. Prentice Hall of India. 2004.UDP. Routing in Switched Networks: Routing in circuit switched network – Routing in packet switched network – least cost algorithms.soft switch architecture-Packet switching principles-X. Local Area Network Overview: Background – Topologies and transmission media – LAN protocol architecture – bridges – layer2 and layer3 switches. Forouzan. ISBN: 0-07-058408-7.20) Text Book: 1. 12) UNIT IV Congestion control in switched Data network: Effect of congestion .5. Behrouz A.Frame Relay congestion control. Credits: 4 : 0 : 0 a K UNIT I Analysis Basics: what is analysis. ISBN: 81-203-2355-6 Reference Book: 1. Data Communications and Networking.25-Frame Relay.

Analysis and Internet Examples. Sara Baase and Allen Van Gelder.McConnell. Pearson Education. Jeffrey J. Johnwiley and Sons. 2. 2002. (Chapter 2) UNIT III Loaders and Linkers: Basic Loader Functions – Machine Dependent Loader Features – Machine Independent Loader Features – Loader Design Options – Implementation Examples. Reference Books: 1.UNIT III Matching algorithms: String matching . (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) . Goodrich and Roberto Tamassia. (Chapter 1) UNIT II Assemblers: Basic Assembler Functions – Machine Dependent Assembler Features – Machine Independent Assembler Features – Assembler Design Options – Implementation Examples. Computer Algorithms – Introduction to Design and Analysis.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. (Chapter 3) UNIT IV Macro Processors: Basic Macro Processor Functions – Machine Independent Macro Processor Features – Macro Processor Design Options – Implementation Examples. Michael T. Analysis of Algorithms. 2000. Algorithm Design: Foundations. Narosa publishing House. 2002. Credits: 4 : 0 : 0 UNIT I Background: Introduction – System Software and Machine Architecture – The Simplified Instructional Computer (SIC) – Traditional (CISC) Machines – RISC Machines.

[Sections: 9.16.3.17.16.2.20.UNIT V Other System Software: Text Editors – Interactive Debugging Systems.3.14. [Sections: 17.2.16. ISBN : 81-7808-036-2.10.18.Beck.3.2. Systems Programming and Operating Systems.4] UNIT III MD5 Message Digest Algorithm – Secure Hash Algorithm – HMAC – Digital signature Standard – Kerberos Version 5 – X. CS251 CRYPTOGRAPHY AND NETWORK SECURITY Credits 4:0:0 UNIT I Services. [Sections: 1.1.2] UNIT II Principles of public Key Cryptosystems – RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Basics of Elliptic Curve Cryptography. Mechanisms and Attacks – Block Cipher principles – Data Encryption Standard – Strength of DES – Evaluation criteria for AES – AES Cipher. [Sections: 15.M.1. 1999. An Introduction to System Programming.16.1.3.2.3.5.7.3. 1999. Reference Book: D.3.10. Addison Wesley.1.1.14.17.2.9.509 Authentication Service.4.1.1.Dhamdhere.20.3) Text Book: L.4.12.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) .16.1.13.12.1. (Chapter 7 : Sections 7. Tata McGraw-Hill Company.2.10.2.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. System Software.18.18.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.3.15.1.2. ISBN : 0-07-463579-4.2.5. [Sections: 12.5.16.4.1.

Modeling the Process and Life Cycle – the meaning – Software Process Models – Tools and Techniques . 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? . availability. 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. products. Prentice Hall. Network security. Prentice-hall. ISBN No: 81-7808 . processes. 2003.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.decomposition and modularity – architectural styles – issues – characteristics – techniques – evaluation and validation – documenting the design. William Stallings.Text Book: 1. 2002. processes. and maintainability – acceptance testing – automated system testing – test documentation –– delivering the documentation – maintaining the system – the changing system – measuring maintenance characteristics – techniques and tools. Third Edition. CS252 SOFTWARE ENGINEERING Credits: 4: 0: 0 UNIT I Software Engineering – A system Approach – An Engineering Approach – Members of the development team . Second edition. a K UNIT IV Testing the system – principles of system testing – function testing – reliability.Practical Process modeling – Planning and Managing the project – tracking Progress – project personnel – Effort Estimation – Risk management – the project plan – process models and project management.ISBN:81-203-2213-4.Mike Speciner. and resources Division of Computer Science & Engineering AN-25 . Cryptography and Network Security. and resources – approaches to evaluation – selecting an evaluation techniques – assessment vs prediction – evaluating products – evaluating processes – evaluating resources – Improving predictions.Radia Perlman. Charlie Kaufman.

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

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

the OpenMP language extension-pipelined MIMD-multithreading. MPI -hardware managed communicationdistributed cache.characterization of communication . UNIT III Distributed Memory Multiprocessors: Distributing data and operations among processor/memory pairs programming with message passing .parallel prefix algorithms characterizing algorithm behavior for large problem size-programming parallel prefixspeedup and efficiency of parallel algorithms . Text Book: Harry F. Pearson Education. 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. Temporal behaviour of parallel programs: temporal characterization of cache behaviour – read sharing in multiprocessors with distributed caches – message waiting in message passing multiprocessors – conclusion.the performance perspective. Fundamentals Of Parallel Processing. UNIT V Implementing Synchronization and Data Sharing: The character of information conveyed by synchronization . Potential for Parallel Computations: Parameters characterizing algorithm parallelism . MIMD Computers and Multiprocessors: Shared memory and message passing architecture-overview of shared memory multiprocessor programming . 2003.prefix problem . Interconnection Networks : network characteristics – permutations – static networks – dynamic networks – combining networks – performance. Jordan and Gita Alaghband.the message .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 .getting started in SIMD and MIMD programming-parallelism in algorithms.synchronizing different kinds of cooperative computations-waiting mechanisms-mutual exclusion using atomic read and write. UNIT IV Data dependence and Parallelism: Discovering parallel operations in sequential code variables with complex names-sample compiler techniques .data flow principles-data flow architectures.passing interface.shared memory programming alternatives and scope-a shared memory multiprocessor programming language . a K n u r a y i n U s r e v y it Division of Computer Science & Engineering AN-28 .

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

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

ISBN: 81. Biometrics – Identity Verification in a Networked World. Ruud Bolle. (Chapters 15.265. ISBN: 0-7923-8345-1 (Chapters 1-16.Unit – II Hand geometry based verification .0273 – 8. (Chapters 7 .Infrared identification of faces and body parts – Keystroke dynamics based authentication.14) Unit – V Large scale systems – Multimodal biometrics – Smartcard based authentication. Raj Nanavati. Anil Jain. Wiley. 18). Samir Nanavati. 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. 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 . Biometrics – Personal Identification in Networked Society. 1999. (Chapters 11 . Kluwer Academic Publishers. Sharath Pankanti. 16 and 18) Text Book: 1. Reference: 1. Micheal Thieme.Ear biometrics – DNA based identification.Speaker recognition . (Chapters 4 – 6) Unit – III Automatic online signature verification.10) Unit – IV Automatic gait recognition – Objective odour measurements . 2002.Recognizing persons by their Iris pattern – Retina identification.

Specification by Pre – and Post Conditions.Configuration Management Plan. Software Maintenance: Major Causes of Maintenance Problems – Reverse Engineering and Restructuring. The Software Life Cycle Revisited: Waterfall model. Project Planning and Control: System view of Project control – Taxonomy of Software Development projects-Risk Management-Techniques for Project planning and Control. Configuration Management: Tasks and Responsibilities.Verification and Validation. J2ME – The Complete Reference.Taxonomy of Quality Attributes-Perspectives on Quality-Quality system-Software Quality Assurance-Capability Maturity Model.distribution of Manpower over time.Notations that support the Design Process.Coverage Based Test Techniques.Fault Based Test Techniques-Error Base Test Techniques-Comparison of test techniques – Different test Stages.Verification and Validation.Thou Shalt Formalize. Tata McGraw Hill Edition. 2003. UNIT III Requirements Engineering: Requirement Elicitation. UNIT V User interface design: What/Where is User Interface? .Prototyping – Incremental Development-Rapid Application Development-Intermezzo. Kim Topley. O’Reilly publications.Requirements Specification DocumentRequirements Specification Techniques-A Modeling Framework. Formal Specification: Informal Specification Techniques – Model Oriented Specifications – Algebraic Specifications.Design Documentation .Verification and Validation. Cost Estimation: How not to estimate costEarly Algorithmic models.Manual test Techniques. Software Architecture: An Example. James Koegh.Testing and the Software Life Cycle-Verification and Validation Planning and Documentation.Producing a KWIC-Index-Architectural Styles. UNIT II People Management and Team Organization. J2ME – In a Nutshell.Organizational and Managerial issues. 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. a K UNIT IV Software Testing: Test Objectives.Text Book: 1.Design Patterns.Later Algorithmic Models. 2002. ISBN: 0-07-053415-2 Reference Book: 1. On Managing Software Quality: Measures and Numbers.Spiral Modeltowards a Software factory-Process modeling. Software Design: Design Considerations – Design Methods.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 .

Second Edition. interface.Specifications of the User Interface details-Evaluation. 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.Non-Technical Aspects of Software Reuse. Software Engineering Principles and Practice.Reuse and the software life cycle. CS333 SOFTWARE ARCHITECTURE Credit: 4:0:0 UNIT I Introduction: what is software architecture-why architect-other software architecture approaches. (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. 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 . (Chapters 8-10).Modeling subsystems. (Chapters 1-11.UML Quick tour: UML diagram summary-General diagramming conventions-The diagram-managing complexity. (Chapters 6-7) UNIT IV Subsystem Design: Terminology.ISBN: 9971-51-51-357-9. Hans van Vliet. 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. Transactionn and data design: Logical data architecture-logical data viewpoint-data model design-transaction design. 13-19).Systems – Task analysis.Reuse Tools and Techniques-perspectives of Software reuse. Process and deployment design: Physical data viewpoint-process viewpoint-deployment viewpoint. 2002. John Wiley and Sons. Software Tools: Toolkits – Language Centered Environments. Text Book: 1. Software Reusability: Reuse Dimensions – Reuse of Intermediate products. Software Reliability: An Example – Fault – Tolerant DisksEstimating Software Reliability. and layers-Mapping subsystem and layers to implementation. (Chapters 1-3) UNIT II Example system Overview: System overview-overview of system interfaces-constraintsmajor operational requirements and software requirements .Process Centered Environments.

Paul Clements and Rick Kazman. (Chapters: 1-4. Wiley. Edition 1998.7808 – 546 . Text book: 1. (Chapters: 5-7. Jeff Garland and Richard Anthony. Large – Scale Software Architecture-A Practical Guide Using UML.12).) UNIT II Analysis: Introduction: An Optical Illusion-An Overview of Analysis-Analysis ConceptsAnalysis Activities: From Use Cases to Objects-Managing Analysis. Modeling with UML: Introduction-An Overview of UML-Modeling Concepts-A Deeper View into UML. ISBN-81-265-0363-7.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. 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.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. Applying the viewpoints: Bottom-up architecture development-top-down architecture development-message protocol and interface development-reengineering existing systemsdocumenting the architecture-conclusion. Len Bass. Reference Book: 1. ISBN 81 . 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. Software Architecture in Practice. Requirements Elicitation: Introduction: Usability Examples-An Overview of Requirements Elicitation-Requirements Elicitation Concepts-Requirements Elicitation Activities-Managing Requirements Elicitation. 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) .) 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. Pearson Education. 2003.Project Organization and Communication: Introduction: A Rocket Example-An Overview of Projects-Project Organization Concepts-Project Communication Concepts-Organizational Activities. (Chapters 11.

Pearson Education. Configuration Management: Introduction: An Aircraft Example-An Overview of Configuration Management-Configuration Management ConceptsConfiguration Management Activities-Managing Configuration Management. Mapping Models to Code: Introduction: A Book Example-An Overview of MappingMapping Concepts-Mapping Activities-Managing Implementation. Allen H.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. Methodologies: Putting It All Together: Introduction: The First Ascent of K2-Project Environment-Methodology Issues-A Spectrum of Methodologies. Pearson Education.ISBN: 81-7808-549-6. Object-Oriented Software Engineering. Applying UML and Patterns. (Chapters: 8-10. Second Edition.) UNIT V Project Management: Introduction: The STS-51L Launch Decision-An Overview of Project Management-Project Management Concepts-Project Management Activities.Define the Real Customer Needs -Recommendations.Interfaces: Introduction: A Railroad Example-An Overview of Interface SpecificationInterface Specification Concepts-Interface Specification Activities-Managing Object Design. 2004.) Text Book: 1. Credits 4:0:0 a K UNIT I Introduction.Dutoit. Craig Larman.Commitment and Recommendations (Chapter 1. Bernd Bruegge. ISBN: 81-297-0433-1. 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.The State of the Industry Today –The Need to use Effective Requirements Practices.) UNIT IV Testing: Introduction: Testing the Space Shuttle-An Overview of Testing-Testing ConceptsTesting Activities-Managing Testing.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 . Rationale Management: Introduction: Slicing HamAn Overview of Rationale-Rationale Concepts-Rationale Activities: From Issues to Decisions-Managing Rationale. (Chapters: 1113.Commited to the approach. and 2003. (Chapters: 14-16.Requirements Process –Benefits of a Process Approach-Pitfalls of using a Process Approach . Second Edition. Reference Book: 1.

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.Young. CS337 SOFTWARE METRICS AND QUALITY MANAGEMENT Credits: 4:0:0 Marks: (40+60) a K UNIT I Software Quality: Total Quality Management. 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) . 2. Software Development Process Models: The waterfall Development model . 2001. 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 . ISBN :0-201-70912-0.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. Effective Requirements Practices. Addison Wesley.UNIT III Use and Continually improve a Requirements Process -Process. Ralph R.Process Designed .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. Familiar Proven industry .In-Process Quality Metrics – Metrics for Software Maintenance – Collecting software Engineering Data. Organizational and Project best practices-How to proceed (Chapter 10-12 ) Text Book: 1.

2003. (Ch :7-9) UNIT IV In-Process Metrics and Reports: Orthogonal defeat classification . 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. not just the destination.Software Process Maturity Assessment and Software Project Assessment .Establishing the Alignment Principle .Measuring Process Capability .Satisfaction with Company.Staged versus Continuous Debating Religion .Quality and Quality Management Metrics . (Ch :15-19) a K n u r a y i n U s r e v y it Text Book: 1. Function Point Metrics to Measure Software Process Improvement: Software Process Improvement Sequences .– 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.Kan. Metrics and Models in Software Quality Engineering.In-Process Metrics for Software Testing – Quality management – Possible metrics for acceptance testing to evaluate vendor developed software.Syntactic Constructs .Keep It Simple—or Face Decomplexification . Metrics and Lessons Learned for Object-Oriented Projects: Object-Oriented Concepts and Constructs . Concluding Remarks.In-Process Metrics for Outage Availability. Availability Metrics: Definition and Measurements of System Availability .Design and Complexity Metrics -Productivity Metrics .Process Improvement Economics – Measuring Process improvements at activity levels. Second Edition.Structure Metrics. Measuring and Analyzing Customer Satisfaction: Customer Satisfaction Surveys .A Proposed Software Project Assessment Method.Celebrate the Journey.Reliability. Do's and Don'ts of Software Process Improvement: Measuring Process Maturity .Measuring the Value of Process Improvement Measuring Process Adoption. ISBN: 81-297-0175-8. (Ch :10-14) UNIT V Conducting In-Process Quality Assessments: Preparation Phase -Evaluation Phase Summarization Phase . Availability.Halstead's Software Science .Recommendations and Risk Mitigation. Pearson Education. Conducting Software Project Assessments: Audit and Assessment . Measuring Process Compliance . Stephen H.Cyclomatic Complexity . 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. and Defect Rate Collecting Customer Outage Data for Quality Improvement .Lessons learned for OO projects. Complexity Metrics and Models: Lines of Code .Software Process Assessment Cycle .Analyzing Satisfaction Data .Take Time Getting Faster . Division of Computer Science & Engineering AN-37 .

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

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

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. Real-Time Systems. (Chapters 7. Jane W. Pearson Education. 2001. Chapters (1-10).10) Text Book: 1. ISBN : 81-7808-463-5. (Chapters 3.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. and tests – Strategies and methods for test case design I. 2000. Wiley . Alan C. Hypotheses. (Chapters 9. Real–Time Systems and Software.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. 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.S.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. ISBN :9814-12-6578. Reference Book: 1. (Chapters 5.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. Shaw.4) Division of Computer Science & Engineering AN-40 . (Chapters 1. (Chapters 1 .Liu.8) UNIT V Programming Languages.

and documentation. ISBN NO: 81-8128089-X (Chapters 1-16). 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. (Chapters 8 . (Chapters 11 . CS342 SOFTWARE TESTING LAB Credits 0:0:2 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. 2003. (Chapters 5 . 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. CS345 OPERATING SYSTEMS AND NETWORKING LAB Marks (50+50) 12 experiments will be notified by the HOD from time to time. (Chapters 14 -16) Text Book: 1. Practical Software Testing.7) UNIT III The test organization – Controlling and monitoring the testing process – Reviews as a testing activity. Springer . policies plans.10) UNIT IV A measurement program to support product and process quality – Evaluating software quality: A quantitative approach – Defect analysis and prevention. Ilene Burnstein.UNIT II Strategies and methods for test case design II – Levels of testing – Test goals.

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.

Data Typing Control Structures – Packages .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 . (Chapter 4) UNIT IV Real Time Databases .Runtime Support.Fault Tolerant Scheduling (Chapter 3) UNIT III Programming Languages and Tools: Desired Characteristics based on ADA .Timing Specification .Exception Handling – Overloading – Multitasking .Concurrency Control .IRIS Tasks .Transaction Processing .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 .Task Assignment Mode Charges .Task Scheduling . 2) UNIT II Task Assignment and Scheduling: Uniprocessor Scheduling .Estimating Program runtime (Chapter 1.

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

Mobile Web Services. Developing Enterprise Web Services. properties. Collection and indexers: collections – arrays – array list – queues – stacks – hash tables. QoS-Enabled Applications. (Chapters 9. Building QoS into Web Services and Applications. Reference Book: Ramesh Nagappan.creating objects – using access modifiers – creating fields.ISBN: 81-265-0499-4. QoS Metrics foe Web Services.net – data types – operators – statements. Pearson Education. (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 .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. (Chapters: 7. C# programming: loops – creating methods – exception handling – working with strings – working with regular expressions. ISBN: 81-297-0491-9 (Chapters 1 – 11).8) UNIT IV ADO. constructors – structs – static members – destructors – overloading (Chapter 1 . Mobile and Wireless.3) UNIT II Handling inheritance and delegates: working with inheritance – overriding virtual methods – abstract classes – polymorphism – boxing and unboxing – nested classes and interfaces – delegates. Challenges with Mobile. Where Are the Holes?. Design Patterns and Best practices. Web applications: web applications – web programming skills – web server controls – advanced windows control. Wiley Publishing Inc. Direct Mobile Web Service Access. Robert Skoczylas and Rima Patel Sriganesh. 2004.. 2004. Proxy-Based Mobile Systems. methods. James Webber. 6) a K UNIT III Windows applications: basic windows controls – advanced controls – multi window applications. (Chapters: 4. C# object oriented programming: creating classes . Web Services management. Developing Java Web Services. 10 and 11) Text Book: Sandeep Chatterjee.UNIT V Quality of Service-What Is QoS? Why Is QoS Important for Web Services?. J2ME Web Services. QoS-Enabled Web Services. CS255 C# PROGRAMMING Credits: 4: 0: 0 UNIT I Essential C#: Visual C#. Portals and Services Management-Portals.

3. Multithreading & Remoting: multiple threads – sleeping. 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.UNIT V Assemblies: Creating an assembly – multiple modules in an assembly – Creating Shared assembles.Relational model constraints and Relational database schemas –Update operations and dealing with constraint violations.15) Text Book: Steven Holzner. Delete and Update statements in SQL – Additional Features of SQL. UNIT III SQL 99: Schema Definition. Microsoft Visual C#. 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.2. Reference Book: Andrew Troelson. Attributes and keys – Relationships types. Entity sets. First Indian reprint. “C# and the .6). Second Edition.Security in c#. 2005.1 –3. aborting. 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 . Roles and Structural Constraints – Weak entity sets – Refining the ER design for the COMPANY database. resuming and joining threads – Synchronizing threads – Remoting – SOAP for remoting (Chapter 13. Intertech Instructor Series. Database Systems Concepts and Architecture: Data models.NET 2003.7) UNIT II The Relational Data model and Relational database constraints: Relational model concepts . 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. ISBN: 81-8128-062-8. 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. (Chapters : 1.Net Platform”. Data modeling using the Entity. ISBN: 81-297-0235-5. Pearson Education. relationship sets. More SQL: Assertions. suspending.Relationship model: Using high level conceptual data models for database design – Entity types. 2004.

Other dependencies and normal forms. Navathe. Fourth Edition. n u r a y i n U s r e v y it Department of Computer Science and Engineering 5 .mappings constraints .Entity relationship model: entities and entity sets relationships . Database System Concepts.14).Algorithms for relational database Schema design – Multi valued dependencies and Fourth Normal form – Join dependencies and Fifth Normal form – Inclusion dependencies. (Chapters : 10.Relational Algebra . ISBN:0072283637 CS257 INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS Credit : 4:0:0 Marks (40+60) a K UNIT I : Introduction Purpose of Database systems . McGraw-Hill. 9. Henry.9.F.Korth. UNIT II : Relational Model Structure . Text Book: Ramez Elmasri and Shamkant B. 2004. Relational Database Design Algorithms and Further dependencies: Properties of Relational decompositions. Pearson Education. Sudharshan.primary keys .4.E. QUEL. Basic File structures and Hashing: Introduction – Secondary Storage devices – Buffering of Blocks – Placing file records on Disk – Operations on Files – Files of unordered records .overall system structure .Commercial Query languages – SQL.Formal Query languages . S.Files of ordered records – Hashing Techniques – Other Primary File organizations – Parallelizing disk access using RAID – Storage Area Networks. Forth Edition.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. 2002. 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. Fundamentals of Database Systems.R diagram. ISBN: 81-297-0228-2 Reference Book: Abraham Silberschatz.Programming: Issues and Techniques – Database Stored Procedures (Chapter 8.11) UNIT V Disk Storage.1 – 9.

selection. Henry K Korth. Reference book Ramesh Elmasri. Navathe.third normal form . Sudarshan S.Job sequencing with dead lines Shortest path . concurrency control and recovery.Overview. 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 . other operation. Shamkant B.Database design and querying tool.Strassens's matrix multiplication . replication.General Method . Transformation. UNIT IV : Query Processing and Query Optimisation Query processing . Fundamentals of Database systems. operation. join operation. distribution and external data Text book Abraham Silberschatz.Tree vertex splitting . Fourth edition. system architecture. materialised views Distributed data base.Finding maximum and minimum .UNIT III : Relational Database Design Pitfalls .selection sort UNIT II Greedy method: General method .Boyce-codd Normal form . Fourth edition.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 . sorting. UNIT V : Oracle ORACLE .domain-key normal form. Database concepts. evaluation of operations Query optimisation . Mc Graw Hill International publications.Quick sort .Complexity analysis . SQL variation and extension. storage and indexing.fourth normal form.Estimating statistics of expression.Normalisation using functional dependencies .2004.Decomposition .Introduction to random algorithms . normalisation using join dependencies . Addison – Wesley Publications.

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

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

Pierre Baldi and Søren Brunak. Soft computing and Bioinformatics.2003.Hybrid models & neural network parameterization of graphical models -The single-model case .Universal approximation properties – Priors & likelihoods . 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 . John Wiley & Sons. Learning algorithms: miscellaneous aspects UNIT III Neural Networks: The Theory -Introduction .Prediction performance evaluation Different performance measures UNIT IV Hidden Markov Models: The Theory .Markov models & DNA symmetries Markov models & gene finders . Mount.Sequence correlations & neural networks – Prediction of protein secondary structure .Learning algorithms: backpropagation . David W.Introduction -Prior information & initialization Likelihood & basic algorithms .Statistical mechanics UNIT II Machine Learning Algorithms . Tinku Acharya.Prediction of signal peptides & their cleavage sites .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.1998.Introduction -Dynamic programming -Gradient descent EM/GEM algorithms –Markov chain Monte-Carlo methods .Bayesian inference & induction -Model structures: graphical models & other tricks .Simulated annealing – Evolutionary & genetic algorithms. Data mining – Multimedia. 2.Reference book Sushmita Mitra.Neural Networks: Applications Sequence encoding & output interpretation.Learning algorithms -Applications of HMMs: general aspects -Protein applications .Applications for DNA & RNA nucleotide sequences .Probabilistic Modeling & Inference: Examples -The simplest sequence models .Advantages & limitations of HMMs a K UNIT V Probabilistic Graphical Models in Bioinformatics .DNA & RNA applications . Bioinformatics: Sequence and Genome Analysis Department of Computer Science and Engineering 9 . Bioinformatics: the Machine Learning Approach – Publisher: MIT Press.

Security and Authorization: Introduction to Database Security-Access ControlDiscretionary and Mandatory Access Control-Security for Internet Application –Additional Issues Related to Security. a K UNIT III Parallel and Distributed Databases: Architecture for Parallel Databases-Parallel Query Evaluation.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 20. (Chapter 22). UNIT IV Information retrieval and XML Data: Colliding Worlds: Databases. 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.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. (Chapter 27). (Chapter 16-18). Serializability and Recoverability-Introduction to Lock Management-Lock Conversion-Dealing with Deadlock-Specialized Locking Techniques-Concurrency Control without Locking. 21). Crash Recovery: Introduction To ARIES –The Log: Other RecoveryRelated Structures-The Write-ahead Log Protocol –Check Pointing-Recovering from a System Crash –Media Recovery.Case Study: The Internet Shop. n u r a y i n U s r e v Marks: 40 + 60 y it Department of Computer Science and Engineering 10 . 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.

UNIT V Database Operating Systems-Introduction to Database Operating systems. UNIT II Distributed Resource Management-Distributed File Systems(upto 9. 2004. Theoretical Aspects. (Chapter 28.7 only).29). Distributed Shared memory(upto 10. Third Edition. ISBN : 0-07-115110-9(ISE) Reference Book: Elmasri & Navathae.4. ISBN: 81-297-0228-2w. n u r a y i n U s r e v y it Marks: 40 + 60 Department of Computer Science and Engineering 11 . 2003. Distributed Operating Systems-Architectures of Distributed Systems.3 only).7.1 only). Concurrency Control.4. Text Book: Raghu Ramakrishnan & Johannes Gehrke.5. Distributed Scheduling(upto 11. CS353 ADVANCED OPERATING SYSTEMS Credits: 4 : 0 : 0 UNIT I Synchronization Mechanisms (upto 2.3 only).4. Fundamentals of Database Systems.4 only). Multiprocessor Operating systems-Multiprocessor System Architectures. Theoretical Foundations(upto 5.7 only ). Database Management Systems. Further Reading: Advanced Transaction Processing-Data Integration-Mobile Databases –Main Memory DatabasesMultimedia Databases-Geographic Information System-Temporal Databases –Biological Databases –Information Visualization. Distributed Mutual Exclusion(upto 6. Fault Tolerance(upto 13. UNIT III Failure Recovery and Fault Tolerance-Recovery(upto 12.5.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.9 only). a K UNIT IV Protection and Security-Resource Security and protection(upto 14. Concurrency Control Algorithms.6.1 only). Pearson Education.7 only). third edition TataMcGrawHill.3 only).5 only). Agreement Protocols(upto 8. Distributed Deadlock detection( upto 7.

3.] 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. 1994. Mechanisms and Attacks – Block Cipher principles – Data Encryption Standard – Strength of DES – Evaluation criteria for AES – AES Cipher.] UNIT III MD5 Message Digest Algorithm – Secure Hash Algorithm – HMAC – Digital signature Standard – Kerberos Version 5 – X.12.RC4 Stream Cipher.1.Text Book: Mukesh Singhal.20. S. 2003. Introduction to Operating Systems: Advanced Course. 2002.] Text Book: William Stallings.1.2.16.2.4. Department of Computer Science and Engineering 12 a K n u r a y i n U s r e v y it .1.3.5.12.5. Todd Stubbs.1.5. Third Edition. Mike Speciner.2.2.16. Advanced Concepts in Operating Systems Distributed.17. Niranjan G.Shivaratri. and Multiprocessor Operating Systems. Tata McGraw-Hill.20.6. [Sections: 17.2 .16. ISBN 81-7808-902-5.509 Authentication Service. [Sections: 12.3.4.16.3.2.2.14.10.18.16. Second Edition.4. (Chapters 4-14.5.14. Gorman. Network Security. Cryptography and Network Security.] UNIT II Principles of Public Key Cryptosystems – RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Basics of Elliptic Curve Cryptography [Sections: 9.2.10. CS354 CRYPTOGRAPHY AND NETWORK SECURITY Credits 4:0:0 Marks (40+60) UNIT I Services.10.17.9. Prentice Hall.6.18. UNIT IV Pretty Good Privacy – S/MIME – IP Security Overview – IP Security Architecture – Authentication Header – Encapsulating Security Payload – Combining Security Associations – Key Management.18.] . Course Technology.3. [Sections: 15. Prentice Hall.3.2.13.2. Reference Book: Charlie Kaufman.1.4.16.15.[Sections: 1. Radia Perlman.1.16.18-20) ISBN : 0-07-047268-8 Reference Book: Mary S.1. 2001.1. Database. ISBN 81-203-2213-4.1.3.3.1.2.1.

Distributed Shared Memory: introduction – design and implementation issues – sequential consistency and Ivy – release consistency and Munin – other consistency models. Time and Global states: introduction – clock. Inter process Communication: introduction – the API for the Internet protocol – external data representation and marshaling – client –server communication – group communication. 8-16. Tim Kindberg.4-6. Maartenvan Steen. UNIT V Replication: Introduction – system model and group communication – fault tolerant services – highly available services – transactions with replicate data. 2002. UNIT III Name Services: introduction – name services and the DNS – directory and discovery services. Operating system support: introduction – the operating system layer – protection – process and threads – communication and invocation .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 file systems: introduction – file service architecture – sun network file system – the Andrew File system – recent advances. System Model: introduction – architectural models – fundamental models. Case Studies not included) Reference Book: Andrew S. UNIT II Distributed objects and remote invocation: introduction – communication between distributed objects – RPC – events and notifications. Jean Dollimore. Third Edition.operating system architecture. 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. (Chapters 1. Pearson Education.2. Distributed Transactions: introduction – flat and nested distributed transactions – atomic commit protocols – concurrency control in distributed transactions – distributed deadlocks – transaction recovery. Co-ordination and Agreement: introduction – distributed mutual exclusion – elections – multicast communication – consensus and related problems. 2001. UNIT IV Transactions and Concurrency control: introduction – transactions – nested transaction – locks – optimistic concurrency control – timestamp ordering – comparison of methods for concurrency control. Text Book: George Coulouris. events and process states – synchronizing physical clocks – logical time and logical clocks – global states – distributed debugging. Distributed Systems – Principles and Paradigms. Pearson Education. Tanenbaum. Distributed Systems – Concepts and Design.

Arithmetic Operators – Unary Operators – Relational and Logical Operators – Assignment Operators – The Conditional Operator – Library Functions – Data Input and Output – Preliminaries .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.Writing a C Program – Error Diagnostics – Debugging Techniques (Chapters 3-5) Unit III Control Statements – Preliminaries .Branching – Looping – More Looping – Still More Looping .Single Character Input & Output – Entering Input Data – More About scanf Function . break.Data Types – Constants – Variables and Arrays – Declarations – Expressions – Statements – Symbolic Constants (Chapters 1. comma statements – The Goto Statement – Functions Defining a Function – Accessing a Function – Function Prototypes – Passing Arguments to a Function – Recursion (Chapters 6.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 .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 .2) Unit II Operators and Expressions .Nested Control Structures – The switch.7) Unit IV Program Structure .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) . continue.

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

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

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

Multiple-Key Access. E-R Diagram. Extended E-R Features. Data Dictionary Storage. ISBN 81-7758476-6 a K Credits: 4:0:0 Unit I Introduction . B-Tree Index Files. Integrity Constraint. Abraham Silberschatz. Dynamic Hashing. Advanced SQL: SQL Data Types and Schema. Weak Entity. 4. Constraints. Transaction State. (Chapters 12.6-11. Database Design for Banking Enterprise. 8. Sudarshan. Multivalued Dependencies.(Chapters 1. Pearson Education. Shamkant B. Somayajulu. 8. Static Hashing.10. Ramez Elmasri. Ordered Indices.1-15.9. Reduction to Relational Schema.7.Modification of Database.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 . Korth and S.9.Dependency Theory.1.8. E-R model. (Chapters 3. 20. Implementation of atomicity and durability.6. Transaction: Transaction concepts. Application Design and Development: Triggers.5) Unit III Database Design and E-R Model: Overview of the design process. 2006. (Chapters 7. 2006.11. Storage and File Structure: File organization.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.L. Henry F. Embedded SQL. Navathi and Shyam K.2) Unit IV Relational Database Design: Features of good Relational Design. Fundamentals of Database Systems.1-6. Database-System Architecture: Centralized and Client-Server Architecture.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 . Server System Architecture. Atomic Domains and First Normal Form.1-3. E-R Design Issues. Concurrent executions. Database-Design Process. Durvasula V. Dynamic SQL. Decomposition Using Functional Dependencies. Functional. (Chapters 6. Organization of records in files. Authorization in SQL. 15.N.5) Text Book: 1. Modeling Temporal data. Reference Book: 1. Decomposition Using Functional dependencies. Authorization. B+ Tree Index Files.1-4. More Normal form.1-12. Comparison of Ordered Indexing and Hashing.8) Unit V Indexing and Hashing: Basic Concept. Mc Graw-Hill International Edition.1-7. Fifth Edition. 20. Database System Concepts. Gupta. Serialization. ISBN 007-124476-X.

Mathematical analysis of recursive algorithms.9.13) Text Book: 1.4) School of Computer Science and Technology AN-28 .1-11. 2.1-4.1-8.3. Seventh Edition.1 – 2. Fundamentals of algorithmic problem solving.Page Replacement – Allocation of Frames – Thrashing – Memory-mapped Files – Allocating Kernel Memory Other Considerations – Storage Management . Important problem types Fundamentals of The Analysis of Algorithm Efficiency – Analysis framework. (Chapters 12.Unit II Process Concept – Process Scheduling – Operation on Processes – Interprocess Communication –Communication in Client Server Systems – Multithreaded Programming – Multithreading models – Thread Libraries .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. 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. 3. (Chapters 3.13. 10. Mathematical analysis of non-recursive algorithms. Peter Baer Galvin.Disk Scheduling – Disk Management – Swap-Space Mnagement – RAID Structure – Stable-Storage Implementation – Tertiary Storage Structure .1-9. Greg Gagne.Threading Issues – Process Scheduling . 8.Basic concepts – Scheduling Criteria – Scheduling Algorithms – Multiple Processor Scheduling – Thread Scheduling – Operating System Examples – Algorithm Evaluation. (Chapters 6. 5) Unit III Synchronization – The Critical Section Problem – Peterson’s Solution .4. 4. Asymptotic notations and basic efficiency classes. Operating System Principles. (Chapters: 1. (Chapters 9. Abraham Silberschatz.9) Unit V Secondary Storage Structure – Overview of Mass Storage Structure – Disk Structure – Disk Attachment .6.1 – 1. 7.6) Unit IV Virtual Memory Management – Demand Paging – Copy-on-Write . 2006 ISBN 9812-53-176-9. 11. John Wiley & Sons.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.4.I/O Systems – I/O Hardware – Application I/O interface – Kernel I/O Subsystem – Transforming I/O Requests to Hardware Operations – Streams – Performance.

7.2.NET Assemblies (up to Configuring Shared Assemblies). 6. and Events-Advanced C# Type Construction Techniques-Introducing .1. Binary search. AppDomains.8.1.3. (Chapters: 9. 14.NET Remoting Layer (up to Building Your First Distributed Application) (Chapters 13.complete problems. Dijkstra’s algorithm. 10. ISBN: 81-7808-984-X.1 – 5.9 and 11) Unit III Processes.4. 6.4) Unit IV Space and Time Tradeoffs – Sorting by counting. 3 and 4) a K Unit II Understanding Object Life Time-Understanding Structured Exception Handling-Interfaces and Collections-Callback Interfaces Delegates. Heaps and heap sort. Divide-and-Conquer – Merge sort. (Chapters 1.3) Text Book: 1.4) Unit III Decrease-and-Conquer – Insertion sort. (Chapters: 3. Credits 4: 0: 0 Unit I The Philosophy of .NET – C# Language Fundamentals – Object Oriented Programming. Depth-first search and breadth-first search. Pearson Education. Quick sort. 6. 4. Anany Levitin. Binary tree traversals and related properties. 2003.4. Sequential search and brute-force string matching. Input enhancement in string matching. (Chapters: 7.Unit II Brute Force – Selection sort and bubble sort. Topological sorting. Balanced search trees.2) Unit V Greedy Technique – Prim’s algorithm.1 – 4. Huffman trees. Warshall’s and Floyd’s algorithms. 3. Transform-and-Conquer – Presorting.1 – 9. Kruskal’s algorithm.1.3. Introduction to the Design & Analysis of Algorithms. NP and NP. 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 . Limitations of Algorithm Power – P. (Chapters 5. Dynamic Programming – Computing a binomial coefficient. 8. (Chapters: 5. 6. Contexts and CLR Hosts and Building Multithreaded ApplicationsUnderstanding Object Serialization-The . Hashing. B-trees.1 – 7. 8.

Unit IV Building a Better Window with System. 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. 2005.Windows.NET (Chapter 22) Text Book: 1. Andrew Troelsen. 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.1 – 7. Total bandwidth and weighted fair – queuing servers. (Chapters 1.NET 2. 2. (Sections: 7. (Chapter 6) Unit IV Scheduling Aperiodic and Sporadic Jobs in Priority Driven Systems: Assumptions and Approaches – Deferrable servers – Sporadic servers – Constant Utilization. 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. (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. Pro C# 2005 and the .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 .Forms-Programming with Windows Forms Controls.0 Platform. (Chapters 19 and 21) Unit V Database Access with ADO. Springer Private Limited.

Balanced search trees. (Chapter 8) Text Book: 1. Kruskal’s algorithm. ISBN NO: 81–7758– 575-4 (Chapters 1-8) Reference Book: 1. Mathematical analysis of non-recursive algorithms. 4. Decrease-by-a-constant-factor algorithms. Pearson Education. Warshall’s and Floyd’s algorithms.S.1 – 5. (Chapters: 1.4) School of Computer Science and Technology AN-31 n u r a y i n U s r e v y it . 2. Divide-and-Conquer – Merge sort. Prentice Hall of India. Real-Time Systems. Laplante.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.1 – 9. Important problem types Fundamentals of the Analysis of Algorithm Efficiency – Analysis framework. Mathematical analysis of recursive algorithms. 9. Asymptotic notations and basic efficiency classes.1 – 6.4) Unit IV Dynamic Programming – Computing a binomial coefficient. Fundamentals of algorithmic problem solving.5) Unit II Brute Force – Selection sort and bubble sort. Horner’s rule and binary exponentiation. 5.6.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. Liu. Huffman trees.6) a K Unit III Transform-and-Conquer – Presorting. Dijkstra’s algorithm. 3. Binary search. Exhaustive search. 5. Problem reduction. Phillip A.2.2. Hashing. 3. 5.1 – 2. (Chapters: 3.5. 2000. (Chapters: 6. Binary tree traversals and related properties.4. (Chapters: 8.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 .3. 2001. The knapsack problem and memory functions. 7. Second Edition. Decrease-and-Conquer – Insertion sort.4.1. 8.1 – 4. Quick sort. 8. Jane W.1 -1. Real-Time Systems Design and Analysis. Topological sorting. Gaussian elimination.4.2 – 7. Sequential search and brute-force string matching. B-trees. Greedy Technique – Prim’s algorithm. Example. Space and Time Tradeoffs – Input enhancement in string matching. Variable-size-decrease algorithms. Depth-first search and breadth-first search.3. Heaps and heapsort.

Pearson Education. 13. Decision trees.3] a K Unit IV Pretty Good Privacy – S/MIME – IP Security Overview . [Sections: 6. Reference Book: 1. 2.1 – 6.Firewall Design principles – Trusted System – Common Criteria for Information Technology Security Evaluation. Anany Levitin.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 . 14. 9. 5. 14.2.3.3. P. Coping with the Limitations of Algorithm Power – Backtracking.1 – 16.1 – 10.3. 10.509 Authentication Service – Public Key Infrastructure. Challenges of numerical algorithms.4] Unit III Secure hash Algorithm – Whirlpool – HMAC – CMAC – Digital Signature Standard – Kerberos version 5(Only) – X. Introduction to the Design & Analysis of Algorithms. 15.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 .1.1. ISBN: 81-7808-984-X.2. Computer Algorithms – Introduction to Design & Analysis.3) Text Book: 1. (Chapters: 10. [Sections: 15. 20.3. Sara Baase & Allen Van Gelder.1 – 20.1 – 17.2. 3. [Sections: 17. 2000. 16. 9.4. 18.4.1 – 11.3.IP Security Architecture – Authentication Header – Encapsulating Security Payload – Combining Security Associations. 14.1 – 19.Unit V Limitations of Algorithm Power – Lower-bound arguments. Branch-and-bound. 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.NP and NPcomplete problems.2. Approximation algorithms for NP-hard problems. ISBN: 81-7808-171-7.1 – 12.1(Version 5 only). 2003. [Sections: 12. 19.1 – 18. Pearson Education. [Sections: Ch 1.1. 10.1 – 3. 11.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.3.

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

directories conversion of a path name to an INODE .link and unlink Unit III The structure of processes: process states and transitions .structure of the buffer pool .saving the context of a process .Super block .read – write – file .pipes .INODE assignment to a new file.structure of a regular file .DUP file Systems .Manipulation of the process address space . Introduction to Kernel: Architecture of the UNIX operating system .change directory change root .record locking .introduction to system concepts.Reading and writing disk blocks -advantages and disadvantages of the buffer cache.Stat and fstat .Buffer headers .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 .scenarios for retrieval of a buffer .creation of special files . The buffer cache .The context of a process .Adjusting the position of the file I/O-lseek – close .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 .File creation .Layout of system memory .Change owner and change mode . System calls for the file system: Open .

Intranet services in Linux – NFS and NIS.System calls for time. Mc-Graw Hill. NewDelhi. Stack. James Farber. Reference Books: 1. Trees Unit II: Sorting And Searching Techniques Sorting. Maruice J. Circular Linked list.signals . Merge Sort. Quick Sort. Steven Graham & Steve Shah. Unit III: Objects And Classes . Linear Search. Linux in a Windows world. 2005.sleep . Binary Tree Search. (Chapters 2-11) 2. The Design of the UNIX operating system. Searching. Prentice Hall of India. Queue.Process termination . Printing – Network configuration. Unit IV Linux Administration – GNOME and KDE – Managing users – The command line – Booting and Shutting down .. Linux Administration. 2. Single linked list. 2003.Changing the size of a process.File systems – Compiling the Linux Kernel Unit V Linux Internet services – DNS – Setting up web server using Apache – the secure shell. Third Edition. Text Books: 1.clock.the user ID of a process . Bubble sort. 1986. Unix-The Complete Reference. Selection Sort.Process Control: Process Creation . Kenneth Rosen. Binary Search. Oreilly. 1999. Douglas Host. Dreamtech.Awaiting process termination – invoking other programs . Process Scheduling and time: process scheduling . Roderick W Smith. Insertion Sort. Richard Rosinki. Heap Sort. Bach. 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. Doubly linked list.

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

Telecommunications Transmission: Power levels-Four wire circuits-Digital transmission- .Analytical Representations -Wiener Process Function Autocorrelation . Recurrence Formula for Binomial and Poisson Distribution -Poisson Distribution as Limiting Form of Binomial Distribution.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. Erlang. Geometric. Single Server Poisson Queue Model I . Poisson.F. Relations Among E(Ns). Hyper Geometric. Robert C. 2006. E(Ws) and E(Wq) -Characteristics of Infinite Capacity. Veerarajan. Weibull and Exponential Distribution.Marginal Probability Distribution.Binomial Distribution as Limiting Form of Hyper Geometric Distribution-M. E(Nq).Characteristics of Finite Queue. Probability. Bernad Kolman. Discrete Mathematical Structures. pj*} (Chapters 1 and 2 of Text Book 2) Unit III Some Special Probability Distribution: Special Discrete Distribution-Mean & Variance for Binomial.Properties-Ergodicity-Mean Ergodic Process. Mean Ergodic Theorem. 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. Tata McGrawHill.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. Statistics and Random Processes. Multiple Server Poisson Queue Model II Characteristics of Finite Capacity. Single Server Poisson Queue Model III . ISBN: 0-07-060170-4.Properties of R(τ)-Cross correlation . Busby and Sharon Ross. ISBN: 81-297-0465-X 2. Pearson Education. 5th Edition. Multiple Server Poisson Queue Model IV -Non Markovian Queuing Model V (Chapter 8 of Text Book 2) Text Books: 1. T. 2004.Memoryless Property of Exponential DistributionReproductive Property of gamma Distribution-Relation Between Distribution Function of Erlang Distribution -Density Function of Weibull Distribution. of Negative Binomial Distribution-Special Continuous DistributionMoments of Uniform Distribution .Conditional Probability Distribution-Independent RVsRandom Vectors-Marginal Probability Distribution of X: {i.G. pi*} and Y: {j. 2nd Edition.

ISBN 81-7808-457-0. 1992.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. Unit IV Control of switching systems: Call processing functions-common control-Reliability. Telecommunications Switching. Text Book J. 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. 6-CCITT signaling system no. 1999. 7-Digital customer line signaling. Reference Book Thiagarajan Viswanathan. availability and security-Stored program control. CS362 ADVANCED DIGITAL SIGNAL PROCESSING Credits 4:0:0 Unit I .Flood. ISBN 81-203-0713-5. Prentice Hall of India. Telecommunication Switching Systems and Networks. Unit V Packet switching: Statistical multiplexing-Local area and wide area networks-Large scale networks-Broadband networks. Pearson Education. Traffic and Networks.E. 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. Telecommunications traffic: The unit of trafficCongestion-Traffic measurement-A mathematical model-Lost call systems-Queuing systemsSimulation. Networks: Analog networks-Integrated digital networksIntegrated services digital networks-Cellular radio networks-Intelligent networks-Private networks-Numbering-Charging-Routing-Network Management. Time division switching: Space and time switching-Time division switching networks-Grades of service of time division switching networks-Non blocking networks-Synchronization.

1-2.Parametric Methods .(Text Book1 Chapters 8.9) Text books: 1.Implementation of Sampling Rate Conversion .2-4.The Levinson Recursion . Digital Signal Processing: Principles.4) Unit III The FIR Wiener Filter . 2007. Fourth Edition. Manolakis. Monson H.The Maximum Entropy Method . (Text Book 2 Chapters 11. 9. Proakis and D.Durbin Recursion .1-11.1-3.Attenuation – Signal distortion in optical waveguides – Pulse broadening in graded-index waveguides-Mode coupling.6.(Text book 1 chapters 2.3-3. 4. Prentice-Hall. Statistical Digital Signal Processing and Modeling.Frequency Estimation. Algorithms.Discrete-Time Signal Processing .1 . Optical Fibers: Structures. 4. (Text book 1 Chapters 5.Discrete Kalman Filter .4.G.[1.6 ] Unit II Signal Degeneration in Optical Fibers.Applications of Sampling Rate Conversion.2.4.1-8.1 -1. Wave guiding. 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. Hayes.FIR Adaptive Filters Adaptive Recursive Filters.Random Processes – Filtering Random Processes – Spectral Factorization – Special Types of Random Processes – Least Squares Method .6) Unit V Decimation by a Factor D .Sampling Rate Conversion of Bandpass Signals .Interpolation by a Factor I .3) Unit IV Non-Parametric Methods .Pade’ Approximation .Sampling Rate conversion by an Arbitrary Factor . 3.4.The IIR Wiener Filter .3] Unit III . J. ISBN 9814-12-646-2. (Text book 1 Chapters 7. and Applications.Multistage Implementation of Sampling Rate Conversion .1-9.1-5.G. Optical Sources –Light – Emitting Diodes (LEDs)-Laser Diodes [3.The Split Levinson Recursion. 2002.Sampling Rate Conversion by a Rational Factor I/D .3) Unit II The Levinson .Minimum Variance Spectrum Estimation . 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.4. John Wiley and Sons.   2. 2.1-7. ISBN 0-13-187374-1.

1. (Chapter 1. 2000. Reference Book: G. Fiber Optic Communication Systems. 1997.4. Optical Receiver Operation: Fundamental receiver operation – Digital receiver performance –Preamplifier Types – Analog receivers. New York. 7.2. 12. Optical Fiber Communications.3. McGraw Hill. 6) .[11.ASP.8] Text Book: G.1-11.4.4. 7. Second Edition. 7.0 – Applications and Page Frameworks.Noise Effects on System Performance WDM Concepts and Components: Operational principles of WDM-Passive Components – Tunable sources – Tunable Filters.Wavelength-Routed Networks-Optical CDMA. 8.1-12.5] Unit IV Digital Transmission Systems: Point-to-Point links – Line coding. 5. [8.4.Side Scripts . 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.Broadcast-and-Select WDM Networks. ISBN: 0-471-21571-6.NET Credits 4:0:0 Unit I Hello ASP.] Unit V Optical Amplifiers: Basic Applications and Types of Optical Amplifiers – Semiconductor Optical Amplifiers – Erbium-Doped Fiber Amplifiers Optical Networks: Basic Networks – SONET/SDH. 7. 3rd Edition.1-10. ISBN 0-07-1164685.NET Server Controls and Client. John Wiley & Sons.P.[6.Photodetectors: Physical principles of photodiodes-Photodetector Noise-Detector response time-Avalanche multiple noise.0 Web Server controls. Agarwal.Net2.NET 2.NET Web Server controls . 12. Keiser. 10.4. 3) Unit II ASP.1-6.ASP. (Chapters 4.1.

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

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

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

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

6) Unit V Representation and Description: Representation . 10. Digital Image Processing.Pratt.1.C. 2002. 10. 8 and 10 of Textbook1) Unit IV Know your JavaScript: What Is JavaScript’s Place in Ajax?. (Chapters: 2 and 3 of Textbook 1) Unit II ASP fundamentals: Using Server – Side Includes.Unit IV Image Segmentation: Detection of discontinuities-Edge Linking and Boundary Detection Thresholding -Region-Based Segmentation -The Use of Motion in Segmentation (Chapters 10. CS373 WEB TECHNOLOGY Credits: 4:0:0 Unit I VBScript Language Elements: Constants . 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.asa file. Second Edition.Gonzalez and Richard.Mathematical Operations .Variables and Data Types .Using Query String Information – Using Server Variables.Regional Descriptors. Using the Request Object: Using Form Information . (Chapters: 7.Mathematical Functions .Data Formatting Functions .Logical Operators . 11. VBScript Functions and Objects: Data Conversion Functions .Text Manipulation Functions . 10.Built-in Objects.E.2. 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. Reference Book: William K.1.Looping and Decision Structures.The Session Object – The Server Object – Using the global . ISBN 9-81412620-9.4. ISBN 81-7758-168-6.3. 2002. 11. Addison Wesley. Digital Image Processing.Woods.Using the Application.Boundary Descriptors . Using the Response Object: Create Output – Managing Output – Managing the Connection. and Server Objects: The application Object . (Chapters: 4.2.Learning the SSI Directives – Creating Modular ASP Code.Date and Time Functions .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 . Session. (Chapter 11. John Wiley.3) Text Book: Rafael . Third Edition. 10.

(Chapters: 11 . 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. ASP 3 Programming Bible. (Chapters: 9. (Chapters: 5. 2007.13) . 2002. Embedded Controls: Smart sensors and Actuators-Smart Appliances-Appliances and Home Networking-Automotive Computing. 7. 10 and 11 of Textbook 2) Text Books: 1. (Chapters: 2. Middleware Components: Programming Consumer Devices-Smart Card Programming-Messaging Components-Database Components. Creating Mouseovers-Using Dynamic Styles-Using document. 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. Dynamic HTML and Ajax.Styling Text Using CSS. Steve Holzner.4) Unit II Entertainment Systems: Television Systems-Game Consoles. and Firefox Web Browsers-Handling White Space in a Cross-Browser Way-Accessing XML Data Directly-Accessing XML Attributes Values-Validating Your XML. Creating Ajax Applications: Writing Ajax-Interacting with Server-Side Code-Passing Data to Server. Connectivity: Wireless Wide Area Networks-Short Range Wireless Communication-Home Networks.Buttons.Styling Colors and Backgrounds Using CSS-Styling Locations in Web Pages. Smart Identification: Smart Cards-Smart Labels. Wiley India Pvt. Devices: Information Access Devices-Handheld Computers-Sub-NotebooksPhones. Smith.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. ISBN 81-265-0049-2 2. Ajax Bible.Side Scripts-Using Ajax with XML. Eric A. Wiley-Dreamtech. Operating Systems: Windows CEPalm OS-Symbian EPOC-Java Card-Windows for Smart Cards. Service Discovery: Universal Plug and Play-Jini-Salutation. (Chapters: 1 . Ltd. 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. Netscape. Cascading Style Sheets and Ajax: Ajax-Enabled Menus-Getting Text Noticed in Ajax Applications-Scrolling Text.write. 8) Unit III WAP: The WAP Architecture-Wireless Application Environment.

Smith Chart – High Frequency Lines. 2001. Surface – Power Handling Capability of Microwave Transmission Lines. (Chapter 6) Unit IV . Impedance Transformations for Matching: General Condition. Synchronization: What Synchronization is all About-The Challenge of Synchronizing DataIndustry Data Synchronization Standards-Today’s Synchronization Solution. Nicklous. Web Application Servers: Architecture and Components-WebSphere Application ServerWebSphere Everyplace Suite-Oracle Portal-to-Go. 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 . (Chapters: 14 . Device Management: Tasks of Device Mangement Systems-Tivoli Device Support Infrastructure-User Profiles and Directory Services.Narrow Band and Broad Band Matching – Tapered Transmission Lines. Martin S. 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.17) Unit V Portals and Access Services: Internet Portals-Wireless Portal-Broadcasting Portal. Thomas Stober. Travel and Business Services: Travel Services-Business Services.Unit IV Gateways: Connectivity Gateway-Wireless Gateway-Transcoding-Residential Gateway.Equation. Springer. Consumer Services: Interactive Advertisement-Loyalty-ShoppingPayment Services. (Chapters 1 – 3) Unit II Microwave Transmission Lines: Ideal Coaxial Line – Planar Transmission Lines – Wave Guides Types: Rectangular.21) Text Book: Uwe Hansmann. Home Services: The System View-Communication Services-Home Automation-Energy ServicesSecurity Services-Remote Home Healthcare Services. Propagation of Electromagnetic Waves: Wave Impedance and Propagation – Electromagnetic Wave . Pervasive Computing Handbook. (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. Ridge. (Chapters: 18 . Circular.

McGraw Hill International Edition. Reference Books: 1. Microwave Engineering. (Chapter 7) Unit V Microwave Filter: Filter Parameters – Mismatch Effects – Microwave Realization of the Filter Elements – Filter Design – Microwave filters: Low-pass. 1992. Band-pass and Band-stop filters. 2. Tata McGraw Hill Publishing Company Ltd. Third Edition. ISBN 0-07-463577-8. ISBN 0-07-112569-8. 2000. (Chapter 8 and 11) Text Book: Annapurna Das and Sisir K Das. Robert E.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. Pozar. 2005. Second Edition. Collin. Microwave Engineering. Applications of Microwaves: Microwave Radar Systems – Microwave Communication Systems – Industrial Application of Microwaves. . Foundations for Microwave Engineering. John Wiley. High-pass. David M. ISBN 0-47117096-8.

Sign up to vote on this title
UsefulNot useful