GJU, Hisar

GJU, MCA Syllabus 3 years

Question Papers of Previous Years 1 Set of 5th Semester

GJU, MCA Syllabus 3 years

MCA / M.Sc. / PGDCA - 1st Semester

MS-01: Introduction to Information Technology

Theory : 100 Marks    Time: 3 hrs.    Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.    
2. All questions carry equal marks.

Information concepts and processing; Evolution of information processing, data, information language and communication.    

Elements of computer processing system; Hardware-CPU, storage devices and media. VDU, input-output devices, data communication equipment. Software-system software, application software.

Programming Language : classification, machine code, assembly language, higher level languages, and fourth generation languages.

Operating Systems: Concept as resource manager and coordinator of processor, devices and memory. Concept of priorities, protection and parallelism. Command interpreter Typical commands of DOS/UNIX/Net Ware, GUI - Windows.

Computers and Communication: Single user, multi-user, work station, client server systems, Computer networks, network protocols, LAN, WAN, Internet facilities through WWW, Mosaic, Gopher, html, elements of Java.

Information integrity definite: Ensuring integrity, computer security, Perverse software, concepts and components of security. Preventive measures and treatment.

Range of application: Scientific, business, educational, industrial, national level weather forecasting remote sensing, planning, multilingual applications.

Introduction to OOPS: Need of object oriented programming, Classes and objects, Data hiding, Data encapsulation, operators overloading, functions overloading, inheritance and polymorphism.

References:
Sanders, D.H. "Computers Today", McGraw Hill, 1998
V.K. Jain "O-Level Module"
E.Balagurswami, "Object Oriented Programming using C++".

MS-02 : Computer Programming for Problem Solving.

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Introduction to algorithms, Flow-Charts, Tracing flow charts, Problem solving methods. Need for computer languages. Reading programs written in C language. C character set, Identifiers and keywords. Data types, Declarations, Expressions, statements and symbolic constants, Input-Output: getchar, putchar, scanf, printf, gets, puts, functions, Pre-processor commands, #include, define, ifdef, preparing and running a complete C program.

Operators and expressions: Arithmetic, Unary,. Logical, bit-wise, assignments and conditional Operator, Library functions. Control statements: While, do-while, for statement, nested loops, if-else, switch, break, continue and goto statements, comma operator.

Functions: Defining and accessing: Passing arguments, Function prototypes, Recursion. Use of library functions, Storage classes: Automatic, external and static variables. Arrays: Defining and processing. passing to a function, Multi dimensional arrays.Strings, operations on strings.

Pointers: Declarations, Passing to a function. Operations on pointers, Pointer and arrays, Arrays of pointers.

Structure: Defining and processing. Passing to a function, Union.

Data Files: Open, close, create, process Unformatted data files.

References:
E.Balaguruswamy, " Introduction to C".
Kernighan, B.W., and Ritchie, D.M., " The C Programming Language" Prentice Hall of India, 1989.

MS-03: Digital Electronics

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Introduction, Logic Gates (AND, OR, NOT, EXOR, NAND, NOR). Boolean Algebra: Simplification by 4 Variable K-Map Method, Logic Implementation using Gates, Multiplexers, Decoders, Binary/BCD Subtraction and Addition. Adder,subtractors,7 segment LED display.

Characteristics of Digital IC's, TTL and MOS Implementations, Representative Circuits and Comparison. Propagation delays, Fan-in/Fan-out, Tristate buffers.

Flip-flops (SR,JK,D,T), Shift Registers, Counters (Synchronous and Asynchronous), Ring Counter. ROM and RAM Cells and Organizations; D/A and A/D converters.

References:
R.P.Jain., "Modern Digital Electronics".
Taub and Schilling., " Digital Integrated Electronics".

MS-04: System Analysis and Design

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Introduction : Overview of System Analysis & Design, Business System, Concepts, system development Life Cycle, Project Selection, Feasibility Analysis, Design, Implementation, Testing and Evaluation.

Project Selection : Sources of projects requests, Managing Project Review and Selection, Preliminary investigation.

Feasibility Study : Technical and Economical Feasibility, Cost/Benefit Analysis.

System Requirements Specification and Analysis : Reqauirements determination, Fact-Finding Techniques, Data Flow Diagrams, Data Dictionary, Decision Analysis, Decision Trees, Decision Tables and Structured English.

