Difference between revisions of "Syllabus Review/VTU/MCA"

   

|<center>'''Information Retrieval'''

|<center>'''07MCA551'''

|-

|<center>'''07MCA542'''</center>

  &lt;/center&gt;  

   

{|class="prettytable"

   

   

   

=== Total Hours : 52Exam Marks: 100 ===  

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.

(Chapters 1, 2 (Page 2-42), 3 (Page 51-65))

   

=== Subject Code: 07MCA32I.A. Marks : 50 ===  

'''3. Packet Switching 7 Hours'''

'''4.Internetworking 12 Hours'''

Simple demultiplexer (UDP); Reliable byte stream (TCP); Issues in resource allocation

   

Passing parameters to base Class Constructors, Granting access, Virtual base classes  

Introduction, Function templates, Class templates.

(Chapter 1, 3 to 18)

   

=== Total Hours : 52Exam Marks: 100 ===  

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.  

(Chapters 16, 17.1, 17.2, 18)

# Silberschatz, Korth and Sudharshan: Data base System Concepts,'' ''5^th Edition, Mc-GrawHill, 2006.

   

=== Total Hours : 52Exam Marks: 100 ===  

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.

  '''Hours/Week: 03Exam Hours : 03'''  

=== PART- A ===  

# Program to count number of

## Positive and negative integers

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

=== PART- B ===  

# 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 /.

(aⁿbⁿ , n&gt;=0)

   

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.

# ADD(a, s2) – where ‘a’ is an integer (real part) and s2 is a complex number

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.

5. Write a C++ program to create a template function for Quicksort and demonstrate sorting of integers and doubles.

# 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

<nowiki>Handle the STACK empty and full conditions. Also display the contents of the stack after each operation, by overloading the << operator.</nowiki>

# no_of_days = d1 – d2; where d1 and d2 are DATE objects, 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>

# OCTAL h = x; where x is an integer.

<nowiki>Display the OCTAL result by overloading the operator << . Also display the values of h and y.</nowiki>

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.

# STRING s1 = “VTU”

# STRING s2 = “BELGAUM”

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.

   

   

=== Total Hours : 42Exam Marks: 50 ===  

PERSON (driver – id #: String, name: string, address: strong)

OWNS (driver-id <nowiki>#:string</nowiki>, Regno:string)

# Create the above tables by properly specifying the primary keys and the foreign keys.

# Enter at least five tuples for each relation.

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

# Find the number of accidents in which cars belonging to a specific model were involved.

# Generate suitable reports.

II. Consider the following relations for an order processing database application in a company.

SHIPMENT (order #: int, warehouse#: int, ship-date: date)

# Create the above tables by properly specifying the primary keys and the foreign keys.

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

III.''' '''Consider the following database of student enrollment in courses &amp; books adopted for each course.

BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int)

# Create the above tables by properly specifying the primary keys and the foreign keys.

# Enter at least five tuples for each relation.

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

# Generate suitable reports.

IV. The following tables are maintained by a book dealer.

CATEGORY (category-id:int, description:string)

# Create the above tables by properly specifying the primary keys and the foreign keys.

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

# Demonstrate how you increase the price of books published by a specific publisher by 10%.

# Generate suitable reports.

BRANCH(branch-name:string, branch-city:string, assets:real)

LOAN(loan-number:int, branch-name:string, amount:real)

# Create the above tables by properly specifying the primary keys and the foreign keys

# Demonstrate how you delete all account tuples at every branch located in a specific city.

# Generate suitable reports.

# The exercises are to be solved in an RDBMS environment like Oracle or DB2.

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

   

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

# Y. Daniel Liang: Introduction to JAVA Programming, 6^th Edition, Pearson Education, 2007.

   

=== Total Hours : 52Exam Marks: 100 ===  

Introduction:''' '''FAQ's about software engineering, Professional and ethical responsibility.

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

Software Requirements: Functional and Non-functional requirements; User requirements; System requirements; Interface specification; The software requirements document.  

System Models: Context models; Behavioral models; Data models; Object models; Structured methods.

Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control styles.

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

Verification and Validation: Planning; Software inspections; automated static analysis; Verification and formal methods.  

Managing People: Selecting staff; Motivating people; Managing people; The People Capability Maturity Model.

# Roger.S.Pressman: Software Engineering-A Practitioners approach, 7^th Edition,McGraw-Hill, 2007.

# Shari Lawrence Pfleeger, Joanne M. Atlee : Software Engineering Theory and Practice, 3^rd Edition, Pearson Education, 2006.

=== Subject Code: 07MCA43I.A. Marks : 50 ===  

(Chapters 1 to 9)

# M. Deitel, P.J. Deitel, A. B. Goldberg: Internet &amp; World Wide Web How to H program, 3^rd Edition, Pearson Education / PHI, 2004.

# Chris Bates: Web Programming Building Internet Applications, 3^rd Edition, Wiley India, 2006.

(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)  

# Coremen T.H., Leiserson C.E., and Rivest R.L.: Introduction to Algorithms, PHI, 1998.

   

   

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.

   

=== Subject Code: 07MCA452I.A. Marks : 50 ===  

=== Total Hours : 52Exam Marks: 100 ===  

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.  

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.

'''3. UNIX File APIs 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.

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.  

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.

Introduction; Socket Descriptors; Addressing; Connection establishment; Data transfer; Socket options; Out-of-band data; Nonblocking and asynchronous I/O.  

(Chapters 7, 8, 9, 13, 15, 16)  

1. Marc J. Rochkind:''' '''Advanced UNIX Programming, 2^nd Edition, Pearson Education, 2005.

   

(Chapters 1, 3, 7)

# K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic: Multimedia Communication Systems: Techniques, Standards, and Networks, Pearson Education, 2002.

   

   

   

=== Total Hours : 52Exam Marks: 100 ===  

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

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

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

'''Multiple-Window Strategies, Hypermedia and the World Wide Web – 1 7 Hours'''

Preparation of Printed Manuals, Preparation of Online Facilities.

Genres and Goals and Designers, Users and Their Tasks, Object-Action Interface Model for Web Site Design.

(Chapters 1 to 13, and 16)

# Alan J Dix et. al.: Human-Computer Interaction, II Edition, Prentice-Hall, India,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.

   

(Chapters 19, 20 excluding 20.5)

1. William Stallings , Data and Computer Communication, 5^th Edition, Prentice Hall India.

# Godbole, Data Communications and Networks, Tata McGraw-Hill 2002.

# Micael A. Gallo &amp; William M. Handcock, Computer

#####  

######  

# 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 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)

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 sessions (Using HTTP Session Interface).

   

   

# <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>

Output: The first n Fibonacci numbers

b) Input: A number n obtained using prompt

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

  Output: The number with its digits in the reverse order  

# Write a Perl program to display a digital clock which displays the current time of the server.

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

=== Subject Code: Marks : 50 ===

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

# Implement 0/1 Knapsack problem using dynamic programming.

# 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 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 Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.

'''Note: In the examination questions must be given based on lots. '''

   

   

   

=== Total Hours : 52Exam Marks: 100 ===  

   

# Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course, Pearson / Prentice-Hall, 2006.  

   

=== Total Hours : 52Exam Marks: 100 ===  

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

(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.)

# Tom Archer: Inside C#, WP Publishers, 2001.  

   

Introduction; Retrieval Strategies: Vector Space Model; Probabilistic Retrieval strategies

'''2'''. '''Retrieval Strategies – 2 6 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.

(Chapters 8, 11, 12)

   

   

   

  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.  

== 8. IT, Internet and Supply Chain 6 Hours ==  

(Chapters 1, 2, 4, 4, 5, 6, 7, 8.1 to 8.3, 10, 14, 15, 16, 17, 18)

# David Simchi-Levi, Philp Kaminky, Edith Simchi-Levi: Designing and Managing The Supply Chain Concepts, Strategies &amp; Case Studies, 3^rd Edition, tata McGraw Hill, 2003.

3. Rahul V. Altekar: Supply Chain Management Concepts and Cases, PHI, 2005.

   

'''1. Introduction 7 Hours '''

= 2. Basic Foundations: Standards, Models, and Language 6 Hours =  

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.

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

   

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

   

   

   

=== Total Hours : 52Exam Marks: 100 ===  

Introduction; Physical design; Firewalls; Protecting Remote Connections.

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

Pretty Good Privacy (PGP); S/MIME.

'''7. IP Security 6 Hours'''

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

(Chapters: 1, 4, 5, 6, 7, 8)

   

   

   

# 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^th Edition, Cambridge University press, 2006.

4. Schiller: Mobile Communication, Pearson Publication, 2004.

   

   

   

   

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.

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