Jump to content

Navigation menu

Note: Currently new registrations are closed, if you want an account Contact us

Difference between revisions of "Syllabus Review/VTU/BE/Information Science and Engineering"

Syllabus Review/VTU/BE/Information Science and Engineering (view source)

Revision as of 18:37, 27 July 2009

436 bytes added ,  18:37, 27 July 2009
no edit summary
 
Line 1: Line 1:
<center>'''Scheme and Syllabus of Semesters V to VII of B.E'''</center>
<center>'''Scheme and Syllabus of Semesters V to VII of B.E'''</center>


<center>'''(With effect from 2006-2007)'''</center>
<center>'''(With effect from 2006-2007)''' </center>
 
Sandesh
<center>'''Information Science and Engineering'''</center>
<center>'''Information Science and Engineering'''</center>


Line 26: Line 24:
|<center>Teaching Dept.</center>
|<center>Teaching Dept.</center>
|colspan="6"|
|colspan="6"|


{|class="prettytable"
{|class="prettytable"
Line 32: Line 31:
|-
|-
|
|


{|class="prettytable"
{|class="prettytable"
Line 44: Line 44:
<center>(Hrs)</center>
<center>(Hrs)</center>
|
|


{|class="prettytable"
{|class="prettytable"
Line 150: Line 151:
|<center>900</center>
|<center>900</center>
|}
|}


<center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center>
<center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center>
Line 161: Line 163:


<center>  
<center>  


{|class="prettytable"
{|class="prettytable"
|&lt;center&gt;'''S. No.'''
|&lt;center&gt;'''S. No.'''
|<center>'''Subject Code'''</center>
|&lt;center&gt;'''Subject Code'''
|<center>'''Subject'''</center>
|<center>'''Subject'''</center>
|<center>'''Teaching Dept.'''</center>
|<center>'''Teaching Dept.'''</center>
|colspan="6"|
|colspan="6"|


{|class="prettytable"
{|class="prettytable"
Line 174: Line 178:
|-
|-
|
|


{|class="prettytable"
{|class="prettytable"
Line 186: Line 191:
<center>'''(Hrs)'''</center>
<center>'''(Hrs)'''</center>
|
|


{|class="prettytable"
{|class="prettytable"
Line 291: Line 297:
|<center>'''700'''</center>
|<center>'''700'''</center>
|<center>'''900'''</center>
|<center>'''900'''</center>
|}
|}  
  &lt;/center&gt;
  &lt;/center&gt;  


   
   
= Elective I – Group A =
= Elective I – Group A =  
  06CS661Operations Research
  06CS661Operations Research  


06IS662/06CS62 Compiler Design
06IS662/06CS62 Compiler Design
Line 317: Line 323:
   
   
<center>  
<center>  


{|class="prettytable"
{|class="prettytable"
|&lt;center&gt;'''S. No.'''
|&lt;center&gt;'''S. No.'''
|<center>'''Subject Code'''</center>
|&lt;center&gt;'''Subject Code'''
|<center>'''Subject'''</center>
|<center>'''Subject'''</center>
|<center>'''Teaching Dept.'''</center>
|<center>'''Teaching Dept.'''</center>
|colspan="6"|
|colspan="6"|


{|class="prettytable"
{|class="prettytable"
Line 330: Line 338:
|-
|-
|
|


{|class="prettytable"
{|class="prettytable"
Line 342: Line 351:
<center>'''(Hrs)'''</center>
<center>'''(Hrs)'''</center>
|
|


{|class="prettytable"
{|class="prettytable"
Line 447: Line 457:
|<center>'''700'''</center>
|<center>'''700'''</center>
|<center>'''900'''</center>
|<center>'''900'''</center>
|}
|}  
  &lt;/center&gt;
  &lt;/center&gt;  


   
   
= Elective II – Group BElective III – Group C =
= Elective II – Group BElective III – Group C =  
  06CS751 Advanced DBMS06CS761 C# Programming and .Net
  06CS751 Advanced DBMS06CS761 C# Programming and .Net  


06CS74/06IS752 Embedded Computing Systems06CS762 Digital Image Processing
06CS74/06IS752 Embedded Computing Systems06CS762 Digital Image Processing
Line 472: Line 482:


<center>'''B.E. INFORMATION SCIENCE AND ENGINEERING'''</center>  
<center>'''B.E. INFORMATION SCIENCE AND ENGINEERING'''</center>  


   
   


{|class="prettytable"
{|class="prettytable"
Line 482: Line 493:
|<center>Teaching Dept.</center>
|<center>Teaching Dept.</center>
|colspan="6"|
|colspan="6"|


{|class="prettytable"
{|class="prettytable"
Line 488: Line 500:
|-
|-
|
|


{|class="prettytable"
{|class="prettytable"
Line 498: Line 511:
|<center>Duration</center>
|<center>Duration</center>
|
|


{|class="prettytable"
{|class="prettytable"
Line 583: Line 597:
|}
|}
   
   
= Elective IV – Group DElective V– Group E =
 
  06CS831 Mobile Computing06CS841 Adhoc Networks
= Elective IV – Group DElective V– Group E =  
  06CS831 Mobile Computing06CS841 Adhoc Networks  


06CS832 Web 2.0 06CS842 Information Retrieval  
06CS832 Web 2.0 06CS842 Information Retrieval  
Line 605: Line 620:


   
   
=== Subject Code: 06CS51 I.A. Marks : 25 ===
=== Subject Code: 06CS51 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 611: Line 626:
<center>'''PART - A'''</center>  
<center>'''PART - A'''</center>  


# '''Machine Architecture 6 Hrs'''  
# '''Machine Architecture 6 Hrs'''


Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines - VAX Architecture, Pentium Pro Architecture, RISC Machines - Ultra SPARC Architecture, Cray T3E Architect'''ure. '''  
Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines - VAX Architecture, Pentium Pro Architecture, RISC Machines - Ultra SPARC Architecture, Cray T3E Architect'''ure. '''  


# '''Assemblers -1 6 Hrs'''  
# '''Assemblers -1 6 Hrs'''


Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats &amp; Addressing Modes, Program Relocation.  
Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats &amp; Addressing Modes, Program Relocation.


# '''Assemblers -2 6 Hrs'''  
# '''Assemblers -2 6 Hrs'''


Machine Independent Assembler Features – Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design Operations - One-Pass Assembler, Multi-Pass Assembler, Implementation Examples - MASM Assembler, SPARC Assembler.  
Machine Independent Assembler Features – Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design Operations - One-Pass Assembler, Multi-Pass Assembler, Implementation Examples - MASM Assembler, SPARC Assembler.


# '''Loaders And Linkers 8 Hrs'''  
# '''Loaders And Linkers 8 Hrs'''


Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker, Sun OS Linker, Cray MPP Linker.
Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker, Sun OS Linker, Cray MPP Linker.
Line 631: Line 646:


   
   
# '''Editors And Debugging Systems 6 Hrs'''  
# '''Editors And Debugging Systems 6 Hrs'''


Text Editors - Overview of Editing Process, User Interface, Editor Structure, Interactive Debugging Systems - Debugging Functions and Capabilities, Relationship With Other Parts Of The System, User-Interface Criteria  
Text Editors - Overview of Editing Process, User Interface, Editor Structure, Interactive Debugging Systems - Debugging Functions and Capabilities, Relationship With Other Parts Of The System, User-Interface Criteria


# '''Macro Processor 8 Hrs'''  
# '''Macro Processor 8 Hrs'''


Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within Language Translators, Implementation Examples - MASM Macro Processor, ANSI C Macro Processor.  
Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within Language Translators, Implementation Examples - MASM Macro Processor, ANSI C Macro Processor.


# '''Lex and Yacc – 1 6 Hrs'''  
# '''Lex and Yacc – 1 6 Hrs'''


Lex and Yacc - The Simplest Lex Program, Recognizing Words With LEX, Symbol Tables, Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running LEX and YACC, LEX and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular Expressions, A Word Counting Program, Parsing a Command Line.  
Lex and Yacc - The Simplest Lex Program, Recognizing Words With LEX, Symbol Tables, Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running LEX and YACC, LEX and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular Expressions, A Word Counting Program, Parsing a Command Line.


# '''Lex And Yacc - 2 6 Hrs'''  
# '''Lex And Yacc - 2 6 Hrs'''


Using YACC – Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.
Using YACC – Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.
Line 653: Line 668:
# Leland.L.Beck: System Software, 3<sup>rd</sup> Edition, Addison-Wesley, 1997.   
# Leland.L.Beck: System Software, 3<sup>rd</sup> Edition, Addison-Wesley, 1997.   


'''('''Chapters 1 (except 1.5.2), 2 (except 2.5.3), 3, 4, 5 (except 5.5), 7.2, 7.3)  
'''('''Chapters 1 (except 1.5.2), 2 (except 2.5.3), 3, 4, 5 (except 5.5), 7.2, 7.3)


# John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1999.  
# John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1999.


(Chapters 1, 2 (Page 27-42), 3 (Page 51-65))
(Chapters 1, 2 (Page 27-42), 3 (Page 51-65))
Line 669: Line 684:
<center>'''Operating Systems'''</center>  
<center>'''Operating Systems'''</center>  


=== Subject Code: 06CS52 I.A. Marks : 25 ===
=== Subject Code: 06CS52 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 676: Line 691:


   
   
# '''Introduction to Operating Systems, System structures6 Hrs'''  
# '''Introduction to Operating Systems, System structures6 Hrs'''


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 system; Special-purpose systems; Computing environments.
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 system; Special-purpose systems; 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.  
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.


# '''Process Management7 Hrs'''  
# '''Process Management7 Hrs'''


Process concept; Process scheduling; Operations on processes; Inter-process communication.
Process concept; Process scheduling; Operations on processes; Inter-process communication.
Line 688: Line 703:
Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues.
Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues.


Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling; Thread scheduling.  
Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling; Thread scheduling.


# '''Process Synchronization''' '''7 Hrs'''  
# '''Process Synchronization''' '''7 Hrs'''


Synchronization: The Critical section problem; Peterson’s solution; Synchronization hardware; Semaphores; Classical problems of synchronization; Monitors.  
Synchronization: The Critical section problem; Peterson’s solution; Synchronization hardware; Semaphores; Classical problems of synchronization; Monitors.


# '''Deadlocks 6 Hrs'''  
# '''Deadlocks 6 Hrs'''


Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
Line 702: Line 717:


   
   
# '''Memory Management 7 Hrs '''Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation.  
# '''Memory Management 7 Hrs '''Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation.


Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing.
Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing.
Line 741: Line 756:


   
   
=== Subject Code: 06CS53 I.A. Marks : 25 ===
=== Subject Code: 06CS53 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 748: Line 763:


   
   
# '''Introduction6 Hrs'''  
# '''Introduction6 Hrs'''


Introduction; An example; Characteristics of Database approach; Actors on the screen; Workers behind the scene; Advantages of using DBMS approach; A brief history of database applications; when not to use a DBMS.
Introduction; An example; Characteristics of Database approach; Actors on the screen; Workers behind the scene; Advantages of using DBMS approach; A brief history of database applications; when not to use a DBMS.
Line 755: Line 770:


   
   
# '''Entity-Relationship Model''' '''6 Hrs'''  
# '''Entity-Relationship Model''' '''6 Hrs'''


Using High-Level Conceptual Data Models for Database Design; An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design; ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two.  
Using High-Level Conceptual Data Models for Database Design; An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design; ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two.


# '''Relational Model and Relational Algebra8 Hrs '''  
# '''Relational Model and Relational Algebra8 Hrs '''  
Line 770: Line 785:
<center>'''PART - B'''</center>  
<center>'''PART - B'''</center>  


# '''SQL – 2 6 Hrs'''  
# '''SQL – 2 6 Hrs'''


Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views (Virtual Tables) in SQL; Additional features of SQL; Database programming issues and techniques; Embedded SQL, Dynamic SQL; Database stored procedures and SQL / PSM.  
Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views (Virtual Tables) in SQL; Additional features of SQL; Database programming issues and techniques; Embedded SQL, Dynamic SQL; Database stored procedures and SQL / PSM.


# '''Database Design - 1 6 Hrs'''  
# '''Database Design - 1 6 Hrs'''


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 Form.   
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 Form.   


# '''Database Design -26 Hrs'''  
# '''Database Design -26 Hrs'''


Properties of Relational Decompositions; Algorithms for Relational Database Schema Design; Multivalued Dependencies and Fourth Normal Form; Join Dependencies and Fifth Normal Form; Inclusion Dependencies; Other Dependencies and Normal Forms.  
Properties of Relational Decompositions; Algorithms for Relational Database Schema Design; Multivalued Dependencies and Fourth Normal Form; Join Dependencies and Fifth Normal Form; Inclusion Dependencies; Other Dependencies and Normal Forms.


# '''Transaction Management 8 Hrs'''   
# '''Transaction Management 8 Hrs'''   
Line 787: Line 802:




'''Text Books:'''  
'''Text Books:'''


# Elmasri and Navathe: Fundamentals of Database Systems, 5<sup>th</sup> Edition, Addison-Wesley, 2007  
# Elmasri and Navathe: Fundamentals of Database Systems, 5<sup>th</sup> Edition, Addison-Wesley, 2007


(Chapters 1, 2, 3 except 3.8, 5, 6.1 to 6.5, 7.1, 8, 9.1, 9.2 except SQLJ, 9.4, 10, 11)   
(Chapters 1, 2, 3 except 3.8, 5, 6.1 to 6.5, 7.1, 8, 9.1, 9.2 except SQLJ, 9.4, 10, 11)   


# Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3<sup>rd</sup> Edition, McGraw-Hill, 2003.  
# Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3<sup>rd</sup> Edition, McGraw-Hill, 2003.


(Chapters 16, 17.1, 17.2, 18)
(Chapters 16, 17.1, 17.2, 18)




'''Reference Book:'''  
'''Reference Book:'''


# Silberschatz, Korth and Sudharshan: Data base System Concepts,'' ''5<sup>th</sup> Edition, Mc-GrawHill, 2006.
# Silberschatz, Korth and Sudharshan: Data base System Concepts,'' ''5<sup>th</sup> Edition, Mc-GrawHill, 2006.
# C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, 8<sup>th</sup> Edition, Pearson education, 2006.  
# C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, 8<sup>th</sup> Edition, Pearson education, 2006.


<center>'''Computer Networks - I'''</center>  
<center>'''Computer Networks - I'''</center>  


=== Subject Code: 06CS54 I.A. Marks : 25 ===  
=== Subject Code: 06CS54 I.A. Marks : 25 ===  
== Hours/Week : 04 Exam Hours: 03 ==
== Hours/Week : 04 Exam Hours: 03 ==  
  '''Total Hours : 52 Exam Marks: 100'''  
  '''Total Hours : 52 Exam Marks: 100'''  


<center>'''PART - A'''</center>  
<center>'''PART - A'''</center>  


'''1. Communication Networks and Services, Applications and Layered Architectures 8 Hrs'''  
'''1. Communication Networks and Services, Applications and Layered Architectures 8 Hrs'''


# Evolution of Network Architecture and Services; Future network architectures and their services; Key factors in communication network evolution.  
# Evolution of Network Architecture and Services; Future network architectures and their services; Key factors in communication network evolution.  
# Examples of Protocols, Services, and Layering; The OSI Reference Model; Overview of TCP/IP Architecture; Application Layer Protocols and TCP/IP Utilities.  
# Examples of Protocols, Services, and Layering; The OSI Reference Model; Overview of TCP/IP Architecture; Application Layer Protocols and TCP/IP Utilities.


'''2. Digital Transmission – 1 6 Hrs'''
'''2. Digital Transmission – 1 6 Hrs'''
Line 832: Line 847:


   
   
# '''Peer-to-Peer Protocols and Data Link Layer - I 6 Hrs'''  
# '''Peer-to-Peer Protocols and Data Link Layer - I 6 Hrs'''


===== Peer-to-Peer Protocols and Service Models: Service models, Examples of services, End to end versus hop by hop; ARQ Protocols and Reliable Data Transfer Service: Stop-and-Wait ARQ, Go-Back-N ARQ, Selective Repeat ARQ; Other Peer-to-Peer Protocols: Sliding-window flow control, Timing recovery for synchronous services, TCP reliable stream service and flow control. =====  
===== Peer-to-Peer Protocols and Service Models: Service models, Examples of services, End to end versus hop by hop; ARQ Protocols and Reliable Data Transfer Service: Stop-and-Wait ARQ, Go-Back-N ARQ, Selective Repeat ARQ; Other Peer-to-Peer Protocols: Sliding-window flow control, Timing recovery for synchronous services, TCP reliable stream service and flow control. =====  
# '''Peer-to-Peer Protocols and Data Link Layer - II 6 Hrs'''  
# '''Peer-to-Peer Protocols and Data Link Layer - II 6 Hrs'''


===== Data Link Controls: Framing; Point to Point Protocol; HDLC Data link Control: Data link services, HDLC configuration and transfer modes, HDLC frame format, Typical frame exchanges; Link Sharing using Packet Multiplexers: Statistical Multiplexing , Speech Interpolation and the Multiplexing of Packetized Speech. =====  
===== Data Link Controls: Framing; Point to Point Protocol; HDLC Data link Control: Data link services, HDLC configuration and transfer modes, HDLC frame format, Typical frame exchanges; Link Sharing using Packet Multiplexers: Statistical Multiplexing , Speech Interpolation and the Multiplexing of Packetized Speech. =====  
# '''Medium Access Control Protocols and Local Area Networks – I 7 Hrs'''  
# '''Medium Access Control Protocols and Local Area Networks – I 7 Hrs'''


== The Medium Access Control Protocols: Multiple Access Communications; Random Access : ALOHA, Slotted ALOHA, CSMA, CSMA-CD; Scheduling Approaches to Medium Access Control: Reservation Systems, Polling, Token-Passing Rings, Comparison of scheduling approaches in MAC, Comparison of random access and scheduling MAC; Channelization: FDMA, TDMA, CDMA. ==  
== The Medium Access Control Protocols: Multiple Access Communications; Random Access : ALOHA, Slotted ALOHA, CSMA, CSMA-CD; Scheduling Approaches to Medium Access Control: Reservation Systems, Polling, Token-Passing Rings, Comparison of scheduling approaches in MAC, Comparison of random access and scheduling MAC; Channelization: FDMA, TDMA, CDMA. ==  
# '''Medium Access Control Protocols and Local Area Networks – II 7 Hrs'''  
# '''Medium Access Control Protocols and Local Area Networks – II 7 Hrs'''


LAN Protocols: LAN Structure , The Medium Access Control Sublayer, The Logical Link Control Sublayer; Ethernet and IEEE 802.3 LAN Standard: Ethernet Protocol, Frame structure, Physical Layers, Fast Ethernet ,Gigabit Ethernet, 10 Gigabit Ethernet; Token Ring and IEEE 802.5 LAN Standard: Token-Ring Protocol, Frame structure; FDDI; Wireless LANs and IEEE 802.11 Standard: Ad hoc and Infrastructure Networks, Frame structure and addressing, Medium Access Control; LAN Bridges and Ethernet Switches: Transparent Bridges, Source Routing Bridges, Mixed-Media Bridges, Virtual LANs.
LAN Protocols: LAN Structure , The Medium Access Control Sublayer, The Logical Link Control Sublayer; Ethernet and IEEE 802.3 LAN Standard: Ethernet Protocol, Frame structure, Physical Layers, Fast Ethernet ,Gigabit Ethernet, 10 Gigabit Ethernet; Token Ring and IEEE 802.5 LAN Standard: Token-Ring Protocol, Frame structure; FDDI; Wireless LANs and IEEE 802.11 Standard: Ad hoc and Infrastructure Networks, Frame structure and addressing, Medium Access Control; LAN Bridges and Ethernet Switches: Transparent Bridges, Source Routing Bridges, Mixed-Media Bridges, Virtual LANs.




'''Text Books:'''  
'''Text Books:'''


# Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key architectures, 2<sup>nd</sup> Edition Tata McGraw-Hill, 2004. .  
# Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key architectures, 2<sup>nd</sup> Edition Tata McGraw-Hill, 2004. .


( Chapters 1, 2.1 to 2.3, 2.5, 3.1 to 3.9 except 3.3.4, 3.9.7 and 3.9.8 , 4.1 to 4.5, 4.8, 5, 6.1 to 6.4, 6 except 6.10.4)  
( Chapters 1, 2.1 to 2.3, 2.5, 3.1 to 3.9 except 3.3.4, 3.9.7 and 3.9.8 , 4.1 to 4.5, 4.8, 5, 6.1 to 6.4, 6 except 6.10.4)  
Line 869: Line 884:


   
   
=== Subject Code: 06CS55 I.A. Marks : 25 ===
=== Subject Code: 06CS55 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 894: Line 909:
Context –free grammars; Parse trees; Applications; Ambiguity in grammars and  
Context –free grammars; Parse trees; Applications; Ambiguity in grammars and  


Languages.  
Languages.


<center>'''PART - B'''</center>  
<center>'''PART - B'''</center>  
Line 936: Line 951:


===== (Common to All Branches) =====  
===== (Common to All Branches) =====  
=== Subject Code: I.A. Marks : 25 ===
=== Subject Code: I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 945: Line 960:


   
   
=== Subject Code: 06CSL57 I.A. Marks : 25 ===
=== Subject Code: 06CSL57 I.A. Marks : 25 ===  
  '''Hours/Week : 03 Exam Hours: 03'''  
  '''Hours/Week : 03 Exam Hours: 03'''  


=== Total Hours : 42 Exam Marks: 50 ===  
=== Total Hours : 42 Exam Marks: 50 ===  
# Consider the Insurance database given below. The primary keys are underlined and the data types are specified.  
# Consider the Insurance database given below. The primary keys are underlined and the data types are specified.


PERSON (driver – id #: String, name: string, address: strong)
PERSON (driver – id #: String, name: string, address: strong)
Line 959: Line 974:
OWNS (driver-id <nowiki>#:string</nowiki>, Regno:string)
OWNS (driver-id <nowiki>#:string</nowiki>, Regno:string)


PARTICIPATED (driver-id: string, Regno:string, report-number:int, damage amount:int)  
PARTICIPATED (driver-id: string, Regno:string, report-number:int, damage amount:int)


# Create the above tables by properly specifying the primary keys and the foreign keys.
# Create the above tables by properly specifying the primary keys and the foreign keys.
# Enter at least five tuples for each relation.
# Enter at least five tuples for each relation.
# Demonstrate how you  
# Demonstrate how you


# Update the damage amount for the car with a specific Regno in the accident with report number 12 to 25000.
# Update the damage amount for the car with a specific Regno in the accident with report number 12 to 25000.
# Add a new accident to the database.  
# Add a new accident to the database.


(iv) Find the total number of people who owned cars that were involved in accidents in 2008.  
(iv) Find the total number of people who owned cars that were involved in accidents in 2008.


# Find the number of accidents in which cars belonging to a specific model were involved.
# Find the number of accidents in which cars belonging to a specific model were involved.
# Generate suitable reports.
# Generate suitable reports.
# Create suitable front end for querying and displaying the results.  
# Create suitable front end for querying and displaying the results.


II. Consider the following relations for an order processing database application in a company.
II. Consider the following relations for an order processing database application in a company.
Line 986: Line 1,001:
SHIPMENT (order #: int, warehouse#: int, ship-date: date)
SHIPMENT (order #: int, warehouse#: int, ship-date: date)


WAREHOUSE (warehouse #: int, city: string)  
WAREHOUSE (warehouse #: int, city: string)


# Create the above tables by properly specifying the primary keys and the foreign keys.
# Create the above tables by properly specifying the primary keys and the foreign keys.
Line 994: Line 1,009:
# Demonstrate how you delete item# 10 from the ITEM table and make that field ''null'' in the ORDER_ITEM table.  
# Demonstrate how you delete item# 10 from the ITEM table and make that field ''null'' in the ORDER_ITEM table.  
# Generate suitable reports.
# Generate suitable reports.
# Create suitable front end for querying and displaying the results.  
# Create suitable front end for querying and displaying the results.


'''III. Consider the following database of student enrollment in courses &amp; books adopted for each course.'''
'''III. Consider the following database of student enrollment in courses &amp; books adopted for each course.'''
Line 1,006: Line 1,021:
BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int)
BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int)


TEXT (book-ISBN:int, book-title:string, publisher:string, author:string)  
TEXT (book-ISBN:int, book-title:string, publisher:string, author:string)


# Create the above tables by properly specifying the primary keys and the foreign keys.
# Create the above tables by properly specifying the primary keys and the foreign keys.
# Enter at least five tuples for each relation.
# Enter at least five tuples for each relation.
# Demonstrate how you add a new text book to the database and make this book be adopted by some department.  
# Demonstrate how you add a new text book to the database and make this book be adopted by some department.


# Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical order for courses offered by the ‘CS’ department that use more than two books.
# Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical order for courses offered by the ‘CS’ department that use more than two books.
# List any department that has ''all'' its adopted books published by a specific publisher.
# List any department that has ''all'' its adopted books published by a specific publisher.
# Generate suitable reports.
# Generate suitable reports.
# Create suitable front end for querying and displaying the results.  
# Create suitable front end for querying and displaying the results.


IV. The following tables are maintained by a book dealer.
IV. The following tables are maintained by a book dealer.
Line 1,027: Line 1,042:
CATEGORY (category-id:int, description:string)
CATEGORY (category-id:int, description:string)


ORDER-DETAILS (order-no:int, book-id:int, quantity:int)  
ORDER-DETAILS (order-no:int, book-id:int, quantity:int)


# Create the above tables by properly specifying the primary keys and the foreign keys.
# Create the above tables by properly specifying the primary keys and the foreign keys.
# Enter at least five tuples for each relation.  
# Enter at least five tuples for each relation.


# Give the details of the authors who have 2 or more books in the catalog and the price of the books is greater than the average price of the books in the catalog and the year of publication is after 2000.
# Give the details of the authors who have 2 or more books in the catalog and the price of the books is greater than the average price of the books in the catalog and the year of publication is after 2000.
# Find the author of the book which has maximum sales.  
# Find the author of the book which has maximum sales.


# Demonstrate how you increase the price of books published by a specific publisher by 10%.
# Demonstrate how you increase the price of books published by a specific publisher by 10%.
# Generate suitable reports.
# Generate suitable reports.
# Create suitable front end for querying and displaying the results.  
# Create suitable front end for querying and displaying the results.


# Consider the following database for a banking enterprise  
# Consider the following database for a banking enterprise


BRANCH(branch-name:string, branch-city:string, assets:real)
BRANCH(branch-name:string, branch-city:string, assets:real)
Line 1,051: Line 1,066:
LOAN(loan-number:int, branch-name:string, amount:real)
LOAN(loan-number:int, branch-name:string, amount:real)


BORROWER(customer-name:string, loan-number:int)  
BORROWER(customer-name:string, loan-number:int)


# Create the above tables by properly specifying the primary keys and the foreign keys
# Create the above tables by properly specifying the primary keys and the foreign keys
Line 1,059: Line 1,074:
# Demonstrate how you delete all account tuples at every branch located in a specific city.
# Demonstrate how you delete all account tuples at every branch located in a specific city.
# Generate suitable reports.
# Generate suitable reports.
# Create suitable front end for querying and displaying the results.  
# Create suitable front end for querying and displaying the results.


'''''Instructions:'''''  
'''''Instructions:'''''


# The exercises are to be solved in an RDBMS environment like Oracle or DB2.
# The exercises are to be solved in an RDBMS environment like Oracle or DB2.
Line 1,068: Line 1,083:
# The student need not create the front end in the examination. The results of the queries may be displayed directly.
# The student need not create the front end in the examination. The results of the queries may be displayed directly.
# Relevant queries other than the ones listed along with the exercises may also be asked in the examination.
# Relevant queries other than the ones listed along with the exercises may also be asked in the examination.
# Questions must be asked based on lots.  
# Questions must be asked based on lots.


<center>'''ALGORITHMS LABORATORY'''</center>  
<center>'''ALGORITHMS LABORATORY'''</center>  


=== Subject Code: 06CSL58 I.A. Marks : 25 ===
=== Subject Code: 06CSL58 I.A. Marks : 25 ===  
  '''Hours/Week : 03 Exam Hours: 03'''  
  '''Hours/Week : 03 Exam Hours: 03'''  


=== Total Hours : 42 Exam Marks: 50 ===
=== Total Hours : 42 Exam Marks: 50 ===  
  '''Implement the following using C/C++ Language.'''
  '''Implement the following using C/C++ Language.'''  


   
   
# Implement Recursive Binary search and Linear search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n.  
# Implement Recursive Binary search and Linear search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n.


# Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.  
# Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.


# Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.   
# Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.   


# Sort a given set of elements using Selection sort and determine the time required to sort elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.  
# Sort a given set of elements using Selection sort and determine the time required to sort elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.


5. a. Obtain the Topological ordering of vertices in a given digraph.
5. a. Obtain the Topological ordering of vertices in a given digraph.
Line 1,099: Line 1,114:
# Sort a given set of elements using Quick sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.   
# Sort a given set of elements using Quick sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.   


# Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's  
# Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's


algorithm.
algorithm.
Line 1,146: Line 1,161:
<center>'''Unix Systems Programming '''</center>  
<center>'''Unix Systems Programming '''</center>  


=== Subject Code: 06CS61 I.A. Marks : 25 ===
=== Subject Code: 06CS61 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 1,152: Line 1,167:
<center>'''PART - A'''</center>  
<center>'''PART - A'''</center>  


# '''Introduction 6 Hrs'''  
# '''Introduction 6 Hrs'''


UNIX and ANSI Standards:''' '''The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open Standards.  
UNIX and ANSI Standards:''' '''The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open Standards.  
Line 1,158: Line 1,173:
UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development Environment, API Common Characteristics.   
UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development Environment, API Common Characteristics.   


# '''UNIX Files 6 Hrs'''  
# '''UNIX Files 6 Hrs'''


File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links.
File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links.
Line 1,164: Line 1,179:
'''3. UNIX File APIs 7 Hrs'''
'''3. UNIX File APIs 7 Hrs'''


General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class, File Listing Program.  
General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class, File Listing Program.


# '''UNIX Processes 7 Hrs'''  
# '''UNIX Processes 7 Hrs'''


The Environment of a UNIX Process:''' '''Introduction, main function, Process Termination, Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.
The Environment of a UNIX Process:''' '''Introduction, main function, Process Termination, Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.
Line 1,177: Line 1,192:
Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times, I/O Redirection.  
Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times, I/O Redirection.  


Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups.  
Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups.


# '''Signals and Daemon Processes 7 Hrs'''  
# '''Signals and Daemon Processes 7 Hrs'''


Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers.
Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers.


Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Client-Server Model.  
Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Client-Server Model.


# '''Interprocess Communication - 1 6 Hrs'''  
# '''Interprocess Communication - 1 6 Hrs'''


Overview of IPC Methods, Pipes, popen, pclose Functions, Coprocesses, FIFOs, System V IPC, Message Queues, Semaphores.  
Overview of IPC Methods, Pipes, popen, pclose Functions, Coprocesses, FIFOs, System V IPC, Message Queues, Semaphores.


# '''Interprocess Communication - 2 6 Hrs'''  
# '''Interprocess Communication - 2 6 Hrs'''


Shared Memory, Client-Server Properties, Stream Pipes, Passing File Descriptors, An Open Server-Version 1, Client-Server Connection Functions.  
Shared Memory, Client-Server Properties, Stream Pipes, Passing File Descriptors, An Open Server-Version 1, Client-Server Connection Functions.  
Line 1,199: Line 1,214:
# Terrence Chan: Unix System Programming Using C++, Prentice Hall India, 1999.   
# Terrence Chan: Unix System Programming Using C++, Prentice Hall India, 1999.   


(Chapters 1, 5, 6, 7, 8, 9, 10)  
(Chapters 1, 5, 6, 7, 8, 9, 10)


# W.Richard Stevens: Advanced Programming in the UNIX Environment, Addison-Wesley/PHI, 1992.  
# W.Richard Stevens: Advanced Programming in the UNIX Environment, Addison-Wesley/PHI, 1992.


(Chapters 7, 8, 9, 13, 14, 15)  
(Chapters 7, 8, 9, 13, 14, 15)  
Line 1,213: Line 1,228:
2. Maurice.J.Bach: The Design of the UNIX Operating System, Pearson Education/Prentice Hall of India, 1987.   
2. Maurice.J.Bach: The Design of the UNIX Operating System, Pearson Education/Prentice Hall of India, 1987.   


# Uresh Vahalia:''' '''Unix Internals, Pearson Education, ASIA, 2001.  
# Uresh Vahalia:''' '''Unix Internals, Pearson Education, ASIA, 2001.


<center>'''File Structures '''</center>  
<center>'''File Structures '''</center>  


   
   
=== Subject Code: 06IS62 I.A. Marks : 25 ===
=== Subject Code: 06IS62 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 1,225: Line 1,240:


   
   
# '''Introduction 7 Hrs'''  
# '''Introduction 7 Hrs'''


File Structures:'' ''The Heart of the file structure Design, A Short History of File Structure Design, A Conceptual'' ''Toolkit; Fundamental File Operations:'' ''Physical Files and Logical Files, Opening Files, Closing Files, Reading and Writing, Seeking, Special Characters, The Unix Directory Structure, Physical devices and Logical Files, File-related Header Files, UNIX file System Commands; Secondary Storage and System Software: Disks, Magnetic Tape, Disk versus Tape; CD-ROM:'' ''Introduction, Physical Organization, Strengths and Weaknesses; Storage as Hierarchy, A journey of a Byte, Buffer Management, Input /Output in UNIX.  
File Structures:'' ''The Heart of the file structure Design, A Short History of File Structure Design, A Conceptual'' ''Toolkit; Fundamental File Operations:'' ''Physical Files and Logical Files, Opening Files, Closing Files, Reading and Writing, Seeking, Special Characters, The Unix Directory Structure, Physical devices and Logical Files, File-related Header Files, UNIX file System Commands; Secondary Storage and System Software: Disks, Magnetic Tape, Disk versus Tape; CD-ROM:'' ''Introduction, Physical Organization, Strengths and Weaknesses; Storage as Hierarchy, A journey of a Byte, Buffer Management, Input /Output in UNIX.


# '''Fundamental File Structure Concepts, Managing Files of Records 6 Hrs'''  
# '''Fundamental File Structure Concepts, Managing Files of Records 6 Hrs'''


Field and Record Organization, Using Classes to Manipulate Buffers, Using Inheritance for Record Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An Object-Oriented Class for Record Files, Record Access, More about Record Structures, Encapsulating Record Operations in a Single Class, File Access and File Organization.  
Field and Record Organization, Using Classes to Manipulate Buffers, Using Inheritance for Record Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An Object-Oriented Class for Record Files, Record Access, More about Record Structures, Encapsulating Record Operations in a Single Class, File Access and File Organization.


# '''Organization of Files for Performance, Indexing 7 Hrs'''  
# '''Organization of Files for Performance, Indexing 7 Hrs'''


Data Compression, Reclaiming Space in files, Internal Sorting and Binary Searching, Keysorting; What is an Index? A Simple Index for Entry-Sequenced File, Using Template Classes in C++ for Object I/O, Object-Oriented support for Indexed, Entry-Sequenced Files of Data Objects, Indexes that are too large to hold in Memory, Indexing to provide access by Multiple keys, Retrieval Using Combinations of Secondary Keys, Improving the Secondary Index structure: Inverted Lists, Selective indexes, Binding.  
Data Compression, Reclaiming Space in files, Internal Sorting and Binary Searching, Keysorting; What is an Index? A Simple Index for Entry-Sequenced File, Using Template Classes in C++ for Object I/O, Object-Oriented support for Indexed, Entry-Sequenced Files of Data Objects, Indexes that are too large to hold in Memory, Indexing to provide access by Multiple keys, Retrieval Using Combinations of Secondary Keys, Improving the Secondary Index structure: Inverted Lists, Selective indexes, Binding.


# '''Cosequential Processing and the Sorting of Large Files 6 Hrs'''  
# '''Cosequential Processing and the Sorting of Large Files 6 Hrs'''


A Model for Implementing Cosequential Processes, Application of the Model to a General Ledger Program, Extension of the Model to include Mutiway Merging, A Second Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk.
A Model for Implementing Cosequential Processes, Application of the Model to a General Ledger Program, Extension of the Model to include Mutiway Merging, A Second Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk.
Line 1,245: Line 1,260:


   
   
# '''Multi-Level Indexing and B-Trees 7 Hrs'''  
# '''Multi-Level Indexing and B-Trees 7 Hrs'''


The invention of B-Tree, Statement of the problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees, Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees, B-Tree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case Search Depth, Deletion, Merging and Redistribution, Redistribution during insertion; B* Trees, Buffering of pages; Virtual B-Trees; Variable-length Records and keys.  
The invention of B-Tree, Statement of the problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees, Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees, B-Tree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case Search Depth, Deletion, Merging and Redistribution, Redistribution during insertion; B* Trees, Buffering of pages; Virtual B-Trees; Variable-length Records and keys.


# '''Indexed Sequential File Access and Prefix B + Trees 6 Hrs '''  
# '''Indexed Sequential File Access and Prefix B + Trees 6 Hrs '''  
Line 1,254: Line 1,269:


   
   
# '''Hashing 7 Hrs'''  
# '''Hashing 7 Hrs'''


Introduction, A Simple Hashing Algorithm, Hashing Functions and Record Distribution, How much Extra Memory should be used?, Collision resolution by progressive overflow, Buckets, Making deletions, Other collision resolution techniques, Patterns of record access.  
Introduction, A Simple Hashing Algorithm, Hashing Functions and Record Distribution, How much Extra Memory should be used?, Collision resolution by progressive overflow, Buckets, Making deletions, Other collision resolution techniques, Patterns of record access.


# '''Extendible Hashing 6 Hrs'''  
# '''Extendible Hashing 6 Hrs'''


How Extendible Hashing Works, Implementation, Deletion, Extendible Hashing Performance, Alternative Approaches.  
How Extendible Hashing Works, Implementation, Deletion, Extendible Hashing Performance, Alternative Approaches.  
Line 1,265: Line 1,280:
'''Text Books: '''  
'''Text Books: '''  


# Michael J. Folk, Bill Zoellick, Greg Riccardi:''' '''File Structures-An Object Oriented Approach with C++, 3<sup>rd</sup> Edition, Addison-Wesley, 1998.  
# Michael J. Folk, Bill Zoellick, Greg Riccardi:''' '''File Structures-An Object Oriented Approach with C++, 3<sup>rd</sup> Edition, Addison-Wesley, 1998.


(Chapters 1 to 12 excluding 1.4, 1.5, 5.5, 5.6, 8.6, 8.7, 8.8)
(Chapters 1 to 12 excluding 1.4, 1.5, 5.5, 5.6, 8.6, 8.7, 8.8)




'''Reference Books:'''  
'''Reference Books:'''


# K.R. Venugopal, K.G. Srinivas, P.M. Krishnaraj: File Structures Using C++, Tata McGraw-Hill, 2008.  
# K.R. Venugopal, K.G. Srinivas, P.M. Krishnaraj: File Structures Using C++, Tata McGraw-Hill, 2008.  
# Scot Robert Ladd: C++ Components and Algorithms, BPB Publications, 1993.
# Scot Robert Ladd: C++ Components and Algorithms, BPB Publications, 1993.
# Raghu Ramakrishan and Johannes Gehrke: Database Management Systems, 3<sup>rd</sup> Edition, McGraw Hill, 2003.  
# Raghu Ramakrishan and Johannes Gehrke: Database Management Systems, 3<sup>rd</sup> Edition, McGraw Hill, 2003.


<center>'''Software Engineering'''</center>  
<center>'''Software Engineering'''</center>  


=== Subject Code: 06IS63 I.A. Marks : 25 ===
=== Subject Code: 06IS63 I.A. Marks : 25 ===  
  '''Hours/Week : 04Exam Hours: 03'''  
  '''Hours/Week : 04Exam Hours: 03'''  


Line 1,288: Line 1,303:
Introduction:''' '''FAQ's about software engineering, Professional and ethical responsibility.
Introduction:''' '''FAQ's about software engineering, Professional and ethical responsibility.


Socio-Technical systems: Emergent system properties; Systems engineering; Organizations, people and computer systems; Legacy systems.  
Socio-Technical systems: Emergent system properties; Systems engineering; Organizations, people and computer systems; Legacy systems.


# '''Critical Systems, Software Processes6 Hrs'''  
# '''Critical Systems, Software Processes6 Hrs'''


Critical Systems: A simple safety-critical system; System dependability; Availability and reliability.
Critical Systems: A simple safety-critical system; System dependability; Availability and reliability.


Software Processes: Models, Process iteration, Process activities; The Rational Unified Process; Computer-Aided Software Engineering.  
Software Processes: Models, Process iteration, Process activities; The Rational Unified Process; Computer-Aided Software Engineering.


# '''Requirements 7 Hrs'''   
# '''Requirements 7 Hrs'''   
Line 1,302: Line 1,317:
Requirements Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation; Requirements management.   
Requirements Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation; Requirements management.   


# '''System models, Project Management7 Hrs'''  
# '''System models, Project Management7 Hrs'''


System Models: Context models; Behavioral models; Data models; Object models; Structured methods.
System Models: Context models; Behavioral models; Data models; Object models; Structured methods.
Line 1,316: Line 1,331:
Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control styles.
Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control styles.


Object-Oriented design: Objects and Object Classes; An Object-Oriented design process; Design evolution.  
Object-Oriented design: Objects and Object Classes; An Object-Oriented design process; Design evolution.


# '''Development6 Hrs'''  
# '''Development6 Hrs'''


Rapid Software Development: Agile methods; Extreme programming; Rapid application development.
Rapid Software Development: Agile methods; Extreme programming; Rapid application development.


Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacy system evolution.  
Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacy system evolution.


# '''Verification and Validation 7 Hrs '''  
# '''Verification and Validation 7 Hrs '''  
Line 1,328: Line 1,343:
Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and formal methods.  
Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and formal methods.  


Software testing: System testing; Component testing; Test case design; Test automation.  
Software testing: System testing; Component testing; Test case design; Test automation.


# '''Management''' '''6 Hrs '''  
# '''Management''' '''6 Hrs '''  
Line 1,344: Line 1,359:




'''Reference Books:'''  
'''Reference Books:'''


# Roger.S.Pressman: Software Engineering-A Practitioners approach, 7<sup>th</sup> Edition,McGraw-Hill, 2007.
# Roger.S.Pressman: Software Engineering-A Practitioners approach, 7<sup>th</sup> Edition,McGraw-Hill, 2007.
# Pfleeger: Software Engineering Theory and Practice, 2<sup>nd</sup> Edition, Pearson Education, 2001.  
# Pfleeger: Software Engineering Theory and Practice, 2<sup>nd</sup> Edition, Pearson Education, 2001.


3. Waman S Jawadekar: Software Engineering Principles and Practice, Tata McGraw Hill, 2004.
3. Waman S Jawadekar: Software Engineering Principles and Practice, Tata McGraw Hill, 2004.
Line 1,356: Line 1,371:
   
   
=== Subject Code: 06CS64 I.A. Marks : 25 ===  
=== Subject Code: 06CS64 I.A. Marks : 25 ===  
== Hours/Week : 04 Exam Hours: 03 ==
== Hours/Week : 04 Exam Hours: 03 ==  
  '''Total Hours : 52 Exam Marks: 100'''  
  '''Total Hours : 52 Exam Marks: 100'''  


Line 1,397: Line 1,412:




'''Text Books:'''  
'''Text Books:'''


# Alberto Leon-Garcia and Indra Widjaja: Communication Networks –Fundamental Concepts and Key architectures, 2<sup>nd</sup> Edition, Tata McGraw-Hill, 2004.  
# Alberto Leon-Garcia and Indra Widjaja: Communication Networks –Fundamental Concepts and Key architectures, 2<sup>nd</sup> Edition, Tata McGraw-Hill, 2004.


(Chapters 7, 8, 9, 11, Appendix B)  
(Chapters 7, 8, 9, 11, Appendix B)


# Nader F. Mir: Computer and Communication Networks, Pearson Education, 2007.   
# Nader F. Mir: Computer and Communication Networks, Pearson Education, 2007.   
Line 1,423: Line 1,438:
   
   
=== Subject Code: 06IS65 I.A. Marks : 25 ===  
=== Subject Code: 06IS65 I.A. Marks : 25 ===  
== Hours/Week : 04 Exam Hours: 03 ==
== Hours/Week : 04 Exam Hours: 03 ==  
  '''Total Hours : 52 Exam Marks: 100'''  
  '''Total Hours : 52 Exam Marks: 100'''  


Line 1,480: Line 1,495:




'''Text Books:'''  
'''Text Books:'''


# James A. O’ Brien, George M. Marakas: Management Information Systems, 7<sup>th</sup> Edition, Tata McGraw Hill, 2006.  
# James A. O’ Brien, George M. Marakas: Management Information Systems, 7<sup>th</sup> Edition, Tata McGraw Hill, 2006.


(Chapters 1, 2, 7, 8, 9, 10, 13, 14)  
(Chapters 1, 2, 7, 8, 9, 10, 13, 14)  




'''Reference Books:'''  
'''Reference Books:'''


# Kenneth C. Laudon and Jane P. Laudon: Management Information System, Managing the Digital Firm, 9<sup>th</sup> Edition, Pearson Education, 2006.
# Kenneth C. Laudon and Jane P. Laudon: Management Information System, Managing the Digital Firm, 9<sup>th</sup> Edition, Pearson Education, 2006.
# Steven Alter: Information Systems The Foundation of E-Business, 4<sup>th</sup> Edition, Pearson Education, 2002.
# Steven Alter: Information Systems The Foundation of E-Business, 4<sup>th</sup> Edition, Pearson Education, 2002.
# W.S. Jawadekar: Management Information Systems, Tata McGraw Hill 1998.  
# W.S. Jawadekar: Management Information Systems, Tata McGraw Hill 1998.


<center>'''Operations Research'''</center>  
<center>'''Operations Research'''</center>  


=== Subject Code: 06CS661 I.A. Marks : 25 ===
=== Subject Code: 06CS661 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 1,547: Line 1,562:




'''Text Books:'''  
'''Text Books:'''


# Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research, 8<sup>th</sup> Edition, Tata McGraw Hill, 2005.  
# Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research, 8<sup>th</sup> Edition, Tata McGraw Hill, 2005.


(Chapters: 1, 2, 3.1 to 3.4, 4.1 to 4.8, 5, 6.1 to 6.7, 7.1 to 7.3, 8, 13, 14, 15.1 to 15.4)
(Chapters: 1, 2, 3.1 to 3.4, 4.1 to 4.8, 5, 6.1 to 6.7, 7.1 to 7.3, 8, 13, 14, 15.1 to 15.4)




'''Reference Books:'''  
'''Reference Books:'''


# Wayne L. Winston: Operations Research Applications and Algorithms, 4<sup>th</sup> Edition, Thomson Course Technology, 2003.  
# Wayne L. Winston: Operations Research Applications and Algorithms, 4<sup>th</sup> Edition, Thomson Course Technology, 2003.  
# Hamdy A Taha: Operations Research: An Introduction, 8<sup>th</sup> Edition, Prentice Hall India, 2007.  
# Hamdy A Taha: Operations Research: An Introduction, 8<sup>th</sup> Edition, Prentice Hall India, 2007.


<center>'''Compiler Design '''</center>  
<center>'''Compiler Design '''</center>  


=== Subject Code: 06IS662 / 06CS62 I.A. Marks : 25 ===
=== Subject Code: 06IS662 / 06CS62 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 1,567: Line 1,582:
<center>'''PART - A'''</center>  
<center>'''PART - A'''</center>  


# '''Introduction, Lexical analysis6 Hrs'''  
# '''Introduction, Lexical analysis6 Hrs'''


Compilers; Analysis of Source Program; The Phases of a Compiler; Cousins of the Compiler; The grouping of phases; Compiler- Construction tools.
Compilers; Analysis of Source Program; The Phases of a Compiler; Cousins of the Compiler; The grouping of phases; Compiler- Construction tools.


Lexical analysis: The Role of Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens.  
Lexical analysis: The Role of Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens.


# '''Syntax Analysis – 17 Hrs '''  
# '''Syntax Analysis – 17 Hrs '''  


The Role of the Parser; Context-free Grammars; Writing a Grammar; Top-down Parsing; Bottom-up Parsing.  
The Role of the Parser; Context-free Grammars; Writing a Grammar; Top-down Parsing; Bottom-up Parsing.


# '''Syntax Analysis – 27 Hrs '''  
# '''Syntax Analysis – 27 Hrs '''  
Line 1,614: Line 1,629:




'''Reference Books:'''  
'''Reference Books:'''


# Charles N. Fischer, Richard J. leBlanc, Jr.: Crafting a Compiler with C, Pearson Education, 1991.
# Charles N. Fischer, Richard J. leBlanc, Jr.: Crafting a Compiler with C, Pearson Education, 1991.
Line 1,622: Line 1,637:
<center>'''Data Compression'''</center>  
<center>'''Data Compression'''</center>  


=== Subject Code: 06CS663 I.A. Marks : 25 ===
=== Subject Code: 06CS663 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 1,699: Line 1,714:


   
   
=== Subject Code: 06CS664 I.A. Marks : 25 ===
=== Subject Code: 06CS664 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 1,755: Line 1,770:
   
   
=== Subject Code: 06IS665 / 06CS65 I.A. Marks : 25 ===  
=== Subject Code: 06IS665 / 06CS65 I.A. Marks : 25 ===  
== Hours/Week : 04 Exam Hours: 03 ==
== Hours/Week : 04 Exam Hours: 03 ==  
  '''Total Hours : 52 Exam Marks: 100'''
  '''Total Hours : 52 Exam Marks: 100'''  


   
   
Line 1,762: Line 1,777:


   
   
# '''INTRODUCTION ''''''7 Hrs'''  
# '''INTRODUCTION ''''''7 Hrs'''


Applications of computer graphics; A graphics system; Images: Physical and synthetic; The human visual system; The pinhole camera; The synthetic camera model; The programmer’s interface; Graphics architectures.
Applications of computer graphics; A graphics system; Images: Physical and synthetic; The human visual system; The pinhole camera; The synthetic camera model; The programmer’s interface; Graphics architectures.
Line 1,819: Line 1,834:
   
   
===== File Structures Laboratory =====  
===== File Structures Laboratory =====  
=== Subject Code: 06ISL67 I.A. Marks : 25 ===
=== Subject Code: 06ISL67 I.A. Marks : 25 ===  
  '''Hours/Week : 03 Exam Hours: 03'''
  '''Hours/Week : 03 Exam Hours: 03'''  


'''Total Hours : 42Exam Marks: 50'''
'''Total Hours : 42Exam Marks: 50'''
Line 1,832: Line 1,847:
## Demonstration of the project report and related viva:50%
## Demonstration of the project report and related viva:50%
## Implementation of the specified modification:30%
## Implementation of the specified modification:30%
## Subject Viva:20%  
## Subject Viva:20%


5. All possible operations relating to files like open, close, read, retrieve, delete and update have to be implemented and demonstrated in all the mini projects
5. All possible operations relating to files like open, close, read, retrieve, delete and update have to be implemented and demonstrated in all the mini projects


   
   
= PART – I =
= PART – I =  
  The following specifications are common to all projects.
  The following specifications are common to all projects.  




Line 1,844: Line 1,859:


   
   
= PART – II =
= PART – II =  
  One of the following mini projects is to be completed by each batch of two students.
  One of the following mini projects is to be completed by each batch of two students.  


   
   
= PROJECT – 1 =
= PROJECT – 1 =  
  Develop an indexed file for the student record file with the USN as the key and name as the secondary key. Write a driver program to create an index file from the student record file created in PART – 1. Prompt for USN and display of the record.  
  Develop an indexed file for the student record file with the USN as the key and name as the secondary key. Write a driver program to create an index file from the student record file created in PART – 1. Prompt for USN and display of the record.  


Line 1,854: Line 1,869:


   
   
# Select any other secondary key of your choice and demonstrate the retrieval using combinations of secondary keys.  
# Select any other secondary key of your choice and demonstrate the retrieval using combinations of secondary keys.


2.Use inverted list structure to rearrange the secondary key index file when new insertion is to be done.
2.Use inverted list structure to rearrange the secondary key index file when new insertion is to be done.


   
   
= PROJECT – 2 =
= PROJECT – 2 =  
  Develop an application that produces student’s transcripts. Use Cosequential processes and Master Transaction Process to develop this. For each student record (Master) print the student information and list of all subjects (transactions) taken by the student. As input, use file of STUDENT records sorted by USN.
  Develop an application that produces student’s transcripts. Use Cosequential processes and Master Transaction Process to develop this. For each student record (Master) print the student information and list of all subjects (transactions) taken by the student. As input, use file of STUDENT records sorted by USN.  


   
   
# Demonstrate 4-way merge.
# Demonstrate 4-way merge.
# Sort the data file using heap-sort and demonstrate the 4 phases of merging using heap-sort.  
# Sort the data file using heap-sort and demonstrate the 4 phases of merging using heap-sort.


= PROJECT – 3 =
= PROJECT – 3 =  
  Add B – tree indexes to the data files created in PART – 1. Use Class BTREE to create B-tree index of the student record file with USN as key.  
  Add B – tree indexes to the data files created in PART – 1. Use Class BTREE to create B-tree index of the student record file with USN as key.  


Line 1,874: Line 1,889:
# Calculate and display the average space utilization.
# Calculate and display the average space utilization.
# Invoke a method to indicate the level of collapse.
# Invoke a method to indicate the level of collapse.
# Invoke a method to indicate the level splitting.  
# Invoke a method to indicate the level splitting.


'''PROJECT – 4'''
'''PROJECT – 4'''
Line 1,885: Line 1,900:
   
   
# Do not compress the keys as you form the separators for the index set.
# Do not compress the keys as you form the separators for the index set.
# Keep B-tree nodes in the same file as the sequence set blocks. The header block should contain a reference to the root of the B-tree as well as a reference to the beginning of the sequence set.  
# Keep B-tree nodes in the same file as the sequence set blocks. The header block should contain a reference to the root of the B-tree as well as a reference to the beginning of the sequence set.


= PROJECT – 5 =
= PROJECT – 5 =  
  Develop a hashed index of the student record file with the USN as the key.
  Develop a hashed index of the student record file with the USN as the key.  




Line 1,895: Line 1,910:
   
   
# Demonstrate doubling of the directory size.
# Demonstrate doubling of the directory size.
# Display the space utilization for buckets and directory size.  
# Display the space utilization for buckets and directory size.


= System Programming Laboratory =  
= System Programming Laboratory =  
== Subject Code: 06ISL68I.A. Marks : 25 ==
== Subject Code: 06ISL68I.A. Marks : 25 ==  
  '''Hours/Week : 03Exam Hours : 03'''
  '''Hours/Week : 03Exam Hours : 03'''  


'''Total Hours : 42Exam Marks : 50'''  
'''Total Hours : 42Exam Marks : 50'''


=== PART A ===
=== PART A ===  
  '''LEX and YACC Programs:'''
  '''LEX and YACC Programs:'''  


Execute the following programs using LEX:  
Execute the following programs using LEX:


# a. Program to count the number of characters, words, spaces and lines in a given input file.  
# a. Program to count the number of characters, words, spaces and lines in a given input file.


b. Program to count the numbers of comment lines in a given C program. Also eliminate them and copy the resulting program into separate file.  
b. Program to count the numbers of comment lines in a given C program. Also eliminate them and copy the resulting program into separate file.


# a. Program to recognize a valid arithmetic expression and to recognize the identifiers and operators present. Print them separately.  
# a. Program to recognize a valid arithmetic expression and to recognize the identifiers and operators present. Print them separately.


b. Program to recognize whether a given sentence is simple or compound.  
b. Program to recognize whether a given sentence is simple or compound.


# Program to recognize and count the number of identifiers in a given input file.  
# Program to recognize and count the number of identifiers in a given input file.


Execute the following programs using YACC:  
Execute the following programs using YACC:


# a. Program to recognize a valid arithmetic expression that uses operators +, -, *  
# a. Program to recognize a valid arithmetic expression that uses operators +, -, *


and /.
and /.


b. Program to recognize a valid variable, which starts with a letter, followed by any number of letters or digits.  
b. Program to recognize a valid variable, which starts with a letter, followed by any number of letters or digits.


# a. Program to evaluate an arithmetic expression involving operators +, -, * and /.  
# a. Program to evaluate an arithmetic expression involving operators +, -, * and /.


b. Program to recognize strings ‘aaab’, ‘abbb’, ‘ab’ and ‘a’ using the grammar  
b. Program to recognize strings ‘aaab’, ‘abbb’, ‘ab’ and ‘a’ using the grammar  


(a<sup>n</sup>b<sup>n</sup>, n&gt;= 0).  
(a<sup>n</sup>b<sup>n</sup>, n&gt;= 0).


# Program to recognize the grammar (a<sup>n</sup>b, n&gt;= 10).  
# Program to recognize the grammar (a<sup>n</sup>b, n&gt;= 10).


<center>'''PART B '''</center>  
<center>'''PART B '''</center>  
Line 1,943: Line 1,958:
them in the Reverse order, ( For example, if the script is named rargs, then executing rargs A B C should produce C B A on the standard output).
them in the Reverse order, ( For example, if the script is named rargs, then executing rargs A B C should produce C B A on the standard output).


b) C program that creates a child process to read commands from the standard input and execute them (a minimal implementation of a shell – like program). You can assume that no arguments will be passed to the commands to be executed.  
b) C program that creates a child process to read commands from the standard input and execute them (a minimal implementation of a shell – like program). You can assume that no arguments will be passed to the commands to be executed.


# a) Shell script that accepts two file names as arguments, checks if the permissions   
# a) Shell script that accepts two file names as arguments, checks if the permissions   
Line 1,951: Line 1,966:
b) C program to create a file with 16 bytes of arbitrary data from the beginning  
b) C program to create a file with 16 bytes of arbitrary data from the beginning  


and another 16 bytes of arbitrary data from an offset of 48. Display the file contents to demonstrate how the hole in file is handled.  
and another 16 bytes of arbitrary data from an offset of 48. Display the file contents to demonstrate how the hole in file is handled.


# a) Shell function that takes a valid directory names as an argument and recursively   
# a) Shell function that takes a valid directory names as an argument and recursively   
Line 1,959: Line 1,974:
b) C program that accepts valid file names as command line arguments and for
b) C program that accepts valid file names as command line arguments and for


each of the arguments, prints the type of the file ( Regular file, Directory file, Character special file, Block special file, Symbolic link etc.)  
each of the arguments, prints the type of the file ( Regular file, Directory file, Character special file, Block special file, Symbolic link etc.)


# a) Shell script that accepts file names specified as arguments and creates a shell   
# a) Shell script that accepts file names specified as arguments and creates a shell   
Line 1,967: Line 1,982:
b) C program to do the following: Using fork( ) create a child process. The child  
b) C program to do the following: Using fork( ) create a child process. The child  


process prints its own process-id and id of its parent and then exits. The parent process waits for its child to finish (by executing the wait( )) and prints its own process-id and the id of its child process and then exits.  
process prints its own process-id and id of its parent and then exits. The parent process waits for its child to finish (by executing the wait( )) and prints its own process-id and the id of its child process and then exits.


# a) Shell script that accepts path names and creates all the components in that path  
# a) Shell script that accepts path names and creates all the components in that path


names as directories. For example, if the script name is mpe, then the command mpe a/b/c/d should create directories a, a/b, a/b/c, and a/b/c/d.
names as directories. For example, if the script name is mpe, then the command mpe a/b/c/d should create directories a, a/b, a/b/c, and a/b/c/d.


b) C program that accepts one command-line argument, executes the arguments as a shell command, determines the time taken by it and prints the time values, Use the “times”, function and the “tms” structure. The code need not include error checking.  
b) C program that accepts one command-line argument, executes the arguments as a shell command, determines the time taken by it and prints the time values, Use the “times”, function and the “tms” structure. The code need not include error checking.


# a) Shell script that accepts valid log-in names as arguments and prints their   
# a) Shell script that accepts valid log-in names as arguments and prints their   
Line 1,981: Line 1,996:
b) C program that accepts a valid directory names as a command line argument  
b) C program that accepts a valid directory names as a command line argument  


and lists all the files in the given directory as well as all the subsequent subdirectories. (The solution can be recursive or non-recursive).  
and lists all the files in the given directory as well as all the subsequent subdirectories. (The solution can be recursive or non-recursive).


# a) Shell script to implement terminal locking. It should prompt the user for a   
# a) Shell script to implement terminal locking. It should prompt the user for a   
Line 2,002: Line 2,017:


   
   
=== Subject Code: 06CS71 I.A. Marks : 25 ===
=== Subject Code: 06CS71 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,099: Line 2,114:
<center>'''Software Architectures'''</center>  
<center>'''Software Architectures'''</center>  


=== Subject Code: 06IS72 I.A. Marks : 25 ===
=== Subject Code: 06IS72 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,173: Line 2,188:


   
   
=== Subject Code: 06CS73 I.A. Marks : 25 ===
=== Subject Code: 06CS73 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


=== Total Hours : 52 Exam Marks: 100 ===
=== Total Hours : 52 Exam Marks: 100 ===  
  '''1. Fundamentals of Web, XHTML - 16 Hrs'''
  '''1. Fundamentals of Web, XHTML - 16 Hrs'''  


Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; The Web Programmers Toolbox.
Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; The Web Programmers Toolbox.
Line 2,222: Line 2,237:




'''Text Books:'''  
'''Text Books:'''


# Robert W. Sebesta: Programming the World Wide web, 3<sup>rd</sup> edition, Pearson education, 2006.  
# Robert W. Sebesta: Programming the World Wide web, 3<sup>rd</sup> edition, Pearson education, 2006.


(Chapters 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14.1, 14.3 to 14.6)
(Chapters 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14.1, 14.3 to 14.6)




'''Reference Books:'''  
'''Reference Books:'''


# M. Deitel, P.J. Deitel, A. B. Goldberg: Internet &amp; World Wide Web How to H program, 3<sup>rd</sup> Edition, Pearson education, 2004.
# M. Deitel, P.J. Deitel, A. B. Goldberg: Internet &amp; World Wide Web How to H program, 3<sup>rd</sup> Edition, Pearson education, 2004.
# Chris Bates: Web Programming Building Internet Applications, 3<sup>rd</sup> Edition, Wiley India, 2006.
# Chris Bates: Web Programming Building Internet Applications, 3<sup>rd</sup> Edition, Wiley India, 2006.
# Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003.  
# Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003.


<center>'''Data Mining'''</center>  
<center>'''Data Mining'''</center>  


   
   
=== Subject Code: 06IS74 / 06CS755 I.A. Marks : 25 ===
=== Subject Code: 06IS74 / 06CS755 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,301: Line 2,316:


   
   
=== Subject Code: 06CS751 I.A. Marks : 25 ===
=== Subject Code: 06CS751 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,365: Line 2,380:


   
   
=== Subject Code: 06CS74 / 06IS752 I.A. Marks : 25 ===
=== Subject Code: 06CS74 / 06IS752 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,436: Line 2,451:
'''Hours/Week: 4 Exam Marks: 100'''
'''Hours/Week: 4 Exam Marks: 100'''


'''Total Hours: 52 Exam Hours: 3'''  
'''Total Hours: 52 Exam Hours: 3'''


<center>'''Part-A'''</center>  
<center>'''Part-A'''</center>  
Line 2,496: Line 2,511:




'''Text Books:'''  
'''Text Books:'''


# Herbert Schildt: Java The Complete Reference, 7<sup>th</sup> Edition, Tata McGraw Hill, 2007.  
# Herbert Schildt: Java The Complete Reference, 7<sup>th</sup> Edition, Tata McGraw Hill, 2007.


(Chapters 1, 2, 3, 4, 5, 6, 8, 10, 11, 21, 22, 29, 30, 31)  
(Chapters 1, 2, 3, 4, 5, 6, 8, 10, 11, 21, 22, 29, 30, 31)


# Jim Keogh: J2EE The Complete Reference, Tata McGraw Hill, 2007.  
# Jim Keogh: J2EE The Complete Reference, Tata McGraw Hill, 2007.


(Chapters 5, 6, 11, 12, 15)  
(Chapters 5, 6, 11, 12, 15)  




'''Reference Books:'''  
'''Reference Books:'''


# Y. Daniel Liang: Introduction to JAVA Programming, 6<sup>th</sup> Edition, Pearson Education, 2007.
# Y. Daniel Liang: Introduction to JAVA Programming, 6<sup>th</sup> Edition, Pearson Education, 2007.
# Stephanie Bodoff et al: The J2EE Tutorial, 2<sup>nd</sup> Edition, Pearson Education, 2004.  
# Stephanie Bodoff et al: The J2EE Tutorial, 2<sup>nd</sup> Edition, Pearson Education, 2004.


<center>'''Multimedia Computing'''</center>  
<center>'''Multimedia Computing'''</center>  


   
   
=== Subject Code: 06CS754 I.A. Marks : 25 ===
=== Subject Code: 06CS754 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,542: Line 2,557:
'''4. Data Compression - 2 6 Hrs'''
'''4. Data Compression - 2 6 Hrs'''


H.261 (Px64) and H.263: Image Preparation, Coding Algorithms, Data Stream, H.263+ and H.263L; MPEG: Video Encoding, Audio Coding, Data Stream, MPEG-2, MPEG-4, MPEG-7; Fractal Compression.  
H.261 (Px64) and H.263: Image Preparation, Coding Algorithms, Data Stream, H.263+ and H.263L; MPEG: Video Encoding, Audio Coding, Data Stream, MPEG-2, MPEG-4, MPEG-7; Fractal Compression.


<center>'''PART -B'''</center>  
<center>'''PART -B'''</center>  
Line 2,563: Line 2,578:




'''Text Books:'''  
'''Text Books:'''


# Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Vol 1-Media Coding and Content Processing, 2<sup>nd</sup> Edition, Pearson Education / PHI, 2003.  
# Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Vol 1-Media Coding and Content Processing, 2<sup>nd</sup> Edition, Pearson Education / PHI, 2003.


(Chapters 2, 3, 4, 5, 6, 7, 8, 9)  
(Chapters 2, 3, 4, 5, 6, 7, 8, 9)


# Prabhat K. Andleigh, Kiran Thakrar: Multimedia Systems Design, PHI, 2003.  
# Prabhat K. Andleigh, Kiran Thakrar: Multimedia Systems Design, PHI, 2003.


(Chapters 1, 3, 7)
(Chapters 1, 3, 7)




'''Reference Books:'''  
'''Reference Books:'''


# K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic: Multimedia Communication Systems: Techniques, Standards, and Networks, Pearson Education, 2002.
# K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic: Multimedia Communication Systems: Techniques, Standards, and Networks, Pearson Education, 2002.
Line 2,586: Line 2,601:
'''Hrs/ Week: 04Exam Hours: 03'''
'''Hrs/ Week: 04Exam Hours: 03'''


'''Total Hours: 52Exam Marks: 100'''  
'''Total Hours: 52Exam Marks: 100'''


<center>'''PART - A'''</center>  
<center>'''PART - A'''</center>  


= Quality Management7 Hrs =
= Quality Management7 Hrs =  
  Quality Concepts: Quality, Software quality; The software quality dilemma; Achieving software quality.
  Quality Concepts: Quality, Software quality; The software quality dilemma; Achieving software quality.  


Review techniques: Cost impact of Software defects; Defect amplification and removal; Review metrics and their use; Reviews: A formal spectrum; Informal reviews; Formal technical reviews.
Review techniques: Cost impact of Software defects; Defect amplification and removal; Review metrics and their use; Reviews: A formal spectrum; Informal reviews; Formal technical reviews.
Line 2,599: Line 2,614:
'''2. Formal Modeling and Verification6 Hrs'''
'''2. Formal Modeling and Verification6 Hrs'''


The Cleanroom Strategy; Functional specification; Cleanroom design; Cleanroom testing; Formal methods concepts; Applying mathematical notation for formal specification; Formal specification languages.  
The Cleanroom Strategy; Functional specification; Cleanroom design; Cleanroom testing; Formal methods concepts; Applying mathematical notation for formal specification; Formal specification languages.


= Process Improvement, Configuration Management7 Hrs =
= Process Improvement, Configuration Management7 Hrs =  
  Process and product quality; Process classification; Process measurement; Process analysis and modeling; Process change; The CMMI process improvement framework.
  Process and product quality; Process classification; Process measurement; Process analysis and modeling; Process change; The CMMI process improvement framework.  


Configuration management planning; Change management; Version and release management; System building; CASE tools for configuration management.
Configuration management planning; Change management; Version and release management; System building; CASE tools for configuration management.
Line 2,643: Line 2,658:
1. Roger S. Pressman: Software Engineering: A Practitioner’s Approach, 7<sup>th</sup> Edition, McGraw-Hill, 2007.
1. Roger S. Pressman: Software Engineering: A Practitioner’s Approach, 7<sup>th</sup> Edition, McGraw-Hill, 2007.


(Chapters 14, 15, 16, 21, 25, 29)  
(Chapters 14, 15, 16, 21, 25, 29)


# Sommerville: Software Engineering, 8<sup>th</sup> Edition, Addison-Wesley, 2007.  
# Sommerville: Software Engineering, 8<sup>th</sup> Edition, Addison-Wesley, 2007.


(Chapters 16, 18, 19, 20, 24, 28, 29, 31, 32)
(Chapters 16, 18, 19, 20, 24, 28, 29, 31, 32)


'''Reference Books:'''  
'''Reference Books:'''


# Pfleeger: Software Engineering Theory and Practice, 2<sup>nd</sup> Edition, Pearson Education, 2001.
# Pfleeger: Software Engineering Theory and Practice, 2<sup>nd</sup> Edition, Pearson Education, 2001.
# Waman S Jawadekar: Software Engineering Principles and Practice, Tata McGraw Hill, 2004.  
# Waman S Jawadekar: Software Engineering Principles and Practice, Tata McGraw Hill, 2004.


<center>'''Neural Networks'''</center>  
<center>'''Neural Networks'''</center>  


   
   
=== Subject Code: 06CS756 I.A. Marks : 25 ===
=== Subject Code: 06CS756 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,663: Line 2,678:
<center>'''PART – A'''</center>  
<center>'''PART – A'''</center>  


# '''Introduction7 Hrs'''  
# '''Introduction7 Hrs'''


What is a Neural Network?, Human Brain, Models of Neuron, Neural Networks viewed as directed graphs, Feedback, Network Architectures, Knowledge representation, Artificial Intelligence and Neural Networks.  
What is a Neural Network?, Human Brain, Models of Neuron, Neural Networks viewed as directed graphs, Feedback, Network Architectures, Knowledge representation, Artificial Intelligence and Neural Networks.


# '''Learning Processes – 16 Hrs'''  
# '''Learning Processes – 16 Hrs'''


Introduction, Error-correction learning, Memory-based learning, Hebbian learning, Competitive learning, Boltzamann learning, Credit Assignment problem, Learning with a Teacher, Learning without a Teacher, Learning tasks, Memory, Adaptation.   
Introduction, Error-correction learning, Memory-based learning, Hebbian learning, Competitive learning, Boltzamann learning, Credit Assignment problem, Learning with a Teacher, Learning without a Teacher, Learning tasks, Memory, Adaptation.   


# '''Learning Processes – 2''', '''Single Layer Perceptrons 7 Hrs'''  
# '''Learning Processes – 2''', '''Single Layer Perceptrons 7 Hrs'''


Statistical nature of the learning process, Statistical learning theory, Approximately correct model of learning.
Statistical nature of the learning process, Statistical learning theory, Approximately correct model of learning.
Line 2,677: Line 2,692:
Single Layer Perceptrons: Introduction, Adaptive filtering problem, Unconstrained optimization techniques, Linear least-squares filters''', '''Least-mean square algorithm, Learning curves, Learning rate annealing techniques, Perceptron, Perceptron convergence theorem, Relation between the Perceptron and Bayes classifier for a Gaussian environment.   
Single Layer Perceptrons: Introduction, Adaptive filtering problem, Unconstrained optimization techniques, Linear least-squares filters''', '''Least-mean square algorithm, Learning curves, Learning rate annealing techniques, Perceptron, Perceptron convergence theorem, Relation between the Perceptron and Bayes classifier for a Gaussian environment.   


# '''Multilayer Perceptrons – 1 6 Hrs'''  
# '''Multilayer Perceptrons – 1 6 Hrs'''


Introduction, Some preliminaries, Back-propagation Algorithm, Summary of back-propagation algorithm, XOR problem, Heuristics for making the back-propagation algorithm perform better, Output representation and decision rule, Computer experiment, Feature detection, Back-propagation and differentiation.   
Introduction, Some preliminaries, Back-propagation Algorithm, Summary of back-propagation algorithm, XOR problem, Heuristics for making the back-propagation algorithm perform better, Output representation and decision rule, Computer experiment, Feature detection, Back-propagation and differentiation.   
Line 2,684: Line 2,699:


   
   
# '''Multilayer Perceptrons – 2 7 Hrs'''  
# '''Multilayer Perceptrons – 2 7 Hrs'''


Hessian matrix, Generalization, approximation of functions, Cross validation, Network pruning techniques, virtues and limitations of back- propagation learning, Accelerated convergence of back propagation learning, Supervised learning viewed as an optimization problem, Convolution networks.  
Hessian matrix, Generalization, approximation of functions, Cross validation, Network pruning techniques, virtues and limitations of back- propagation learning, Accelerated convergence of back propagation learning, Supervised learning viewed as an optimization problem, Convolution networks.


# '''Radial-Basic Function Networks – 1 6 Hrs'''  
# '''Radial-Basic Function Networks – 1 6 Hrs'''


Introduction, Cover’s theorem on the separability of patterns, Interpolation problem, Supervised learning as an ill-posed Hypersurface reconstruction problem, Regularization theory, Regularization networks, Generalized radial-basis function networks, XOR problem, Estimation of the regularization parameter.  
Introduction, Cover’s theorem on the separability of patterns, Interpolation problem, Supervised learning as an ill-posed Hypersurface reconstruction problem, Regularization theory, Regularization networks, Generalized radial-basis function networks, XOR problem, Estimation of the regularization parameter.


# '''Radial-Basic Function Networks – 2, Optimization - 1 6 Hrs'''  
# '''Radial-Basic Function Networks – 2, Optimization - 1 6 Hrs'''


Approximation properties of RBF networks, Comparison of RBF networks and multilayer Perceptrons, Kernel regression and it’s relation to RBF networks, Learning strategies, Computer experiment.
Approximation properties of RBF networks, Comparison of RBF networks and multilayer Perceptrons, Kernel regression and it’s relation to RBF networks, Learning strategies, Computer experiment.


Optimization using Hopfield networks: Traveling salesperson problem, Solving simultaneous linear equations, Allocating documents to multiprocessors.  
Optimization using Hopfield networks: Traveling salesperson problem, Solving simultaneous linear equations, Allocating documents to multiprocessors.


# '''Optimization Methods – 2 7 Hrs'''  
# '''Optimization Methods – 2 7 Hrs'''


Iterated gradient descent, Simulated Annealing, Random Search, Evolutionary computation- Evolutionary algorithms, Initialization, Termination criterion, Reproduction, Operators, Replacement, Schema theorem.
Iterated gradient descent, Simulated Annealing, Random Search, Evolutionary computation- Evolutionary algorithms, Initialization, Termination criterion, Reproduction, Operators, Replacement, Schema theorem.




'''Text Books:'''  
'''Text Books:'''


# Simon Haykin: Neural Networks- A Comprehensive Foundation, 2nd Edition, Pearson Education, 1999.  
# Simon Haykin: Neural Networks- A Comprehensive Foundation, 2nd Edition, Pearson Education, 1999.


(Chapters 1.1-1.8, 2.1-2.15, 3.1-3.10, 4.1-4.19, 5.1-5.14)   
(Chapters 1.1-1.8, 2.1-2.15, 3.1-3.10, 4.1-4.19, 5.1-5.14)   


# Kishan Mehrotra, Chilkuri K. Mohan, Sanjay Ranka: Artificial Neural Networks, Penram International Publishing, 1997.  
# Kishan Mehrotra, Chilkuri K. Mohan, Sanjay Ranka: Artificial Neural Networks, Penram International Publishing, 1997.


(Chapters 7.1-7.5)
(Chapters 7.1-7.5)




'''Reference Books:'''  
'''Reference Books:'''


# B.Yegnanarayana: Artificial Neural Networks, PHI, 2001.  
# B.Yegnanarayana: Artificial Neural Networks, PHI, 2001.


<center>'''C# Programming and .Net'''</center>  
<center>'''C# Programming and .Net'''</center>  


   
   
=== Subject Code: 06CS761 I.A. Marks : 25 ===
=== Subject Code: 06CS761 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,728: Line 2,743:


   
   
# '''The philosophy of .NET 6 Hrs'''  
# '''The philosophy of .NET 6 Hrs'''


Understanding the Previous State of Affairs, The .NET Solution, The Building Block of the .NET Platform (CLR,CTS, and CLS), The Role of the .NET Base Class Libraries, What C# Brings to the Table, An Overview of .NET Binaries ( aka Assemblies ), the Role of the Common Intermediate Language , The Role of .NET Type Metadata, The Role of the Assembly Manifast, Compiling CIL to Platform –Specific Instructions, Understanding the Common Type System, Intrinsic CTS Data Types, Understanding the Common Languages Specification, Understanding the Common Language Runtime A tour of the .NET Namespaces, Increasing Your Namespace Nomenclature, Deploying the .NET Runtime  
Understanding the Previous State of Affairs, The .NET Solution, The Building Block of the .NET Platform (CLR,CTS, and CLS), The Role of the .NET Base Class Libraries, What C# Brings to the Table, An Overview of .NET Binaries ( aka Assemblies ), the Role of the Common Intermediate Language , The Role of .NET Type Metadata, The Role of the Assembly Manifast, Compiling CIL to Platform –Specific Instructions, Understanding the Common Type System, Intrinsic CTS Data Types, Understanding the Common Languages Specification, Understanding the Common Language Runtime A tour of the .NET Namespaces, Increasing Your Namespace Nomenclature, Deploying the .NET Runtime


# '''Building C# Applications 6 Hrs'''  
# '''Building C# Applications 6 Hrs'''


The Role of the Command Line Complier (csc.exe), Building C # Application using csc.exe Working with csc.exe Response Files, Generating Bug Reports , Remaining C# Compiler Options, The Command Line Debugger (cordbg.exe) Using the, Visual Studio .NET IDE, Other Key Aspects of the VS.NET IDE, C# “Preprocessor:” Directives, An Interesting Aside: The System. Environment Class.  
The Role of the Command Line Complier (csc.exe), Building C # Application using csc.exe Working with csc.exe Response Files, Generating Bug Reports , Remaining C# Compiler Options, The Command Line Debugger (cordbg.exe) Using the, Visual Studio .NET IDE, Other Key Aspects of the VS.NET IDE, C# “Preprocessor:” Directives, An Interesting Aside: The System. Environment Class.


# '''C# Language Fundamentals. 8 Hrs'''  
# '''C# Language Fundamentals. 8 Hrs'''


The Anatomy of a Basic C# Class, Creating objects: Constructor Basics, The Composition of a C# Application, Default Assignment and Variable Scope, The C# Member Initialization Syntax, Basic Input and Output with the Console Class, Understanding Value Types and Reference Types, The Master Node: System, Object, The System Data Types (and C# Aliases), Converting Between Value Types and Reference Types: Boxing and Unboxing, Defining Program Constants, C# Iteration Constructs, C# Controls Flow Constructs, The Complete Set of C# Operators, Defining Custom Class Methods, Understating Static Methods, Methods Parameter Modifies, Array Manipulation in C #, String Manipulation in C#, C# Enumerations, Defining Structures in C#, Defining Custom Namespaces.  
The Anatomy of a Basic C# Class, Creating objects: Constructor Basics, The Composition of a C# Application, Default Assignment and Variable Scope, The C# Member Initialization Syntax, Basic Input and Output with the Console Class, Understanding Value Types and Reference Types, The Master Node: System, Object, The System Data Types (and C# Aliases), Converting Between Value Types and Reference Types: Boxing and Unboxing, Defining Program Constants, C# Iteration Constructs, C# Controls Flow Constructs, The Complete Set of C# Operators, Defining Custom Class Methods, Understating Static Methods, Methods Parameter Modifies, Array Manipulation in C #, String Manipulation in C#, C# Enumerations, Defining Structures in C#, Defining Custom Namespaces.  
Line 2,748: Line 2,763:


   
   
# '''Exceptions and Object Lifetime. 6 Hrs'''  
# '''Exceptions and Object Lifetime. 6 Hrs'''


Ode to Errors, Bugs, and Exceptions, The Role of .NET Exception Handing, the System. Exception Base Class, Throwing a Generic Exception, Catching Exception, CLR System – Level Exception (System. System Exception), Custom Application-Level Exception (System. System Exception), Handling Multiple Exception, The Family Block, the Last Chance Exception Dynamically Identifying Application – and System Level Exception Debugging System Exception Using VS. NET, Understanding Object Lifetime, the CIT of “new’, The Basics of Garbage Collection,, Finalization a Type, The Finalization Process, Building an Ad Hoc Destruction Method, Garbage Collection Optimizations, The System. GC Type.  
Ode to Errors, Bugs, and Exceptions, The Role of .NET Exception Handing, the System. Exception Base Class, Throwing a Generic Exception, Catching Exception, CLR System – Level Exception (System. System Exception), Custom Application-Level Exception (System. System Exception), Handling Multiple Exception, The Family Block, the Last Chance Exception Dynamically Identifying Application – and System Level Exception Debugging System Exception Using VS. NET, Understanding Object Lifetime, the CIT of “new’, The Basics of Garbage Collection,, Finalization a Type, The Finalization Process, Building an Ad Hoc Destruction Method, Garbage Collection Optimizations, The System. GC Type.  
Line 2,771: Line 2,786:
# Andrew Troelsen: Pro C# with .NET 3.0, Special Edition, Dream tech Press, India, 2007.   
# Andrew Troelsen: Pro C# with .NET 3.0, Special Edition, Dream tech Press, India, 2007.   


Chapters: 1 to 11 (up to pp.369)  
Chapters: 1 to 11 (up to pp.369)


# E. Balagurusamy: Programming in C#, , 5<sup>th</sup> Reprint, Tata McGraw Hill, 2004.   
# E. Balagurusamy: Programming in C#, , 5<sup>th</sup> Reprint, Tata McGraw Hill, 2004.   
Line 2,790: Line 2,805:


   
   
=== Subject Code: 06CS762 I.A. Marks : 25 ===
=== Subject Code: 06CS762 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,799: Line 2,814:
= Basic concepts, Image digitization, Digital image properties. =  
= Basic concepts, Image digitization, Digital image properties. =  
= 2. Image Preprocessing7 Hrs =  
= 2. Image Preprocessing7 Hrs =  
= Image pre-processing: Brightness and geometric transformations, local preprocessing. =
= Image pre-processing: Brightness and geometric transformations, local preprocessing. =  
  '''3''. ''Segmentation – 1'' ''6 Hrs''' Thresholding, Edge-based segmentation.
  '''3''. ''Segmentation – 1'' ''6 Hrs''' Thresholding, Edge-based segmentation.  


'''4. Segmentation – 27 Hrs'''
'''4. Segmentation – 27 Hrs'''
Line 2,826: Line 2,841:
'''8. Morphology6 Hrs'''
'''8. Morphology6 Hrs'''


Basic morphological concepts, Morphology principles, Binary dilation and erosion, Gray-scale dilation and erosion, Morphological segmentation and watersheds.  
Basic morphological concepts, Morphology principles, Binary dilation and erosion, Gray-scale dilation and erosion, Morphological segmentation and watersheds.


= Text Books: =
= Text Books: =  
  1'''.''' Milan Sonka, Vaclav Hlavac and Roger Boyle: Image Processing, Analysis and Machine Vision, 2 nd Edition, Thomoson Learning, 2001.
  1'''.''' Milan Sonka, Vaclav Hlavac and Roger Boyle: Image Processing, Analysis and Machine Vision, 2 nd Edition, Thomoson Learning, 2001.  


( Chapters 2, 4.1 to 4.3, 5.1 to 5.4, 6, 11.1 to 11.4, 11.7)  
( Chapters 2, 4.1 to 4.3, 5.1 to 5.4, 6, 11.1 to 11.4, 11.7)  
Line 2,838: Line 2,853:




'''Reference Books:'''  
'''Reference Books:'''


# Anil K Jain, “Fundamentals of Digital Image Processing”, Pearson Education/Prentice-Hall of India Pvt. Ltd., 1997.
# Anil K Jain, “Fundamentals of Digital Image Processing”, Pearson Education/Prentice-Hall of India Pvt. Ltd., 1997.
# B.Chanda ,D Dutta Majumder, “Digital Image Processing and Analysis”, Prentice-Hall, India, 2002.  
# B.Chanda ,D Dutta Majumder, “Digital Image Processing and Analysis”, Prentice-Hall, India, 2002.


<center>'''Game Theory'''</center>  
<center>'''Game Theory'''</center>  


   
   
=== Subject Code: 06CS763 I.A. Marks : 25 ===
=== Subject Code: 06CS763 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,872: Line 2,887:
Extensions: Allowing for simultaneous moves, illustration: entry in to a monopolized industry; Discussion: subgame perfect equilibrium and backward induction.
Extensions: Allowing for simultaneous moves, illustration: entry in to a monopolized industry; Discussion: subgame perfect equilibrium and backward induction.


Coalition games; The core; Illustration: ownership and the distribution of wealth; Other solution concepts.  
Coalition games; The core; Illustration: ownership and the distribution of wealth; Other solution concepts.


<center>'''PART – B'''</center>  
<center>'''PART – B'''</center>  
Line 2,923: Line 2,938:


   
   
=== Subject Code: 06CS764 I.A. Marks : 25 ===
=== Subject Code: 06CS764 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,990: Line 3,005:


   
   
=== Subject Code: 06IS765 I.A. Marks : 25 ===
=== Subject Code: 06IS765 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 2,997: Line 3,012:


   
   
# '''Human Factors of Interactive Software, Theories, Principles and Guidelines 7 Hrs'''  
# '''Human Factors of Interactive Software, Theories, Principles and Guidelines 7 Hrs'''


Introduction, Goals of Systems Engineering, Goals of Interface Design, Motivation for Human Factors in Design, Accommodation of Human Diversity, Goals for the Profession,''' '''High Level Theories, Object-Action Interface Model, Principle 1: Recognize the Diversity, Principle 2: Use the Eight Golden Rules of Interface Design, Principle 3: Prevent Errors, Guidelines for Date Display, Guidelines for Data Entry, Balance of Automation and Human Control.  
Introduction, Goals of Systems Engineering, Goals of Interface Design, Motivation for Human Factors in Design, Accommodation of Human Diversity, Goals for the Profession,''' '''High Level Theories, Object-Action Interface Model, Principle 1: Recognize the Diversity, Principle 2: Use the Eight Golden Rules of Interface Design, Principle 3: Prevent Errors, Guidelines for Date Display, Guidelines for Data Entry, Balance of Automation and Human Control.


===== Management Issues 6 Hrs =====
===== Management Issues 6 Hrs =====  
  Introduction, Organizational Design to Support Usability, The Three Pillars of Design, Development Methodologies, Ethnographic Observation, Participatory Design, Scenario Development, Social Impact Statement for Early Design Review, Legal Issues.  
  Introduction, Organizational Design to Support Usability, The Three Pillars of Design, Development Methodologies, Ethnographic Observation, Participatory Design, Scenario Development, Social Impact Statement for Early Design Review, Legal Issues.  


Expert Reviews, Usability Testing and Laboratories, Surveys, Acceptance Tests, Evaluation During Active Use, Controlled Psychologically Oriented Experiments  
Expert Reviews, Usability Testing and Laboratories, Surveys, Acceptance Tests, Evaluation During Active Use, Controlled Psychologically Oriented Experiments


# '''Tools and Environments 7 Hrs'''  
# '''Tools and Environments 7 Hrs'''


Introduction, Specification Methods, Interface-Building Tools, Evaluation and Critiquing Tools.
Introduction, Specification Methods, Interface-Building Tools, Evaluation and Critiquing Tools.


Introduction, Examples of Direct-Manipulation Systems, Explanations of Direct Manipulation, Visual Thinking and Icons, Direct Manipulation Programming, Home Automation, Remote Direct Manipulation Virtual Environments.  
Introduction, Examples of Direct-Manipulation Systems, Explanations of Direct Manipulation, Visual Thinking and Icons, Direct Manipulation Programming, Home Automation, Remote Direct Manipulation Virtual Environments.


===== Menus, Forms, Dialog Boxes and Commands 6 Hrs =====
===== Menus, Forms, Dialog Boxes and Commands 6 Hrs =====  
  Task Related Organization, Item Presentation Sequence, Response Time and Display Rate, Fast Movement through Menus, Menu Layout, Form Fillin, Dialog Boxes.
  Task Related Organization, Item Presentation Sequence, Response Time and Display Rate, Fast Movement through Menus, Menu Layout, Form Fillin, Dialog Boxes.  


Functionality to support Users Tasks, Command-Organization Strategies, The Benefits of Structure, Naming and Abbreviations, Command Menus, Natural Language in Computing.
Functionality to support Users Tasks, Command-Organization Strategies, The Benefits of Structure, Naming and Abbreviations, Command Menus, Natural Language in Computing.
Line 3,021: Line 3,036:


   
   
# '''Interaction Devices and Response Time 7 Hrs'''  
# '''Interaction Devices and Response Time 7 Hrs'''


Interaction Devices, Introduction, Keyboards and Function Keys, Pointing Devices, Speech Recognition, Digitization, and Generation, Image and Vide Displays, Printers. Theoretical Foundations, Expectations and Attitudes.  
Interaction Devices, Introduction, Keyboards and Function Keys, Pointing Devices, Speech Recognition, Digitization, and Generation, Image and Vide Displays, Printers. Theoretical Foundations, Expectations and Attitudes.


# '''Presentation Styles, Manuals, Help, and Tutorials - 1 6 Hrs'''  
# '''Presentation Styles, Manuals, Help, and Tutorials - 1 6 Hrs'''


Error Messages, Non-anthropomorphic Design, Display Design, Color. Reading from Paper Versus from Displays.  
Error Messages, Non-anthropomorphic Design, Display Design, Color. Reading from Paper Versus from Displays.


# '''Presentation Styles, Manuals, Help, and Tutorials – 2'''  
# '''Presentation Styles, Manuals, Help, and Tutorials – 2'''


'''Multiple-Window Strategies, Hypermedia and the World Wide Web – 1 7 Hrs'''
'''Multiple-Window Strategies, Hypermedia and the World Wide Web – 1 7 Hrs'''
Line 3,035: Line 3,050:
Preparation of Printed Manuals, Preparation of Online Facilities.
Preparation of Printed Manuals, Preparation of Online Facilities.


Multiple-Window Strategies: Introduction, Individual-Window Design, Multiple- window Design, Co-ordination by Tightly Coupled Windows, Image Browsing and Tightly Coupled Windows, Personal Role Management an Elastic Windows.  
Multiple-Window Strategies: Introduction, Individual-Window Design, Multiple- window Design, Co-ordination by Tightly Coupled Windows, Image Browsing and Tightly Coupled Windows, Personal Role Management an Elastic Windows.


# '''Multiple-Window Strategies, Hypermedia and the World Wide Web – 2 6 Hrs '''  
# '''Multiple-Window Strategies, Hypermedia and the World Wide Web – 2 6 Hrs '''  
Line 3,042: Line 3,057:




'''Text Books:'''  
'''Text Books:'''


# Ben Shneiderman: Designing the User Interface, 3<sup>rd</sup> Edition, Addison-Wesley, 1998.  
# Ben Shneiderman: Designing the User Interface, 3<sup>rd</sup> Edition, Addison-Wesley, 1998.


(Chapters 1 to 13, and 16)
(Chapters 1 to 13, and 16)




'''Reference Books:'''  
'''Reference Books:'''


# Alan J Dix et. al.: Human-Computer Interaction, II Edition, Prentice-Hall, India,1998
# Alan J Dix et. al.: Human-Computer Interaction, II Edition, Prentice-Hall, India,1998
# Eberts: User Interface Design, Prentice-Hall, 1994.
# Eberts: User Interface Design, Prentice-Hall, 1994.
# Wilber O Galitz: The Essential Guide to User Interface Design - An Introduction to GUI Design, Principles and Techniques, Wiley-Dreamtech India Pvt. Ltd, 1998.  
# Wilber O Galitz: The Essential Guide to User Interface Design - An Introduction to GUI Design, Principles and Techniques, Wiley-Dreamtech India Pvt. Ltd, 1998.


<center>'''Fuzzy Logic'''</center>  
<center>'''Fuzzy Logic'''</center>  


   
   
=== Subject Code: 06CS766 I.A. Marks : 25 ===
=== Subject Code: 06CS766 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 3,065: Line 3,080:


   
   
# '''Introduction, Classical Sets and Fuzzy Sets7 Hrs'''  
# '''Introduction, Classical Sets and Fuzzy Sets7 Hrs'''


Background, Uncertainty and Imprecision, Statistics and Random Processes, Uncertainty in Information, Fuzzy Sets and Membership, Chance versus Ambiguity.
Background, Uncertainty and Imprecision, Statistics and Random Processes, Uncertainty in Information, Fuzzy Sets and Membership, Chance versus Ambiguity.
Line 3,071: Line 3,086:
Classical Sets - Operations on Classical Sets, Properties of Classical (Crisp) Sets, Mapping of Classical Sets to Functions. Fuzzy Sets - Fuzzy Set operations, Properties of Fuzzy Sets. Sets as Points in Hypercubes.   
Classical Sets - Operations on Classical Sets, Properties of Classical (Crisp) Sets, Mapping of Classical Sets to Functions. Fuzzy Sets - Fuzzy Set operations, Properties of Fuzzy Sets. Sets as Points in Hypercubes.   


# '''Classical Relations and Fuzzy Relations 6 Hrs'''  
# '''Classical Relations and Fuzzy Relations 6 Hrs'''


Cartesian Product, Crisp Relations - Cardinality of Crisp Relations, Operations on Crisp Relations, Properties of Crisp Relations, Composition. Fuzzy Relations - Cardinality of Fuzzy Relations, Operations on Fuzzy Relations, Properties of Fuzzy Relations, Fuzzy Cartesian Product and Composition, Non-interactive Fuzzy Sets. Tolerance and Equivalence Relations - Crisp Equivalence Relation, Crisp Tolerance Relation, Fuzzy Tolerance and Equivalence Relations. Value Assignments - Cosine Amplitude, Max-min Method, Other Similarity methods.
Cartesian Product, Crisp Relations - Cardinality of Crisp Relations, Operations on Crisp Relations, Properties of Crisp Relations, Composition. Fuzzy Relations - Cardinality of Fuzzy Relations, Operations on Fuzzy Relations, Properties of Fuzzy Relations, Fuzzy Cartesian Product and Composition, Non-interactive Fuzzy Sets. Tolerance and Equivalence Relations - Crisp Equivalence Relation, Crisp Tolerance Relation, Fuzzy Tolerance and Equivalence Relations. Value Assignments - Cosine Amplitude, Max-min Method, Other Similarity methods.
Line 3,083: Line 3,098:
Extension Principle - Crisp Functions, Mapping and Relations, Functions of fuzzy Sets – Extension Principle, Fuzzy Transform (Mapping), Practical Considerations. Fuzzy Numbers
Extension Principle - Crisp Functions, Mapping and Relations, Functions of fuzzy Sets – Extension Principle, Fuzzy Transform (Mapping), Practical Considerations. Fuzzy Numbers


Interval Analysis in Arithmetic, Approximate Methods of Extension - Vertex method, DSW Algorithm, Restricted DSW Algorithm, Comparisons. Fuzzy Vectors.  
Interval Analysis in Arithmetic, Approximate Methods of Extension - Vertex method, DSW Algorithm, Restricted DSW Algorithm, Comparisons. Fuzzy Vectors.


<center>'''PART - B'''</center>  
<center>'''PART - B'''</center>  
Line 3,122: Line 3,137:


   
   
=== Subject Code: 06CSL77 I.A. Marks : 25 ===
=== Subject Code: 06CSL77 I.A. Marks : 25 ===  
  '''Hours/Week : 03 Exam Hours: 03'''  
  '''Hours/Week : 03 Exam Hours: 03'''  


=== Total Hours : 42 Exam Marks: 50 ===
=== Total Hours : 42 Exam Marks: 50 ===  
  '''Note: Student is required to solve one problem from PART-A and one problem from PART-B. The questions are allotted based on lots. Both questions carry equal marks.'''
  '''Note: Student is required to solve one problem from PART-A and one problem from PART-B. The questions are allotted based on lots. Both questions carry equal marks.'''  


   
   
Line 3,135: Line 3,150:
   
   
# Simulate a three nodes point – to – point network with duplex links between them. Set the queue size and vary the bandwidth and find the number of packets dropped.
# Simulate a three nodes point – to – point network with duplex links between them. Set the queue size and vary the bandwidth and find the number of packets dropped.
# Simulate a four node point-to-point network with the links connected as follows:  
# Simulate a four node point-to-point network with the links connected as follows:


n0 – n2, n1 – n2 and n2 – n3. Apply TCP agent between n0-n3 and UDP between n1-n3. Apply relevant applications over TCP and UDP agents changing the parameter and determine the number of packets sent by TCP / UDP.  
n0 – n2, n1 – n2 and n2 – n3. Apply TCP agent between n0-n3 and UDP between n1-n3. Apply relevant applications over TCP and UDP agents changing the parameter and determine the number of packets sent by TCP / UDP.


# Simulate the different types of Internet traffic such as FTP and TELNET over a network and analyze the throughput.
# Simulate the different types of Internet traffic such as FTP and TELNET over a network and analyze the throughput.
Line 3,144: Line 3,159:
# Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and determine collision across different nodes.
# Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and determine collision across different nodes.
# Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion window for different source / destination.
# Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion window for different source / destination.
# Simulate simple ESS and with transmitting nodes in wire-less LAN by simulation and determine the performance with respect to transmission of packets.  
# Simulate simple ESS and with transmitting nodes in wire-less LAN by simulation and determine the performance with respect to transmission of packets.


<center>'''PART-B'''</center>  
<center>'''PART-B'''</center>  
Line 3,158: Line 3,173:
# Write a program for simple RSA algorithm to encrypt and decrypt the data.
# Write a program for simple RSA algorithm to encrypt and decrypt the data.
# Write a program for Hamming code generation for error diction and correction.
# Write a program for Hamming code generation for error diction and correction.
# Write a program for congestion control using leaky bucket algorithm.  
# Write a program for congestion control using leaky bucket algorithm.


<center>'''Web Programming Laboratory'''</center>  
<center>'''Web Programming Laboratory'''</center>  


   
   
=== Subject Code: 06CSL78 I.A. Marks : 25 ===
=== Subject Code: 06CSL78 I.A. Marks : 25 ===  
  '''Hours/Week : 03 Exam Hours: 03'''  
  '''Hours/Week : 03 Exam Hours: 03'''  


=== Total Hours : 42 Exam Marks: 50 ===
=== Total Hours : 42 Exam Marks: 50 ===  
  '''Note: One exercise must be asked in the examination. '''
  '''Note: One exercise must be asked in the examination. '''  


'''The assignment of the exercise must be based on lots.'''  
'''The assignment of the exercise must be based on lots.'''  
Line 3,173: Line 3,188:
   
   
# <nowiki>Develop and demonstrate a XHTML document that illustrates the use external style sheet, ordered list, table, borders, padding, color, and the <span> tag.</nowiki>
# <nowiki>Develop and demonstrate a XHTML document that illustrates the use external style sheet, ordered list, table, borders, padding, color, and the <span> tag.</nowiki>
# Develop and demonstrate a XHTML file that includes Javascript script for the following problems:  
# Develop and demonstrate a XHTML file that includes Javascript script for the following problems:


# Input: A number n obtained using prompt  
# Input: A number n obtained using prompt


Output: The first n Fibonacci numbers
Output: The first n Fibonacci numbers


b) Input: A number n obtained using prompt  
b) Input: A number n obtained using prompt


  Output: A table of numbers from 1 to n and their squares using '''alert'''  
  Output: A table of numbers from 1 to n and their squares using '''alert'''  


# Develop and demonstrate a XHTML file that includes Javascript script that uses functions for the following problems:  
# Develop and demonstrate a XHTML file that includes Javascript script that uses functions for the following problems:


# Parameter: A string  
# Parameter: A string


Output: The position in the string of the left-most vowel
Output: The position in the string of the left-most vowel


b) Parameter: A number  
b) Parameter: A number


  Output: The number with its digits in the reverse order  
  Output: The number with its digits in the reverse order  


   
   
# a) Develop and demonstrate, using Javascript script, a XHTML document that collects the USN ( the valid format is: A digit from 1 to 4 followed by two upper-case characters followed by two digits followed by two upper-case characters followed by three digits; no embedded spaces allowed) of the user. Event handler must be included for the form element that collects this information to validate the input. Messages in the alert windows must be produced when errors are detected.  
# a) Develop and demonstrate, using Javascript script, a XHTML document that collects the USN ( the valid format is: A digit from 1 to 4 followed by two upper-case characters followed by two digits followed by two upper-case characters followed by three digits; no embedded spaces allowed) of the user. Event handler must be included for the form element that collects this information to validate the input. Messages in the alert windows must be produced when errors are detected.


b) Modify the above program to get the current semester also (restricted to be a number from 1 to 8)   
b) Modify the above program to get the current semester also (restricted to be a number from 1 to 8)   


# a) Develop and demonstrate, using Javascript script, a XHTML document that contains three short paragraphs of text, stacked on top of each other, with only enough of each showing so that the mouse cursor can be placed over some part of them. When the cursor is placed over the exposed part of any paragraph, it should rise to the top to become completely visible.  
# a) Develop and demonstrate, using Javascript script, a XHTML document that contains three short paragraphs of text, stacked on top of each other, with only enough of each showing so that the mouse cursor can be placed over some part of them. When the cursor is placed over the exposed part of any paragraph, it should rise to the top to become completely visible.


b) Modify the above document so that when a paragraph is moved from the top stacking position, it returns to its original position rather than to the bottom.   
b) Modify the above document so that when a paragraph is moved from the top stacking position, it returns to its original position rather than to the bottom.   


# a) Design an XML document to store information about a student in an engineering college affiliated to VTU. The information must include USN, Name, Name of the College, Brach, Year of Joining, and e-mail id. Make up sample data for 3 students. Create a CSS style sheet and use it to display the document.  
# a) Design an XML document to store information about a student in an engineering college affiliated to VTU. The information must include USN, Name, Name of the College, Brach, Year of Joining, and e-mail id. Make up sample data for 3 students. Create a CSS style sheet and use it to display the document.


b) Create an XSLT style sheet for one student element of the above document and use it to create a display of that element.   
b) Create an XSLT style sheet for one student element of the above document and use it to create a display of that element.   


# a) Write a Perl program to display various Server Information like Server Name, Server Software, Server protocol, CGI Revision etc.  
# a) Write a Perl program to display various Server Information like Server Name, Server Software, Server protocol, CGI Revision etc.


b) Write a Perl program to accept UNIX command from a HTML form and to display the output of the command executed.  
b) Write a Perl program to accept UNIX command from a HTML form and to display the output of the command executed.


# a) Write a Perl program to accept the User Name and display a greeting message randomly chosen from a list of 4 greeting messages.  
# a) Write a Perl program to accept the User Name and display a greeting message randomly chosen from a list of 4 greeting messages.


b) Write a Perl program to keep track of the number of visitors visiting the web page and to display this count of visitors, with proper headings.  
b) Write a Perl program to keep track of the number of visitors visiting the web page and to display this count of visitors, with proper headings.