System Design : Modularization, Module Specifications, Design of Input and Control, Design of Output and Control, File/Database design, Process Design and User Interface Design.

Systems Engineering and Quality Assurance : Design Objectives: Reliability and Maintenance, Software Design and Documentation tools, Managing Quality Assurance, Managing Testing Practices and Plans, Systems Controls, Audit Trails.

Merging System Implementation : Training, Conversion and Post Implementation Review

References:
Lee, "System Analysis and Design, Vol. I & II", Galghotia Publication
Awadh. "System Analysis and Design"

MS-05 Practical(MS-01 & MS-02)

Practical: 100 marks
Load: 8 Hours/Week

a) IT Lab.
Familiarising with PC, MS DOS and MS WINDOWS commands, File creation, editing and directory creation. Mastery of MS DOS commands. Learning to use MS OFFICE MS WORD, use of database
and spread sheet, Slide creation with Power Point. Use of a visual programming language such as Visual Basic.

b) Programming Lab.
Programming exercises and project using C programming language. Exercises to study various features of the language. Stress to be laid on writing well-structured modular and readable programs accompanies by good documentation. Case studies of use of various data structures in applications such as sorting, searching string manipulation and list manipulation.

MCA / M.Sc. / PGDCA - 2nd Semester

MS-06: Data Strucutures and Algorithms.

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Introduction to Data Structures, linear list structures, (Stack Queue, Dequeue), Circularly-linked lists, Doubly-linked lists, Multilinked lists, Trees, Binary Tree, Threaded Binary Tree and Balanced Trees, Different tree traversal Algorithms, Representation of Graphs and Applications.

Various searching and sorting algorithms and their Analysis. Internal and external sorting Techniques, Various Hashing Techniques, Dynamic Storage.

References:
Yedidyah Langsam , Moshe J. Avgenstein, Auromm. Tenenbaum, "Data structure using C and C++"
Sartaj Sahanai, "Data structure using C"

MS-07: Computer Organisation and Architecture.

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Principles of Computer design-Software, hardware interaction layers in computer architecture Central processing unit, machine language instructions, Addressing modes, instruction types, Instruction set selection. Instruction cycle and execution cycle.

Control unit. Data path and control path design. Microprogramming V/s hardwired control RISC Vs CISC , Pipelining in CPU design , Superscalar processors.

Memory subsystem , Storage technologies , Memory array organization , Memory hierarchy , Interleaving, cache and virtual memories and architectural aids to implement these.

Input-output devices and characteristics.

Input-output processing, bus interface, data transfer techniques. I/O interrupts channels Performance evaluation - SPEC MARKS , Transaction Processing benchmarks.

References :
J.P. Hayes, Computer Organisation & Architecture.
Mano M. "Computer System and architecture". (3rd edition) Prentice Hall of India, New Delhi, 1994

MS-08: Operating System.

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.Introduction:

Evolution of operating systems, operating systems concepts and structure, types of operating systems.

File Systems: File concepts, Access methods, Allocation methods, Directory systems, File protection.

CPU Scheduling : Scheduling concepts, CPU scheduling algorithms, Algorithms evaluation, Multiple Processor Scheduling.

Memory Management : memory management without swapping or paging, swapping overlapped swapping, Paging, Segmentation, Virtual memory concepts, Demand paging, Page replacement algorithms, Allocation algorithms and thrashing

Disk scheduling : Disk scheduling algorithms, selecting a disk scheduling algorithms, sector queering.

System Dead Locks : The dead lock problem, Dead lock characterization, Dead lock Prevention, Dead lock avoidance, Dead lock detection, Recovery from deadlock.

Concurrent Processes : Mutual Exclusion, shared data, critical section, busy form of waiting, lock and unlock primitives and non-primitives, synchronization, block and wakeup.

Case Studies : MS-DOS, MS-WINDOWS AND Linux(Unix) Operating Systems.

References :
Peterson James L and Silberschatz A., " Operating Systems Concepts", Addison-Wesley.
Galvin, "O S".

MS-09: Business Data Processing

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Introduction to data processing: records & files; data collection. preparations verification, editing and checking.

