Difference between revisions of "Syllabus Review/VTU/MCA"
no edit summary
| (2 intermediate revisions by one other user not shown) | |||
| Line 18: | Line 18: | ||
{| class="prettytable" | {|class="prettytable" | ||
| S. No. | |S. No. | ||
| Subject Code | |Subject Code | ||
| <center>Title</center> | |<center>Title</center> | ||
| colspan="6" | | |colspan="6"| | ||
{|class="prettytable" | |||
|colspan="2"|<center>Teaching Hrs / Week</center> | |||
|colspan="2"|<center>Examination</center> | |||
|- | |- | ||
| Theory | |Theory | ||
| Practical | |Practical | ||
| <center>Duration</center> | |<center>Duration</center> | ||
| | |||
{|class="prettytable" | |||
|colspan="3"|<center>Marks</center> | |||
|- | |- | ||
| <center>IA</center> | |<center>IA</center> | ||
| <center>Exam</center> | |<center>Exam</center> | ||
| <center>Total</center> | |<center>Total</center> | ||
|} | |} | ||
|} | |} | ||
|- | |- | ||
| 1 | |1 | ||
| 07MCA31 | |07MCA31 | ||
| Systems Software | |Systems Software | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |||
|2 | |||
|07MCA32 | |||
|Computer Networks | |||
|<center>04</center> | |||
|<center>-</center> | |||
|<center>03</center> | |||
|<center>50</center> | |||
|<center>100</center> | |||
|<center>150</center> | |||
|- | |- | ||
| | |3 | ||
| | |07MCA33 | ||
| | |Object Oriented programming with C++ | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| | |4 | ||
| | |07MCA34 | ||
| | |Database Management Systems | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| | |5 | ||
| | |07MCA35 | ||
| | |Operating Systems | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| | |6 | ||
| | |07MCA36 | ||
| | |Systems Programming Laboratory | ||
| <center> | |<center>-</center> | ||
| <center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center> | |<center>50</center> | ||
| <center> | |<center>100</center> | ||
|- | |- | ||
| | |7 | ||
| | |07MCA37 | ||
| | |OOP with C++ Laboratory | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| | |8 | ||
| | |07MCA38 | ||
| | |DBMS Laboratory | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| | |colspan="3"|<center>Total</center> | ||
|<center>20</center> | |||
|<center>09</center> | |||
| <center> | | | ||
| <center> | |400 | ||
| <center> | |650 | ||
| | |1050 | ||
| | |} | ||
| | |||
<center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center> | <center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center> | ||
| Line 155: | Line 142: | ||
{| class="prettytable" | {|class="prettytable" | ||
| S. No. | |S. No. | ||
| Subject Code | |Subject Code | ||
| <center>Title</center> | |<center>Title</center> | ||
| colspan="6" | | |colspan="6"| | ||
{|class="prettytable" | |||
|colspan="2"|<center>Teaching Hrs / Week</center> | |||
|colspan="2"|<center>Examination</center> | |||
|- | |- | ||
| Theory | |Theory | ||
| Practical | |Practical | ||
| <center>Duration</center> | |<center>Duration</center> | ||
| | |||
{|class="prettytable" | |||
|colspan="3"|<center>Marks</center> | |||
|- | |- | ||
| <center>IA</center> | |<center>IA</center> | ||
| <center>Exam</center> | |<center>Exam</center> | ||
| <center>Total</center> | |<center>Total</center> | ||
|} | |} | ||
|} | |} | ||
|- | |- | ||
| 1 | |1 | ||
| 07MCA41 | |07MCA41 | ||
| Topics in Enterprise Architectures –I | |Topics in Enterprise Architectures –I | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 2 | |2 | ||
| 07MCA42 | |07MCA42 | ||
| Software Engineering | |Software Engineering | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 3 | |3 | ||
| 07MCA43 | |07MCA43 | ||
| Web Programming | |Web Programming | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 4 | |4 | ||
| 07MCA44 | |07MCA44 | ||
| Design and Analysis of Algorithms | |Design and Analysis of Algorithms | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 5 | |5 | ||
| 07MCA45 | |07MCA45 | ||
| Elective I | |Elective I | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 6 | |6 | ||
| 07MCA46 | |07MCA46 | ||
| Java & J2EE Laboratory | |Java & J2EE Laboratory | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| 7 | |7 | ||
| 07MCA47 | |07MCA47 | ||
| Web programming Laboratory | |Web programming Laboratory | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| 8 | |8 | ||
| 07MCA48 | |07MCA48 | ||
| Algorithms Laboratory | |Algorithms Laboratory | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| colspan="3" | <center>Total</center> | |colspan="3"|<center>Total</center> | ||
| <center>20</center> | |<center>20</center> | ||
| <center>09</center> | |<center>09</center> | ||
| | | | ||
| 400 | |400 | ||
| 650 | |650 | ||
| 1050 | |1050 | ||
|} | |} | ||
{| class="prettytable" | {|class="prettytable" | ||
| colspan="2" | = Elective I = | |colspan="2"|= Elective I = | ||
|- | |||
|07MCA451 | |||
|Computer Graphics and Visualization | |||
|- | |- | ||
| | |07MCA452 | ||
| | |UNIX system Programming | ||
|- | |- | ||
| | |07MCA453 | ||
| | |Multimedia Systems | ||
|- | |- | ||
| | |07MCA454 | ||
| | |Pattern Recognition | ||
|- | |- | ||
| | |07MCA455 | ||
| | |Principles of User Interface Design | ||
|- | |- | ||
| | |07MCA456 | ||
| | |Advanced Computer Networks | ||
|} | |||
<center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center> | <center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center> | ||
| Line 322: | Line 288: | ||
{| class="prettytable" | {|class="prettytable" | ||
| S. No. | |S. No. | ||
| Subject Code | |Subject Code | ||
| colspan="2" | <center>Title</center> | |colspan="2"|<center>Title</center> | ||
| colspan="6" | | |colspan="6"| | ||
{|class="prettytable" | |||
|colspan="2"|<center>Teaching Hrs / Week</center> | |||
|colspan="2"|<center>Examination</center> | |||
|- | |- | ||
| Theory | |Theory | ||
| Practical | |Practical | ||
| <center>Duration</center> | |<center>Duration</center> | ||
| | |||
{|class="prettytable" | |||
|colspan="3"|<center>Marks</center> | |||
|- | |- | ||
| <center>IA</center> | |<center>IA</center> | ||
| <center>Exam</center> | |<center>Exam</center> | ||
| <center>Total</center> | |<center>Total</center> | ||
|} | |} | ||
|} | |} | ||
|- | |- | ||
| 1 | |1 | ||
| 07MCA51 | |07MCA51 | ||
| colspan="2" | Object-Oriented Modeling and Design Patterns | |colspan="2"|Object-Oriented Modeling and Design Patterns | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 2 | |2 | ||
| 07MCA52 | |07MCA52 | ||
| colspan="2" | System Simulation and Modeling | |colspan="2"|System Simulation and Modeling | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 3 | |3 | ||
| 07MCA53 | |07MCA53 | ||
| colspan="2" | Topics in Enterprise Architectures -II | |colspan="2"|Topics in Enterprise Architectures -II | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 4 | |4 | ||
| 07MCA54 | |07MCA54 | ||
| colspan="2" | Elective II | |colspan="2"|Elective II | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 5 | |5 | ||
| 07MCA55 | |07MCA55 | ||
| colspan="2" | Elective III | |colspan="2"|Elective III | ||
| <center>04</center> | |<center>04</center> | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
| <center>150</center> | |<center>150</center> | ||
|- | |- | ||
| 6 | |6 | ||
| 07MCA56 | |07MCA56 | ||
| colspan="2" | Software Design Laboratory | |colspan="2"|Software Design Laboratory | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| 7 | |7 | ||
| 07MCA57 | |07MCA57 | ||
| colspan="2" | .Net Laboratory | |colspan="2"|.Net Laboratory | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| 8 | |8 | ||
| 07MCA58 | |07MCA58 | ||
| colspan="2" | Mini Project | |colspan="2"|Mini Project | ||
| <center>-</center> | |<center>-</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>100</center> | |<center>100</center> | ||
|- | |- | ||
| colspan="4" | <center>Total</center> | |colspan="4"|<center>Total</center> | ||
| <center>24</center> | |<center>24</center> | ||
| <center>06</center> | |<center>06</center> | ||
| | | | ||
| 400 | |400 | ||
| 650 | |650 | ||
| 1050 | |1050 | ||
|- | |- | ||
| colspan="3" | | |colspan="3"| | ||
| colspan="7" | | |colspan="7"| | ||
|- | |- | ||
| colspan="4" | | |colspan="4"| | ||
| colspan="6" | | |colspan="6"| | ||
|- | |- | ||
| colspan="4" | | |colspan="4"| | ||
| colspan="6" | | |colspan="6"| | ||
|- | |- | ||
| colspan="4" | | |colspan="4"| | ||
| colspan="6" | | |colspan="6"| | ||
|- | |- | ||
| colspan="4" | | |colspan="4"| | ||
| colspan="6" | | |colspan="6"| | ||
|- | |- | ||
| colspan="4" | | |colspan="4"| | ||
| colspan="6" | | |colspan="6"| | ||
|- | |- | ||
| colspan="4" | | |colspan="4"| | ||
| colspan="6" | | |colspan="6"| | ||
|} | |} | ||
<center> | |||
{|class="prettytable" | |||
|colspan="2"|= Elective II = | |||
|colspan="2"|= Elective III = | |||
|- | |- | ||
| <center>''' | |<center>'''07MCA541''' | ||
| <center>''' | |<center>'''Information Retrieval''' | ||
| <center>''' | |<center>'''07MCA551''' | ||
| <center>''' | |<center>'''Information & Network Security''' | ||
|- | |||
|<center>'''07MCA542'''</center> | |||
|<center>'''Data Mining '''</center> | |||
|<center>'''07MCA552'''</center> | |||
|<center>'''Software Testing'''</center> | |||
|- | |- | ||
| <center>''' | |<center>'''07MCA543'''</center> | ||
| <center>''' | |<center>'''Supply Chain Management'''</center> | ||
| <center>''' | |<center>'''07MCA553'''</center> | ||
| <center>''' | |<center>'''Services Oriented Architecture'''</center> | ||
|- | |- | ||
| <center>''' | |<center>'''07MCA544'''</center> | ||
| <center>''' | |<center>'''Network Management '''</center> | ||
| <center>''' | |<center>'''07MCA554'''</center> | ||
| <center>''' | |<center>'''Mobile Computing'''</center> | ||
|- | |- | ||
| <center>''' | |<center>'''07MCA545'''</center> | ||
| <center>''' | |<center>'''Compiler Design'''</center> | ||
| <center>''' | |<center>'''07MCA555'''</center> | ||
| <center>''' | |<center>'''Artificial Intelligence'''</center> | ||
|- | |- | ||
| <center>''' | |<center>'''07MCA546'''</center> | ||
| <center>''' | |<center>'''Software Architectures'''</center> | ||
| <center>''' | |<center>'''07MCA556'''</center> | ||
| <center>''' | |<center>'''Web 2.0 & Rich Internet Applications'''</center> | ||
|} | |||
</center> | |||
<center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center> | |||
<center>SCHEME OF TEACHING AND EXAMINATION</center> | |||
</center> | |||
<center>''' | <center>'''VI SEMESTER - Master of Computer Applications'''</center> | ||
| | {|class="prettytable" | ||
| | |S. No. | ||
| | |Subject Code | ||
| <center> | |<center>Title</center> | ||
|colspan="7"| | |||
{|class="prettytable" | |||
|colspan="2"|<center>Teaching Hrs / Week</center> | |||
|colspan="2"|<center>Examination</center> | |||
|- | |||
|Theory | |||
|Practical | |||
|<center>Duration</center> | |||
| | |||
{|class="prettytable" | |||
|colspan="4"|<center>Marks</center> | |||
|- | |- | ||
| <center>IA</center> | |<center>IA</center> | ||
| <center>Dissertation</center> | |<center>Dissertation</center> | ||
| <center>Viva</center> | |<center>Viva</center> | ||
| <center>Total</center> | |<center>Total</center> | ||
|} | |} | ||
|} | |} | ||
|- | |- | ||
| 1 | |1 | ||
| | | | ||
| Project Work | |Project Work | ||
| - | | - | ||
| <center>03</center> | |<center>03</center> | ||
| <center>03</center> | |<center>03</center> | ||
| <center>50</center> | |<center>50</center> | ||
| <center>125</center> | |<center>125</center> | ||
| <center>75</center> | |<center>75</center> | ||
| <center>250</center> | |<center>250</center> | ||
|} | |||
'''NOTE: Students have to register for one Elective from each of the Three Elective Groups''' | |||
''' | <center>'''III SEMESTER'''</center> | ||
<center>'''Systems Software'''</center> | |||
=== Subject Code: 07MCA31I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Subject Code: 07MCA31I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | === Total Hours : 52Exam Marks: 100 === | ||
# '''Machine Architecture | # '''Machine Architecture 6 Hours''' | ||
Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples.''' ''' | Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples.''' ''' | ||
# '''Assemblers -1 6 Hours''' | # '''Assemblers -1 6 Hours''' | ||
Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation. | Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation. | ||
# '''Assemblers -2 | # '''Assemblers -2 6 Hours''' | ||
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. | 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. | ||
# '''Loaders And Linkers | # '''Loaders And Linkers 8 Hours''' | ||
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. | 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. | ||
# '''Editors And Debugging Systems | # '''Editors And Debugging Systems 6 Hours''' | ||
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 Hours''' | # '''Macro Processor 8 Hours''' | ||
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 Hours''' | # '''Lex and Yacc – 1 6 Hours''' | ||
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 | # '''Lex And Yacc - 2 6 Hours''' | ||
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. | ||
'''Text Books:''' | '''Text Books:''' | ||
# 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.1 to 1.3, 2 (except 2.5.2 and 2.5.3), 3 (except 3.5.2 and 3.5.3), 4 (except 4.4.3)) | '''('''Chapters 1.1 to 1.3, 2 (except 2.5.2 and 2.5.3), 3 (except 3.5.2 and 3.5.3), 4 (except 4.4.3)) | ||
# John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1998. | # John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1998. | ||
(Chapters 1, 2 (Page 2-42), 3 (Page 51-65)) | (Chapters 1, 2 (Page 2-42), 3 (Page 51-65)) | ||
| Line 639: | Line 575: | ||
1.''' '''D.M.Dhamdhere: System Programming and Operating Systems, 2<sup>nd</sup> Edition, Tata McGraw - Hill, 1999. | 1.''' '''D.M.Dhamdhere: System Programming and Operating Systems, 2<sup>nd</sup> Edition, Tata McGraw - Hill, 1999. | ||
<center>'''Computer Networks '''</center> | |||
=== Subject Code: 07MCA32I.A. Marks : 50 === | |||
== Hours/Week : 04Exam Hours: 03 == | |||
'''Total Hours : 52Exam Marks: 100''' | |||
'''1. Foundation 8 Hours''' | |||
# Building a Network; Applications; Requirements; Network Architecture; Implementing Network software; Performance. | |||
'''2. Direct Link Networks 12 Hours''' | |||
# Physically connecting hosts; Hardware building blocks; Encoding; Framing; Error detection; Reliable transmission; Ethernet (802.3); Ring; (802.5, FDDI, 802.17); Wireless (802.15.1, 802.11, 802.16, Cell Phone Technologies). | |||
# Physically connecting hosts; Hardware building blocks; Encoding; Framing; Error detection; Reliable transmission; Ethernet (802.3); Ring; (802.5, FDDI, 802.17); Wireless (802.15.1, 802.11, 802.16, Cell Phone Technologies). | |||
'''3. Packet Switching 7 Hours''' | '''3. Packet Switching 7 Hours''' | ||
| Line 661: | Line 597: | ||
'''4.Internetworking 12 Hours''' | '''4.Internetworking 12 Hours''' | ||
Simple internetworking (IP);''' '''Routing; Global Internet. | Simple internetworking (IP);''' '''Routing; Global Internet. | ||
# '''End –to-End Protocols; Resource Allocation Issues 7 Hours''' | # '''End –to-End Protocols; Resource Allocation Issues 7 Hours''' | ||
Simple demultiplexer (UDP); Reliable byte stream (TCP); Issues in resource allocation | Simple demultiplexer (UDP); Reliable byte stream (TCP); Issues in resource allocation | ||
| Line 691: | Line 627: | ||
3. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key architectures, 2<sup>nd</sup> Edition Tata McGraw-Hill, 2004. | 3. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key architectures, 2<sup>nd</sup> Edition Tata McGraw-Hill, 2004. | ||
<center>'''Object Oriented Programming with C++'''</center> | <center>'''Object Oriented Programming with C++'''</center> | ||
| Line 702: | Line 638: | ||
'''1. Overview of OOP | '''1. Overview of OOP 3 Hours''' | ||
Object Oriented paradigm, Structured vs. Object Oriented Paradigm. Elements of Object Oriented Programming, Object, Classes, Encapsulation & data abstraction, Inheritance, Polymorphism etc. | Object Oriented paradigm, Structured vs. Object Oriented Paradigm. Elements of Object Oriented Programming, Object, Classes, Encapsulation & data abstraction, Inheritance, Polymorphism etc. | ||
'''2. C++ Overview | '''2. C++ Overview 4 Hours''' | ||
Introduction, different data types, operators, expressions, qualifiers, arrays and strings. | Introduction, different data types, operators, expressions, qualifiers, arrays and strings. | ||
| Line 714: | Line 650: | ||
Function Components, argument passing, inline functions, function overriding, function overloading, function templates, recursive functions. | Function Components, argument passing, inline functions, function overriding, function overloading, function templates, recursive functions. | ||
'''4. Classes & Objects | '''4. Classes & Objects 18 Hours''' | ||
<nowiki>Introduction, Class Specification, Class Objects, access members, defining member functions, data hiding, constructors, destructors, parameterized constructors, static data members, functions, scope resolution operator, Passing objects as arguments, returning objects, friend functions & classes, arrays of objects, Dynamic objects – Pointers to objects, Class members, Operator overloading using friend functions such as ++, --, [ ] etc.</nowiki> | <nowiki>Introduction, Class Specification, Class Objects, access members, defining member functions, data hiding, constructors, destructors, parameterized constructors, static data members, functions, scope resolution operator, Passing objects as arguments, returning objects, friend functions & classes, arrays of objects, Dynamic objects – Pointers to objects, Class members, Operator overloading using friend functions such as ++, --, [ ] etc.</nowiki> | ||
| Line 720: | Line 656: | ||
'''5. Inheritance Virtual functions, Polymorphism 12 Hours''' | '''5. Inheritance Virtual functions, Polymorphism 12 Hours''' | ||
Base Class, Inheritance & protected members, protected base class inheritance, Inheriting multiple base classes, Constructors, Destructors & Inheritance | Base Class, Inheritance & protected members, protected base class inheritance, Inheriting multiple base classes, Constructors, Destructors & Inheritance | ||
Passing parameters to base Class Constructors, Granting access, Virtual base classes | Passing parameters to base Class Constructors, Granting access, Virtual base classes | ||
Virtual function – Calling a Virtual function through a base class reference, Virtual attribute is inherited, Virtual functions are hierarchical, pure virtual functions, abstract classes, using Virtual functions, Early & late binding. | Virtual function – Calling a Virtual function through a base class reference, Virtual attribute is inherited, Virtual functions are hierarchical, pure virtual functions, abstract classes, using Virtual functions, Early & late binding. | ||
# '''Generic Programming with Templates 3 Hours''' | # '''Generic Programming with Templates 3 Hours''' | ||
Introduction, Function templates, Class templates. | Introduction, Function templates, Class templates. | ||
'''7. I/O | '''7. I/O 4 Hours''' | ||
<nowiki>IO Stream Library, output operator <<, input >>, additional i/o operators, overloading the output operator <<, overloading the io operator >>, file input & output. </nowiki> | <nowiki>IO Stream Library, output operator <<, input >>, additional i/o operators, overloading the output operator <<, overloading the io operator >>, file input & output. </nowiki> | ||
'''Text Books: ''' | '''Text Books: ''' | ||
# H. Schild: C++ The Complete Reference, 4<sup>th</sup> Edition, Tata McGraw Hill, 2003. | # H. Schild: C++ The Complete Reference, 4<sup>th</sup> Edition, Tata McGraw Hill, 2003. | ||
(Chapters 11 to 17, 20, 21) | (Chapters 11 to 17, 20, 21) | ||
# K R Venugopal, Rajkumar, T., Ravi Shankar: Mastering C++, Tata McGraw Hill, 1997. | # K R Venugopal, Rajkumar, T., Ravi Shankar: Mastering C++, Tata McGraw Hill, 1997. | ||
(Chapter 1, 3 to 18) | (Chapter 1, 3 to 18) | ||
'''Reference Book: ''' | '''Reference Book: ''' | ||
# Stanley B.Lippmann, Josee Lajore: C++Primer, 4<sup>th</sup> <sup>d</sup> Edition, Addison Wesley, 2005. | # Stanley B.Lippmann, Josee Lajore: C++Primer, 4<sup>th</sup> <sup>d</sup> Edition, Addison Wesley, 2005. | ||
<center>'''Database Management Systems'''</center> | <center>'''Database Management Systems'''</center> | ||
=== Subject Code: 07MCA34I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== | === Total Hours : 52Exam Marks: 100 === | ||
'''Hours | # '''Introduction 7 Hours''' | ||
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. Data models, schemas and instances; Three-schema architecture and data independence; Database languages and interfaces; The database system environment; Centralized and client-server architectures; Classification of Database Management systems. | |||
# '''Entity-Relationship Model''' '''7 Hours''' | |||
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 Algebra 8 Hours ''' | |||
Relational Model Concepts; Relational Model Constraints and Relational Database Schemas; Update Operations, Transactions and dealing with constraint violations; Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary Relational Operations : JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra; Relational Database Design Using ER- to-Relational Mapping. | |||
# '''SQL 16 Hours''' | |||
SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in SQL; Basic queries in SQL; More complex SQL Queries. Insert, 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 8 Hours''' | |||
# '''Database Design | |||
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. | ||
| Line 780: | Line 716: | ||
'''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) | (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) | ||
# 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 Books:''' | '''Reference Books:''' | ||
# 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>'''Operating Systems'''</center> | <center>'''Operating Systems'''</center> | ||
=== Subject Code: 07MCA35I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
# '''Introduction to Operating Systems, System structures''' '''6 Hours''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
# '''Introduction to Operating Systems, System structures''' '''6 Hours''' | |||
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. | 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. | ||
# '''Process Management | # '''Process Management 7 Hours''' | ||
Process concept; Process scheduling; Operations on processes; Inter-process communication. Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues. Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling; Thread scheduling. | Process concept; Process scheduling; Operations on processes; Inter-process communication. Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues. Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling; Thread scheduling. | ||
# '''Process Synchronization 7 Hours''' | # '''Process Synchronization 7 Hours''' | ||
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 Hours''' | # '''Deadlocks 6 Hours''' | ||
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. | ||
# '''Memory Management | # '''Memory Management 7 Hours''' | ||
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. | 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. | ||
'''6.''' '''File System, Implementation of File System | '''6.''' '''File System, Implementation of File System 7 Hours''' | ||
File System:''' '''File concept; Access methods; Directory structure; File system mounting; File sharing; Protection. Implementing File System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management. | File System:''' '''File concept; Access methods; Directory structure; File system mounting; File sharing; Protection. Implementing File System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management. | ||
'''7.''' '''Secondary Storage Structures,Protection | '''7.''' '''Secondary Storage Structures,Protection 6 Hours''' | ||
Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management.Protection: Goals of protection, Principles of protection, Domain of protection, Access matrix , Implementation of access matrix, Access control, Revocation of access rights, Capability-Based systems. | Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management.Protection: Goals of protection, Principles of protection, Domain of protection, Access matrix , Implementation of access matrix, Access control, Revocation of access rights, Capability-Based systems. | ||
| Line 851: | Line 787: | ||
2. Harvey M Deital: Operating systems, 3<sup>rd</sup> Edition, Addison Wesley, 1990. | 2. Harvey M Deital: Operating systems, 3<sup>rd</sup> Edition, Addison Wesley, 1990. | ||
= System Programming Laboratory = | |||
== Subject Code: 07MCA36I.A. Marks: 50 == | |||
'''Hours/Week: 03Exam Hours : 03''' | |||
'''Total Hours : 42Exam Marks : 50''' | |||
'''Total Hours : 42Exam Marks : 50''' | |||
=== PART- A === | === PART- A === | ||
'''Execute of the following programs using LEX:''' | '''Execute of the following programs using LEX:''' | ||
# Program to count the number of vowels and consonants in a given string. | # Program to count the number of vowels and consonants in a given string. | ||
| Line 865: | Line 801: | ||
# Program to count number of | # Program to count number of | ||
## Positive and negative integers | ## Positive and negative integers | ||
## Positive and negative fractions | ## Positive and negative fractions | ||
4) Program to count the numbers of comment lines in a given C program. Also eliminate them and copy that program into separate file. | 4) Program to count the numbers of comment lines in a given C program. Also eliminate them and copy that program into separate file. | ||
# Program to count the number of ‘scanf’ and ‘printf’ statements in a C program. Replace them with ‘readf’ and ‘writef’ statements respectively. | # Program to count the number of ‘scanf’ and ‘printf’ statements in a C program. Replace them with ‘readf’ and ‘writef’ statements respectively. | ||
# Program to recognize a valid arithmetic expression and identify the identifiers and operators present. Print them separately. | # Program to recognize a valid arithmetic expression and identify the identifiers and operators present. Print them separately. | ||
# 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. | ||
=== PART- B === | === PART- B === | ||
'''Execute of the following programs using YACC:''' | '''Execute of the following programs using YACC:''' | ||
# Program to test the validity of a simple expression involving operators +, -, * and /. | # Program to test the validity of a simple expression involving operators +, -, * and /. | ||
| Line 881: | Line 817: | ||
# Program to recognize a valid variable, which starts with a letter, followed by any number of letters or digits. | # Program to recognize a valid variable, which starts with a letter, followed by any number of letters or digits. | ||
# Program to evaluate an arithmetic expression involving operators +, -, * and /. | # Program to evaluate an arithmetic expression involving operators +, -, * and /. | ||
# Program to recognize strings ‘aaab’, ‘abbb’, ‘ab’ and ‘a’ using the grammar | # Program to recognize strings ‘aaab’, ‘abbb’, ‘ab’ and ‘a’ using the grammar | ||
(a<sup>n </sup>b<sup>n</sup> , n | (a<sup>n </sup>b<sup>n</sup> , n>=0) | ||
7) Program to recognize the grammar (a<sup>n</sup> b, n | 7) Program to recognize the grammar (a<sup>n</sup> b, n>=10). | ||
| Line 892: | Line 828: | ||
In the examination, a combination of one LEX and one YACC problem has to be asked based on lots. Both will have equal weightages. | In the examination, a combination of one LEX and one YACC problem has to be asked based on lots. Both will have equal weightages. | ||
<center>'''OOP with C++ Laboratory'''</center> | <center>'''OOP with C++ Laboratory'''</center> | ||
| Line 913: | Line 849: | ||
2. Define a STUDENT class with USN, Name, and Marks in 3 tests of a subject. Declare an array of 10 STUDENT objects. Using appropriate functions, find the average of the two better marks for each student. Print the USN, Name and the average marks of all the students. | 2. Define a STUDENT class with USN, Name, and Marks in 3 tests of a subject. Declare an array of 10 STUDENT objects. Using appropriate functions, find the average of the two better marks for each student. Print the USN, Name and the average marks of all the students. | ||
3. Write a C++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a complex number: | 3. Write a C++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a complex number: | ||
# ADD(a, s2) – where ‘a’ is an integer (real part) and s2 is a complex number | # ADD(a, s2) – where ‘a’ is an integer (real part) and s2 is a complex number | ||
# ADD(s1, s2) – where s1 and s2 are complex numbers | # ADD(s1, s2) – where s1 and s2 are complex numbers | ||
4. Write a C++ program to create a class called LIST (linked list) with member functions to insert an element at the front as well as to delete an element from the front of the list. Demonstrate all the functions after creating a list object. | 4. Write a C++ program to create a class called LIST (linked list) with member functions to insert an element at the front as well as to delete an element from the front of the list. Demonstrate all the functions after creating a list object. | ||
| Line 922: | Line 858: | ||
5. Write a C++ program to create a template function for Quicksort and demonstrate sorting of integers and doubles. | 5. Write a C++ program to create a template function for Quicksort and demonstrate sorting of integers and doubles. | ||
6. Write a C++ program to create a class called STACK using an array of integers. Implement the following operations by overloading the operators ‘+’ and ‘-‘: | 6. Write a C++ program to create a class called STACK using an array of integers. Implement the following operations by overloading the operators ‘+’ and ‘-‘: | ||
# s1 = s1 + element; where s1 is an object of the class STACK and element is an integer to be pushed on the top of the stack | # s1 = s1 + element; where s1 is an object of the class STACK and element is an integer to be pushed on the top of the stack | ||
# s1 = s1- ; where s1 is an object of the class STACK. ‘-‘ operator pops the element. | # s1 = s1- ; where s1 is an object of the class STACK. ‘-‘ operator pops the element. | ||
<nowiki>Handle the STACK empty and full conditions. Also display the contents of the stack after each operation, by overloading the << operator.</nowiki> | <nowiki>Handle the STACK empty and full conditions. Also display the contents of the stack after each operation, by overloading the << operator.</nowiki> | ||
<nowiki>7. Write a C++ program to create a class called DATE. Accept two valid dates in the form dd/mm/yy. Implement the following operations by overloading the operators ‘+’ and ‘-‘. After every operation display the results by overloading the operator <<.</nowiki> | <nowiki>7. Write a C++ program to create a class called DATE. Accept two valid dates in the form dd/mm/yy. Implement the following operations by overloading the operators ‘+’ and ‘-‘. After every operation display the results by overloading the operator <<.</nowiki> | ||
# no_of_days = d1 – d2; where d1 and d2 are DATE objects, and no_of_days is an integer | # no_of_days = d1 – d2; where d1 and d2 are DATE objects, and no_of_days is an integer | ||
# d2 = d1 + no_of_days; where d1 is a DATE object and no_of_days is an integer | # d2 = d1 + no_of_days; where d1 is a DATE object and no_of_days is an integer | ||
8. Create a class called MATRIX using two-dimensional array of integers. Implement the following operations by overloading the operator ++ which <nowiki>checks the compatibility of two matrices to be added and subtracted. Perform the addition and subtraction by overloading the + and – operators respectively. Display the results by overloading the operator <<.</nowiki> | 8. Create a class called MATRIX using two-dimensional array of integers. Implement the following operations by overloading the operator ++ which <nowiki>checks the compatibility of two matrices to be added and subtracted. Perform the addition and subtraction by overloading the + and – operators respectively. Display the results by overloading the operator <<.</nowiki> | ||
| Line 939: | Line 875: | ||
9. Write a C++ program to create a class called OCTAL which has the characteristics of an octal number. Implement the following operations by writing an appropriate constructor and an overloaded operator +. | 9. Write a C++ program to create a class called OCTAL which has the characteristics of an octal number. Implement the following operations by writing an appropriate constructor and an overloaded operator +. | ||
# OCTAL h = x; where x is an integer. | # OCTAL h = x; where x is an integer. | ||
# int y = h + k; where h is an OCTAL object and k is an integer | # int y = h + k; where h is an OCTAL object and k is an integer | ||
<nowiki>Display the OCTAL result by overloading the operator << . Also display the values of h and y.</nowiki> | <nowiki>Display the OCTAL result by overloading the operator << . Also display the values of h and y.</nowiki> | ||
| Line 952: | Line 888: | ||
12. Write a C++ program to create a class called STUDENT with data members USN, Name and Age. Using inheritance, create the classes UGSTUDENT and PGSTUDENT having fields as Semester, Fees and Stipend. Enter the data for at least 5 students. Find the semester-wise average age for all UG and PG students separately. | 12. Write a C++ program to create a class called STUDENT with data members USN, Name and Age. Using inheritance, create the classes UGSTUDENT and PGSTUDENT having fields as Semester, Fees and Stipend. Enter the data for at least 5 students. Find the semester-wise average age for all UG and PG students separately. | ||
<nowiki>13. Write a C++ program to create a class called STRING and implement the following operations. Display the results after every operation by overloading the operator <<.</nowiki> | <nowiki>13. Write a C++ program to create a class called STRING and implement the following operations. Display the results after every operation by overloading the operator <<.</nowiki> | ||
# STRING s1 = “VTU” | # STRING s1 = “VTU” | ||
# STRING s2 = “BELGAUM” | # STRING s2 = “BELGAUM” | ||
# STRING s3 = s1 + s2 (Use copy constructor) | # STRING s3 = s1 + s2 (Use copy constructor) | ||
14. Write a C++ program to create a class called BIN_TREE (Binary Tree) with member functions to perform in-order, preorder and post-order traversals. Create a BIN_TREE object and demonstrate the traversals. | 14. Write a C++ program to create a class called BIN_TREE (Binary Tree) with member functions to perform in-order, preorder and post-order traversals. Create a BIN_TREE object and demonstrate the traversals. | ||
| Line 962: | Line 898: | ||
15. Write a C++ program to create a class called EXPRESSION. Using appropriate member functions convert a given valid Infix expression into postfix form. Display the infix and postfix expressions. | 15. Write a C++ program to create a class called EXPRESSION. Using appropriate member functions convert a given valid Infix expression into postfix form. Display the infix and postfix expressions. | ||
<center>'''DBMS Laboratory'''</center> | |||
=== Subject Code: 07MCA38I.A. Marks : 50 === | |||
'''Hours/Week : 03Exam Hours: 03''' | |||
=== Total Hours : 42Exam Marks: 50 === | |||
# Consider the Insurance database given below. The primary keys are underlined and the data types are specified. | |||
=== Total Hours : 42Exam Marks: 50 === | |||
# 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 980: | Line 916: | ||
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 1,007: | Line 943: | ||
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 1,015: | Line 951: | ||
# Demonstrate the deletion of an item from the ITEM table and demonstrate a method of handling the rows in the ORDER_ITEM table that contain this particular item. | # Demonstrate the deletion of an item from the ITEM table and demonstrate a method of handling the rows in the ORDER_ITEM table that contain this particular item. | ||
# 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 & books adopted for each course. | III.''' '''Consider the following database of student enrollment in courses & books adopted for each course. | ||
STUDENT (regno: string, name: string, major: string, bdate:date) | STUDENT (regno: string, name: string, major: string, bdate:date) | ||
| Line 1,027: | Line 963: | ||
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,048: | Line 984: | ||
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,072: | Line 1,008: | ||
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,080: | Line 1,016: | ||
# 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,089: | Line 1,025: | ||
# 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>'''IV Semester'''</center> | <center>'''IV Semester'''</center> | ||
<center>'''Topics in Enterprise Architecture - 1 '''</center> | <center>'''Topics in Enterprise Architecture - 1 '''</center> | ||
| Line 1,104: | Line 1,040: | ||
'''1. Introduction to Java''' | '''1. Introduction to Java''' '''6 Hours''' | ||
Java and Java applications; Java Development Kit (JDK); Java is interpreted, Byte Code, JVM; Object-oriented programming; Simple Java programs. | Java and Java applications; Java Development Kit (JDK); Java is interpreted, Byte Code, JVM; Object-oriented programming; Simple Java programs. | ||
| Line 1,114: | Line 1,050: | ||
Control Statements: Selection statements, iteration statements, Jump Statements. | Control Statements: Selection statements, iteration statements, Jump Statements. | ||
'''2. Classes, Inheritance, Exceptions, Applets | '''2. Classes, Inheritance, Exceptions, Applets 6 Hours''' | ||
Classes: Classes in Java; Declaring a class; Class name; Super classes; Constructors; Creating instances of class; Inner classes. | Classes: Classes in Java; Declaring a class; Class name; Super classes; Constructors; Creating instances of class; Inner classes. | ||
| Line 1,155: | Line 1,091: | ||
'''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>'''Software Engineering'''</center> | <center>'''Software Engineering'''</center> | ||
=== Subject Code: 07MCA42I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
# '''Overview 6 Hours''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
# '''Overview 6 Hours''' | |||
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 Processes 6 Hours''' | # '''Critical Systems, Software Processes 6 Hours''' | ||
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 | # '''Requirements 7 Hours''' | ||
Software Requirements: Functional and Non-functional requirements; User requirements; System requirements; Interface specification; The software requirements document. | Software Requirements: Functional and Non-functional requirements; User requirements; System requirements; Interface specification; The software requirements document. | ||
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 Management 7 Hours''' | # '''System models, Project Management 7 Hours''' | ||
System Models: Context models; Behavioral models; Data models; Object models; Structured methods. | System Models: Context models; Behavioral models; Data models; Object models; Structured methods. | ||
Project Management: Management activities; Project planning; Project scheduling; Risk management. | Project Management: Management activities; Project planning; Project scheduling; Risk management. | ||
# '''Software Design | # '''Software Design 7 Hours''' | ||
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. | ||
# '''Development 6 Hours''' | # '''Development 6 Hours''' | ||
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 | # '''Verification and Validation 7 Hours ''' | ||
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''' | # '''Management''' '''6 Hours ''' | ||
Managing People: Selecting staff; Motivating people; Managing people; The People Capability Maturity Model. | Managing People: Selecting staff; Motivating people; Managing people; The People Capability Maturity Model. | ||
| Line 1,234: | Line 1,170: | ||
'''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. | ||
# Shari Lawrence Pfleeger, Joanne M. Atlee : Software Engineering Theory and Practice, 3<sup>rd</sup> Edition, Pearson Education, 2006. | # Shari Lawrence Pfleeger, Joanne M. Atlee : Software Engineering Theory and Practice, 3<sup>rd</sup> Edition, Pearson Education, 2006. | ||
# 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>'''Web Programming'''</center> | <center>'''Web Programming'''</center> | ||
=== Subject Code: 07MCA43I.A. Marks : 50 === | === Subject Code: 07MCA43I.A. Marks : 50 === | ||
'''Hours/Week : 04Exam Hours: 03''' | '''Hours/Week : 04Exam Hours: 03''' | ||
=== Total Hours : 52Exam Marks: 100 === | === Total Hours : 52Exam Marks: 100 === | ||
'''1. Fundamentals of Web, XHTML - 1 12 Hours''' | '''1. Fundamentals of Web, XHTML - 1 12 Hours''' | ||
Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; Security; The Web Programmers Toolbox. | Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; Security; The Web Programmers Toolbox. | ||
| Line 1,277: | Line 1,213: | ||
'''Text Books:''' | '''Text Books:''' | ||
# Robert W. Sebesta: Programming the World Wide Web, 4<sup>th </sup>Edition, Pearson Education, 2008. | # Robert W. Sebesta: Programming the World Wide Web, 4<sup>th </sup>Edition, Pearson Education, 2008. | ||
(Chapters 1 to 9) | (Chapters 1 to 9) | ||
'''Reference Books:''' | '''Reference Books:''' | ||
# M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to H program, 3<sup>rd</sup> Edition, Pearson Education / PHI, 2004. | # M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to H program, 3<sup>rd</sup> Edition, Pearson Education / PHI, 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>'''Design and Analysis of Algorithms'''</center> | <center>'''Design and Analysis of Algorithms'''</center> | ||
| Line 1,300: | Line 1,236: | ||
'''1. Introduction | '''1. Introduction 6 Hours''' | ||
Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamental data Structures | Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamental data Structures | ||
| Line 1,343: | Line 1,279: | ||
'''Text Books:''' | '''Text Books:''' | ||
# Anany Levitin: Introduction to the Design and Analysis of Algorithms, Pearson Education, 2003. | # Anany Levitin: Introduction to the Design and Analysis of Algorithms, Pearson Education, 2003. | ||
(Chapters 1.1-1.4, 2.1-2.5, 3.1, 3.2, 3.4, 4.1-4.5, 5.1-5.4, 6.1, 6.3, 6.4, 6.6, 7.1-7.3, 8.1, 8.2, 8.4, 9.1-9.4, 10.1-10.3, 11.1-11.3) | (Chapters 1.1-1.4, 2.1-2.5, 3.1, 3.2, 3.4, 4.1-4.5, 5.1-5.4, 6.1, 6.3, 6.4, 6.6, 7.1-7.3, 8.1, 8.2, 8.4, 9.1-9.4, 10.1-10.3, 11.1-11.3) | ||
'''Reference Books: ''' | '''Reference Books: ''' | ||
# Coremen T.H., Leiserson C.E., and Rivest R.L.: Introduction to Algorithms, PHI, 1998. | # Coremen T.H., Leiserson C.E., and Rivest R.L.: Introduction to Algorithms, PHI, 1998. | ||
# Horowitz E., Sahani S., Rajasekharan S.: Computer Algorithms, Galgotia Publications, 2001. | # Horowitz E., Sahani S., Rajasekharan S.: Computer Algorithms, Galgotia Publications, 2001. | ||
<center>'''Computer Graphics and Visualization '''</center> | <center>'''Computer Graphics and Visualization '''</center> | ||
=== Subject Code: 07MCA451I.A. Marks : 50 === | |||
== Hours/Week : 04Exam Hours: 03 == | |||
'''Total Hours : 52Exam Marks: 100''' | |||
# '''Introduction 7 Hours''' | |||
# '''Introduction 7 Hours''' | |||
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,413: | Line 1,349: | ||
3. Donald Hearn and Pauline Baker: Computer Graphics- C Version, 2<sup>nd</sup> Edition, Pearson Education / PHI, 2003. | 3. Donald Hearn and Pauline Baker: Computer Graphics- C Version, 2<sup>nd</sup> Edition, Pearson Education / PHI, 2003. | ||
<center>'''UNIX Systems Programming '''</center> | |||
=== Subject Code: 07MCA452I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
# '''Introduction 6 Hours''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
# '''Introduction | |||
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. | ||
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 | # '''UNIX Files 6 Hours''' | ||
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,432: | Line 1,368: | ||
'''3. UNIX File APIs 7 Hours''' | '''3. UNIX File APIs 7 Hours''' | ||
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 Hours''' | # '''UNIX Processes 7 Hours''' | ||
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,442: | Line 1,378: | ||
Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, waited, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times. | Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, waited, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times. | ||
Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp, and tcgetsid Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups. | Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp, and tcgetsid Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups. | ||
# '''Signals and Daemon Processes 7 Hours''' | # '''Signals and Daemon Processes 7 Hours''' | ||
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, Single-instance daemons; Daemon conventions; Client-Server Model. | Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Single-instance daemons; Daemon conventions; Client-Server Model. | ||
# '''Interprocess Communication - 1 | # '''Interprocess Communication - 1 6 Hours''' | ||
Introduction; Pipes, popen, pclose Functions; Coprocesses; FIFOs; XSI IPC; Message Queues; Semaphores. | Introduction; Pipes, popen, pclose Functions; Coprocesses; FIFOs; XSI IPC; Message Queues; Semaphores. | ||
# '''Network IPC: Sockets | # '''Network IPC: Sockets 6 Hours''' | ||
Introduction; Socket Descriptors; Addressing; Connection establishment; Data transfer; Socket options; Out-of-band data; Nonblocking and asynchronous I/O. | Introduction; Socket Descriptors; Addressing; Connection establishment; Data transfer; Socket options; Out-of-band data; Nonblocking and asynchronous I/O. | ||
'''Text Books:''' | '''Text Books:''' | ||
# Terrence Chan: Unix System Programming Using C++, Prentice-Hall of India / Pearson Education, 1999.. | # Terrence Chan: Unix System Programming Using C++, Prentice-Hall of India / Pearson Education, 1999.. | ||
(Chapters 1, 5, 6, 7, 8, 9) | (Chapters 1, 5, 6, 7, 8, 9) | ||
# W.Richard Stevens, Stephen A. Rago: Advanced Programming in the UNIX Environment, 2<sup>nd</sup> Edition, Pearson Education / Prentice-Hall of India, 2005. | # W.Richard Stevens, Stephen A. Rago: Advanced Programming in the UNIX Environment, 2<sup>nd</sup> Edition, Pearson Education / Prentice-Hall of India, 2005. | ||
(Chapters 7, 8, 9, 13, 15, 16) | (Chapters 7, 8, 9, 13, 15, 16) | ||
| Line 1,474: | Line 1,410: | ||
1. Marc J. Rochkind:''' '''Advanced UNIX Programming, 2<sup>nd</sup> Edition, Pearson Education, 2005. | 1. Marc J. Rochkind:''' '''Advanced UNIX Programming, 2<sup>nd</sup> Edition, Pearson Education, 2005. | ||
2. Maurice.J.Bach: The Design of the UNIX Operating System, Pearson Education / PHI, 1987. | 2. Maurice.J.Bach: The Design of the UNIX Operating System, Pearson Education / PHI, 1987. | ||
# Uresh Vahalia:''' '''UNIX Internals, Pearson Education, 2001. | # Uresh Vahalia:''' '''UNIX Internals, Pearson Education, 2001. | ||
<center>'''Multimedia Systems'''</center> | <center>'''Multimedia Systems'''</center> | ||
=== Subject Code: 07MCA453I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction, Media and Data Streams, Audio Technology 7 Hours''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction, Media and Data Streams, Audio Technology 7 Hours''' | |||
Multimedia Elements; Multimedia Applications; Multimedia Systems Architecture; Evolving Technologies for Multimedia Systems; Defining Objects for Multimedia Systems; Multimedia Data Interface Standards; The need for Data Compression; Multimedia Databases. | Multimedia Elements; Multimedia Applications; Multimedia Systems Architecture; Evolving Technologies for Multimedia Systems; Defining Objects for Multimedia Systems; Multimedia Data Interface Standards; The need for Data Compression; Multimedia Databases. | ||
| Line 1,499: | Line 1,435: | ||
Basics; Television Systems; Digitalization of Video Signals; Digital Television; Basic Concepts; Specification of Animations; Methods of Controlling Animation; Display of Animation; Transmission of Animation; Virtual Reality Modeling Language. | Basics; Television Systems; Digitalization of Video Signals; Digital Television; Basic Concepts; Specification of Animations; Methods of Controlling Animation; Display of Animation; Transmission of Animation; Virtual Reality Modeling Language. | ||
'''3'''. '''Data Compression - 1 | '''3'''. '''Data Compression - 1 6 Hours''' | ||
Storage Space; Coding Requirements; Source, Entropy, and Hybrid Coding; Basic Compression Techniques; JPEG: Image Preparation, Lossy Sequential DCT-based Mode, Expanded Lossy DCT-based Mode, Lossless Mode, Hierarchical Mode. | Storage Space; Coding Requirements; Source, Entropy, and Hybrid Coding; Basic Compression Techniques; JPEG: Image Preparation, Lossy Sequential DCT-based Mode, Expanded Lossy DCT-based Mode, Lossless Mode, Hierarchical Mode. | ||
'''4. Data Compression - 2 | '''4. Data Compression - 2 6 Hours''' | ||
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. | ||
'''5. Optical Storage Media | '''5. Optical Storage Media 6 Hours''' | ||
History of Optical Storage; Basic Technology; Video Discs and Other WORMs; Compact Disc Digital Audio; Compact Disc Read Only Memory; CD-ROM Extended Architecture; Further CD-ROM-Based Developments; Compact Disc Recordable; Compact Disc Magneto-Optical; Compact Disc Read/Write; Digital Versatile Disc. | History of Optical Storage; Basic Technology; Video Discs and Other WORMs; Compact Disc Digital Audio; Compact Disc Read Only Memory; CD-ROM Extended Architecture; Further CD-ROM-Based Developments; Compact Disc Recordable; Compact Disc Magneto-Optical; Compact Disc Read/Write; Digital Versatile Disc. | ||
| Line 1,515: | Line 1,451: | ||
Simple Vs. Complex Features; Analysis of Individual Images; Analysis of Image Sequences; Audio Analysis; Applications. | Simple Vs. Complex Features; Analysis of Individual Images; Analysis of Image Sequences; Audio Analysis; Applications. | ||
'''7. Data and File Format Standards | '''7. Data and File Format Standards 7 Hours''' | ||
Rich-Text Format; TIFF File Format; Resource Interchange File Format (RIFF); MIDI File Format; JPEG DIB File Format for Still and Motion Images; AVI Indeo File Format; MPEG Standards; TWAIN. | Rich-Text Format; TIFF File Format; Resource Interchange File Format (RIFF); MIDI File Format; JPEG DIB File Format for Still and Motion Images; AVI Indeo File Format; MPEG Standards; TWAIN. | ||
'''8. Multimedia Application Design | '''8. Multimedia Application Design 7 Hours''' | ||
Multimedia Application Classes; Types of Multimedia Systems; Virtual Reality Design; Components of Multimedia Systems; Organizing Multimedia Databases; Application Workflow Design Issues; Distributed Application Design Issues. | Multimedia Application Classes; Types of Multimedia Systems; Virtual Reality Design; Components of Multimedia Systems; Organizing Multimedia Databases; Application Workflow Design Issues; Distributed Application Design Issues. | ||
'''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. | ||
# Nalin K Sharad: Multimedia information Networking, PHI, 2002. | # Nalin K Sharad: Multimedia information Networking, PHI, 2002. | ||
<center>'''Pattern Recognition'''</center> | <center>'''Pattern Recognition'''</center> | ||
=== Subject Code: 07MCA454I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction 6 Hours''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction 6 Hours''' | |||
Machine perception, an example; Pattern Recognition System; The Design Cycle; Learning and Adaptation | Machine perception, an example; Pattern Recognition System; The Design Cycle; Learning and Adaptation | ||
| Line 1,559: | Line 1,495: | ||
Introduction; Maximum-likelihood estimation; Bayesian Estimation; Bayesian parameter estimation: Gaussian Case, general theory; Hidden Markov Models. | Introduction; Maximum-likelihood estimation; Bayesian Estimation; Bayesian parameter estimation: Gaussian Case, general theory; Hidden Markov Models. | ||
'''4. Non-parametric Techniques | '''4. Non-parametric Techniques 6 Hours''' | ||
Introduction; Density Estimation; Parzen windows; k<sub>n </sub>– Nearest- Neighbor Estimation; The Nearest- Neighbor Rule; Metrics and Nearest-Neighbor Classification. | Introduction; Density Estimation; Parzen windows; k<sub>n </sub>– Nearest- Neighbor Estimation; The Nearest- Neighbor Rule; Metrics and Nearest-Neighbor Classification. | ||
| Line 1,588: | Line 1,524: | ||
1. Earl Gose, Richard Johnsonbaugh, Steve Jost : Pattern Recognition and Image Analysis, Pearson Education / PHI, 2007. | 1. Earl Gose, Richard Johnsonbaugh, Steve Jost : Pattern Recognition and Image Analysis, Pearson Education / PHI, 2007. | ||
<center>'''Principles of User Interface Design'''</center> | |||
=== Subject Code: 07MCA455 I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
# '''Human Factors of Interactive Software, Theories, Principles and Guidelines 7 Hours''' | |||
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 Issue 6 Hours ===== | ||
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 | |||
# '''Tools and Environments 7 Hours''' | |||
# '''Tools and Environments 7 Hours''' | |||
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 Hours ===== | ===== Menus, Forms, Dialog Boxes and Commands 6 Hours ===== | ||
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. | ||
# '''Interaction Devices and Response Time | # '''Interaction Devices and Response Time 7 Hours''' | ||
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 Hours''' | # '''Presentation Styles, Manuals, Help, and Tutorials - 1 6 Hours''' | ||
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 | '''Multiple-Window Strategies, Hypermedia and the World Wide Web – 1 7 Hours''' | ||
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 | # '''Multiple-Window Strategies, Hypermedia and the World Wide Web – 2 6 Hours ''' | ||
Genres and Goals and Designers, Users and Their Tasks, Object-Action Interface Model for Web Site Design. | Genres and Goals and Designers, Users and Their Tasks, Object-Action Interface Model for Web Site Design. | ||
'''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. | ||
3. Wilber O Galitz: The Essential Guide to User Interface Design - An Introduction to GUI Design, Principles and Techniques, Wiley-Dreamtech India Pvt. Ltd, 1998. | 3. 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>'''Advanced Computer Networks'''</center> | <center>'''Advanced Computer Networks'''</center> | ||
| Line 1,697: | Line 1,633: | ||
'''Text Books:''' | '''Text Books:''' | ||
# Behrouz A. Forouzan, Data Communications and Networking, 4<sup>th</sup> Edition, Tata McGraw-Hill, 2006. | # Behrouz A. Forouzan, Data Communications and Networking, 4<sup>th</sup> Edition, Tata McGraw-Hill, 2006. | ||
(Chapters 2, 17, 18, 20.3, 20.4, 21.1, 21.2, 22.4, 23.4, 24, 29) | (Chapters 2, 17, 18, 20.3, 20.4, 21.1, 21.2, 22.4, 23.4, 24, 29) | ||
# Nader F. Mir: Computer and Communication Networks, Pearson, 2007. | # Nader F. Mir: Computer and Communication Networks, Pearson, 2007. | ||
(Chapters 19, 20 excluding 20.5) | (Chapters 19, 20 excluding 20.5) | ||
| Line 1,712: | Line 1,648: | ||
1. William Stallings , Data and Computer Communication, 5<sup>th</sup> Edition, Prentice Hall India. | 1. William Stallings , Data and Computer Communication, 5<sup>th</sup> Edition, Prentice Hall India. | ||
2. William A. Shay, Understanding Data Communications and Networks, 2<sup>nd</sup> Edition, Thomson. | 2. William A. Shay, Understanding Data Communications and Networks, 2<sup>nd</sup> Edition, Thomson. | ||
# Godbole, Data Communications and Networks, Tata McGraw-Hill 2002. | # Godbole, Data Communications and Networks, Tata McGraw-Hill 2002. | ||
# Micael A. Gallo & William M. Handcock, Computer | # Micael A. Gallo & William M. Handcock, Computer | ||
# Communications and Networking Technologies, 2003 Edition, Thomson. | # Communications and Networking Technologies, 2003 Edition, Thomson. | ||
<center>'''Java and J2EE Laboratory'''</center> | <center>'''Java and J2EE Laboratory'''</center> | ||
| Line 1,725: | Line 1,661: | ||
'''Total Hours: 42Exam Marks: 50''' | '''Total Hours: 42Exam Marks: 50''' | ||
# | # | ||
## | ## | ||
| Line 1,732: | Line 1,668: | ||
##### | ##### | ||
###### | ###### | ||
####### a) Write a JAVA Program to demonstrate Constructor Overloading and Method overloading. | ####### a) Write a JAVA Program to demonstrate Constructor Overloading and Method overloading. | ||
b) Write a JAVA Program to implement Inner class and demonstrate its Access Protections. | b) Write a JAVA Program to implement Inner class and demonstrate its Access Protections. | ||
# a) Write a JAVA Program to implement Inheritance. | # a) Write a JAVA Program to implement Inheritance. | ||
b) Write a JAVA Program to implement Exception Handling (Using Nested try catch and finally). | b) Write a JAVA Program to implement Exception Handling (Using Nested try catch and finally). | ||
# a) Write a JAVA Program to create an Interface and implement it in a class. | # a) Write a JAVA Program to create an Interface and implement it in a class. | ||
b) Write a JAVA Program to create a class (extending Thread) and use methods Thread class to change name, priority, ---- of the current Thread and display the same. | b) Write a JAVA Program to create a class (extending Thread) and use methods Thread class to change name, priority, ---- of the current Thread and display the same. | ||
# a) Write a JAVA Program to create a Scrolling Text using JAVA Applets. | # a) Write a JAVA Program to create a Scrolling Text using JAVA Applets. | ||
b)Write a JAVA Program to pass parameters to Applets and display the same. | b)Write a JAVA Program to pass parameters to Applets and display the same. | ||
# Write a JAVA Program to insert data into Student DATA BASE and retrieve info base on particular queries (Using JDBC Design Front end using Swings). | # Write a JAVA Program to insert data into Student DATA BASE and retrieve info base on particular queries (Using JDBC Design Front end using Swings). | ||
| Line 1,753: | Line 1,689: | ||
# Write a JAVA Servlet Program to implement a dynamic HTML using Servlet (user name and password should be accepted using HTML and displayed using a Servlet). | # Write a JAVA Servlet Program to implement a dynamic HTML using Servlet (user name and password should be accepted using HTML and displayed using a Servlet). | ||
# Write a JAVA Servlet Program to Download a file and display it on the screen (A link has to be provided in HTML, when the link is clicked corresponding file has to be displayed on Screen) | # Write a JAVA Servlet Program to Download a file and display it on the screen (A link has to be provided in HTML, when the link is clicked corresponding file has to be displayed on Screen) | ||
# a) Write a JAVA Servlet Program to implement RequestDispatcher object (use include() and forward() methods). | # a) Write a JAVA Servlet Program to implement RequestDispatcher object (use include() and forward() methods). | ||
b)Write a JAVA Servlet Program to implement and demonstrate get() and Post methods(Using HTTP Servlet Class). | b)Write a JAVA Servlet Program to implement and demonstrate get() and Post methods(Using HTTP Servlet Class). | ||
# Write a JAVA Servlet Program to implement sendRedirect() method(using HTTP Servlet Class). | # Write a JAVA Servlet Program to implement sendRedirect() method(using HTTP Servlet Class). | ||
# Write a JAVA Servlet Program to implement sessions (Using HTTP Session Interface). | # Write a JAVA Servlet Program to implement sessions (Using HTTP Session Interface). | ||
# a) Write a JAVA JSP Program to print 10 even and 10 odd number. | # a) Write a JAVA JSP Program to print 10 even and 10 odd number. | ||
b) Write a JAVA JSP Program to implement verification of a particular user login and display a welcome page. | b) Write a JAVA JSP Program to implement verification of a particular user login and display a welcome page. | ||
# Write a JAVA JSP Program to get student information through a HTML and create a JAVA Bean Class, populate Bean and display the same information through another JSP. | # Write a JAVA JSP Program to get student information through a HTML and create a JAVA Bean Class, populate Bean and display the same information through another JSP. | ||
<center>'''Web Programming Laboratory'''</center> | <center>'''Web Programming Laboratory'''</center> | ||
=== Subject Code: 07MCA47I.A. Marks : 50 === | |||
'''Hours/Week : 03Exam Hours: 03''' | |||
=== Total Hours : 42Exam Marks: 50 === | |||
'''Note: One exercise must be asked in the examination. ''' | |||
=== Total Hours : 42Exam Marks: 50 === | |||
'''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.''' | ||
# <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 | ||
| Line 1,787: | Line 1,723: | ||
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 1,824: | Line 1,760: | ||
# 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>'''ALGORITHMS LABORATORY'''</center> | <center>'''ALGORITHMS LABORATORY'''</center> | ||
=== Subject Code: Marks : 50 === | |||
=== Total Hours : 42Exam Marks: 50 === | |||
'''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. | ||
# a. Obtain the Topological ordering of vertices in a given digraph. | # a. Obtain the Topological ordering of vertices in a given digraph. | ||
b. Implement All Pair Shortest paths problem using Floyd's algorithm. | b. Implement All Pair Shortest paths problem using Floyd's algorithm. | ||
# Implement 0/1 Knapsack problem using dynamic programming. | # Implement 0/1 Knapsack problem using dynamic programming. | ||
| Line 1,846: | Line 1,782: | ||
# 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 algorithm. | # Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm. | ||
# a. Print all the nodes reachable from a given starting node in a digraph using BFS method. | # a. Print all the nodes reachable from a given starting node in a digraph using BFS method. | ||
b. Check whether a given graph is connected or not using DFS method. | b. Check whether a given graph is connected or not using DFS method. | ||
# Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution. | # Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution. | ||
# a. Implement Horspool algorithm for String Matching. | # a. Implement Horspool algorithm for String Matching. | ||
b. Find the Binomial Co-efficient using Dynamic Programming. | b. Find the Binomial Co-efficient using Dynamic Programming. | ||
# Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm. | # Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm. | ||
# a. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem. | # a. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem. | ||
b. Compute the transitive closure of a given directed graph using Warshall's algorithm. | b. Compute the transitive closure of a given directed graph using Warshall's algorithm. | ||
# Implement N Queen's problem using Back Tracking. | # Implement N Queen's problem using Back Tracking. | ||
'''Note: In the examination questions must be given based on lots. ''' | '''Note: In the examination questions must be given based on lots. ''' | ||
<center>'''V SEMESTER'''</center> | |||
<center>''' | |||
<center>'''Object-Oriented Modeling and Design Patterns'''</center> | |||
=== Subject Code: 07MCA51I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
<center>'''PART – A'''</center> | |||
=== Total Hours : 52Exam Marks: 100 === | |||
<center>'''PART – A'''</center> | |||
| Line 1,886: | Line 1,822: | ||
Class Modeling: Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of class models; Practical tips. | Class Modeling: Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of class models; Practical tips. | ||
'''2. Advanced Class Modeling, State Modeling | '''2. Advanced Class Modeling, State Modeling 6 Hours''' | ||
Advanced object and class concepts; Association ends; N-ary associations; Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages; Practical tips. | Advanced object and class concepts; Association ends; N-ary associations; Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages; Practical tips. | ||
| Line 1,908: | Line 1,844: | ||
Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis. | Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis. | ||
'''5. Application Analysis, System Design | '''5. Application Analysis, System Design 7 Hours''' | ||
Application Analysis: Application interaction model; Application class model; Application state model; Adding operations. | Application Analysis: Application interaction model; Application class model; Application state model; Adding operations. | ||
| Line 1,922: | Line 1,858: | ||
Legacy Systems: Reverse engineering; Building the class models; Building the interaction model; Building the state model; Reverse engineering tips; Wrapping; Maintenance. | Legacy Systems: Reverse engineering; Building the class models; Building the interaction model; Building the state model; Reverse engineering tips; Wrapping; Maintenance. | ||
'''7. Design Patterns, Idioms | '''7. Design Patterns, Idioms 12 Hours''' | ||
What is a pattern and what makes a pattern? Pattern categories; Relationships between patterns; Pattern description; Communication Patterns: Forwarder-Receiver; Client-Dispatcher-Server; Publisher-Subscriber; Management Patterns: Command processor; View Handler; Idioms: Introduction; What can idioms provide? Idioms and style; Where to find idioms; Counted Pointer example. | What is a pattern and what makes a pattern? Pattern categories; Relationships between patterns; Pattern description; Communication Patterns: Forwarder-Receiver; Client-Dispatcher-Server; Publisher-Subscriber; Management Patterns: Command processor; View Handler; Idioms: Introduction; What can idioms provide? Idioms and style; Where to find idioms; Counted Pointer example. | ||
| Line 1,952: | Line 1,888: | ||
6. Simon Bennett, Steve McRobb and Ray Farmer: Object-Oriented Systems Analysis and Design Using UML, 2<sup>nd</sup> Edition, Tata McGraw-Hill, 2002. | 6. Simon Bennett, Steve McRobb and Ray Farmer: Object-Oriented Systems Analysis and Design Using UML, 2<sup>nd</sup> Edition, Tata McGraw-Hill, 2002. | ||
<center>'''System Modeling and Simulation'''</center> | <center>'''System Modeling and Simulation'''</center> | ||
| Line 1,963: | Line 1,899: | ||
'''1. Introduction | '''1. Introduction 8 Hours''' | ||
When simulation is the appropriate tool and when it is not appropriate; Advantages and disadvantages of Simulation; Areas of application; Systems and system environment; Components of a system; Discrete and continuous systems; Model of a system; Types of Models; Discrete-Event System Simulation; Steps in a Simulation Study. | When simulation is the appropriate tool and when it is not appropriate; Advantages and disadvantages of Simulation; Areas of application; Systems and system environment; Components of a system; Discrete and continuous systems; Model of a system; Types of Models; Discrete-Event System Simulation; Steps in a Simulation Study. | ||
| Line 1,973: | Line 1,909: | ||
Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance Algorithm, World Views, Manual simulation Using Event Scheduling; List processing. | Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance Algorithm, World Views, Manual simulation Using Event Scheduling; List processing. | ||
Simulation in Java; Simulation in GPSS. | Simulation in Java; Simulation in GPSS. | ||
'''3. Statistical Models in Simulation | '''3. Statistical Models in Simulation 6 Hours''' | ||
Review of terminology and concepts; Useful statistical models; Discrete distributions; Continuous distributions; Poisson process; Empirical distributions. | Review of terminology and concepts; Useful statistical models; Discrete distributions; Continuous distributions; Poisson process; Empirical distributions. | ||
| Line 1,989: | Line 1,925: | ||
Random-Variate Generation: Inverse transform technique; Acceptance-Rejection technique; Special properties. | Random-Variate Generation: Inverse transform technique; Acceptance-Rejection technique; Special properties. | ||
'''6. Input Modeling | '''6. Input Modeling 6 Hours ''' | ||
Data Collection; Identifying the distribution with data; Parameter estimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process; Selecting input models without data; Multivariate and Time-Series input models'''. ''' | Data Collection; Identifying the distribution with data; Parameter estimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process; Selecting input models without data; Multivariate and Time-Series input models'''. ''' | ||
'''7. Output Analysis for a Single Model | '''7. Output Analysis for a Single Model 6 Hours ''' | ||
Types of simulations with respect to output analysis; Stochastic nature of output data; Measures of performance and their estimation; Output analysis for terminating simulations; Output analysis for steady-state simulations. | Types of simulations with respect to output analysis; Stochastic nature of output data; Measures of performance and their estimation; Output analysis for terminating simulations; Output analysis for steady-state simulations. | ||
'''8. Verification and Validation of Simulation Models, Optimization | '''8. Verification and Validation of Simulation Models, Optimization 6 Hours ''' | ||
Model building, verification and validation; Verification of simulation models; Calibration and validation of models, Optimization via Simulation | Model building, verification and validation; Verification of simulation models; Calibration and validation of models, Optimization via Simulation | ||
'''Text Books''': | '''Text Books''': | ||
| Line 2,010: | Line 1,946: | ||
'''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>'''Topics in Enterprise Architecture - 2'''</center> | <center>'''Topics in Enterprise Architecture - 2'''</center> | ||
=== Subject Code: 07MCA53I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== | === Total Hours : 52Exam Marks: 100 === | ||
'''Hours | # '''The philosophy of .NET ''''''6 Hours''' | ||
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 Hours''' | |||
# | 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 Hours''' | |||
# '''C# Language Fundamentals. | |||
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. | ||
'''4. Object- Oriented Programming with C# | '''4. Object- Oriented Programming with C# 6 Hours''' | ||
Forms Defining of the C# Class, Definition the “Default Public Interface” of a Type, Recapping the Pillars of OOP, The First Pillars: C#’s Encapsulation Services, Pseudo- Encapsulation: Creating Read-Only Fields, The Second Pillar: C#’s Inheritance Supports, keeping Family Secrets: The “ Protected” Keyword, Nested Type Definitions, The Third Pillar: C #’s Polymorphic Support, Casting Between . | Forms Defining of the C# Class, Definition the “Default Public Interface” of a Type, Recapping the Pillars of OOP, The First Pillars: C#’s Encapsulation Services, Pseudo- Encapsulation: Creating Read-Only Fields, The Second Pillar: C#’s Inheritance Supports, keeping Family Secrets: The “ Protected” Keyword, Nested Type Definitions, The Third Pillar: C #’s Polymorphic Support, Casting Between . | ||
# '''Exceptions and Object Lifetime. | # '''Exceptions and Object Lifetime. 6 Hours''' | ||
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. | ||
'''6. Interfaces and Collections | '''6. Interfaces and Collections 6 Hours ''' | ||
Defining Interfaces Using C# Invoking Interface Members at the object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation, Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing, Implementation, Interfaces Using VS .NET, understanding the IConvertible Interface, Building a Custom Enumerator (IEnumerable and Enumerator), Building Cloneable objects ( ICloneable), Building Comparable Objects ( I Comparable ), Exploring the system. Collections Namespace, Building a Custom Container (Retrofitting the Cars Type). | Defining Interfaces Using C# Invoking Interface Members at the object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation, Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing, Implementation, Interfaces Using VS .NET, understanding the IConvertible Interface, Building a Custom Enumerator (IEnumerable and Enumerator), Building Cloneable objects ( ICloneable), Building Comparable Objects ( I Comparable ), Exploring the system. Collections Namespace, Building a Custom Container (Retrofitting the Cars Type). | ||
'''7. Callback Interfaces, Delegates, and Events, Advanced Techniques | '''7. Callback Interfaces, Delegates, and Events, Advanced Techniques 8 Hours''' | ||
Understanding Callback Interfaces, Understanding the .NET Delegate Type, Members of System. Multicast Delegate, The Simplest Possible Delegate Example, , Building More a Elaborate Delegate Example, Understanding Asynchronous Delegates, Understanding (and Using)Events. | Understanding Callback Interfaces, Understanding the .NET Delegate Type, Members of System. Multicast Delegate, The Simplest Possible Delegate Example, , Building More a Elaborate Delegate Example, Understanding Asynchronous Delegates, Understanding (and Using)Events. | ||
| Line 2,052: | Line 1,988: | ||
The Advances Keywords of C#, A Catalog of C# Keywords Building a Custom Indexer, A Variation of the Cars Indexer Internal Representation of Type Indexer . Using C# Indexer from VB .NET. Overloading operators, The Internal Representation of Overloading Operators, interacting with Overload Operator from Overloaded- Operator- Challenged Languages, Creating Custom Conversion Routines, Defining Implicit Conversion Routines, The Internal Representations of Customs Conversion Routines | The Advances Keywords of C#, A Catalog of C# Keywords Building a Custom Indexer, A Variation of the Cars Indexer Internal Representation of Type Indexer . Using C# Indexer from VB .NET. Overloading operators, The Internal Representation of Overloading Operators, interacting with Overload Operator from Overloaded- Operator- Challenged Languages, Creating Custom Conversion Routines, Defining Implicit Conversion Routines, The Internal Representations of Customs Conversion Routines | ||
'''8. Understanding .NET Assembles | '''8. Understanding .NET Assembles 6 Hours''' | ||
Problems with Classic COM Binaries, An Overview of .NET Assembly, Building a Simple File Test Assembly, A C#. Client Application, A Visual Basic .NET Client Application, Cross Language Inheritance, Exploring the CarLibrary’s, Manifest, Exploring the CarLibrary’s Types, Building the Multifile Assembly ,Using Assembly, Understanding Private Assemblies, Probing for Private Assemblies (The Basics), Private A Assemblies XML Configurations Files, Probing for Private Assemblies ( The Details), Understanding Shared Assembly, Understanding Shared Names, Building a Shared Assembly, Understanding Delay Signing, Installing/Removing Shared Assembly, Using a Shared Assembly | Problems with Classic COM Binaries, An Overview of .NET Assembly, Building a Simple File Test Assembly, A C#. Client Application, A Visual Basic .NET Client Application, Cross Language Inheritance, Exploring the CarLibrary’s, Manifest, Exploring the CarLibrary’s Types, Building the Multifile Assembly ,Using Assembly, Understanding Private Assemblies, Probing for Private Assemblies (The Basics), Private A Assemblies XML Configurations Files, Probing for Private Assemblies ( The Details), Understanding Shared Assembly, Understanding Shared Names, Building a Shared Assembly, Understanding Delay Signing, Installing/Removing Shared Assembly, Using a Shared Assembly | ||
'''Text Books: ''' | '''Text Books: ''' | ||
# 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. | ||
(Programming Examples 3.7, 3.10, 5.5, 6.1, 7.2, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3, 8.5, 87, 8.8, 9.1, 9.2, 9.3, 9.4, 10.2, 10.4, 11.2, 11.4, 12.1, 12.4, 12.5, 12.6, 13.1, 13.2, 13.3, 13.6, 14.1, 14.2, 14.4, 15.2, 15.3, 16.1, 16.2, 16.3, 18.3, 18.5.18.6.) | (Programming Examples 3.7, 3.10, 5.5, 6.1, 7.2, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3, 8.5, 87, 8.8, 9.1, 9.2, 9.3, 9.4, 10.2, 10.4, 11.2, 11.4, 12.1, 12.4, 12.5, 12.6, 13.1, 13.2, 13.3, 13.6, 14.1, 14.2, 14.4, 15.2, 15.3, 16.1, 16.2, 16.3, 18.3, 18.5.18.6.) | ||
'''Reference Books: ''' | '''Reference Books: ''' | ||
# Tom Archer: Inside C#, WP Publishers, 2001. | # Tom Archer: Inside C#, WP Publishers, 2001. | ||
# Herbert Schildt: The Complete Reference C#, , Tata McGraw Hill, 2004. | # Herbert Schildt: The Complete Reference C#, , Tata McGraw Hill, 2004. | ||
<center>'''Information Retrieval'''</center> | <center>'''Information Retrieval'''</center> | ||
| Line 2,082: | Line 2,018: | ||
'''Total Hours: 52Exam Marks: 100''' | '''Total Hours: 52Exam Marks: 100''' | ||
# '''Introduction, Retrieval Strategies - 1 | # '''Introduction, Retrieval Strategies - 1 7 Hours''' | ||
Introduction; Retrieval Strategies: Vector Space Model; Probabilistic Retrieval strategies | Introduction; Retrieval Strategies: Vector Space Model; Probabilistic Retrieval strategies | ||
| Line 2,089: | Line 2,025: | ||
'''2'''. '''Retrieval Strategies – 2 6 Hours''' | '''2'''. '''Retrieval Strategies – 2 6 Hours''' | ||
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 Utilities 7 Hours''' | # '''Retrieval Utilities 7 Hours''' | ||
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 Searching 6 Hours''' | # '''Indexing and Searching 6 Hours''' | ||
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. | ||
# '''Cross-Language Information Retrieval and Efficiency 6 Hours''' | # '''Cross-Language Information Retrieval and Efficiency 6 Hours''' | ||
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 Text 6 Hours''' | # '''Integrating Structured Data and Text 6 Hours''' | ||
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 Retrieval | # '''Parallel Information Retrieval, Distributed Information Retrieval 7 Hours''' | ||
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 2,116: | Line 2,052: | ||
'''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 & Algorithms, Prentice Hall PTR, 1992. | # William B. Frakes, Ricardo Baeza-Yates (Editors):Information Retrieval Data Structures & Algorithms, Prentice Hall PTR, 1992. | ||
<center>'''Data Mining'''</center> | <center>'''Data Mining'''</center> | ||
=== Subject Code: 07MCA542I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction, Data - 1''' '''6 Hours''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction, Data - 1''' | |||
What is Data Mining? Motivating Challenges; The origins of data mining; Data Mining Tasks. Types of Data; Data Quality. | What is Data Mining? Motivating Challenges; The origins of data mining; Data Mining Tasks. Types of Data; Data Quality. | ||
| Line 2,186: | Line 2,122: | ||
1. K.P.Soman, Shyam Diwakar, V.Ajay: Insight into Data Mining – Theory and Practice, PHI, 2006. | 1. K.P.Soman, Shyam Diwakar, V.Ajay: Insight into Data Mining – Theory and Practice, PHI, 2006. | ||
<center>'''Supply Chain Management'''</center> | |||
=== Subject Code: 07MCA543I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
= 1. Introduction to Supply Chain, Performance of Supply Chain 6 Hours = | |||
===== 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. | |||
=== | ===== 2. Supply Cain drivers and Obstacles, Designing Distribution Network 6 Hours ===== | ||
===== 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. | |||
===== 3. Network Design 7 Hours ===== | |||
== The role of network design in the Supply Chain; Factors influencing Network design Decisions; A framework for Network Design Decisions; Models for facility Location and Capacity Allocation; making Network Design decisions in practice. == | |||
== The impact of uncertainty on Network design; Discounted cash flow analysis; Representations of uncertainty; Evaluating Network Design decisions using Decision Trees; Making Supply Chain decisions under uncertainty in practice. == | |||
== 4. Demand Forecasting, Aggregate Planning 7 Hours == | |||
= The role of forecasting in a Supply Chain; Characteristics of forecast; Components of a forecast and forecasting methods; Basic approach of Demand forecasting; Time series forecasting methods; Measures of forecast errors; The role of aggregate planning in a supply Chain; The aggregate planning problem; Aggregate planning strategies. = | |||
= 5. Inventory Management 6 Hours = | |||
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. | |||
===== 3. Network Design | |||
== The role of network design in the Supply Chain; Factors influencing Network design Decisions; A framework for Network Design Decisions; Models for facility Location and Capacity Allocation; making Network Design decisions in practice. == | |||
== The impact of uncertainty on Network design; Discounted cash flow analysis; Representations of uncertainty; Evaluating Network Design decisions using Decision Trees; Making Supply Chain decisions under uncertainty in practice. | |||
== 4. Demand Forecasting, Aggregate Planning 7 Hours == | |||
= The role of forecasting in a Supply Chain; Characteristics of forecast; Components of a forecast and forecasting methods; Basic approach of Demand forecasting; Time series forecasting methods; Measures of forecast errors; The role of aggregate planning in a supply Chain; The aggregate planning problem; Aggregate planning strategies. | |||
= 5. Inventory Management 6 Hours = | |||
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. Transportation 7 Hours = | = 6. Transportation 7 Hours = | ||
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, Coordination 7 Hours = | = 7. Pricing and Revenue Management, Coordination 7 Hours = | ||
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. | ||
== 8. IT, Internet and Supply Chain 6 Hours == | == 8. IT, Internet and Supply Chain 6 Hours == | ||
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 | ||
'''Text Books :''' | '''Text Books :''' | ||
# 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) | ||
'''Reference Books:''' | '''Reference Books:''' | ||
# David Simchi-Levi, Philp Kaminky, Edith Simchi-Levi: Designing and Managing The Supply Chain Concepts, Strategies & Case Studies, 3<sup>rd</sup> Edition, tata McGraw Hill, 2003. | # David Simchi-Levi, Philp Kaminky, Edith Simchi-Levi: Designing and Managing The Supply Chain Concepts, Strategies & Case Studies, 3<sup>rd</sup> Edition, tata McGraw Hill, 2003. | ||
# R.P. Mohanty, S.G. Deshmukh: Supply Chain Management Theories & Practices, Bizmantra, 2005. | # R.P. Mohanty, S.G. Deshmukh: Supply Chain Management Theories & 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 2,241: | Line 2,177: | ||
4. M Martin Christopher: Logistics and Supply Chain Management, 2<sup>nd</sup> Edition, Pearson Education, 1998. | 4. M Martin Christopher: Logistics and Supply Chain Management, 2<sup>nd</sup> Edition, Pearson Education, 1998. | ||
<center>'''Network Management'''</center> | <center>'''Network Management'''</center> | ||
| Line 2,254: | Line 2,190: | ||
'''1. Introduction 7 Hours ''' | '''1. Introduction 7 Hours ''' | ||
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 Language 6 Hours = | = 2. Basic Foundations: Standards, Models, and Language 6 Hours = | ||
== 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 | '''3. SNMPv1 Network Management - 1 6 Hours''' | ||
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 2,272: | Line 2,208: | ||
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 Networks 6 Hours''' | '''6. Broadband Network Management: ATM Networks 6 Hours''' | ||
== 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 Management 6 Hours''' | '''7. Broadband Network Management 6 Hours''' | ||
== 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 Applications 8 Hours == | == 8. Network Management Applications 8 Hours == | ||
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 2,291: | Line 2,227: | ||
1. J. Richard Burke: Network management Concepts and Practices: a Hands-On Approach, PHI, 2008. | 1. J. Richard Burke: Network management Concepts and Practices: a Hands-On Approach, PHI, 2008. | ||
<center>'''Compiler Design'''</center> | <center>'''Compiler Design'''</center> | ||
| Line 2,331: | Line 2,267: | ||
Storage Organization; Stack allocation of space; Access to non-local data on the stack; Heap management; Introduction to garbage collection. | Storage Organization; Stack allocation of space; Access to non-local data on the stack; Heap management; Introduction to garbage collection. | ||
'''8. Code Generation | '''8. Code Generation 6 Hours''' | ||
Issues in the design of Code Generator; The Target language; Addresses in the target code; Basic blocks and Flow graphs; Optimization of basic blocks; A Simple Code Generator. | Issues in the design of Code Generator; The Target language; Addresses in the target code; Basic blocks and Flow graphs; Optimization of basic blocks; A Simple Code Generator. | ||
| Line 2,343: | Line 2,279: | ||
'''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. | ||
# Andrew W Apple: Modern Compiler Implementation in C, Cambridge University Press, 1997. | # Andrew W Apple: Modern Compiler Implementation in C, Cambridge University Press, 1997. | ||
# Kenneth C Louden: Compiler Construction Principles & Practice, Thomson Education, 1997. | # Kenneth C Louden: Compiler Construction Principles & Practice, Thomson Education, 1997. | ||
<center>'''Software Architectures'''</center> | <center>'''Software Architectures'''</center> | ||
=== Subject Code: 07MCA546I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction 6 Hours''' | |||
=== Total Hours : 52Exam Marks: 100 === | |||
'''1. Introduction 6 Hours''' | |||
The Architecture Business Cycle: Where do architectures come from? Software processes and the architecture business cycle; What makes a “good” architecture? What software architecture is and what it is not; Other points of view; Architectural patterns, reference models and reference architectures; Importance of software architecture; Architectural structures and views. | The Architecture Business Cycle: Where do architectures come from? Software processes and the architecture business cycle; What makes a “good” architecture? What software architecture is and what it is not; Other points of view; Architectural patterns, reference models and reference architectures; Importance of software architecture; Architectural structures and views. | ||
| Line 2,372: | Line 2,308: | ||
Achieving Quality: Introducing tactics; Availability tactics; Modifiability tactics; Performance tactics; Security tactics; Testability tactics; Usability tactics; Relationship of tactics to architectural patterns; Architectural patterns and styles. | Achieving Quality: Introducing tactics; Availability tactics; Modifiability tactics; Performance tactics; Security tactics; Testability tactics; Usability tactics; Relationship of tactics to architectural patterns; Architectural patterns and styles. | ||
'''4. Architectural Patterns | '''4. Architectural Patterns 20 Hours''' | ||
Introduction; From mud to structure: Layers, Pipes and Filters, Blackboard. | Introduction; From mud to structure: Layers, Pipes and Filters, Blackboard. | ||
| Line 2,412: | Line 2,348: | ||
'''Web site for Patterns:''' [http://www.hillside.net/patterns/ http://www.hillside.net/patterns/] | '''Web site for Patterns:''' [http://www.hillside.net/patterns/ http://www.hillside.net/patterns/] | ||
<center>'''Information and Network Security'''</center> | |||
=== Subject Code: 07MCA551I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Subject Code: 07MCA551I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | === Total Hours : 52Exam Marks: 100 === | ||
# '''Planning for Security 6 Hours''' | # '''Planning for Security 6 Hours''' | ||
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 12 Hours''' | # '''Security Technology 12 Hours''' | ||
Introduction; Physical design; Firewalls; Protecting Remote Connections. | Introduction; Physical design; Firewalls; Protecting Remote Connections. | ||
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. | ||
# '''Cryptography 8 Hours''' | # '''Cryptography 8 Hours''' | ||
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. | ||
# '''Introduction to Network Security, Authentication Applications | # '''Introduction to Network Security, Authentication Applications 8 Hours''' | ||
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 Security 6 Hours''' | # '''Electronic Mail Security 6 Hours''' | ||
Pretty Good Privacy (PGP); S/MIME. | Pretty Good Privacy (PGP); S/MIME. | ||
| Line 2,446: | Line 2,382: | ||
'''7. IP Security 6 Hours''' | '''7. IP Security 6 Hours''' | ||
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 Security 6 Hours''' | # '''Web Security 6 Hours''' | ||
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) | ||
# William Stallings: Network Security Essentials: Applications and Standards, Pearson Education, 2000. | # William Stallings: Network Security Essentials: Applications and Standards, Pearson Education, 2000. | ||
(Chapters: 1, 4, 5, 6, 7, 8) | (Chapters: 1, 4, 5, 6, 7, 8) | ||
| Line 2,468: | Line 2,404: | ||
1. Behrouz A. Forouzan: Cryptography and Network Security, Special Indian Edition, Tata McGraw-Hill, 2007. | 1. Behrouz A. Forouzan: Cryptography and Network Security, Special Indian Edition, Tata McGraw-Hill, 2007. | ||
<center>'''Software Testing'''</center> | <center>'''Software Testing'''</center> | ||
| Line 2,478: | Line 2,414: | ||
'''Total Hours: 52 Exam Marks: 100''' | '''Total Hours: 52 Exam Marks: 100''' | ||
'''1. Basics of Software Testing | '''1. Basics of Software Testing 12 Hours''' | ||
Human Errors and Testing; Software Quality; Requirements, Behavior and Correctness; Correctness versus Reliability; Testing and Debugging; Test Metrics; Software and Hardware Testing; Testing and Verification; Defect Management; Execution History; | Human Errors and Testing; Software Quality; Requirements, Behavior and Correctness; Correctness versus Reliability; Testing and Debugging; Test Metrics; Software and Hardware Testing; Testing and Verification; Defect Management; Execution History; | ||
| Line 2,519: | Line 2,455: | ||
2. Mauro Pezze, Michal Young: Software Testing and Analysis – Process, Principles and | 2. Mauro Pezze, Michal Young: Software Testing and Analysis – Process, Principles and | ||
Techniques, John Wiley & Sons, 2008. | Techniques, John Wiley & Sons, 2008. | ||
(Chapters 4, 6, 9, 12, 13, 17, 21, 22) | (Chapters 4, 6, 9, 12, 13, 17, 21, 22) | ||
| Line 2,532: | Line 2,468: | ||
3. Brian Marrick:The Craft of Software Testing, Pearson, 1995. | 3. Brian Marrick:The Craft of Software Testing, Pearson, 1995. | ||
<center>'''Services Oriented Architecture'''</center> | <center>'''Services Oriented Architecture'''</center> | ||
| Line 2,583: | Line 2,519: | ||
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>'''Mobile Computing'''</center> | <center>'''Mobile Computing'''</center> | ||
| Line 2,600: | Line 2,536: | ||
GSM – Services and System Architectures, Radio Interfaces, Protocols, Localization, Calling, Handover, General Packet Radio Service | GSM – Services and System Architectures, Radio Interfaces, Protocols, Localization, Calling, Handover, General Packet Radio Service | ||
'''2. Wireless Medium Access Control and CDMA – based Communication | '''2. Wireless Medium Access Control and CDMA – based Communication 6 Hours''' | ||
Medium Access Control, Introduction to CDMA – based Systems, OFDM | Medium Access Control, Introduction to CDMA – based Systems, OFDM | ||
| Line 2,628: | Line 2,564: | ||
Wireless LAN (WiFi) Architecture and Protocol Layers, WAP 1.1 and WAP 2.0 Architectures, Bluetooth – enabled Devices Network, Zigbee. | Wireless LAN (WiFi) Architecture and Protocol Layers, WAP 1.1 and WAP 2.0 Architectures, Bluetooth – enabled Devices Network, Zigbee. | ||
'''8. Mobile Application languages – XML, Java, J2ME and JavaCard, Mobile Operating Systems | '''8. Mobile Application languages – XML, Java, J2ME and JavaCard, Mobile Operating Systems 7 Hours''' | ||
Introduction, XML, JAVA, Java 2 Micro Edition (J2ME), JavaCard | Introduction, XML, JAVA, Java 2 Micro Edition (J2ME), JavaCard | ||
| Line 2,635: | Line 2,571: | ||
'''Text Book:''' | '''Text Book:''' | ||
# 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. | ||
4. Schiller: Mobile Communication, Pearson Publication, 2004. | 4. Schiller: Mobile Communication, Pearson Publication, 2004. | ||
<center>'''Artificial Intelligence'''</center> | |||
=== Subject Code: 07MCA555I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Subject Code: 07MCA555I.A. Marks : 50 === | |||
'''Hours/Week : 04Exam Hours: 03''' | |||
=== Total Hours : 52Exam Marks: 100 === | === Total Hours : 52Exam Marks: 100 === | ||
'''1. Introduction | '''1. Introduction 7 Hours''' | ||
What is AI? Intelligent Agents: Agents and environment; Rationality; the nature of environment; the structure of agents. Problem-solving: Problem-solving agents; Example problems; Searching for solution; Uninformed search strategies. | What is AI? Intelligent Agents: Agents and environment; Rationality; the nature of environment; the structure of agents. Problem-solving: Problem-solving agents; Example problems; Searching for solution; Uninformed search strategies. | ||
'''2. Informed Search, Exploration, Constraint Satisfaction, Adversial Search | '''2. Informed Search, Exploration, Constraint Satisfaction, Adversial Search 7 Hours''' | ||
Informed search strategies; Heuristic functions; On-line search agents and unknown environment. Constraint satisfaction problems; Backtracking search for CSPs. Adversial search: Games; Optimal decisions in games; Alpha-Beta pruning. | Informed search strategies; Heuristic functions; On-line search agents and unknown environment. Constraint satisfaction problems; Backtracking search for CSPs. Adversial search: Games; Optimal decisions in games; Alpha-Beta pruning. | ||
| Line 2,683: | Line 2,619: | ||
Probabilistic Reasoning: Representing knowledge in an uncertain domain; The semantics of Bayesian networks; Efficient representation of conditional distributions; Exact inference in Bayesian networks. | Probabilistic Reasoning: Representing knowledge in an uncertain domain; The semantics of Bayesian networks; Efficient representation of conditional distributions; Exact inference in Bayesian networks. | ||
'''7. Learning, AI: Present and Future | '''7. Learning, AI: Present and Future 6 Hours''' | ||
Learning: Forms of Learning; Inductive learning; Learning decision trees; Ensemble learning; Computational learning theory. | Learning: Forms of Learning; Inductive learning; Learning decision trees; Ensemble learning; Computational learning theory. | ||
| Line 2,703: | Line 2,639: | ||
2. Nils J. Nilsson: Principles of Artificial Intelligence, Elsevier, 1980. | 2. Nils J. Nilsson: Principles of Artificial Intelligence, Elsevier, 1980. | ||
<center>'''Web 2.0 and Rich Internet Applications'''</center> | <center>'''Web 2.0 and Rich Internet Applications'''</center> | ||
| Line 2,713: | Line 2,649: | ||
'''Total Hours: 52Exam Marks: 100''' | '''Total Hours: 52Exam Marks: 100''' | ||
# '''Introduction, Web Services 8 Hours''' | # '''Introduction, Web Services 8 Hours''' | ||
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 2,730: | Line 2,666: | ||
Flash player, Flex framework, MXML and Actionscript, Working with Data services, Understanding differences between HTML and Flex applications, Understanding how Flex applications work, Understanding Flex and Flash authoring, MXML language, a simple example. | Flash player, Flex framework, MXML and Actionscript, Working with Data services, Understanding differences between HTML and Flex applications, Understanding how Flex applications work, Understanding Flex and Flash authoring, MXML language, a simple example. | ||
Using Actionscript, MXML and Actionscript correlations. Understanding Actionscript 3.0 language syntax: Language overview, Objects and Classes, Packages and namespaces, Variables & 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 & 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 | ||
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. | ||
| Line 2,738: | Line 2,674: | ||
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 | # '''Building Advanced Web 2.0 applications 8 Hours''' | ||
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 2,767: | Line 2,703: | ||
# 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>'''Software Design Laboratory'''</center> | <center>'''Software Design Laboratory'''</center> | ||
| Line 2,781: | Line 2,717: | ||
The student has to draw the necessary UML diagrams using any suitable UML Drawing Tool and implement in Java OR C++ OR C# a program to demonstrate the Design Pattern specified by the Examiner. | The student has to draw the necessary UML diagrams using any suitable UML Drawing Tool and implement in Java OR C++ OR C# a program to demonstrate the Design Pattern specified by the Examiner. | ||
'''The Design Pattern is allotted based on lots from the following list:''' | '''The Design Pattern is allotted based on lots from the following list:''' | ||
# Expert | # Expert | ||
| Line 2,791: | Line 2,727: | ||
# Proxy | # Proxy | ||
# Façade | # Façade | ||
# Polymorphism | # Polymorphism | ||
<center>'''.Net Laboratory'''</center> | <center>'''.Net Laboratory'''</center> | ||
| Line 2,839: | Line 2,775: | ||
18. Demonstrate arrays of interface types with a C# program. | 18. Demonstrate arrays of interface types with a C# program. | ||
<center>'''Mini Project'''</center> | <center>'''Mini Project'''</center> | ||
| Line 2,849: | Line 2,785: | ||
'''Total Hours: 42Exam Marks: 50''' | '''Total Hours: 42Exam Marks: 50''' | ||
'''NOTES:''' | '''NOTES:''' | ||
* A team of '''TWO '''students must develop the mini project. However, during the examination, each student must demonstrate the project individually. | * A team of '''TWO '''students must develop the mini project. However, during the examination, each student must demonstrate the project individually. | ||
| Line 2,860: | Line 2,796: | ||
** Implementation | ** Implementation | ||
** Testing | ** Testing | ||
* The Report must be valuated for 10 marks, Demonstration for 30 marks and Viva for 10 marks. | * The Report must be valuated for 10 marks, Demonstration for 30 marks and Viva for 10 marks. </center> </center> </center> </center> | ||