# Write a Perl program to display a digital clock which displays the current time of the server.
# Write a Perl program to display a digital clock which displays the current time of the server.
Line 3,219: Line 3,234:
# Write a PHP program to store page views count in SESSION, to increment the count on each refresh, and to show the count on web page.
# Write a PHP program to store page views count in SESSION, to increment the count on each refresh, and to show the count on web page.
# Create a XHTML form with Name, Address Line 1, Address Line 2, and E-mail text fields. On submitting, store the values in MySQL table. Retrieve and display the data based on Name.  
# Create a XHTML form with Name, Address Line 1, Address Line 2, and E-mail text fields. On submitting, store the values in MySQL table. Retrieve and display the data based on Name.  
# Using PHP and MySQL, develop a program to accept book information viz. Accession number, title, authors, edition and publisher from a web page and store the information in a database and to search for a book with the title specified by the user and to display the search results with proper headings.  
# Using PHP and MySQL, develop a program to accept book information viz. Accession number, title, authors, edition and publisher from a web page and store the information in a database and to search for a book with the title specified by the user and to display the search results with proper headings.


<center>'''VIII SEMESTER'''</center>  
<center>'''VIII SEMESTER'''</center>  
Line 3,231: Line 3,246:
'''Hours/Week: 4 Exam Marks: 100'''
'''Hours/Week: 4 Exam Marks: 100'''


