# 1-MCA _NS_

Document Sample

```					 DE–641                                                       101

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION,
DECEMBER 2010.

DIGITAL COMPUTER ORGANIZATIONS

(2001 onwards)

Time : Three hours                            Maximum : 100 marks

(5  20 = 100)

1. (a)     Subtract 3250 from 72532 using 1‘s and 2‘s complement.
(b)   Convert the decimal 153.513 into octal and binary.

2. (a)     Simplify :
(i)    A  B  A  C  A  B  C (A  B  C)

(ii)   AB  A  AB .
(b)   Reduce the following function by Karnaugh map and represent the
reduced function in sum of products and product of sums form :
F  (1, 5, 6, 7, 14, 15) .

3. (a)     Design a RS flip-flop using NAND gates and explain.
(b)   Design a 3-bit binary counter and explain.

4. (a)     Draw a full adder circuit and explain its working.
(b)   What are the possible ways available to represent the negative numbers?
Explain them.

5. (a)     Describe the linear select memory organization.
(b)   Explain the need for secondary memory.

6. (a)     Write about the sequence of operation of control registers.
(b)   With the timing diagram, explain instruction cycle.

7. (a)     What is interface? Why interfacing devices are needed? Explain.
(b)   How CPU and IOP communicated each other?

1          DE–641
8. (a)      Explain the working principle of multiplexer.
(b)   Design a 3-to-8 decoder and explain.

–––––––––––––––
DE–642                                                         102

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.

PRINCIPLES OF INFORMATION TECHNOLOGY

(2001 and 2002 batches)

(2001 onwards)

Time : Three hours                         Maximum : 100 marks

All questions carry equal marks.
(5  20 = 100)

1. (a)      Summarize the developments in communications technology.
(10)
(b)   Write an essay about ‗‗All Purpose Machine‘‘.             (10)

2. (a)      Write a note on intellectual property rights.       (10)
(b)   Explain the features of word processing.                  (10)

3. (a)      Justify the statement. ‗‗The Information Appliance that will change your
future‘‘.  (10)
(b)   Enumerate the features of personal information managers.
(10)

4. (a)      List out the telephone related communications services. and explain each
one of them.       (10)
(b)   Discuss the factors that affecting data transmission.
(10)

5. Explain the following :
(a)   Workgroup computing.               (7)

2       DE–641
(b)   ISDN lines.                       (6)
(c)   Communications Network.           (7)

6. (a)      Bring out the importance of compression and Decompression.
(7)
(b)   What are the different types of database organization? Explain each one of
them.      (9)
(c)   Write a note on optical disks.    (4)

7. (a)      Briefly explain about knowledge storage capacity.
(10)
(b)   Discuss about concerns related to the accuracy and privacy of databases.
(10)

8. (a)      Explain five generations of programming languages.
(5)
(b)   Explain the concepts of object oriented programming.                   (8)
(c)   Explain the advantages of using functions.                (7)

——————
DE–643                                                     102

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.

PRINCIPLES OF INFORMATION TECHNOLOGY

(2003 onwards)

Time : Three hours                        Maximum : 100 marks

(5  20 =100)

1. (a)      Describe the elements of a communication system.
(b)   Explain the importance of database software.

2. (a)      Describe the telephone related communication services.

3. (a)      Explain scanf and printf functions with suitable example.
(b)   Describe the loop structures available in C.

3        DE–641
4. (a)     Explain the structure with an example. Also compare with arrays.
(b)   Write a program to arrange the given set of data in ascending order using
pointer.

5. (a)     What is recursion? Write a recursive program to find the factorial of a
given number.
(b)   Illustrate pass-by-reference by an example program.

6. (a)     Write a program in C to find the product of two matrices.
(b)   Write a program in C to solve the quadratic equation using switch
statement.

7. (a)     Describe the data types supported by C.
(b)   Write a program to check whether the given string is palindrome or not.

8. (a)     Describe the services provided by internet.
(b)   What is browser? Explain any two popular browsers available in the
market.

————————
DE–644                                                    103

DISTANCE EDUCATION
M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.
C AND DATA STRUCTURES
(2001 onwards)

Time : Three hours                        Maximum : 100 marks

All questions carry equal marks.
(5  20 = 100)

1. (a)     Explain the control structures in C.                (10)
(b)   What       are        the      preprocessing         directives   available
in C? Explain.                                      (10)

2. (a)     Describe the basic aspects of pointers with example.
(10)

4          DE–641
(b)   Write a brief note on storage class initialization. (10)

3. How to represent arrays and structures in C? Discuss. (20)

4. How to represent stacks in C? Explain with examples.        (20)

5. Explain     the      basic     concepts       of   linked      list    representation
in C.                                                      (20)

6. (a)     What is meant by queue? Explain with an example.
(10)
(b)   Discuss the Huffman algorithm.                      (10)

7. Describe merge and radix sorts with example each.           (20)

8. Write down the overview of searching techniques.            (20)

———————————
DE–645                                                     104

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION,
DECEMBER 2010.

OFFICE AUTOMATION

(2001 onwards)

Time : Three hours                        Maximum : 100 marks

All questions carry equal marks.
(5  20 =100)

1. (a)     Discuss about document - create, delete save and naming the document.
(b)   Explain about title bar, status bar, menu bar and tool bars.

2. (a)     Explain tables and Graphics.
(b)   Discuss in detail abut text formating.

3. (a)     How to Build a worksheet? Explain with example.

5         DE–641
(b)   Explain in detail about char wizard.

4. (a)     Explain the following :
(i)    Using functions in Excel and.                (5)
(ii)   Formatting numbers and text.                 (5)
(b)   How to formate text explain in Ms word.            (10)

5. Explain the following :
(a)   Report Wizard                                      (10)
(b)   Query Wizard.                                      (10)

6. (a)     Explain how to create and print reports using wizard.
(10)
(b)   Explain with example :
(i)    Create and save a table in Access.
(ii)   Primary key.                                (10)

7. (a)     Discuss about Merging an access table with a word letter.
(b)   Explain briefly about the access form creation.

8. (a)     How to create a power point presentation - Explain.
(b)   What are the functions used to create power point presentation? Explain.

——————
DE–646                                                      105

DISTANCE EDUCATION

M.C.A. (N.S) DEGREE EXAMINATION, DECEMBER 2010.

DISCRETE MATHEMATICS

(2001 onwards)

Time : Three hours                        Maximum : 100 marks

(5  20 = 100)

1. (a)     Show that P  Q  R   P  Q   P  R  .

6           DE–641
(b)   Find the PCNF and PDNF of P  Q                             
PR .

2. (a)       Show that

(i)    x  px   qx   x px   x qx 

(ii)   x  px   qx   x px   x qx  .

(b)   Show that the following arguement is valid ‗‗All rock music is loud music some
rock music exists. Therefore some loud music exists‘‘.

3. (a)       Show that :

A  B  C    A  B    A  C  .

(b)   Let X   , 2, 3, 4 and
1

R  1,1, 1,4, 4,1, 4,4, 2,2, 2,3, 3,2, 3,3 . Write the matrix of R and draw
its graph.

4. (a)       Find the partition of A  a, b, c, d.

(b)   Show that for any set X, px  = set of all subsets of X is a partially ordered set
with respect to set inclusion.

5. (a)       Which of the following are injective, surjective, bijectives on R, set of real
numbers?

(i)     f x   2x

(ii)    g x   x 2  1 .

(b)   If fiA  B and giB  C are invertible functions then show that

g  f 1  f 1  g 1 .

6. (a)       Show that if A and B are subsets of U then

(i)    Z A  B x   Z A x .Z B x 

(ii)   Z A  B x   Z A x   Z B x   Z A  B x  .

7            DE–641
(b)   Let giI  I  I where I is the set of integers and g x, y  x  y  xy . Show
that the binary operation g is commutative and associative. Find the
identify and inverse element.

7. (a)     Show that Z 5 , 5  is an abelian group.

(b)   Show that a subgroups H , of a group G, is a normal subgroup if and only
if g  H  g 1  H for g  G .

8. (a)     Show that a simple graph with n vertices and k components can have at

most
n  k n  k  1   edges.
2
(b)   Show that a tree with n vertices has n  1 edges.

–––––––––––––––

DE–647                                                          108

DISTANCE EDUCATION
M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.
OBJECT ORIENTED PROGRAMMING AND C++
(2001 onwards)
Time : Three hours                               Maximum : 100 marks
All questions carry equal marks.
(5  20 = 100)

1. (a)     Explain about Encapsulation and Abstraction.          (10)
(b)   What are advantages of Inheritance?                        (10)

2. Explain about stream objects in detail.                       (20)

3. (a)     Explain about for ... loop structure in C++.          (10)
(b)   Compare switch and if ... else if ... statement.           (10)

4. (a)     Describe about accessibility of members and methods in a class.
(10)

8         DE–641
(b)   Explain about constructors and destructors in detail.
(10)

(b)   What is reference variable in C++? Explain with an example.
(10)

6. Write a C++ program to convert basic data type into object and vice versa.
(20)

(10)
(b)   Explain about Reusing code with member objects.
(10)

8. Write short notes on :
(a)   Storing objects on disk.           (7)
(b)   Swapping using reference variable.                         (7)
(c)   Pointer to function.                                       (6)

———————
DE–648                                                   109

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.
COMPUTER GRAPHICS
(2001 onwards)

Time : Three hours                         Maximum : 100 marks
All questions carry equal marks.

(5  20 = 100)

1. (a)     Discuss in detail about the classification of input devices.
(10)

9       DE–641
(b)   Briefly     explain    about        the   graphics     system        software.
(10)

2. (a)     Describe the working of flat panel displays. (10)
(b)   List out the difference between raster and random scan display methods.
(10)

3. (a)     Write and explain the Bresenham‘s algorithm for line generation.
(10)
(b)   Explain the circle generation algorithm in detail.
(10)

4. (a)     Explain the basic concept of two dimensional transformations.
(10)
(b)   Explain about the line segment clipping algorithm.
(10)

5. (a)     Explain about the basic         transformation      of     three   dimensional
transformations. (10)
(b)   Explain the composite transformation.               (10)

6. (a)     Derive the transformation matrix for perspective projection.
(10)
(b)   Explain the cohen-sutherland line clipping algorithm.
(10)

7. (a)     Explain the hidden surface algorithm.               (10)
(b)   Explain the components of user interface.           (10)

(10)
(b)   Explain about the information display.              (10)

———————
DE–649                                                 110

DISTANCE EDUCATION
M.C.A. DEGREE EXAMINATION, DECEMBER 2010.
Non–Semester
DESIGN AND ANALYSIS OF ALGORITHMS
(2001 onwards)

10           DE–641
Time : Three hours                            Maximum : 100 marks
All questions carry equal marks.
(5 × 20 = 100)

1. (a)      Write short notes on program testing.                  (7)
(b)    Explain - Design of an algorithm and how algorithm is analysed.
(13)

(b)    Write    short      notes    on        queues.     Explain   with      example.
(10)

3. (a)      What are the basic problem solving methods?           (10)
(b)    Explain in detail about Heuristics algorithm.         (10)

4. (a)      Explain in detail about simulating a single server problem. Give
flowchart. (13)
(b)    Write short notes on quick sort.                       (7)

5. (a)      Explain about Backtrack programming using bicycle lock problem.
(10)
(b)    Explain stack and queue with example.                 (10)

6. (a)      Write about searching techniques.                     (10)
(b)    Explain about simulating a single queue system. (10)

7. (a)      Write an algorithm to implement heapsort.             (10)

8. (a)      Explain about Ackermann‘s function in recursion with example.
(10)
(b)    Explain Binary search algorithm.                      (10)

————————
DE–650                                                          111

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.

11             DE–641
ACCOUNTING AND FINANCIAL MANAGEMENT

(2001 onwards)

Time : Three hours                           Maximum : 100 marks

All questions carry equal marks. (5  20 = 100)

1. (a)     Distinguish between single entry system and double entry system.

(b)   What are different classes of errors? Which of them do not affect trail balance?

2. (a)     Draw a specimen of trading account with necessary information.

(b)   What are the different methods of Wage payment? Explain.

3. (a)     State the limitations of ratio analysis.

(b)   You are given the following information calculate current ratio, liquidity ratio
and absolute liquidity ratio.

Rs.

Cash                        18,000

Debtors                    1,42,000

Closing stock              1,80,000

Bills payable               27,000

Creditors                   50,000

Outstanding expenses        15,000

Taxes payable               75,000

4. (a)     What are the different methods of pricing of material issues?

(b)   Write notes on ABC analysis and VED analysis.

5. From the following balance sheets prepare schedule of changes in working
capital and fund flow statements.
Liabilities      2006     2007     Assets           2006   2007

12            DE–641
Rs.      Rs.                      Rs.      Rs.

Share capital       1,00,000 1,50,000 Fixed Assets    1,00,000 2,00,000

P & L a/c            40,000    60,000 Current Assets 1,30,000 1,45,000

Provision for Tax    20,000    30,000

Proposed dividend    10,000    15,000

Creditors            40,000    60,000

Outstanding

Expenses             20,000    30,000

2,30,000 3,45,000                 2,30,000 3,45,000

Tax paid during the year 2007 - Rs. 25,000 and Dividend Paid during 2007 - Rs.
10,000.

6. The following data are obtained from the records of the company
Sales      Profit

Period I    1,20,000 15,000

Period II 1,40,000 20,000

Calculate:
(a)   P/V Ratio
(b)   Break Even Point
(c)   Sales required to earn a profit or Rs. 40,000
(d)   Fixed Expenses and
(e)   Profit when sales are Rs. 3,00,000.

7. A company operating at present at 50% capacity, produces and sells 10,000 units.
The unit cost is Rs. 180 and the selling price is Rs. 200.
The expenses per unit are given below :
Direct material Rs. 100
Direct labour Rs. 30
Factory expenses (60% variable) Rs. 30
Administrative expenses (40% variable) Rs. 20.

13         DE–641
Prepare flexible budget at 80% capacity.

8. Explain the factors which determine the working capital needs of a firm?
(a)   What is budget?
(b)   What are its types?

–––––––––––
–DE    651                                                     112

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

COMMUNICATION SKILLS

(2001 onwards)

Time : Three hours                         Maximum : 100 marks

All questions carry equal marks.

1. Compare and contrast inter-personal communication and intra-personal
communication.

2. List the importance of ‗Report Writing‘ in written communication.

3. How can one plan and prepare oneself for an interview?

4. Does Group Discussion help in testing one‘s personality? – Give your supportive
reasons.

5. Trace the origin and development of Body Language.

6. ―Negotiation is an attempt to achieve a mutually acceptable resolution and it
should not result in a winner or loser‖ – Justify.

7. What are the importance and objectives of conducting meetings in organizations?

8. Write short notes on the following :
(b)   Listening tests
(c)   Lateral thinking
(d)   Desirable body language.
______________

14         DE–641
DE–652                                                        201

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.

RESOURCE MANAGEMENT TECHNIQUES

(2001 onwards)

Time : Three hours                             Maximum : 100 marks

All questions carry equal marks.

1. (a)      Discuss the scope of Operations Research.
(b)    Solve the following LP Problem graphically :
Minimize Z  45X1  55X 2
Subject to
X1  2X 2  30
2X1  3 X 2  80
X1  X 2  8
X1 and X 2  0
2. (a)      Write the dual of the following LP Problem :
Maximize Z  5X1  6X 2
Subject to
4 X1  7 X 2  20
5X1  2 X 2  10
6 X1  8 X 2  25
X1 and X 2  0
(b)    Discuss practical applications of assignment problem.

3. (a)      Find the initial basic feasible solution of the following transportation
problem by Vogel‘s approximation method :
Warehouses
W1 W2 W3 W4 Capacity

F1   10    30    50    10      7
Factory      F2   70    30    40    60      9
F3   40     8    70    20      18

15          DE–641
Requirement      5    8    7    14    34

(b)   Discuss the steps of simulation.

4. (a)     Consider the assignment problem as shown below. In this problem, five
different jobs are to be assigned to five different operators such that the
total processing time is minimized. The matrix entries represent
processing times in hours.
Operator
1 2 3 4 5

1 5 6 8 6 4
2 4 8 7 7 5
3 7 7 4 5 4
4 6 5 6 7 5
5 4 7 8 6 8

Develop a zero-one programming model for the above problem.
(b)   Briefly explain the importance of dummies in Network analysis.

5. (a)     Distinguish      between   breakdown      maintenance    and     preventive
maintenance.

(b)   There are three docks in a harbour. The arrival rate of ships follows
Poisson distribution and it is 36 ships per month. The service rate

and it is 13 ships per month. The waiting space in the harbour can
accommodate a maximum of 10 ships. Find the following :

(i)    Average waiting number of ships in the queue as well as in the

system.

(ii)   Average waiting time per ship in the queue as well as in the
system.

6. (a)     List and explain different types of costs in inventory system.

16         DE–641
(b)   Ram Industry needs 5400 units per year of a bought-out component
which will be used in its main product. The ordering cost is Rs. 250 per
order and the carrying cost per unit per year is Rs. 30. Find the economic
order quantity, the number of orders per year and the time between
successive orders.

7. (a)     Explain in detail the components of the queuing system. Also bring out
the various applications of queuing theory in the business environment.

(b)   Discuss on ‗‗Replacement Theory‘‘ with various models.

8. (a)     Bring out the various applications of Operations research in the Indian
context.

(b)   Discuss the similarity between transportation problem and assignment
problem.

————————
DE–653                                                   202

DISTANCE EDUCATION
M.C.A. (Non-Semester) DEGREE EXAMINATION,
DECEMBER 2010.
OPERATING SYSTEMS
(2001 onwards)
Time : Three hours                       Maximum : 100 marks

(5  20 = 100)

All questions carry equal marks.

1. (a)    What is an operating system? Explain in detail about the operating
systems concepts.  (10)
(b)   Explain about simple batch systems.                (5)
(c)   Describe the usage of time sharing systems.        (5)

2. (a)     Discuss about Mutual Exclusions in detail.        (10)

17          DE–641
(b)   Explain :
(i)    Monitors.                                    (5)
(ii)   Message Passing.                             (5)

3. (a)     Describe about the Interrupt handlers.            (10)
(b)   Explain the methods of deadlock defection and recovery.
(10)

4. (a)     Discuss in detail about the independent I/O software.
(10)
(b)   Explain Deadlock Prevention in detail.            (10)

5. (a)     Explain the multiprogramming with fixed partition allocation.
(10)
(b)   Explain : Page replacement algorithm.             (10)

6. (a)     Describe analysis of swapping systems in detail. (10)
(b)   Discuss about multiprogramming and memory management.
(10)

7. (a)     Write in detail about the file system reliability. (10)
(b)   Write about t he performance of the file system. (10)

8. (a)     Discuss about the following mechanisms.
(i)    Shared file concepts.                        (5)
(ii)   File storage.                                (5)
(b)   Describe about the Disk Space Management of the file system in detail.
(10)

–––––––––––––––
DE–654                                                     203

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

RDBMS

(2001 onwards)

Time : Three hours                         Maximum : 100 marks

18          DE–641
(5  20 = 100)

1. (a)     Illustrate schema and subschema.                        (8)
(b)   Explain the structure of a DBMS.                            (12)

2. (a)     What is primary and foreign key? Give an example.
(8)
(b)   Explain how can you obtain a database design in the relational model.
(12)

3. (a)     Write the benefits of oracle.                          (10)
(b)   Outline the overview of oracle architecture.                (10)

4. (a)     What is a null value? How can you work with null values?
(10)
(b)   Describe the effect of UNION, INTERSECT and MINUS operators with
suitable examples.  (10)

5. (a)     How can you update and alter a table using SQL?
(10)
(b)   Explain any five embedded SQL statements with suitable examples.
(10)

6. (a)     What are the data types supported by oracle? Explain them.
(10)
(b)   Explain EQUI-JOINS and NON-EQUI-JOINS with suitable examples.
(10)

7. (a)     What do you mean by mapping cardinality? Explain.
(10)
(b)   Describe the data definition facilities in detail.          (10)

8. (a)     Describe the guidelines for creating indexes.          (10)
(b)   Compare file with DBMS.              (10)

–––––––––––––––
DE–655                                                     204

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

19            DE–641
UNIX AND SHELL PROGRAMMING

(2001 onwards)

Time : Three hours                       Maximum : 100 marks
All questions carry equal marks.
(5  20 = 100)

1. (a)     Explain the method of creating a file in unix using vi editor.
(6)
(b)   Discuss the unix directory hierarchy.              (8)
(c)   Explain the use of awk with an example.            (6)

2. (a)     Explain any five shell metacharacters and its use with examples.
(10)
(b)   Explain the for statement in shell programming with an example
program. (10)

3. (a)     Explain the method of changing the file permissions using chmod.
(6)
(b)   Explain path variable and its use.                 (6)
(c)   Discuss the method of accessing devices in unix. (8)

4. (a)     Explain the method of customizing the cal command with an example.
(10)
(b)   Explain the until loop with an example.           (10)

5. (a)     Explain the commands kill, news and zap.          (10)
(b)   Write a C program to accept characters from the keyboard and display it
on the screen.   (10)

6. (a)     Explain the system calls fork and wait with an example.
(10)
(b)   Discuss any two system calls related to file creation.
(10)

7. Explain the implementation of a Four function calculator.
(20)

8. Write notes on :
(a)   MS Macro package.                                  (8)
(b)   Tbl and eqn preprocessors.                         (8)
(c)   Document preparation tools.                        (4)

20          DE–641
————————
DE–656                                                     205

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

COMPUTER NETWORKS

(2001 onwards)

Time : Three hours                        Maximum : 100 marks

Answer any FIVE questions.          (5 × 20 = 100)

All questions carry equal marks.

1. (a)     Explain about ISO Reference model with a neat diagram.
(15)

(b)   What are goals of Computer Networks?                  (5)

2. (a)     Describe about different Transmission media.         (10)

(b)   Explain about the features of ISDN.                  (10)

3. (a)     Explain about CRC code with an example.              (10)

(b)   Describe about sliding window protocol.              (10)

4. (a)     Explain about centralized Routing algorithm.         (10)

(b)   Explain     about      any     one      congestion      control       algorithm.
(10)

5. (a)     Explain the function of ARP protocol.                (10)

(b)   Describe the function of Network Layer in ATM Networks.
(10)

6. (a)     Compare functions of TCP and VDP protocols.          (15)

7. (a)     Describe about Public and Private key algorithm.
(10)

(b)   Explain about SNMP protocol.                         (10)

8. Write short notes on :

21           DE–641
(a)   World wide web.                                        (4)

(b)   Data compression.                                      (8)

(c)   JPEG and MPEG.                                         (8)

————————
DE–657                                                         208

DISTANCE EDUCATION

M.C.A. DEGREE EXAMINATION, DECEMBER 2010.

Non-Semester

SIMULATION AND MODELLING

(2001 onwards)

Time : Three hours                            Maximum : 100 marks

All questions carry equal marks.
(5  20 = 100)

1. (a)     Discuss        in      detail     about     static    Mathematical       Model.
(7)
(b)   Explain the concept of continuous and discrete system.
(7)
(c)   Explain the system modeling.                           (6)

2. (a)     Write the brief details about the progress of simulation study.
(6)
(b)   What      is    CSMP       111?    Give   the    concepts    of   CSMP     111.
(7)
(c)   Explain the Monte-Carlo method.                        (7)

3. (a)     Discuss the multi segment model.                       (6)
(b)   Explain biological example in system dynamic.          (7)
(c)   Discuss the world models in system dynamics.           (7)

4. (a)     Describe the DYNAMO language.                         (10)
(b)   Explain the multi-segment models in system dynamics.
(10)

22           DE–641
5. (a)      Write     short      notes     on      Discrete     probability      functions.
(10)
(b)    Explain the Mathematical solutions of Queuing problems.
(10)

6. (a)      Explain the SIM SCRIPT system concepts.             (10)
(b)    Explain the MAIN Routine in SIM SCRIPT.             (10)

7. (a)      Explain the simulation of Telephone system.         (10)
(b)    Describe the trace drive simulation.                (10)

8. Write short notes on :
(a)    Exponential Decay Models                            (10)
(b)    A uniform Random Number generator.                  (10)

———————
DE–658                                                      209

DISTANCE EDUCATION

M.C.A. (Non–Semester) DEGREE EXAMINATION, DECEMBER 2010.

OBJECT ORIENTED ANALYSIS AND DESIGN

(2001 onwards)

Time : Three hours                         Maximum : 100 marks

All questions carry equal marks.
(5 × 20 = 100)

1. Explain the elements of the object model.                    (20)

2. Explain the relationship among classes.                      (20)

3. Explain about the purpose of analysis and design.            (20)

4. Write a note on UML state diagram.                           (20)

5. Discuss the following :

23           DE–641
(a)   Elaboration process.                              (10)
(b)   Refactoring process.                              (10)

6. What are the elements of the object model? Explain.       (20)

7. Explain about key abstraction mechanism.                  (20)

8. What is class diagram? Explain with an example.           (20)

————————

DE-659                                                  210

DISTANCE EDUCATION

M.C.A. (N.S.) DEGREE EXAMINATION, DECEMBER 2010.

INTERNET PROGRAMMING

(2001 onwards)

Time : Three hours                       Maximum : 100 marks

All questions carry equal marks.

(5  20 = 100)

1. (a)     Explain the various design issues in WWW.

(b)   Discuss security and encryption in detail.

2. (a)     Expand CGI. Explain it in detail.

(b)   Describe the process of Microsoft Internet Implementation.

3. Write an essay about VB script and its components in detail.

4. (a)     Compare and contrast HTML with SGML.

(b)   Write short notes on Shokwave and Lingo.

5. (a)     Discuss the steps for creating Netscape Navigator plug-ins.

(b)   Explain the concept of pulling web information.

24             DE–641
6. (a)     Describe the process of creating a custom integrated application with
multiple protocols.

(b)   Write short notes on Perl.

7. (a)     Discuss the concept of site and page design.
(b)   Illustrate the concept of framing your graphics.

8. (a)     Explain the principles of animation in detail.
(b)   Discuss any Five HTML tags with example.

——————

25           DE–641
DE–660                                                      211

DISTANCE EDUCATION

M.C.A. (Non-semester) DEGREE EXAMINATION,

DECEMBER 2010.

SOFTWARE ENGINEERING

(2001 onwards)

Time : Three hours                           Maximum : 100 marks

Answer any FIVE questions.       (5  20 = 100)

All questions carry equal marks.

1. Discuss in detail about :
(a)      Linear Sequential Model.                          (10)

(b)      Prototyping Model.                                (10)

2. Describe about Software Risk identification and Projection.

3. What are conditions used to get ISO 9000 Quality standards? Explain with its
Reliability.

4. Discuss about Formal Technical Reviews (FTR).

5. Explain in detail about Software Design notations.

6. Explain about Modular design, and also explain the types of coupling and
cohesion.

7. Discuss the following :

(a)      Data Design.                                      (10)

(b)      Architectural Design.                             (10)

8. Explain in detail about Black box and white box testing.

26          DE–641
————————
DE–661                                                         212

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.

VISUAL PROGRAMMING

(2001 onwards)

Time : Three hours                         Maximum : 100 marks

All questions carry equal marks.
(5  20 = 100)

1. (a)   Compare and contrast between windows programming and traditional
programming model.
(10)
(b)    Explain about Message Maps and Memory Management in detail.
(10)

2. (a)      Discuss in detail about procedures and functions with an example
program. (10)
(b)    Explain about form properties in detail.            (10)

3. Discuss in detail about data control with an example program.
(20)

4. Describe in detail about Model dialog and Modeless dialog.
(20)

(20)

6. Explain the following :
(a)    Splitter Windows.                                   (10)
(b)    Document View Architecture.                         (10)

7. Discuss the following :
(a)    OLE.                                                (10)

27          DE–641
(b)   Exception Handling.                               (10)

8. Explain in detail about database management with Microsoft ODBC with an
example. (20)

————————
DE–662                                                     301

DISTANCE EDUCATION

M.C.A.(NS) DEGREE EXAMINATION, DECEMBER 2010.

SOFTWARE PROJECT MANAGEMENT

(2001 onwards)

Time : Three hours                        Maximum : 100 marks

All questions carry equal marks.
(5 × 20 =100)

1. Explain the steps to defining a software development process in detail.
(20)
2. (a)     Discuss the need for discipline in detail.        (10)
(b)   Write the attributes of successful leader in detail.
(10)
3. (a)     Explain top down and bottom up planning in detail.
(10)
(b)   How does the critical path help in estimating the duration of an activity?
Explain with an example.
(10)
4. (a)     Explain project outlook. Discuss when should tracking occur?
(10)
(b)   How to schedule tracking meeting? Discuss and Write the tracking
meeting         ground           rules         in         detail.
(10)
5. (a)     Discuss the steps needed to understand the customers problem and to
solve it. (10)
(b)   What is the need for product adjectives? Discuss in detail.
(10)

28            DE–641
6. (a)      Describe the procedure for performing functional test.
(10)
(b)   Explain unit test and its plan.                  (10)

7. (a)      Explain vendor relationships in detail.          (10)
(b)   Discuss the vendor contract process in detail.   (10)

8. Write in detail about the following:
(a)   Post project review                               (7)
(b)   Anticipating qualities weak link                  (6)
(c)   Project check list.                               (7)

————————
DE–663                                                      302

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.

CLIENT SERVER TECHNOLOGY

(2001 onwards)

Time : Three hours                        Maximum : 100 marks

All questions carry equal marks. (5  20 = 100)

1. (a)      What is client server computing? Explain its advantages.
(b)   Discuss about Mainframe applications and preserving it.

2. (a)      Write about Downsizing client server computing.

(b)   Explain about Various client services.

3. (a)      Discuss on DDE, OLE and CORBA.

(b)   Write about Server operating systems.

4. (a)      Explain OSI model.

29          DE–641
(b)    Discuss about Communication interface technology.

5. (a)       Write about Hardware components of client server architecture.

(b)    Discuss on WAN Technology.

6. (a)       Describe about distributed objects.

(b)    With neat sketch explain Web client/server architecture.

7. (a)       Discuss on Networking operating systems.

(b)    Explain SQL Windows and Tool set.

8. (a)       Describe prototype process in developing an application.

(b)    Discuss on EASEL Workbench and APT Workbench.

–––––––––––
DE-664                                               303

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

PATTERN RECOGNITION AND IMAGE PROCESSING

(2001 onwards)

Time : Three hours                         Maximum : 100 marks
(5  20 = 100)
All questions carry equal marks

1. (a)       With neat sketch explain human vision system.
(b)   Discuss on Ranging devices.
2. (a)       Give a note on Image processors.
(b)   Explain two dimensional geometric transformation
3. (a)       Write in detail about spatially dependent transformation.

30          DE–641
4. (a)     Discuss on pyramid edge detection.
(b)   What is edge detection? Explain crack edge detection.
5. (a)     Explain Quantizing compression.
(b)   Describe Real time image transmission.
6. (a)     What is pattern recognition? Explain design concepts and methodologies.
(b)   List and explain examples of automatic pattern recognition systems.

7. (a)     Discuss on linear decision functions.
(b)   Explain single and multiple prototypes.

8. (a)     Write about cluster seeking algorithm.
(b)   Describe in detail about maximum distance algorithm.

——————
DE–665                                                  304

DISTANCE EDUCATION

M.C.A. (Non Semester) DEGREE EXAMINATION,
DECEMBER 2010.

COMPILER DESIGN

(2001 onwards)

Time : Three hours                        Maximum : 100 marks

All questions carry equal marks.
(5 × 20 = 100)

1. Explain the structure of a compiler.                      (20)

2. Explain the role of the lexical analyzer.                 (20)

3. Discuss about the operator precedence parsing with an example.
(20)

4. Explain in detail about the constructing canonical LR parsing table.
(20)

5. Discuss about the following :
(a)   post fix translations.                            (10)

31         DE–641

6. Explain about the data structures for symbol table.        (20)

7. Write a note on lexical phase errors.                      (20)

8. Explain loop optimization with an example.                 (20)
———————
DE–666                                                     305

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.

MULTIMEDIA SYSTEMS

(2001 onwards)

Time : Three hours                         Maximum : 100 marks

(5  20 = 100)

1. (a)      Explain different types of Multimedia products. (10)

(b)    Explain the stages of a Multimedia Project.       (10)

2. (a)      Explain the following media types

(i)    Temporal

(ii)   Non-Temporal.                              (10)

(b)    Explain briefly the digital audio systems.        (10)

3. (a)      Explain the characteristics of Digital Video.     (10)

(b)    What do you mean by animation? How will you use it? Explain.
(10)

4. Discuss in detail the MPEG motion video compression standard.
(20)

5. (a)      Explain about Transform classes.                  (10)

(b)    Explain about Media classes.                      (10)

6. Explain the following :

32            DE–641
(a)     Video capturing.                                 (10)

(b)     Playback.                                        (10)

7. Explain the architecture and operations of multimedia environment.
(20)

8. Discuss on impact of multimedia on Training and education.
(20)

————————
DE–1028                                                     106

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

LAB I — DATA STRUCTURES USING ‗C‘ AND MS-OFFICE

(2003 and 2004 Batches)

(Upto 2004)

Time : Three hours                             Maximum : 100 marks

Answer any TWO questions choosing one from data structures and another from
MS-Office.
Break-Up of Marks
Record Note Book             :     5
Algorithm/Flowchart          :     15
Program                      :     35
Debugging & Execution :            35
Result                       :     10
Total                        :     100
Cut here

DATA STRUCTURES

1. Write a C program to convert a given number into words for numbers 1 to 10.

Cut here

33        DE–641
2.   Write a C program to read 10 values to array variable use pointer to locate and
display each value.

3.   Write a C program to copy contents of one file to another file.

Cut here

4.   Write a C program for linked list implementation of queue operations.

Cut here

5.   Write a C program to implement push and pop operations on stack.

Cut here

MS-OFFICE

6.   Prepare Pongal and Diwali Greeting cards with picture insertion and
alignment write the procedure to take hard copy.

Cut here

7.   Prepare a document to advertise your company and tender notice using
newspaper format.

Cut here

8.   Type the 4 columns and 5 rows values in a document and convert into table

9.   Create a woksheet with the following data for five students Regno, Name four
test marks.
(a)   Find the total, average of each student.
(b)   Find the highest and lowest scores in each subject.
(c)   Find the highest and lowest scores and draw the bar chart as per the
average mark.

34          DE–641
(d)    Declare the result is ‗pass‘ if average is more than or equal to 50%
otherwise ‗FAIL‘.

Cut here

10.   Construct the worksheet with the following Emp.No, Emp. Name, designation,
Hra, Lic, Da.Hra, PF, Grosspay, Netpay.
(a)    Type the 10 data for Emp.No, Emp name , designation, LIC, HRA and
PF.
(b)    Calculate :
DA = 35% of basic pay
HRA = 15% of basic pay
Gross pay = Basic pay + DA + HRA
Net pay = Grosspay – (LIC + PF + HRA).

(c)    Prepare public for each every employee with your own format
(d)    Draw the graph for Netpay and Mark legend, title.
(e)    Convert into Ms-Excel using OLE concept.

———————
DE–1029                                                   113
DISTANCE EDUCATION
M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.
Lab II — GRAPHICS USING C++ AND ALGORITHMS
(2003 and 2004 Batches)
(Upto 2004)

Time : Three hours                          Maximum : 100 marks
Examiner has to choose ONE question for each candidate by lot system
Break-up of marks
Record Note Book : 5
Algorithm/Flow chart : 15
Program : 35
Debugging and Execution : 35
Result : 10
Total : 100

35        DE–641
1. (a)     Write a C++ program to draw a straight line using simple DDA
technique.
(b)   Write a C++ program to perform various operations of dequeue.
Cut here

2.   (a)   Write a C++ program to draw non linear object circle and three
concentric circles.
(b)   Write a C++ program for linear search.

Cut here

3.   (a)   Write a C++ program to manipulate the graphical object using SHADING
technique.
(b)   Write a C++ program for converting a decimal number into binary
system.

4.   (a)   Write a C++ program to draw a ball and perform animation on it.
(b)   Write     a     C++      program       for     generating   the    first
10 terms of the Fibonacci series using recursion.

Cut here
5.   (a)   Write a C++ program to draw a cube and specify its co-ordinates.
(b)   Write a C++ program to solve tower of Hanoi

Cut here

6.   (a)   Write a C++ program to show graphical transformation on a three
dimensional object.
(b)   Write a C++ program to implement the basic operations in STACK.
Cut here

7.   (a)   Write a C++ program to draw a ball and perform animation on it.
(b)   Write a C++ program for Binary searching.

Cut here

8.   (a)   Write a C++ program to draw nonlinear objects arcs and curves.
(b)   Write a C++ program for Ackerman‘s function using recursion.

——————
DE–1030                                                  206

36          DE–641
DISTANCE EDUCATION
M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2010.
LAB V — RDBMS
(2001 and 2002 batches)
(Upto 2004)

Time : Three hours                        Maximum : 100 marks

Each question carries 100 marks. Examine has to choose and give ONE question for
each candidate by lot system.

1. A departmental store maintains a file that contain records with the following
fields, store name, department number, item description, sales price, quantity, cost,
total write a PL/SQL program that prepares a daily report.

2.   Create a file with the following information employee no, employ name,
Cut here
department, basic pay, HRA, DA, PF. Write a PL/SQL program to calculate net
pay.
Cut here
3.   Write a PL/SQL program for telephone billing system, If contains costume
details, telephone number, customer id, month, units used. The telephone bill
for every month has to be calculated in given below.
Rent Rs. 260 + 50 paise/unit till 1000 units and paise/unit after 1000 units.

4.                           Cut for
Write a PL/SQL program here airline reservation system. It should create two
files. One for strong the passenger detail, source, destination, time, date.
Another for Flight no, name, source, destination, date. The program should
prepare daily report and also check the availability of seats and availability of
flight at a particular date.

5.   Write a PL/SQL program for computing the electric charges. It should create a
file that stores customer information, EB No, Month, Units used. The EB Bill
in calculated as given below :
Domestic – Rs. 0.55 for 1 unit and number of units  100
– Rs. 1.00 for exceed 100 units.
Industry – Rs. 1.10 for 1 unit and number of units  1000
– Rs. 1.40 for greater that 1000 units.

Cut here

6.   Create a file with the following information student name, register number,
mark1, mark2, mark3 calculate the total and average. The grade should be
calculated.

37            DE–641
If aver > 80 grade – ‗DISTINCTION‘ (or) ‗OUTSTANDING‘.
avg.  80 and avg.  70 grade = ‗‗A‘‘
avg.  70 and avg.  60 grade = ‗‗Q‘‘
avg.  60 and avg.  50 grade = ‗‗C‘‘
avg. < 50 grade = ‗‗FAIL‘‘

Cut here

7.     Write a program in PL/SQL for hospital billing system contains records with
the following fields patient no. patient name, age, consulting charge, blood test
charge, other charges. Calculate total fee write a report for the following
conditions
(a)   The patients undergone blood test
(b)   The patients taken X-rays.

8.     Write a PL/SQL program for bank management system. To prepare a report
includes customer name, customer, Id, customer a/c, deposit, transaction, loan
etc.

—————————
DE-1031                                                207

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

LAB VI — SHELL PROGRAMMING

(2001–02 Batches)

(Upto 2004)

Time : Three hours                          Maximum : 100 marks
Record Note Book : 5
Algorithm : 15
Program : 35
Debugging and Execution : 35
Results : 10

38         DE–641
Total : 100

Examiner to select and give ONE question to each Candidate.

Each subdivision carries 50 marks.

1. (a)     Write a menu driven program for
(i)    List of files
(ii)   Processes of users
(iii) Today's date
(iv)   Users of system
(v)    Quit to UNIX

(b)   Write a shell program to convert all capital letters in a file to a small
cases letters.

2.   (a)   Write a shell program which accepts the name of a file from the standard
input and then perform the following tests on it :

(i)    File existence

(iii) File writable

(iv)   Both the readable and writable

(b)   Write a Shell program to sum up the series

1 / 1!  2 / 2!  3 / 3!  ....  1 / 10!

Cut here

3.   (a)   Write a shell program using 3 arguments to take the pattern as well as
input and output file names. If the pattern is found display ‗‗pattern
found‘‘ else display ‗‗error message‘‘. Also check if right number of
arguments are entered.

(b)   Write a shell program to display the result PASS or FAIL using the
information given below :

39              DE–641
Student Name, Reg No, Mark1, Mark2, Mark3, Mark4. The minimum
pass for each subject is 50

4.   (a)   Write a shell program which accepts the name of a file from the standard
input and then perform the following tests on it.

(i)    Enter the 5 names in a file

(ii)   Sort the names in existing file

(iii) List sorted and unsorted file

(iv)   Quit.

(b)   Suppose a user has renamed some files in current directory using
command like my file name filename.\$\$. Write a shell script to search all
such files and rename them such that they do not contain the shell PTD.

Cut here

5.   (a)   Write a menu driven shell program to copy, edit, rename, delete a file.

(b)   Write a shell program for a file contains records with each record
containing name of city, name of state and name of country. How would
sort this file with country as the primary sort key and state as the
secondary sort key.

Cut here

6.   (a)   Write a shell program to enter the sentence in file, search a given word in
an existing file and quit.

(b)   Write the shell script which gets executed the moment the user logs in. It
should display the message ‗‗Good morning‘‘/‗‗Good afternoon‘‘/‗‗Good
evening‘‘ depending upon the time at which the user logs in.

7.   (a)   Write a shell program to prepare electric bill for domestic customers
using the following data :
(i)    For first 100 units Rs. 75/unit
(ii)   For first 100 units Rs. 1.50 unit
(iii) For first 100 unit Rs. 3.00/unit
Prepare the bill for the following format
Input : Customer Number, Customer Name, Previous reading, Current

40          DE–641
(b)     Write a shell program to convert all capital letters in a file to a small
cases letters.

Cut here

8.   (a)     write a shell program to sum up the series

1 / 1!  2 / 2!  3 / 3!  ...  1 / 10!
(b)     Write a shell program for a file contains records with each record
containing name of city, name of state and name of country. How would
sort this file with country as the primary sort key and state as the
secondary sort key.

———————
DE–1032                                                                 213

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

Computer Science

LAB VII — INTERNET PROGRAMMING

(2001 and 2002 batches)

(Upto 2004)

Time : Three hours                             Maximum : 100 marks

Break-Up of Marks
Record Note Book           :        5
Algorithm/Flowchart        :      15
Program                    :      35
Debugging & Execution :           35
Result                     :      10
Total                      :      100
Examiner has to choose the question for each candidate by lot system Each
question carries 100 marks.
Cut here

1. (a)       Write a Javascript to create a order form to select house articles.
(b)     Design and publish a web page for a college.
Cut here

41              DE–641
2.   (a)   Write a HTML program to develop a web page for job recruitment agency
in an IT industry.
(b)   Write a java program to create a color as the back ground.

3.   (a)   Write a VB script to do the following :

(i)    Find the difference between the two dates.

(ii)   Find the age of a person by providing date of birth.

(iii) Display the current date.

(b)   Develop a single page advertisement for a shop to be opened shortly.

Cut here

4.   (a)   By using database connectivity display the records in a table.

(b)   Write a java program using applet to display the different colors and
fonts.

Cut here

5.   (a)   Write    a    java    program      using Applet to    display   any
3 images when 3 buttons in the border layout are clicked. The image
should be displayed at the center.

(b)   Write a swing program to create buttons with

(i)    Tool tip text

(ii)   Image

(iii) Border

(iv)   Short cut key.

6.   (a)   Write a Java program using Applet to display the dialogue and menu in
applet.
(b)   Using at least 20 HTML tags, create a screen with a string ―WEB
DESIGN‖.

Cut here
7.   (a)   Write a Swing program to create the tabbed panels.

42          DE–641
(b)    Write a Java program to create a color as a background.

Cut here
8.   (a)    Develop a picture gallery having at least 3 pages. Each of them is having
several pictures.
(b)    Create a web page in the format of front page of a newspaper using Text
links. Align the text with colors.

———————
DE–1033                                                     214

DISTANCE EDUCATION

M.C.A.(NS) DEGREE EXAMINATION, DECEMBER 2010.

LAB VIII — VISUAL PROGRAMMING

(2001 & 2002 batches)

Time : Three hours                         Maximum : 100 marks

Break up of marks :
Record Note Book : 5
Algorithm/Flow chart : 15
Program : 35
Debugging and Execution : 35
Result : 10
Total : 100

Each          candidate      should        select     one     question    using
lot system.

1. (a)      Using VB develop a data report using employee table with the following :
(i)    Display all the employee details
(ii)   Display all the employee details in each department and display
total salary in each department.
(b)    Write a VC++ program to find out whether a mouse is attached or not;
and if attached how many buttons are present or not.

43            DE–641
2.   (a)   Using Activex control create a textbox that accepts only numeric value
with the following properties.
(i)    Background of the textbox
(ii)   Foreground of the textbox
(iii) Text property of the text box.
(b)   Write a VC++ program to create a window of desired size using MFC.

Cut here

3.   (a)   Create a worksheet with the following fields stuname, Internal mark,
external mark and result. Using data access object, create a student
application to do the following operations.
(i)    Insert the records
(ii)   Delete the records
(iii) Update the records.
(b)   Write a VC++ program to create a list box in a window.

4.   (a)                  Cut here
Create a VB program to develop a data report using employee table with
the following.
(i)    Display all the employee details
(ii)   Display all the employee details in each department and display
total salary in each department.
(b)   Write a VC++ program to generate a status bar and show the status of
Caps lock, Num lock and Scroll lock in it.

5.   (a)   Create a VB form with Text box, Combobox and Command button and do
the following operation.

(i)    Add the university name in the Combobox at the run time

(ii)   Search and delete the particular university in the Combobox

(iii) Sort the university names in the alphabetical order.

(b)   Write a VC++ program to get the status of the shift and toggle keys using
MFC.

Cut here

44         DE–641
6.   (a)   Create a VB program using built in AX control, develop the windows
notepad with file and edit menu operation and also display the floating

(b)   Write a VC++ program to fill background of the client area with a bit
map.
Cut here
7.   (a)   Create a VB program using MSFlex grid control, display the
multiplication and addition table of 20 rows and columns.

(b)   Write a VC++ program to handle windows messages in MFC program.

8.   (a)   Write a VB program to perform the following operation in a record of
random access file

(i)     Insert

(ii)    Delete

(iii) Search

(b)   Write a VC++ program to create a window of desired size using MFC.
————————
DE–1034                                                     206

DISTANCE EDUCATION
M.C.A. (Non-Semester) DEGREE EXAMINATION,
DECEMBER 2010.
LAB III — RDBMS AND SHELL PROGRAMMING
(2003 – 2004 batches)
(Upto 2004)
Time : Three hours                           Maximum : 100 marks

Each candidate should select a question using lot system.
Each subdivision carries 50 marks.

Cut here
1. (a)     A hospital maintains blood donors record information in a file. The items
are
Donor Number, Donor name, Donor age, Donor Address, Pin, Place of
birth, Blood group (A, B, AB and O).

45         DE–641
Write a PL/SQL program to print out the number, name and address of
the donors for the following categories :
(i)    Blood donor having blood group AB.
(ii)   Blood donor in the age group between 16 to 25.
(iii) Female donors having blood group A in the age between 20 and 25.
(b)   Write a Shell program using 3 arguments to take the pattern as well as
input and output file names. If the pattern is found display ‗‗Pattern
Found‘‘ else display ‗‗error message‘. Also check if right number of
arguments are entered.

2.   (a)   Write a program in SQL to compute electric bill with the following
conditions :
For domestic –    Rs. 0.55 for 1 unit
Rs. 1.00 for exceed 100 unit
Create a table having the structure service number, previous reading and
(b)   Write a Shell program to convert all capital letters in a file to small case
letters.
Cut here

3.   (a)   Write a program in SQL to hospital billing system having the following
fields : Patient No, Name, Age, Doctor Attending, Patient type (IN/OUT),
Consulting charge, Blood test charge, X-ray charge, other test charges
and total fee.
Write a report program for the following conditions :
(i)    The patients undergone blood test.
(ii)   The patients who taken X-rays
(iii) The patients who belong to In-patient category.
The fields to be included in the reports are patient no, patient
name, age and charge and total fee.
(b)   Write a menu driven shell program to copy, edit, rename, delete a file.
Cut here

4.   (a)   Write a PL/SQL program and execute the same for a Railway
Reservation System. Demonstrate Reservation and cancellation
operations.
(b)   Write a menu driven shell program to copy, edit, rename, delete a file.

5.   (a)   Write a PL/SQL program to prepare grade sheets for students. An
examination has been conducted to a class of 10 students and 5 scores

46           DE–641
have been provided along with register number and name. Assign a letter
grade to each student based on the average score. List out the student‘s
register number, average score and grade.
(b)   Write a shell script which will receive either the file or file name with its
full path during execution. This script should obtain information about
this file as given by ls – l and display it in proper format.
Cut here
6.   (a)   Write a PL/SQL program for payroll. Create a master table containing
the details of employees including basic pay. Allowances are : DA, HRA
and CCA. Deductions are : PF and Income Tax. Use your own logic for
the calculations and prepare pay slips and consolidated report.
(b)   Suppose a user has renamed some files in current directory. Write a shell
script to search all such files and rename them such that they do not
contain the shell PID.
Cut here
7.   (a)   Each morning a newspaper vendor buy newspapers in wholesale from a
distributor for 60 paise and sell them for 75 paise. Unsold papers are
returned to distributor for 30 paise per paper. Prepare a report for the
vendor with 10 weeks data including profit and loss for each week and
over all total at the end of 10 weeks.
(b)   Write a Shell program which accepts the name of a file from the standard
input and then perform the following tests on it :
(i)   Enter 5 names in a file.
(ii) Sort the names
(iii) List unsorted and sorted file
(iv) Quit.

8.   (a)   Create a salesman table containing S.No., Name Commission along with
minimum sales for which the commission is given and a monthly sales
report containing suitable sales details. Write a PL/SQL program to join
three two tables into one sales table that contains only relevant fields
from the first two tables and outputs each salesman commission slip.
(b)   Write a Shell program to sum up the series :
1   1  1          1
    ......      .
1! 2! 3!         10!

–––––––––––––––
DE–1035                                                  213

DISTANCE EDUCATION
M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

47          DE–641
LAB IV — INTERNET AND VISUAL PROGRAMMING
(2003 and 2004 Batches)
(Upto 2004)

Time : Three hours                      Maximum : 100 marks

Break-up of Marks :

Record Note Book : 5

Algorithm/Flowchart : 15

Program : 35

Debugging and Execution : 35

Result : 10

Total : 100

Examiner has to choose the question for each candidate by lot system.
Each sub division carries 50 marks.

Cut here
1. (a)     Write a Java program using Applet to display the dialogue and menu in
Applet.
(b)   Write a visual C++ program to fill background of the client area with a
bit map.

2.   (a)   By using database connectivity (IDBC) insert and delete records from a
table.

(b)   Write a visual C++ program to handle windows messages in MFC
program.

Cut here

3.   (a)   Develop a web page for recruitment agency in an IT industry.

(b)   Write a visual C++ program to find out whether a mouse is attached or
not. If attached find how many buttons present.

48           DE–641
4.   (a)   Write a visual C++ program to handle windows messages in MFC
Cut here
program.

(b)   Write a Java script to create a color palet and display the background in
the color chosen from palet.

Cut here

5.   (a)   Write a Java program using Applet to display the different colors and
fonts.

(b)   Write a visual C++ program to create a window of desired size using
MFC.

6.   (a)   Write a swing program to create the tabbed panels.

(b)   Write a visual C++ program to get the status of the shift and toggle keys
using MFC.

Cut here

7.   (a)   Write a VB script to do the following :

(b)   Write a visual C++ program to create a list box in a window.

Cut here

8.   (a)   Write a Java program using Applet to create the frames and its controls.

(b)   Write a visual C++ program to generate a status bar and show the status
of caps lock, num lock and scroll lock on it.

————————
DE–1036                                                  306

49         DE–641
DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

LAB (IX) MULTIMEDIA SYSTEMS

(Upto 2001 and 2002 batches)

(Upto 2004)

Time : Three hours                         Maximum : 100 marks
Record Note Book : 5
Algorithm/Flow chart : 15
Program : 35
Debugging and Execution : 35
Result : 10
Total : 100

Examiner has to choose question for each candidate by lot system .
Each subdivision carries 50 marks.
Cut here

1. (a)    Write a C++ program for setting up a pattern for multiple-grey level
images on bilevel display using limbs algorithm with a 2  2 matrix
Also print the dot patterns produced on a 16 grey-level system for a pixel.
(50)

(b)   Animate traffic signal using flash.               (50)

2.   (a)   Write a C++ program for grey level transformation techniques

(i)    Thresholding

(ii)   Bunching.                                  (50)
(50)
Cut here

3.   (a)   Write a C++ program to find the best grey level for splitting an image.
Use automatic selection for splitting technique.           (50)
(50)

50        DE–641
Cut here

4.   (a)   Write a C++ program to find edges of an image using sobel edge detection
procedure. (50)
(b)   Prepare a power point presentation for courses offered by an educational
institution.     (50)
Cut here

5.   (a)   Write a C++ program to empress image using contour coding techniques.
(50)
(b)   Using flash animate a gift box which opens on mouse dick.
(50)
Cut here

6.   (a)   Write a C++ program for 2 dimensional image animation using computer
graphics. (50)
(50)

7.   (a)   Write a C++ program to transform the grey-level using histogram
equalization technique. (50)

Cut here
8.   (a)   Write a C++ program to compress an image using run-length encoding
technique. (50)
(b)   Do image animation using flash.                 (50)

————————
DE–1037                                                  307

DISTANCE EDUCATION

M.C.A. (NS) DEGREE EXAMINATION, DECEMBER 2010.

LAB X — COMPILER DESIGN

(2001 and 2002 Batches)

(Upto 2004)

51        DE–641
Time : Three hours                        Maximum : 100 marks
Break-up of marks :
Record Note Book : 5
Algorithm/Flow chart : 15
Program : 35
Debugging and Execution : 35
Result : 10
Total : 100
Candidates has to choose ONE question using lot system.
Each question carries 100 marks.

1. (a)     Write a C program to recognize identifier in the given source code.
(b)   Write a C program to recognize constant in the give source code.
Cut here

2.   Construct a C program to accept a string and check whether it satisfies the
following production rule. (By using operator precedence Grammar).
S  AbB
A  aBb
B  a / Bba.

3.   Write a C program to accept a string and check whether it belongs to
ambiguous grammar or not by using the following production rule.

E  E  E / E  E / E  E / E / E / id / const /( E )

Cut here

4.   Write a C program to construct an LALR parsing table for the following
grammar

S  BB
B  aB / b.

Cut here

5.   Write a C program to construct an SLR parsing table for the following
grammar

52            DE–641
E  E  T /T
T T F /F
F  E  / id.

Cut here

6.   Write a C program to construct, predictive parsing table for the following
production rule

S  iCtS S  / a
S   eS / E ( E is empty )
C  b.

7.   Write a C program to check the production rule whether it is an operator,
grammar or not
(a)      S  aBCD
S  aBdC
(b)       E  E  E / E  E /( E ) / id
E  E OPE
(c)
E  (E )
E  id;
OP   |  || / .

Cut here

8.   Write a program to construct infix to postfix notation using C.
————————
DE–1038                                                   306

DISTANCE EDUCATION

M.C.A.(NS) DEGREE EXAMINATION, DECEMBER 2010

LAB V – MULTIMEDIA SYSTEMS AND COMPILER DESIGN LAB

(2003 and 2004 Batches)

(upto 2004)

53        DE–641
Time : Three hours                      Maximum : 100 marks
Break-Up of Marks
Record Note Book:         5
Algorithm / Flowchart: 15
Program:                 35
Debugging & Execution: 35
Result:                  10
Total                   100
Examiner has to choose the questions for each candidates          by lot system.
Each subdivision carries 50 marks.

1. (a)     Write a C++ program to transform the grey-level using Histogram
Equalization technique.
(b) Write a C program which accepts (a/b)* abb draw the transition diagram
for DFA.

Cut here

2.   (a)   Write a C++ program for gray level transformation techniques.
(i)    Thresholding
(ii)   Bunching
(b)   Write a C program which accepts (1/0)+10(1/10)* draw the transition
diagram for DFA.

3.   (a)   Write a C++ program for two dimensional image animation using
computer graphics.
(b)   Write a C program to construct of an Canonical LR parsing table for
following grammar.
S  CC
B  aB / b

Cut here

4.   (a)   Write a C++ program for creating an image form the given image using
automatic selection of grey level for splitting technique.

1 8 4 3 6 2 5 2 8 4 6 2 5
0 3 8 3 6 5 4 0 3 8 3 8 7
0 9 8 0 5 4 8 5 9 3 7 2 9

54          DE–641
(b)   Write a C program to check the production rule whether it is operator
grammar or not.
(i)    S  aBCd
S  aBdC
(ii)   E  E  E E * E ( E ) id

Cut here

5.   (a)   Write a C++ program to compress the image using Run length
Encoding(RLE) technique.
(b)   Write a C program to construct canonical LR parsing table for the
following grammar.
S  CC
C  cC / d

(b)   Write a C program to construct of a Canonical LR parsing table for the
following grammar.
S  CC
C  cC / d

Cut here

7.   (a)   Prepare a slides show for the courses offered by an Educational
Institution using Power Point Presentation.
(b)   Write a C program to construct predictive parsing table for the following
production rule.
S  iCtSS 1 a
S 1  eS E ( E is empty )
C b

Cut here

8.   (a)   Design an advertisement for a home appliances product using Power
Point presentation.
(b)   Write a C program to translate the expression (a+b)*(b-c)/(a+b)      into
postfix notation.

55      DE–641
————————

56      DE–641

```
DOCUMENT INFO
Shared By:
Categories:
Tags:
Stats:
 views: 16 posted: 12/30/2011 language: pages: 56