Business files: Master and transaction file, file generations, back-ups and file recovery procedures.COBOL programming: language constructs and structured program development.File sorting, searching, merging, matching

References:
Sten & Sten, "C Programming"
Dastidar Ghosh, "C Programming"

MS-10: Data Structure & BDP Labs

Practical: 100 marks
Load: 8 Hours/week

a) Data Structure Lab.

Implementation of stack, queues as an array and linked list.
Implementation of linked with all the operations that can be performed on it.
Binary tree traversals, Binary Search tree, Heaps.
Graph & its sequential & linked representations.
Main sorting & Searching techniques.

At least eight exercises to be given on above-mentioned concepts.

b) BDP Lab.

A system for journal acquisition in a library.
A bus passenger reservation system.
An electricity billing system.
A fixed deposit accounting system for a Finance Company.
Hotel room booking.
Book issues and receipts in library.
Insurance premium calculation an issuing reminders.
A hospital management system.

MCA / M.Sc. - 3rd Semester

MS-11: Relational Data Base Management System (RDBMS)

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Basic Concepts : Introduction, Database users, Data models, Schema and Instances. DBMS Architectuire and Data Independence. Database languages, Data modeling using E-R Model.

Relational Model : Relational Model concepts, Relational model constrains, Update operations on relations. The relational Algebra, SQL-A Relational Database Language.

Database Design : Informal Design Guidelines for Relation Schema, Functional Dependencies, Normal Form Based on Primary Keys. Boyee - codd Normal Form, Multivalued Dependencies and Forth Normal Form. The Database Design Process.

Query Processing : Basic Algorithms for Executing query operations, Using Heuristics in Query optimisation.

Concurrency Control : Concepts, Locking Techniques for concurrency Control. Concurrency control based on Time stamp ordering. Multiversion concurrency control Technques.

Recovery Techniques : Recovery concepts, Recovery Based on deferred Update, Recovery Technique Based on Immediate update, Shadow Paging.

Distributed Database : Concepts, Overview of Client-server Architecture, Data Fragmentation, Replication and Allocation Techniques for Design Query Processing in Distributed Database.

References:
C.J. Date, "Data Base Systems", Sixth Edition, Addison-Wesley.
Ramez Elmasri, Shamkant B. Nawthe, "Fundamentals of Data Base Systems", Addision-Wesley.

