Banaras Hindu University MCA Sample papers needed

**Ritesh Singh** · 26-03-2009

Hello all people,
Can anyone give me a link or so to download sample paper of MCA of Banaras Hindu University. I would be very glad if anyone can give it to me. Thank you.

**Amil** · 26-03-2009

Here is the SAmple paper of MCA (Second Year) Examination 2005

FIRST PAPER

PRINCIPLES OF OPERATING SYSTEM

Time: Three hours Maximum Marks: 80

NOTE: Answer Five Questions in all, including Question No.1, which is compulsory.

Figures on the right-hand side margin indicate Max. Marks for each Question.

Answers should be brief and to the point and may be supplemented with neat

Sketches.

1. Answer all the parts: (05 X 04 =20)
(a) Define the Terms: Process Switch & Context Switch? How are they related?
(b) A Computer System has 36-bit Virtual Address Space with a Page Size of 8 K and each page
table entry of 4 Bytes. What will be number of pages in Virtual Address Space? What is the
maximum size of addressable Physical Memory?
(c) How can mutually exclusive access of Critical Sections be achieved using Interrupt Disabling
Mechanism? Can this scheme be used with Multiprocessor Systems?
(d) What are the necessary conditions for deadlock to occur in a computer system? ‘A cycle in
wait-for-graph is necessary and sufficient condition for deadlock to occur’. Comment.
(e) What are Foreground and Background Processes in UNIX? What does the following C
Program do:
main()
{ int pid, ppid;
pid=getpid();
ppid=getppid();
printf(“process id=%d parent id =%d”, pid, ppid);
}

2. (a) Giving the notion of Process & Process states briefly explain the Process State (7)
Transitions with the help of a neat diagram.
(b) What are the criteria used for comparing various scheduling algorithms? Compute the (8)
Average Waiting & Turnaround times for the following, if Shortest Remaining Time First
Scheduling Algorithm is used:
Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
3. (a) Compare Fixed Partition Scheme to Dynamic Partition Scheme of memory management. (7)
Can compaction be used with Compile Time and Load Time Bindings?
(b) Define the notion of Logical & Physical Addresses. How is Logical Address translated to (8)
Physical Address in Paging? Explain with a neat diagram.
4. (a) Consider the following page reference string: (7)
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
How many page faults will occur for the FIFO page replacement algorithms, assuming three
frames? Does the page fault rate always decreases with increasing number of frames?
(b) What is a Semaphore? Explain how it can be used to solve Finite Buffer Producer (8)
Consumer problem.
5. (a) Explain why wait and signal operations on semaphores need to be atomic. Differentiate (7)
between strong and weak Semaphores. Which one of these guarantee freedom from
starvation?
(b) Distinguish between Deadlock Prevention & Deadlock Avoidance. How can a (8)
computing system recover from Deadlock, if one is known to exist?
6. (a) Consider a UNIX Inode having 15 pointers, out of which 12 are pointers to direct (7)
blocks and remaining to indirect blocks, with 13th for single indirection , 14th for
double indirection & the 15th for triple indirection. Assume block size of 1 KB and
each address of 2 Bytes. What can be the maximum size of a File?
(b) What Delay elements are involved in Disk read & write? Consider a disk queue with (8)
requests for I/O to blocks on following Cylinders:
98, 183, 37, 122, 14, 124, 65, 67
in that order. If the head is initially at cylinder 53, what will be the total head movement
in serving all the requests, if Shortest Seek Time First scheduling algorithm is used?
7. Write short notes on any two of the following: (7.5 X 2 = 15)
(a) Batch Processing & Multiprogramming.
(b) Process Control Block.
(c) File Allocation Methods.
(d) Operating System Structure.

tarun said..
MCA-102: Introduction to Programming Language Through C Question paper

MCA (Semester I) Examination 2004-2005

MCA-102: Introduction to Programming Language Through C

Time: Three hours Maximum Marks: 70

Note: Answer Five Questions in all, including Question No.1, which is compulsory.

Figures on the right-hand side margin indicate Max Marks for each Question.

1. Answer all the parts: (3+3+4+4=14)
(a) What are High Level Programming Languages? Give two examples. What are the benefits
of using High Level Programming Languages?
(b) What will be the value of K in the following C expression? Given num=30.
K = (num>5?(num<=10?100:200):500)
(c) What is an Abstract Syntax Tree? Construct the Abstract Syntax Tree for the Infix
expression: b*b-4*a*c.
(d) What will be the output of following C Programme?
main()
{
int i=1, j=1;
for ( ; ; )
{
if (i>5)
break;
else
j+=1;
printf (“\n %d”, j);
i+=j;
}
}
2. (a) What are Compilers and Interpreters? How are they different? Give two examples (7)
each of Compiled and Interpreted languages.
(b) Differentiate between Call by value and Call by reference methods of parameter (7)
passing to a function giving an example of each.
3. (a) What do you mean by Scope of a variable? Differentiate between Global and (7)
Local Scope of variables giving an example of each.
(b) Explain with examples the syntax & working of following C constructs: (7)
while …, do…..while, For…..
4. (a) What are Storage classes in C? Explain the method of declaration and working of (7)
the four storage classes in C.
(b) What is recursion? Write a recursive function in C to compute the Factorial value (7)
of an integer. The Factorial of an integer n is defined as n X (n-1)X (n-2)X…..X1.
5. (a) Define an Array? Write a Programme in C to sort an array of integers in ascending (7)
order.
(b) What is a pointer variable? How is a Pointer Variable declared? How is the (7)
address of a variable determined? How pointer can be used to pass an entire array
to a function in C?
6. (a) Explain the usage of following Console I/O functions in C: (7)
scanf ( ), printf ( ), getch ( ), getche ( ), getchar ( ), gets ( ), puts ( ).
(b) Write a Programme in C to copy one file to another. The Programme should read (7)
the filenames at command line.
7. Write short notes on any two of the following: (7 X 2 = 14)
(a) Structured Programming.
(b) C preprocessor.
(c) Structures and unions in C.
(d) Strings & String Functions in C.