'''Total Hours: 52 Exam Hours: 3'''  
'''Total Hours: 52 Exam Hours: 3'''


<center>'''PART – A'''</center>  
<center>'''PART – A'''</center>  
Line 3,351: Line 3,366:




'''Reference Books''':  
'''Reference Books''':


# Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course, Pearson / Prentice-Hall, 2006.  
# Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course, Pearson / Prentice-Hall, 2006.  
# Averill M. Law: Simulation Modeling and Analysis,4<sup>th</sup> Edition, Tata McGraw-Hill, 2007.  
# Averill M. Law: Simulation Modeling and Analysis,4<sup>th</sup> Edition, Tata McGraw-Hill, 2007.


<center>'''Mobile Computing'''</center>  
<center>'''Mobile Computing'''</center>  
Line 3,414: Line 3,429:




'''Text Books:'''  
'''Text Books:'''


# Raj Kamal: Mobile Computing, Oxford University Press, 2007.  
# Raj Kamal: Mobile Computing, Oxford University Press, 2007.


'''Reference Books:'''  
'''Reference Books:'''


# Asoke Talkukder, Roopa R Yavagal: Mobile Computing – Technology, Applications and Service Creation, Tata McGraw Hill, 2005.
# Asoke Talkukder, Roopa R Yavagal: Mobile Computing – Technology, Applications and Service Creation, Tata McGraw Hill, 2005.
# Reza B’Far: Mobile Computing Principles – Designing and Developing Mobile Applications with UML and XML, 5<sup>th</sup> Edition, Cambridge University press, 2006.
# Reza B’Far: Mobile Computing Principles – Designing and Developing Mobile Applications with UML and XML, 5<sup>th</sup> Edition, Cambridge University press, 2006.
# Uwe Hansmann, Lothat Merk, Martin S Nicklous and Thomas Stober: Principles of Mobile Computing, 2<sup>nd</sup> Edition, Springer International Edition, 2003.
# Uwe Hansmann, Lothat Merk, Martin S Nicklous and Thomas Stober: Principles of Mobile Computing, 2<sup>nd</sup> Edition, Springer International Edition, 2003.
# Schiller: Mobile Communication, Pearson Publication, 2004.  
# Schiller: Mobile Communication, Pearson Publication, 2004.


<center>'''Web 2.0 and Rich Internet Applications'''</center>  
<center>'''Web 2.0 and Rich Internet Applications'''</center>  
Line 3,432: Line 3,447:
'''Hrs/ Week: 04Exam Hours: 03'''
'''Hrs/ Week: 04Exam Hours: 03'''


'''Total Hours: 52Exam Marks: 100'''  
'''Total Hours: 52Exam Marks: 100'''


<center>'''PART - A'''</center>  
<center>'''PART - A'''</center>  


# '''Introduction, Web Services7 Hrs'''  
# '''Introduction, Web Services7 Hrs'''


What is Web 2.0?, Folksonomies and Web 2.0, Software As a Service (SaaS), Data and Web 2.0, Convergence, Iterative development, Rich User experience, Multiple Delivery Channels, Social Networking.
What is Web 2.0?, Folksonomies and Web 2.0, Software As a Service (SaaS), Data and Web 2.0, Convergence, Iterative development, Rich User experience, Multiple Delivery Channels, Social Networking.
Line 3,458: Line 3,473:


   
   
# '''Building Rich Internet Applications with Flex - 26 Hrs'''  
# '''Building Rich Internet Applications with Flex - 26 Hrs'''


Using Actionscript, MXML and Actionscript correlations. Understanding Actionscript 3.0 language syntax: Language overview, Objects and Classes, Packages and namespaces, Variables &amp; scope of variables, case sensitivity and general syntax rules, Operators, Conditional, Looping, Functions, Nested functions, Functions as Objects, Function scope, OO Programming in Actionscript: Classes, Interfaces, Inheritance, Working with String objects, Working with Arrays, Error handling in Actionscript: Try/Catch, Working with XML
Using Actionscript, MXML and Actionscript correlations. Understanding Actionscript 3.0 language syntax: Language overview, Objects and Classes, Packages and namespaces, Variables &amp; scope of variables, case sensitivity and general syntax rules, Operators, Conditional, Looping, Functions, Nested functions, Functions as Objects, Function scope, OO Programming in Actionscript: Classes, Interfaces, Inheritance, Working with String objects, Working with Arrays, Error handling in Actionscript: Try/Catch, Working with XML


   
   
# '''Building Rich Internet Applications with Flex - 36 Hrs'''  
# '''Building Rich Internet Applications with Flex - 36 Hrs'''


Framework fundamentals, Understanding application life cycle, Differentiating between Flash player and Framework, Bootstrapping Flex applications, Loading one flex application in to another, Understanding application domains, Understanding the preloader.
Framework fundamentals, Understanding application life cycle, Differentiating between Flash player and Framework, Bootstrapping Flex applications, Loading one flex application in to another, Understanding application domains, Understanding the preloader.


Managing layout, Flex layout overview, Working with children, Container types, Layout rules, Padding, Borders and gaps, Nesting containers, Making fluid interfaces.  
Managing layout, Flex layout overview, Working with children, Container types, Layout rules, Padding, Borders and gaps, Nesting containers, Making fluid interfaces.


# '''Building Rich Internet Applications with Flex – 4 6 Hrs'''  
# '''Building Rich Internet Applications with Flex – 4 6 Hrs'''


Working with UI components: Understanding UI Components, Creating component instances, Common UI Component properties, Handling events, Button, Value selectors, Text components, List based controls, Data models and Model View Controller, Creating collection objects, Setting the data provider, Using Data grids, Using Tree controls, Working with selected values and items, Pop up controls, Navigators, Control bars
Working with UI components: Understanding UI Components, Creating component instances, Common UI Component properties, Handling events, Button, Value selectors, Text components, List based controls, Data models and Model View Controller, Creating collection objects, Setting the data provider, Using Data grids, Using Tree controls, Working with selected values and items, Pop up controls, Navigators, Control bars


Working with data: Using data models, Using XML, Using Actionscript classes, Data Binding.  
Working with data: Using data models, Using XML, Using Actionscript classes, Data Binding.


# '''Building advanced Web 2.0 applications 8 Hrs'''  
# '''Building advanced Web 2.0 applications 8 Hrs'''


Definition of mash up applications, Mash up Techniques, Building a simple mash up application with AJAX, Remote data communication, strategies for data communication, Simple HTTPServices, URLLoader in Flex, Web Services in Flex, Examples: Building an RSS reader with AJAX, Building an RSS reader with Flex.
Definition of mash up applications, Mash up Techniques, Building a simple mash up application with AJAX, Remote data communication, strategies for data communication, Simple HTTPServices, URLLoader in Flex, Web Services in Flex, Examples: Building an RSS reader with AJAX, Building an RSS reader with Flex.




'''Text Books:'''  
'''Text Books:'''


# Nicholas C Zakas et al: Professional AJAX, Wrox publications, 2006.  
# Nicholas C Zakas et al: Professional AJAX, Wrox publications, 2006.


(Chapters 1 to 4, Chapter 6 pp157-166, Chapter 7 pp191-196)  
(Chapters 1 to 4, Chapter 6 pp157-166, Chapter 7 pp191-196)


# Chafic Kazoun: Programming Flex 2, O’Reilly publications, 2007.  
# Chafic Kazoun: Programming Flex 2, O’Reilly publications, 2007.


(Chapters 1, Chapters 3 to 7, Chapter 12, Chapter 16 pp380-403)   
(Chapters 1, Chapters 3 to 7, Chapter 12, Chapter 16 pp380-403)   


# Francis Shanahan: Mashups, Wrox, 2007.  
# Francis Shanahan: Mashups, Wrox, 2007.


(Chapters 1, 6)
(Chapters 1, 6)




'''Reference Books:'''  
'''Reference Books:'''


# Thomas A. Powel: Ajax The Complete reference, McGraw Hill, 2008.
# Thomas A. Powel: Ajax The Complete reference, McGraw Hill, 2008.
Line 3,502: Line 3,517:
# Steven Holzner : Ajax Bible Wiley India , 2007.
# Steven Holzner : Ajax Bible Wiley India , 2007.
# Justin Gehtland et al: A Web 2.0 primer Pragmatic Ajax, SPD Publications, 2006.
# Justin Gehtland et al: A Web 2.0 primer Pragmatic Ajax, SPD Publications, 2006.
# Eric Van derVlist et al: Professional Web 2.0 Programming, Wiley India, 2007.  
# Eric Van derVlist et al: Professional Web 2.0 Programming, Wiley India, 2007.


<center>'''STORAGE AREA NETWORK'''</center>  
<center>'''STORAGE AREA NETWORK'''</center>  
Line 3,516: Line 3,531:
<center>'''PART- A'''</center>  
<center>'''PART- A'''</center>  


# '''Introduction 6 Hrs'''  
# '''Introduction 6 Hrs'''


Server Centric IT Architecture and its Limitations; Storage – Centric IT Architecture and its advantages; Case study: Replacing a server with Storage Networks; The Data Storage and Data Access problem; The Battle for size and access.  
Server Centric IT Architecture and its Limitations; Storage – Centric IT Architecture and its advantages; Case study: Replacing a server with Storage Networks; The Data Storage and Data Access problem; The Battle for size and access.  
Line 3,540: Line 3,555:


   
   
== PART- B ==
== PART- B ==  
  '''5. File System and NAS 6 Hrs'''
  '''5. File System and NAS 6 Hrs'''  


Local File Systems; Network file Systems and file servers; Shared Disk file systems;  
Local File Systems; Network file Systems and file servers; Shared Disk file systems;  
Line 3,562: Line 3,577:




'''Text Books:'''  
'''Text Books:'''


# Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Wiley India, 2003  
# Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Wiley India, 2003


(Ch. 1, 2, 3.1 to 3.5, 4, 5.3 to 5.7)   
(Ch. 1, 2, 3.1 to 3.5, 4, 5.3 to 5.7)   
Line 3,573: Line 3,588:




'''Reference Books:'''  
'''Reference Books:'''


# Richard Barker and Paul Massiglia: Storage Area Network Essentials A Complete Guide to understanding and Implementing SANs, John Wiley India, 2002.
# Richard Barker and Paul Massiglia: Storage Area Network Essentials A Complete Guide to understanding and Implementing SANs, John Wiley India, 2002.
# Marc Farley: Storage Networking Fundamentals, Cisco Press, 2005.  
# Marc Farley: Storage Networking Fundamentals, Cisco Press, 2005.


<center>'''Network Management Systems'''</center>  
<center>'''Network Management Systems'''</center>  
Line 3,593: Line 3,608:
'''1. Introduction7 Hrs '''
'''1. Introduction7 Hrs '''


Analogy of Telephone Network Management, Data and Telecommunication Network Distributed computing Environments, TCP/IP-Based Networks: The Internet and Intranets, Communications Protocols and Standards- Communication Architectures, Protocol Layers and Services; Case Histories of Networking and Management – The Importance of topology , Filtering Does Not Reduce Load on Node, Some Common Network Problems; Challenges of Information Technology Managers, Network Management: Goals, Organization, and Functions- Goal of Network Management, Network Provisioning, Network Operations and the NOC, Network Installation and Maintenance; Network and System Management, Network Management System platform, Current Status and Future of Network Management.  
Analogy of Telephone Network Management, Data and Telecommunication Network Distributed computing Environments, TCP/IP-Based Networks: The Internet and Intranets, Communications Protocols and Standards- Communication Architectures, Protocol Layers and Services; Case Histories of Networking and Management – The Importance of topology , Filtering Does Not Reduce Load on Node, Some Common Network Problems; Challenges of Information Technology Managers, Network Management: Goals, Organization, and Functions- Goal of Network Management, Network Provisioning, Network Operations and the NOC, Network Installation and Maintenance; Network and System Management, Network Management System platform, Current Status and Future of Network Management.


= 2. Basic Foundations: Standards, Models, and Language6 Hrs =  
= 2. Basic Foundations: Standards, Models, and Language6 Hrs =  
== Network Management Standards, Network Management Model, Organization Model, Information Model – Management Information Trees, Managed Object Perspectives, Communication Model; ASN.1- Terminology, Symbols, and Conventions, Objects and Data Types, Object Names, An Example of ASN.1 from ISO 8824; Encoding Structure; Macros, Functional Model. ==
== Network Management Standards, Network Management Model, Organization Model, Information Model – Management Information Trees, Managed Object Perspectives, Communication Model; ASN.1- Terminology, Symbols, and Conventions, Objects and Data Types, Object Names, An Example of ASN.1 from ISO 8824; Encoding Structure; Macros, Functional Model. ==  
  '''3. SNMPv1 Network Management - 1 6 Hrs'''
  '''3. SNMPv1 Network Management - 1 6 Hrs'''  


Managed Network: The History of SNMP Management, Internet Organizations and standards, Internet Documents, The SNMP Model, The Organization Model, System Overview.  
Managed Network: The History of SNMP Management, Internet Organizations and standards, Internet Documents, The SNMP Model, The Organization Model, System Overview.  
Line 3,615: Line 3,630:
Remote Monitoring, RMON SMI and MIB, RMONI1- RMON1 Textual Conventions, RMON1 Groups and Functions, Relationship Between Control and Data Tables, RMON1 Common and Ethernet Groups, RMON Token Ring Extension Groups, RMON2 – The RMON2 Management Information Base, RMON2 Conformance Specifications; ATM Remote Monitoring, A Case Study of Internet Traffic Using RMON.
Remote Monitoring, RMON SMI and MIB, RMONI1- RMON1 Textual Conventions, RMON1 Groups and Functions, Relationship Between Control and Data Tables, RMON1 Common and Ethernet Groups, RMON Token Ring Extension Groups, RMON2 – The RMON2 Management Information Base, RMON2 Conformance Specifications; ATM Remote Monitoring, A Case Study of Internet Traffic Using RMON.


'''6. Broadband Network Management: ATM Networks6 Hrs'''  
'''6. Broadband Network Management: ATM Networks6 Hrs'''


== Broadband Networks and Services, ATM Technology – Virtual Path-Virtual Circuit, TM Packet Size, Integrated Service, SONET, ATM LAN Emulation, Virtual LAN; ATM Network Management – The ATM Network Reference Model, The Integrated Local Management Interface, The ATM Management Information Base, The Role of SNMP and ILMI in ATM Management, M1 Interface: Management of ATM Network Element, M2 Interface: Management of Private Networks, M3 Interface: Customer Network Management of Public Networks, M4 Interface: Public Network Management, Management of LAN Emulation, ATM Digital Exchange Interface Management. ==
== Broadband Networks and Services, ATM Technology – Virtual Path-Virtual Circuit, TM Packet Size, Integrated Service, SONET, ATM LAN Emulation, Virtual LAN; ATM Network Management – The ATM Network Reference Model, The Integrated Local Management Interface, The ATM Management Information Base, The Role of SNMP and ILMI in ATM Management, M1 Interface: Management of ATM Network Element, M2 Interface: Management of Private Networks, M3 Interface: Customer Network Management of Public Networks, M4 Interface: Public Network Management, Management of LAN Emulation, ATM Digital Exchange Interface Management. ==  
  '''7. Broadband Network Management6 Hrs'''  
  '''7. Broadband Network Management6 Hrs'''  


== Broadband Access Networks and Technologies – Broadband Access Networks, roadband Access Technology; HFCT Technology – The Broadband LAN, The Cable Modem, The Cable Modem Termination System, The HFC Plant, The RF Spectrum for Cable Modem; Data Over Cable Reference Architecture; HFC Management – Cable Modem and CMTS Management, HFC Link Management, RF Spectrum Management, DSL Technology; Asymmetric Digital Subscriber Line Technology – Role of the ADSL Access Network in an Overall Network, ADSL Architecture, ADSL Channeling Schemes, ADSL Encoding Schemes; ADSL Management – ADSL Network Management Elements, ADSL Configuration Management, ADSL Fault Management, ADSL Performance Management, SNMP-Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2, ADSL Configuration Profiles. ==  
== Broadband Access Networks and Technologies – Broadband Access Networks, roadband Access Technology; HFCT Technology – The Broadband LAN, The Cable Modem, The Cable Modem Termination System, The HFC Plant, The RF Spectrum for Cable Modem; Data Over Cable Reference Architecture; HFC Management – Cable Modem and CMTS Management, HFC Link Management, RF Spectrum Management, DSL Technology; Asymmetric Digital Subscriber Line Technology – Role of the ADSL Access Network in an Overall Network, ADSL Architecture, ADSL Channeling Schemes, ADSL Encoding Schemes; ADSL Management – ADSL Network Management Elements, ADSL Configuration Management, ADSL Fault Management, ADSL Performance Management, SNMP-Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2, ADSL Configuration Profiles. ==  
== 8. Network Management Applications8 Hrs ==
== 8. Network Management Applications8 Hrs ==  
  Configuration Management- Network Provisioning, Inventory Management, Network Topology, Fault Management- Fault Detection, Fault Location and Isolation Techniques, Performance Management – Performance Metrics, Data Monitoring, Problem Isolation, Performance Statistics; Event Correlation Techniques – Rule-Based Reasoning, Model-Based Reasoning, Case-Based Reasoning, Codebook correlation Model, State Transition Graph Model, Finite State Machine Model, Security Management – Policies and Procedures, Security Breaches and the Resources Needed to Prevent Them, Firewalls, Cryptography, Authentication and Authorization, Client/Server Authentication Systems, Messages Transfer Security, Protection of Networks from Virus Attacks, Accounting Management, Report Management, Policy-Based Management, Service Level Management.  
  Configuration Management- Network Provisioning, Inventory Management, Network Topology, Fault Management- Fault Detection, Fault Location and Isolation Techniques, Performance Management – Performance Metrics, Data Monitoring, Problem Isolation, Performance Statistics; Event Correlation Techniques – Rule-Based Reasoning, Model-Based Reasoning, Case-Based Reasoning, Codebook correlation Model, State Transition Graph Model, Finite State Machine Model, Security Management – Policies and Procedures, Security Breaches and the Resources Needed to Prevent Them, Firewalls, Cryptography, Authentication and Authorization, Client/Server Authentication Systems, Messages Transfer Security, Protection of Networks from Virus Attacks, Accounting Management, Report Management, Policy-Based Management, Service Level Management.  


Line 3,633: Line 3,648:
<center>'''Information and Network Security'''</center>  
<center>'''Information and Network Security'''</center>  


=== Subject Code: 06CS835 I.A. Marks : 25 ===
=== Subject Code: 06CS835 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 3,639: Line 3,654:
<center>'''PART – A'''</center>  
<center>'''PART – A'''</center>  


# '''Planning for Security6 Hrs'''  
# '''Planning for Security6 Hrs'''


Introduction; Information Security Policy, Standards, and Practices; The Information Security Blue Print; Contingency plan and a model for contingency plan.  
Introduction; Information Security Policy, Standards, and Practices; The Information Security Blue Print; Contingency plan and a model for contingency plan.


# '''Security Technology-16 Hrs'''  
# '''Security Technology-16 Hrs'''


Introduction; Physical design; Firewalls; Protecting Remote Connections.  
Introduction; Physical design; Firewalls; Protecting Remote Connections.


# '''Security Technology - 26 Hrs'''  
# '''Security Technology - 26 Hrs'''


Introduction; Intrusion Detection Systems (IDS); Honey Pots, Honey Nets, and Padded cell systems; Scanning and Analysis Tools.  
Introduction; Intrusion Detection Systems (IDS); Honey Pots, Honey Nets, and Padded cell systems; Scanning and Analysis Tools.


# '''Cryptography8 Hrs'''  
# '''Cryptography8 Hrs'''


Introduction; A short History of Cryptography; Principles of Cryptography; Cryptography Tools; Attacks on Cryptosystems.
Introduction; A short History of Cryptography; Principles of Cryptography; Cryptography Tools; Attacks on Cryptosystems.
Line 3,659: Line 3,674:


   
   
# '''Introduction to Network Security, Authentication Applications8 Hrs'''  
# '''Introduction to Network Security, Authentication Applications8 Hrs'''


Attacks , services, and Mechanisms; Security Attacks; Security Services; A model for Internetwork Security; Internet Standards and RFCs.
Attacks , services, and Mechanisms; Security Attacks; Security Services; A model for Internetwork Security; Internet Standards and RFCs.


Kerberos, X.509 Directory Authentication Service.  
Kerberos, X.509 Directory Authentication Service.


# '''Electronic Mail Security6 Hrs'''  
# '''Electronic Mail Security6 Hrs'''


Pretty Good Privacy (PGP); S/MIME.
Pretty Good Privacy (PGP); S/MIME.
Line 3,671: Line 3,686:
'''7. IP Security6 Hrs'''
'''7. IP Security6 Hrs'''


IP Security Overview; IP Security Architecture; Authentication Header; Encapsulating Security Payload; Combining Security Associations; Key Management.  
IP Security Overview; IP Security Architecture; Authentication Header; Encapsulating Security Payload; Combining Security Associations; Key Management.


# '''Web Security6 Hrs'''  
# '''Web Security6 Hrs'''


Web security requirements; Secure Socket layer (SSL) and Transport layer Security (TLS); Secure Electronic Transaction (SET).
Web security requirements; Secure Socket layer (SSL) and Transport layer Security (TLS); Secure Electronic Transaction (SET).




'''Text Books:'''  
'''Text Books:'''


# Michael E. Whitman and Herbert J. Mattord: Principles of Information Security, 2<sup>nd</sup> Edition, Thomson, 2005.   
# Michael E. Whitman and Herbert J. Mattord: Principles of Information Security, 2<sup>nd</sup> Edition, Thomson, 2005.   


(Chapters 5, 6, 7, 8; Exclude the topics not mentioned in the syllabus)  
(Chapters 5, 6, 7, 8; Exclude the topics not mentioned in the syllabus)


# Network Security Essentials: Applications and Standards, William Stallings, Person Education  
# Network Security Essentials: Applications and Standards, William Stallings, Person Education


(Chapters: 1, 4, 5, 6, 7, 8)
(Chapters: 1, 4, 5, 6, 7, 8)
Line 3,696: Line 3,711:
<center>'''Microcontroller-Based Systems'''</center>  
<center>'''Microcontroller-Based Systems'''</center>  


=== Subject Code: 06CS836 I.A. Marks : 25 ===
=== Subject Code: 06CS836 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 3,813: Line 3,828:




'''Text Books:'''  
'''Text Books:'''


# C. Siva Ram Murthy &amp; B. S. Manoj: Ad hoc Wireless Networks, 2<sup>nd</sup> Edition, Pearson Education, 2005   
# C. Siva Ram Murthy &amp; B. S. Manoj: Ad hoc Wireless Networks, 2<sup>nd</sup> Edition, Pearson Education, 2005   


'''Reference Books:'''  
'''Reference Books:'''


# Ozan K. Tonguz and Gianguigi Ferrari: Ad hoc Wireless Networks, John Wiley, 2006.  
# Ozan K. Tonguz and Gianguigi Ferrari: Ad hoc Wireless Networks, John Wiley, 2006.  
# Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad hoc Wireless Networking, Kluwer Academic Publishers, 2004.  
# Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad hoc Wireless Networking, Kluwer Academic Publishers, 2004.


3. C.K. Toh: Adhoc Mobile Wireless Networks- Protocols and Systems, PHI, 2002.
3. C.K. Toh: Adhoc Mobile Wireless Networks- Protocols and Systems, PHI, 2002.
Line 3,832: Line 3,847:
'''Hours/Week: 4 Exam Marks: 100'''
'''Hours/Week: 4 Exam Marks: 100'''


'''Total Hours: 52 Exam Hours: 3'''  
'''Total Hours: 52 Exam Hours: 3'''


<center>'''PART – A'''</center>  
<center>'''PART – A'''</center>  


   
   
# '''Introduction, Retrieval Strategies - 17 Hrs'''  
# '''Introduction, Retrieval Strategies - 17 Hrs'''


Introduction; Retrieval Strategies: Vector Space Model; Probabilistic Retrieval strategies
Introduction; Retrieval Strategies: Vector Space Model; Probabilistic Retrieval strategies
Line 3,843: Line 3,858:
2. '''Retrieval Strategies – 26 Hrs'''
2. '''Retrieval Strategies – 26 Hrs'''


Some More Retrieval Strategies: Language Models; Inference Networks; Extended Boolean Retrieval; Latent Semantic Indexing; Neural Networks; Genetic Algorithms; Fuzzy Set Retrieval.  
Some More Retrieval Strategies: Language Models; Inference Networks; Extended Boolean Retrieval; Latent Semantic Indexing; Neural Networks; Genetic Algorithms; Fuzzy Set Retrieval.


# '''Retrieval Utilities7 Hrs'''  
# '''Retrieval Utilities7 Hrs'''


Relevance feedback; Clustering; Passage-Based Retrieval; N-Grams; Regression Analysis; Thesauri; Semantic Networks; Parsing.   
Relevance feedback; Clustering; Passage-Based Retrieval; N-Grams; Regression Analysis; Thesauri; Semantic Networks; Parsing.   


# '''Indexing and Searching6 Hrs'''  
# '''Indexing and Searching6 Hrs'''


Introduction; Inverted Files; Other indices for text; Boolean queries; Sequential searching; Pattern matching; Structural queries; Compression.
Introduction; Inverted Files; Other indices for text; Boolean queries; Sequential searching; Pattern matching; Structural queries; Compression.
Line 3,857: Line 3,872:


   
   
# '''Cross-Language Information Retrieval and Efficiency6 Hrs'''  
# '''Cross-Language Information Retrieval and Efficiency6 Hrs'''


Introduction; Crossing the language barrier; Cross-Language retrieval strategies; Cross language utilities. Duplicate Document Detection.  
Introduction; Crossing the language barrier; Cross-Language retrieval strategies; Cross language utilities. Duplicate Document Detection.


# '''Integrating Structured Data and Text6 Hrs'''  
# '''Integrating Structured Data and Text6 Hrs'''


Review of the relational model; A historical progression; Information retrieval as a relational application; Semi-structured search using a relational schema; Multi-dimensional data model.   
Review of the relational model; A historical progression; Information retrieval as a relational application; Semi-structured search using a relational schema; Multi-dimensional data model.   


# '''Parallel Information Retrieval, Distributed Information Retrieval7 Hrs'''  
# '''Parallel Information Retrieval, Distributed Information Retrieval7 Hrs'''


Parallel text scanning; Parallel indexing; Clustering and classification; Large parallel systems; A theoretic model of distributed information retrieval; Web search; Result fusion; Peer-to-Peer information systems; Other architectures.
Parallel text scanning; Parallel indexing; Clustering and classification; Large parallel systems; A theoretic model of distributed information retrieval; Web search; Result fusion; Peer-to-Peer information systems; Other architectures.
Line 3,874: Line 3,889:




'''Text Books:'''  
'''Text Books:'''


# David A. Grossman, Ophir Frieder: Information Retrieval Algorithms and Heuristics, 2<sup>nd</sup> Edition, Springer, 2004.   
# David A. Grossman, Ophir Frieder: Information Retrieval Algorithms and Heuristics, 2<sup>nd</sup> Edition, Springer, 2004.   


(Chapters 1, 2, 3, 4, 5, 6, 7, 8)  
(Chapters 1, 2, 3, 4, 5, 6, 7, 8)


# Ricardo Baeza-Yates, Berthier Ribeiro-Neto: Modern Information Retrieval, Pearson Education, 1999  
# Ricardo Baeza-Yates, Berthier Ribeiro-Neto: Modern Information Retrieval, Pearson Education, 1999


(Chapters 8, 11, 12)
(Chapters 8, 11, 12)




'''Reference Books :'''  
'''Reference Books :'''


# William B. Frakes, Ricardo Baeza-Yates (Editors):Information Retrieval Data Structures &amp; Algorithms, Prentice Hall PTR, 1992.  
# William B. Frakes, Ricardo Baeza-Yates (Editors):Information Retrieval Data Structures &amp; Algorithms, Prentice Hall PTR, 1992.


<center>'''Supply Chain Management'''</center>  
<center>'''Supply Chain Management'''</center>  


   
   
=== Subject Code: 06CS843 I.A. Marks : 25 ===
=== Subject Code: 06CS843 I.A. Marks : 25 ===  
  '''Hours/Week : 04 Exam Hours: 03'''  
  '''Hours/Week : 04 Exam Hours: 03'''  


Line 3,898: Line 3,913:
= PART - A =  
= PART - A =  
= 1Introduction to Supply Chain, Performance of Supply Chain6 Hrs =  
= 1Introduction to Supply Chain, Performance of Supply Chain6 Hrs =  
===== What is a Supply Chain; Decision phases in a supply Chain; Process view of a Supply Chain; The importance of Supply Chain Flows; Examples of Supply Chains. =====
===== What is a Supply Chain; Decision phases in a supply Chain; Process view of a Supply Chain; The importance of Supply Chain Flows; Examples of Supply Chains. =====  
  Competitive and Supply Chain strategies; Achieving strategic fit; Expanding strategic scope.  
  Competitive and Supply Chain strategies; Achieving strategic fit; Expanding strategic scope.  


===== 2Supply Cain drivers and Obstacles, Designing Distribution Network6 Hrs =====  
===== 2Supply Cain drivers and Obstacles, Designing Distribution Network6 Hrs =====  
===== Drivers of Supply Chain Performance; A framework for structuring drivers; Facilities, Inventory, Transportation, and Information; Obstacles to achieve strategic fit. =====
===== Drivers of Supply Chain Performance; A framework for structuring drivers; Facilities, Inventory, Transportation, and Information; Obstacles to achieve strategic fit. =====  
  The role of distribution in the Supply Chain; factors influencing distribution network design; Design options for a distribution network; the value of distributors in the Supply Chain; Distribution Networks in practice.
  The role of distribution in the Supply Chain; factors influencing distribution network design; Design options for a distribution network; the value of distributors in the Supply Chain; Distribution Networks in practice.  


===== 3Network Design 7 Hrs =====  
===== 3Network Design 7 Hrs =====  
Line 3,913: Line 3,928:


   
   
= 5.Inventory Management6 Hrs =
= 5.Inventory Management6 Hrs =  
  The role of cycle inventory in a supply Chain; Economies of scale to exploit fixed costs, quantity discounts; Short-term discounting; Managing multi-echelon cycle inventory; Estimating cycle inventory related costs in practice.
  The role of cycle inventory in a supply Chain; Economies of scale to exploit fixed costs, quantity discounts; Short-term discounting; Managing multi-echelon cycle inventory; Estimating cycle inventory related costs in practice.  


= 6.Transportation7 Hrs =
= 6.Transportation7 Hrs =  
  The role of transportation in the Supply Chain; Factors affecting transportation decisions; Modes of transportation and their performance characteristics; Design options for a transportation network; Trade-offs in transportation design; Tailored transportation; Routing and scheduling in transportation; Making transportation decisions in practice.  
  The role of transportation in the Supply Chain; Factors affecting transportation decisions; Modes of transportation and their performance characteristics; Design options for a transportation network; Trade-offs in transportation design; Tailored transportation; Routing and scheduling in transportation; Making transportation decisions in practice.  


= 7.Pricing and Revenue Management, Coordination7 Hrs =
= 7.Pricing and Revenue Management, Coordination7 Hrs =  
  The role of revenue management in Supply Chain; revenue management for multiple customer segments, perishable assets, seasonal demand, and bulk and spot contracts; Using revenue management in practice.
  The role of revenue management in Supply Chain; revenue management for multiple customer segments, perishable assets, seasonal demand, and bulk and spot contracts; Using revenue management in practice.  


Lack of Supply Chain coordination and Bullwhip effect; Effect of lack of coordination on performance; Obstacles to coordination in the Supply Chain; managerial levers to achieve coordination; Building strategic partnerships and trust within a supply Chain; Achieving coordination in practice.  
Lack of Supply Chain coordination and Bullwhip effect; Effect of lack of coordination on performance; Obstacles to coordination in the Supply Chain; managerial levers to achieve coordination; Building strategic partnerships and trust within a supply Chain; Achieving coordination in practice.


== 8IT, Internet and Supply Chain6 Hrs ==
== 8IT, Internet and Supply Chain6 Hrs ==  
  The role of IT in the Supply Chain; The Supply Chain IT framework; CRM; Internal SCM; Supplier Relationship Management; The transaction management foundation; The future if IT in SCM; Supply Chain It in practice.
  The role of IT in the Supply Chain; The Supply Chain IT framework; CRM; Internal SCM; Supplier Relationship Management; The transaction management foundation; The future if IT in SCM; Supply Chain It in practice.  


The role of E-Business in Supply Chain; The E-Business framework; The B2B addition to the E-Business framework; E-Business in practice.
The role of E-Business in Supply Chain; The E-Business framework; The B2B addition to the E-Business framework; E-Business in practice.
Line 3,933: Line 3,948:


   
   
# Sunil Chopra, Pter Meindl: Supply Chain Management Strategy, Planning, and Operation, 2<sup>nd</sup> Edition, Prentice-Hall of India, 2004.  
# Sunil Chopra, Pter Meindl: Supply Chain Management Strategy, Planning, and Operation, 2<sup>nd</sup> Edition, Prentice-Hall of India, 2004.


(Chapters 1, 2, 4, 4, 5, 6, 7, 8.1 to 8.3, 10, 14, 15, 16, 17, 18)
(Chapters 1, 2, 4, 4, 5, 6, 7, 8.1 to 8.3, 10, 14, 15, 16, 17, 18)
Line 3,942: Line 3,957:
   
   
# David Simchi-Levi, Philp Kaminky, Edith Simchi-Levi: Designing and Managing The Supply Chain Concepts, Strategies &amp; Case Studies, 3<sup>rd</sup> Edition, Tata McGraw Hill, 2008.
# David Simchi-Levi, Philp Kaminky, Edith Simchi-Levi: Designing and Managing The Supply Chain Concepts, Strategies &amp; Case Studies, 3<sup>rd</sup> Edition, Tata McGraw Hill, 2008.
# R.P. Mohanty, S.G. Deshmukh: Supply Chain Management Theories &amp; Practices, Bizmantra, 2005.  
# R.P. Mohanty, S.G. Deshmukh: Supply Chain Management Theories &amp; Practices, Bizmantra, 2005.


3. Rahul V. Altekar: Supply Chain Management Concepts and Cases. PHI, 2005.
3. Rahul V. Altekar: Supply Chain Management Concepts and Cases. PHI, 2005.
Line 3,956: Line 3,971:
'''Hours/Week: 4 Exam Marks: 100'''
'''Hours/Week: 4 Exam Marks: 100'''


'''Total Hours: 52 Exam Hours: 3'''  
'''Total Hours: 52 Exam Hours: 3'''


<center>'''PART – A'''</center>  
<center>'''PART – A'''</center>  
Line 3,977: Line 3,992:
'''4. Web Services and Contemporary SOA – 27 Hrs'''
'''4. Web Services and Contemporary SOA – 27 Hrs'''


Addressing; Reliable messaging; Correlation; Polices; Metadata exchange; Security; Notification and eventing.  
Addressing; Reliable messaging; Correlation; Polices; Metadata exchange; Security; Notification and eventing.


<center>'''PART – B'''</center>  
<center>'''PART – B'''</center>  
Line 4,007: Line 4,022:




1. Eric Newcomer, Greg Lomow: Understanding SOA with Web Services, Pearson education, 2005.  
1. Eric Newcomer, Greg Lomow: Understanding SOA with Web Services, Pearson education, 2005.


<center>'''Grid Computing'''</center>  
<center>'''Grid Computing'''</center>  
Line 4,016: Line 4,031:
'''Hours/Week: 4 Exam Marks: 100'''
'''Hours/Week: 4 Exam Marks: 100'''


'''Total Hours: 52 Exam Hours: 3'''  
'''Total Hours: 52 Exam Hours: 3'''


<center>'''PART – A'''</center>  
<center>'''PART – A'''</center>  
Line 4,127: Line 4,142:




'''Text Books:'''  
'''Text Books:'''


# Efraim Turban. Jay E. Aronson, Ting-Peng Liang: Decision Support Systems and Intelligent Systems, 7<sup>th</sup> Edition, Prentice-Hall of India, 2006.  
# Efraim Turban. Jay E. Aronson, Ting-Peng Liang: Decision Support Systems and Intelligent Systems, 7<sup>th</sup> Edition, Prentice-Hall of India, 2006.


(Chapters 1, 2, 3, 6, 7, 8 excluding 8.7 to 8.9, 9, 15)
(Chapters 1, 2, 3, 6, 7, 8 excluding 8.7 to 8.9, 9, 15)




'''Reference Books:'''  
'''Reference Books:'''


# Sprague R.H. Jr and H.J. Watson: Decision Support Systems , 4<sup>th</sup> Edition, Prentice Hall, 1996. </center></center>
# Sprague R.H. Jr and H.J. Watson: Decision Support Systems , 4<sup>th</sup> Edition, Prentice Hall, 1996. &lt;/center&gt;&lt;/center&gt; </center></center>
Anonymous user
Retrieved from "https://wiki.fsci.in/Special:MobileDiff/7893"