MS-12: Software Engineering

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Concepts of Software Engineering, Software characteristics, components applications, Software Metrics and Models: Process and Product Metrics, Size metric, Complexity metric (McCabe's Cyclometic Complexity), Halstead's Theory, Function Point Analysis.

Software Development : Phases, Process Models, Role of Management, Role of Metrics and Measurement, Software Quality factors.

Planning and Software Project : Cost Estimation, COCOMO, Putnam, Project Scheduling, Quality Assurance Plans, Project Monitoring Plans.

System Design : Design Objectives, Design Principles, Effective Modular Design (Functional Independence, Coupling, Cohesion), Design Tools and Techniques, Prototyping, Structured Programming.

Coding : Programming Practices, Verification, Monitoring and Control.

Testing : Testing Fundamentals, Test case design, Functional Testing, Structural Testing, Test Plan, Activities during testing, Unit System, Integration Testing.

Reliability : Concept of Software Reliability, Software Repair and Availability, Software Errors and Faults, Reliability Models (JM, GO, MUSA, Markov). Limitations of Reliability Models.

References:
K.K. Aggarwal and Yogesh Singh,"Software Engineering" Nas Age International Pub.
Pankaj Jalota, "An Integrated Approach to Software Engineering", Narosa Pub.

MS-13: Computer Graphics

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Overview of Computer Graphics, Interactive graphics, passive graphics, Advantages of Interactive Graphics.

Display Devices: Refresh CRT, Random-Scan and Raster-Scan Monitor, Color CRT Monitors, DVST, Plasma-Panel Displays, LED and LCD monitors, Hard copy devices.

Scan conversion : Scan converting a point, line, circle, ellipse and arcs.
2-D graphics transformations (Rotations, Scaling, Translations, Reflecting, Shearing) Composition of 2-2-D transformation, 2-D viewing and clipping, Windowing concepts, clipping algorithms (Line, Area and Text) Sutherland-Cohen, Mid-point subdivision Window-to-view port transformation, Primitive and attributes. Exterior and Interior clipping.

Interactive Graphics : Concept of Positioning and Pointing, Interactive Graphic Devices (Key Boards, Touch Panels, Light Pens, Graphic tablets, Joysticks, Mouse, Voice Systems)

Interactive Graphical Techniques : Basic Positioning Methods, Constraints, Gride, Gravity field, Rubber-Band Mehtods, Sketching, Dragging, Inking and Painting.

Computer Graphic Software : Introduction, GKS (Primitive, attributes and Viewport, Display subroutines)

3-D Graphics : 3-D Graphics transformations (Rotation, Rotation about an arbitrary line Scaling, Translation), Parallel and Perspective Projections, Concepts of Hidden Line, Hidden Line and Surface elimination methods (Z-Buffer, Scan-line, Painter's, Subdivision). 3-D viewing and clipping. 3-D Object Representation: Wireframe model, Bezier Curves and Surfaces.

Multimedia: Introduction, Hardware and Software for multimedia, Application Area for Multimedia, Components of Multimedia, Multimedia, Authoring Tools.

References:
Roy. A Plastock., Gordon Kalley; Computer Graphics (Schaum's Series ) McGraw Hill.
Newman, W, Sproul, R.F., Principles of Interactive Computer Graphics, McGraw Hill.
N. Krishnamurthy, "Introduction to Computer Graphics",TMH

MS-14: Management Information System.

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Background Meaning, Nature, Need, Role, Importance. Evolution of management through information system; Relatedness of MIS with management activities. Management functions and decision making.

Concept of balance MIS Effectiveness and efficiency criteria.

Development of MIS: Methodology and Tools/Techniques for systematic identification, evaluation, modification of MIS.

References:
Robert G. Murdick, Jeol E. Ross, James R. Claggett, ":Information system for Modern Management".
James A. O'Brien, "Management Information Systems".
Banerji & Sachdeva ( Vikas Publication )

MS-15: Computer Graphics and RDBMS Labs

Practical: 100 Marks
Load: 8 Hours/week

a) Computer Graphics Lab

·                                 Draw circle using Broshenhem's Method.

·                                 Draw a line using Broshenhem's Method.

·                                 Translate and Rotate a Wheel.

·                                 Plot a dashed line.

·                                 Generate Bat Chart.

·                                 Rotate a circle around the circumference of an another circle.

·                                 Rotate a line around the circumference of a circle.

·                                 Generate a synchronized clock with system time.

·                                 Generate a fan and rotate it with proper switches.

·                                 Display a moving slide on screen.

·                                 Implement Cohn-Sutherland algorithm for line segment clipping.

·                                 Obtained mirror image of word "COMPUTER"

·                                 Perform various shearing transformations on a rectangle.

·                                 Write a program that applies any specified sequence of transformations to a displayed object. The program is to be designed so that a user selects the transformation sequence from displayed menu, and the composite transformation is then calculated and used to transform the object. Display the original object and transformed object.

·                                 Any minor project (Each student will do different problem.

b) RDBMS Lab

Study features of a commercial RDBMS package such as oracle, FoxPro. Ms Access and Structures query language (SQL, use with the RDBMS. Laboratory exercises should include defining scheme for applications, creation of a database, writing SQL queries to retrieve information from the database. Use of host language interface with embedded SQL. Use of forms and report writer packages available with the chosen RDBMS product. Some sample application which may be programmed are given below :

·                                 Accounting for a shop

·                                 Database manager for magazine agency or newspaper agency

·                                 Ticket booking for performances

·                                 Preparing greeting and birth day cards

·                                 Personal accounts- insurance, loans, mortgage payments etc.

·                                 Doctor's diary, billing

·                                 Personal bank account

·                                 Class marks management

·                                 Hostel accounting

·                                 Video tape library

·                                 History of cricket scores

·                                 Cable transmission program manager

·                                 Personal Library

MCA / M.Sc (Comp. Sc) - 4th Semester

MS-16: Computer Network

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Concepts of data transmission, Analog data and Analog carrier, Digital data and digital carrier etc., Half Duplex and Full Duplex transmission, MODEMS, Asynchronous, Synchronous Transmission Methods, Fundamental of communication theory, Shannon Hartlay Theorem, Source Encoding, Channel speed and bit rate. Bandwidth and frequency spectrum, Time Division multiple access system.

Network components, Network topology - Bus, Star, Ring, Mesh, Hybrid, Layered protocols, Layers of OSI References Model, Character and bit protocols, Binary synchronous control (BSC), HDLC, SDLC, LANs, IEEE LAN standards - IEEE 802.5 (token ring), (token bus) IEEE 802.4 and IEEE 802.3 (Ethernet) MANs DQDB, Message, Switching, Packets switching, X.25 protocols, Routing and Flow Control, TCP /IP Reference Model. Introduction to ATM and ISDN.

References :
Tennenbaum, A.S., "Computer Networks". Prentice Hall of India.
Stallings, W., "Computer Communications Networks", Prentice Hall of India.

MS-17: Object Oriented Programming using C++

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Definition: Object Oriented Programming. Paradigams and metaphors; Active Data; Message Passing; Classes; Instantiation and inheritance; Types of Object in object Oriented Systems.

Object - Oriented Programming Tools: Development of Programming Language Class Declarations and creating objects Expressions and Statements; Functions; Classes; Operator Over loading; Derived Classes; File and Streams string Manipulation; Buffering.

Concurrent Object -Oriented Systems.

References:
E. Balagurswami "Object Oriented Programming Using C++"
Laffore "Object Oriented Programming"

MS-18: Internet and WEB Programming

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Internet - Beginning and Current State. Hardware and Software requirement, ISP and Internet accounts. Web-Home page, URL, Browser, Security on Web, Plug-ins and Helpers. Searching tools and Search engine. FTP, Gopher, Telnet and E-Mail.

Web Authoring using HTML; Creating a Web page, Methods of Linking, Publishing HTML, Text formatting and Alignment, Font Control, Arranging text in lists, Images on a Web page, Backgrounds and Color Control, Interactive Layout with Frames.

Programming through JAVA : JAVA History, Java features, Java and Internet, Java and World Wide Web, Hardware and software requirements. Java environment, Java Program Structure. Java Tokens, Java Virtual Machine, Constants, Variables and Data Types, Operators and Expressions, Decision Making and Branching, Decision Making and looping, Classes, Objects and Methods, Interfaces Packages, Managing Errors and Exceptions.

Applet Programming : Local and remote Applets, Applets and Applications, Applet life cycle, Creating an Executable Applet, Applet tag, Passing Parameters to Apples. Brief Overview of CGI Programming.

References:
Kris Jamsa, "Web Programming", Frank Bros. & Co.
Ned Snell, " Teach Yourself Internet", Techmedia.
E. Balagurusamy, "Programming with JAVA", Tata McGraw Hill.

MS-19 : Computer Based Optimisation Methods

Theory : 100 Marks
Time: 3 hrs.
Load: 3 Hours/week

Note:
1. A candidate is required to attempt five questions out of eight questions.
2. All questions carry equal marks.

Operation Research: An Introduction, Linear programming, Formulation of Linear Programming Problems, Simplex methods Duality, Software for linear programming. Network problems and shortest path in network, Discrete and continuous Markov Chains Queuing Theory (MM1 and MMC), Integer programming.

References:
V.K.Kapoor, "Operational Research".
S.D. Sharma, "Operational Research".

MS-20: Practical Based on (MS-17 & MS-18)

Practical Marks: 100
Load: 8 Hours/week

a) OOP Lab

Practical based on C++

b) Internet and Web programming Lab

Practical based on HTML and JAVA programming

MCA - 5th Semester

MS-31 Data Warehousing and Data Mining

Time : 3:00 hours
Total Marks : 100

Note : Examiner is requested to set 8 questions covering the whole syllbi and student are required to attempt any five questions.

Data Warehousing

Introduction : The evolution of Data Warehousing (The Historical Context). The data warehouse - a brief history, today's development environment.

Principles of Data Warehousing (Architecture and Design Techniques) : Types of Data and their uses, conceptual data architecture, design techniques, introduction to the logical architecture.

Creating the Data Asset : Business Data Warehouse Design, Populating the Data Warehouse.

Unlocking the Data Asset for end users (The use of Business Information) : Designing business information warehouse, populating business information warehouse, user access to information, information data in context.

Implementing the Warehouse (Managing the project and environment) : Obstacles to implementation, planning your implementation, justifying the warehouse, organizational implications of Data Warehousing, the data warehouse in your organization, data warehouse management, looking to the future.

Data Mining

Introduction : Motivation, importance, data mining, kind of data, functionalities, interesting patterns, classification of data mining systems, major issues.

Data warehouse and OLAP technology for data minings : data warehouse, operational database systems and data warehouses, architecture, implementation, development of data cube technology, data warehousing to data mining, data warehouse usage.

Data Preparation : Preprocess, data cleaning, data integration and transformation, data reduction, discretization and concept hierarchy generation.

Data Mining Primitives, languages and system architectures, graphical user interfaces.

Concept Description : Characterization and comparison, data generalization and summarization based characterization, analytical characterization, analysis of attribute relevance, mining class comparison, mining descriptive statistical measures in large databases.

Mining association rules in large databases, mining single dimensional boolean association rules from transactional databases, mining multi-dimensional association rules from relational databases and data warehouses, from association mining to correlation analysis, constraint based association.

MS-32 C Sharp (C#) Programming

Time : 3:00 hours
Total Marks : 100

Note : Examiner is requested to set 8 questions covering the whole syllbi and student are required to attempt any five questions.

Introduction
Basic concepts, features, visual object system, .NET, common language specification, Next Generation Windows Services, IL & metadata.

C# Types
Value Types - Simple type, struct type, enumeration type. Reference Type - object type, class type, interfaces, delegates, string type, arrays. Boxing and unboxing conversions. Implicit, explicit, standard and user defined conversions.

Classes & Methods
Constructors & destructors. Methods - Parameters, overriding, hidding, class properties, indexes, modifiers, class member access, multicast delegates.

Control Statements
Selection statements - if, switch. Iteration statements - for, foreach, while, do statements.

Exceptional Handling
Checked & unchecked statement, compiler setting for overflow checking, programmatic overflow checking. Exceptional handling statement - try & catch, try & finally, try-catch-finally. Throwing exception, re-throwing execption.

Inheritance & Polymorphism
Inheritance - Basic class and derived class. Polymorphism, base class with a virtual method, derived class with override methods.

Interfaces
Interfaces - Base interface, interface body, interface members, interface methods, interface properties, interface events, interface indexes, interface mapping, interface reimplementation.

Configuration & Deployment
Conditional compilation - Processor usage, the conditional attribute. Documentation comments in XML - Describing an element, adding remarks and lists, examples, describing parameters, describing properties, documentation compiling, NGWS components.

Security
Code Access Security, verification of type security, permissions, standard permissions, identity permissions, role based security.

References :
Christoph Wille, Presenting C# - SAMS Techmedia
Vijay Mukhi, C# The Basics - BPB Publications
Vijay Mukhi, C# The Nuts & Bolts - BPB Publications
C# Made Simple - BPB Publications

MS-33 Advance Computer Architecture

Time : 3:00 hours
Total Marks : 100
Note : Examiner is requested to set 8 questions covering the whole syllbi and student are required to attempt any five questions.
Introduction
Evolution, performance attributes, Flynn's classification, multiprocessor, multicomputer, scalable, superscalar, multithreading, pipelining, superpipelining, dataflow architecture.

System Network & Scalable Properties
Data & Resource. Dependencies, program partitioning and scheduling. System interconnect architecture -
crossbar, multiport, multistage networks. Scalability analysis and approaches.

Pipelining
Pipelining -- Linear, non-linear pipelining, design of instruction and arithmetic pipeline. Superscalar and Superpipeline design. Pipelining in RISC, CISC, CRISC & VLIW architecture.

Cache Memory Organization
Cache addressing modes - physical, virtual. Unified vs Split cache. Mapping - Direct, associative, set-associative, sector mapping cache. Performance issues. Page replacement policies. Cache coherence problem, Snoopy bus protocol - write back vs write through. Directory based protocol.

Multithreaded & Dataflow architecture
Multithreading, multiple context processors, multidimensional architecture, dataflow architecture - dataflow graph, static & dynamic dataflow computers.

Concurrent Processors
Vector processors - functional units, vector instruction, processor implementation, speedup. Vector memory - modeling vector memory performance, Gamma Binomial model. Multiple issue processors. Multivector multiprocessors.

References :
i ) Kai Hwang - Advanced Computer Architecture, Parallelism, Scalability, Programmability. - MGH
ii) Michael J Flynn - Computer Architecture, Pipelined & Parallel Processor Design - Narosa.
iii) J.P. Hayes - Computer Architecture & Organisation - MGM.

