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

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

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

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

Charles Petzold. event signaling. Middle Click. Copy. Developing a program that works on different fonts over a text. Unit II : Communications Communications in distributed systems – The Client-Server model .Blocking Vs Non Blocking primitives – Buffered versus Unbuffered primitives – Implementation of ClientServer model. 9.Conger.File concept could be used Creation of an editor performing all the operations like Cut. 8. File Open File. Programming Windows. Close File Save etc.. James L. Developing an Application which scrolls the text vertically . Text Book 1.. 3. ellipse etc. Windows API Bible – Programmer’s reference. 4. thread synchronization. Microsoft press. 5. a K Unit I : Introduction Distributed Processing . Mouse Down etc. 1996. Galgotia Publications Ltd.Models for distributed computing – Load balancing – Remote Procedure Calls – Process migration – Concurrency issues on databases – Hardware Concepts – Bus based multiprocessors – Switched multicomputers – Software Concepts – Network Operating systems and NFS – Time distributed systems – Multiprocessor time sharing system – Design issue – Transparency – Flexibility – Reliability – Performance and scalability. windows multithreading. Internet : Windows sockets. 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 .. 2. win Inet and FTP. 6. CS211 WINDOWS PROGRAMMING LAB 1.Multitasking and Multithreading: modes of multitasking. 5th edition. 1998 Reference Book 1. Mouse UP.. Developing an Application supporting Graphical objects like arc. Paste. 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. 7. Left Click.

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

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

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

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

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

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

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

Unit-III Synchronization in Distributed Systems : Clock Synchronization -Logical Clocks – Physical clocks – Clock Synchronization Algorithms – Mutual Exclusion – A Centralized Algorithm – A Distributed Algorithm . 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.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.S: What is an operating system – Operating system? – History of operating system concepts – operating system structure. 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 .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. 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.

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

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

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

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

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

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

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

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

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

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.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 . 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.Memory Management Background – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with Paging. UNIT V File-System Structure – File-System Implementation – Directory Implementation – Allocation Methods – Free-Space Management – Efficiency and Performance – Recovery – Log-Structured File System –NFS – Overview of I/O systems – I/O Hardware – Application .Deadlock Prevention – Deadlock Avoidance –Deadlock Detection – Recovery from deadlock .

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

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

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

B+ Tree Index Files – B Tree Index Files – Static Hashing – Dynamic Hashing – Comparison of ordered Indexing and hashing – Index Definition in SQL – Multiple Key Access (Chapters 11. 9) UNIT V File Organization – Organization of records in Files – Data Dictionary Storage – Storage for Object Oriented Databases – Indexing and Hashing Basic Concepts – Ordered Indicies .6-11.9. 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. 12) a K n u r a y i n U s r e v y it Division of Computer Science and Engineering 7 . 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 .

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

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

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

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

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

