www.PunjabColleges.com

Department of Computer Science & Engineering

Gju hisar. For result:01662-263158 (result), 263141

265158 (DDE)

GJU, HISAR  (Phone 76735)  www.gju.ernet.in

NAFE SINGH, SUPDT, DDE  01662-75730 (R) 68135 (o)

gju result pritam singh 01662-263141 (mca result: mr rai)

Dr Dharminder Kumar, Co-Ordinator, DDE

RES. D-16 GJU CAMPUS, HISAR-125 001    75015-18(o) EXTN 236    76767 (R)

SECOND V.C.                             76469

DR SANSAR CHAND, DIRECTOR, DDE TEL/FAX 76735

-DO-                                         PHONE 68157

(HE IS FROM DELHI, NO PHONE AT RES.)

MR VIPAN WALIA, ASST REGISTRAR

DIWAN CHAND (CLERK) NOT DEALING M.SC.

EARLIER SUPDT MR PARKASH ARORA

01662-68137 (O) 76869 (R)

GJU, SANGRUR

Gurvinder Singh 3235857(O), 230892 (R) 98142-48157 (old) 98155-94841

94174-46467 (latest) 98762-00392 (totally latest)

(New) NIC COMPUTER CENTRE, PATIALA GATE, SANGRUR

GJU, BARNALA

GURJANT SINGH 34872(R)

42872(o)

PTU MANOHAR LAL

GJU, Chandigarh

Guru Jambheshwar University   (EPABX : 75015-16-17-18)

For Enquiries :
Phone No. : 01662-76790,76025
Fax : 01662-76240
Email : info@gju.ernet.in, gju_tech@yahoo.com

INCUMBENCY BOARD
( VICE - CHANCELLOR)

(PRO VICE - CHANCELLOR)

( REGISTRAR)

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.

·                                 </