MS-34 High Speed Networks

Time : 3:00 hours
Total Marks : 100

Note : Examiner is requested to set 8 questions covering the whole syllbi and student are required to attempt any five questions.

Need of high speed network, performance attributes, network backbone, cost of high speed networks, Fiber Distributed Data Interface (FDDI), Fast Ethernet - IEEE 802.3u, Gigabit Ethernet - RSVP, Virtual LANs, Video Compression, Fiber Channel - Layer 0, Layer 1, Layer 2, Layer 3, Layer 4, Protocol mapping, ISO Ethernet 802.9a.

Integrated Services Digital Network (ISDN), Switched Multimegabit Data Services (SMDS), Frame Relay Networks, Asynchronous Transmission Mode (ATM) - Reference Model, ATM Switches, ATM in datalink, Network and Transport Layer.

Digital Subscriber Line Services & Cable Modems - DSL (Digital Subscriber Line), ADSL (Asymmetric Digital Subsriber Line), HDSL (High bit rate Digital Subscriber Line), VDSL (Very High bit rate Digital subscriber Line), SDSL (Symmetric Digital Subscriber Line), RADSL (Rate Adaptive Digital Subscriber Line).

Management System for High Speed Network - Traffic Management, Application Management, Device Management, Management Platforms.

References :
Tere Parnell - Building High Speed Networks - TMH
Cooper E. - Broadband Network Technology - Prentice Hall
Tanenbaum - Computer Networks - PHI
Green P.E. - Fiber Optics Networks - PHI
Goralski W.J. - Introduction to ATM Networking - MGH   

Question Papers of Previous Years 1 Set of 5th Semester 

M.C.A. EXAMINATION

Data Warehousing and Data Mining

MS-31

Time  : 3 hours                                                                                  Maximum Marks : 100

Note : Attempt any five questions.

1              (a)           Define Data Warehouse.  How is a warehouse different from a database?  How they similar?

                (b)           Define Data Mining.  Explain how the evolution database technology led to data mining.

2.                             What are the differences between three main types of data warehouse usage: Information processing, Analyzed processing and Data mining? Discuss the motive behind OLAP Mining.

3.             (a)           Discuss the 3-tier Architecture of warehouse.

                (b)           What is back propagation? 

4.                             Explain the Star and Snowflake model of data warehouse and give the difference between them.  10

 Suppose that the data for analysis include the attribute age.  The age values for the data tuples are (in increasing order) : 13, 15, 16, 16, 19, 20, 20, 21, 22, 22, 25,  25,  25,  25,  30, 33, 33, 35, 35, 35, 35, 36, 40, 45, 46, 52, 70.                                                                                    

10

 (i)                   Use smoothing by bin means to smooth the above data, using a bin depth of 3.  Illustrate your steps.  Comment on the effect of this technique for the given data.

(ii)                 How might you determine outlier in the data?

(iii)                What other methods are there for data smoothing?

5.                             Explain the categorization of major clustering methods.(10) 

                                How do you choose a data mining system? (10)

6.                           Write an algorithm to generate a decision tree.(10) 

What are different operations associated with data warehousing? Explain few of them. (10)                                            

7.                           Explain the process of Mining Class Comparisons.   Your answer should explain is systematic procedure, using an example and its DMQL.

8.                             (a)           Write the differences between 

                                (i)                   Data Warehouse and Data Mat

                                (ii)                 OLAP and OLTP.

                                (b) Write short notes on :

                                (i)                   Date Cleaning

                                (ii)                 Outlier Analysis.

M.C.A. EXAMINATION

C SHARP (C#) PROGRAMMING

MS-32

Time  : 3 hours                                                                                                                      Maximum Marks : 100

Note : Attempt any five questions.

1.             (a)                Discuss different features of C#.                                      10

                (b)      &n