5.Dhamdhere. Mechanisms and Attacks – Block Cipher principles – Data Encryption Standard – Strength of DES – Evaluation criteria for AES – AES Cipher.3) Text Book: L.1.4.20. [Sections: 15.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.Beck. An Introduction to System Programming.1. Reference Book: D.17.16.17.1.2.4.10.2.18.M.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.9. [Sections: 9.1.16.12.12.2.10.1.16. Tata McGraw-Hill Company. CS251 CRYPTOGRAPHY AND NETWORK SECURITY Credits 4:0:0 UNIT I Services.5.2. 1999.2. [Sections: 17.10. Addison Wesley.16.2.1. Systems Programming and Operating Systems.1.1.15.UNIT V Other System Software: Text Editors – Interactive Debugging Systems.2.1.3.16.4] UNIT III MD5 Message Digest Algorithm – Secure Hash Algorithm – HMAC – Digital signature Standard – Kerberos Version 5 – X.2.2.5.3.7.1.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) .1.3.14.18.3.3.20.3.4.14. System Software. [Sections: 1. [Sections: 12.2] UNIT II Principles of public Key Cryptosystems – RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Basics of Elliptic Curve Cryptography. ISBN : 0-07-463579-4.509 Authentication Service. ISBN : 81-7808-036-2.13. 1999.3. (Chapter 7 : Sections 7.16.

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

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

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

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

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

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

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

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

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

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

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

Effective Requirements Practices.Process Designed . Addison Wesley. 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 .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. 2. Organizational and Project best practices-How to proceed (Chapter 10-12 ) Text Book: 1. Familiar Proven industry .The Prototyping Approach – The spiral Model – The iterative Development Process Model – The object-oriented Development Process – The cleanroom Methodology – The Defect Prevention Process – Process Maturity Framework and Quality Standards. Defect Removal Effectiveness: A closer Look at defect removal Effectiveness – Defect Removal Effectiveness and Quality Planning Division of Computer Science & Engineering AN-36 n u r a y i n U s r e v y it Marks (50+50) . Ralph R.UNIT III Use and Continually improve a Requirements Process -Process. Software Development Process Models: The waterfall Development model . 2001. CS336 OBJECT ORIENTED CASE TOOLS LAB Credits 0:0:2 12 experiments will be notified by the HOD from time to time. CS337 SOFTWARE METRICS AND QUALITY MANAGEMENT Credits: 4:0:0 Marks: (40+60) a K UNIT I Software Quality: Total Quality Management. 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. ISBN :0-201-70912-0.In-Process Quality Metrics – Metrics for Software Maintenance – Collecting software Engineering Data.Young.

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

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

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

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. (Chapters 9. 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.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. Pearson Education. (Chapters 5. Shaw.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. (Chapters 3. Hypotheses. Real–Time Systems and Software. ISBN :9814-12-6578.Liu.8) UNIT V Programming Languages. Wiley . Chapters (1-10). Alan C. ISBN : 81-7808-463-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.10) Text Book: 1. Jane W.S. (Chapters 7.4) Division of Computer Science & Engineering AN-40 . 2000. Real-Time Systems. (Chapters 1 . Reference Book: 1.6) UNIT IV Execution Time Prediction-Measurement of Software by software-Program Analysis with Timing Schema-Prediction by optimization-System Interferences and architectural-Keeping Time on computers-Timer applications-properties of real and Ideal Clocks-Clock ServersClock synchronization. (Chapters 1. and tests – Strategies and methods for test case design I. 2001.

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

CS347 ADVANCED TECHNOLOGIES LAB Credits 0:0:2 Marks (50+50) 12 experiments will be notified by the HOD from time to time.CS346 CASE TOOLS 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 .

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

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

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

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

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

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

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

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

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

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

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

3. Mechanisms and Attacks – Block Cipher principles – Data Encryption Standard – Strength of DES – Evaluation criteria for AES – AES Cipher. Radia Perlman.9.18.1.5.16.2.14.] .] Text Book: William Stallings.3.16. 2001.4.17.3. [Sections: 17.16.1. Introduction to Operating Systems: Advanced Course. Course Technology. [Sections: 12.20.1. Cryptography and Network Security.10. and Multiprocessor Operating Systems.2.2.[Sections: 1.4. Mike Speciner.1. 2002.16.3.] UNIT III MD5 Message Digest Algorithm – Secure Hash Algorithm – HMAC – Digital signature Standard – Kerberos Version 5 – X. Gorman.17.1. Advanced Concepts in Operating Systems Distributed. ISBN 81-203-2213-4.2.Text Book: Mukesh Singhal. Tata McGraw-Hill.13.3.1.6.12.18-20) ISBN : 0-07-047268-8 Reference Book: Mary S.18.3. (Chapters 4-14.3.1.6. 2003.1.4.10.14.RC4 Stream Cipher.16.] 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: 15.2. CS354 CRYPTOGRAPHY AND NETWORK SECURITY Credits 4:0:0 Marks (40+60) UNIT I Services.5. Database. S.4.5. ISBN 81-7808-902-5.16. Reference Book: Charlie Kaufman.Shivaratri. Department of Computer Science and Engineering 12 a K n u r a y i n U s r e v y it .3. Prentice Hall.2.20.1.10.5. Second Edition.15.2.2 .] UNIT II Principles of Public Key Cryptosystems – RSA Algorithm – Key Management – Diffie Hellman Key Exchange – Basics of Elliptic Curve Cryptography [Sections: 9. Network Security.16.2.509 Authentication Service.1.18. Todd Stubbs. Niranjan G.2.1. Prentice Hall.2.12. UNIT IV Pretty Good Privacy – S/MIME – IP Security Overview – IP Security Architecture – Authentication Header – Encapsulating Security Payload – Combining Security Associations – Key Management. 1994. Third Edition.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful