Exam.

Code:0505
Sub. Code: 3872
2123
Master of Computer Applications
First Semester
CS-2111: Computer Organization and Architecture
Tine allowed: 3 Houis Max. Marks: 80

NOTE: Attempt fve questions in all, including Question No. LX (Unit-) which is compulsory
and selecting one question eachfrom Unit l -V.
X-X-X

UNIT - I
I. Justify that truth tables and K-maps are the building blocks of designing functionality ofa
computer system. Support your answer using suitable examples of your own choice. (16)

II. Distinguish the role of combination and sequential logic design with illustrative circuit
diagram. Write steps involved to design Mod-N counter and write about its real time
applications. (16)
UNIT - II
III. Describe various logic and shift micro operations and their relevar.ce in microprocessor
programming. (16)

IV. Discuss various instruction codes and instruction formats available for writing programs
in machine language. (16)

UNIT - III
V. Write note on:
a) Types of interrupts
b) Types of memories (16)
VI. Draw the pin diagram of 8086/8088 CPU elaborating the usage of each pin in the
microprocessor architecture. (16)

UNIT - IV
VII. Dist1nguish between:
a) RISCand CISC
b) SIMD and MIMD (16)
P.T.0.
 Sub, Code: 3872
(2)

VIII. How is vector processing different from array processing? Outline applications of inter
processor communication and synchronization. (16)

UNIT -V

IX. Attempt the following:

a) Compare working of encoder and decoder. (3)
b) Give an application of ripple counter. (3)
c) Write about and instruction cycle. (3)
d) What is the relevance of DMA? (3)
e) Define RTL. (2)
f) Why is super scalar pipeline design implemented? (2)

X-X-X
 Exam.Code:0505
Sub. Code: 3874
2123
Master of Computer Applications
First Semester
CS-2113: Relational Database Management System
Time allowed: 3 Hours Max. Marks: 80

NOTE: Atempt five questions in all, including Question No. LX (Unit-) which is compulsory
and selecting one question eachfrom Unit I -IV.
X-X-X

UNIT - I
I. Discuss the three tier architecture of database system in detail highlighting the role of
data independence, in the same. (16)

II. Justify that the concept of Normalization is the backbone of database management
system. Explain any four normal forms with suitable example. (16)

UNIT - II
III. Discuss the following operations with illustrative examples:
a) Union and Intersection
b) Projection and Selection .
(16)

IV. Explain the relevance of ACID properties and states of transaction. Outline various
techniques followed in DBMS for concurrency control. (16)

UNIT - III

V. Describe various types of statements available in SQL. Write a note on pattern

matching functions with sample SQL queries. (16)

VI. Write SQL commands with illustrative examples for:

a) Creating table from existing table
b) Adding constraints with attributes
c) Inserting values in a table
d) Viewing data from multiple tables (16)

P.T.O.
 Sub. Code: 3874

(2)

UNIT - IV

VII. Discuss PL/SQL architecture with its major components. Elaborate conditional and
iterative controls available in SQL with suitable examples. (16)

VIII. Write note on:

a) Block structure of PL/SQL
b) User defined and predefined exceptions
c) Types of triggers
d) Cursor management (16)

UNIT - V

IX. Attempt the following:

a) Write a note on applications of database systems. (3)
b) Draw major symbols of ER model. (3)
c) Explain log base recovery. (3)
d) Howisgrouping of data done from tables in SQL? (3)
e) Define role of Grant and Revoke Commands (2)
f) What iscomposite data type in PL/SQL? (2)

X-X-X
 Exam.Codc:0505
Sub. Code: 3875
2123
Master of Computer Applications
First Semester
CS-2114: Operating Systems
Time allowed: 3 Hours Max. Marks: 80

NOTE: Attempt ftve questions in all, including Question No. LX (Unit-V) which is
compulsory and selecting one question each fom Unit I-IV.
X-X-X

UNIT -
I. a) List five services provided by an operating system. Explain how each provides
convenience to the users. Explain also in which cases it would be impossible for user
level programs to provide these services.
b) What is process synchronization? Describe the following problems in the context of
process Synchronization:
(i) Reader-Writer problem
(i) Dining Philosophers probiem (2x8)
II. a) What do you mean be process in a computer system? What are the different process
states? Explain the process life cycle in an operating system.
b) Suppose that the three processes P1, P2 and P3 arrive for execution at the times
indicated as (Pi, 0.0, 7), (P2, 0.5, 4), (P3, 1.2, 2) where the second component of the
iripie is tine time ar1ivai and the third component is the burst ime. Each process wil!
run the listed amount of time. Use non-preemptive scheduling, and base all decisions
on the informat:on that you have at the time the decision must be made.
i) What is the average turnaround. time for these processes with the FCFS
sched1uling algorithm?
i) What is the average turnaround time for these processes with the SJF
scheduling algorithm? (2x8)
UNIT - II
III. What is disk scheduling? How it different from disk management? Assume that the
disk head is currently at cylinder 0. (Where the total cylinders are from 0 to 199). The
disk queue requests are 75, 120,155, 80, 170, 60,and 100. Calculate the total distance (in
cylinders) moved by the disk arm by the SCAN, LOOK and SSTF algorithms. (16)
IV. a) Consider a paging hardware with a TI.B. Assume that the entire page table and all the
pages are in the physical memory. It takes 10milliseconds to search the TLB and 80
milliseconds to access the physical memory. If the TLB hit ratio is 0.6, compute the
effective memory access time (in milliseconds).
b) Consider a demand paging system with four page frames (initially empty) and LRU
page replacement policy. Compute the page fault rate (defined as he ratio of number
of page faults to the number of memory accesses) for the page reference string:
7,2, 7, 3, 2, 5, 3,4, 6, 7, 7, 1, 5, 6, 1. (2x8)
P.T.O.
 Sub. Code: 3875
(2)
UNIT - III
V. a) How is Linux shell different from Linux kernel? Elaborate the salient features of
Bourne Again Shell (BASH).
b) In an ext2 Linux file system, an inode consists of 12 Direct Disk Block Addresses

(DBA), 1single indirect DBA, 1doubly indirect DBA and I triple indirect DBA. The
DBA requires 32 bits and the Disk block size is 1KB. Then what is the maximum file
size possible? (2x8)

VI. a) Write a Bourne shell script that prints the name and size of all files in the current
directory that are larger than bytes, where x is a command line argument. For
example, if the program is saved to a file called 'bigfiles', and we run is "bigfiles
4096", then it will list allfiles larger than 4096 bytes.
b) Write a shell script that reads the input file, translates all the characters in the input file
into the uppercase, and then stores the results in the specified output file. Synopsis:
upper -i infile -o outfile. (2x8)
UNIT -IV
VII. What is Operating system administration? Explain the role and functions of a system
administrator in Linux. As a Linux administrator, how do you (i) administer user and
group accounts (i) perform backup andrestore operations.Explain with examples. (16)

VIII. a) Write a 'C program to create a child process as that it can generate Fibonacci

sequence using command line arguments i.e. the number of the sequence will be
provided in the command line. Make sure that parent process waits for the child to
execute first.
b) For each of the following pairs of terms, define each term, making sure to
clarify the
key difference(s) between the two terms:
i) signal() and kill()
ii) read() and writer()
(2x8)
UNIT - V
IX. Attempt the following:
a) Explain the difference between
preemptive and non-preemptive (or co-operative)
CPUscheduling. Which scheme is the best' for a
general purpose OS, would you
say? Justify!
b) A byte-addressable memory system has 48-bit virtual addresses and 32-bit
physical addresses, with 8KB pages. Find the number of virtual
pages that each
process's page table has.
c) What the importance of regular expressions in string
d) What is Linux system run level? How
handling? Give examples.
do you move between the run levels
(including shutdown)? How do you boot your computer (running
single user mode?
Linux) into a
(4x4)
K-X-X
 Sub. Code: 3871
2123
Master of Computer Applications
First Semester
CS-2110: Dataand File Structures Using C
Timeallowed: 3 Hours Max. Marks: 80

NOTE: Attenmpt five questions in all, including Question No.A-D.9 (Section-E) which is
compulsory and seleciing one question each from Section

SECTION-A
1)
a) Explain scope and life time of variables in 'C' by taking appropriate program examples.
b) Write a function in 'C' which takes the address of a single dimensional array (containing a
finite sequence of numbers) and the number of numbers stored in the array as arguments
and stores the numbers in the same array in reverse order. (8, 8)
2)
a) Explain formatted input and output statements used in 'C'with syntax and examples.
b) Explain the function and need of each of the bitwise operators: &, 1, ^, ~. llustrate each
operator with an example. (8, 8)
SECTION-B
3)
a) What is string in 'C'? Write a 'C' program that reads a sentence and prints the frequency of
each of the vowels and total count of consonants.
b) What is pointer in "C"? Explain how the pointer variables declared and initialized? Explain
the array of pointers in 'C' with example. (8, 8)
4)
a) What is union in 'C? How it is different from structure in 'C'? How a union is declared in
'C'?
b) What is the output of the following 'C' program? (Assuming little - endian representation
of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory
address.)
#include<stdio.h>
#include<stdlib.h>
/* Assume short int occupies two bytes of storage */
int main ()

union saving

short int one;

char two[2];
};
union saving m;
m.two [O] -5;
m.two [1] -2;
printf("%d, %d, %d\n", m.two[0), m.two[1], m.one);
}/* end of main */
(8, 8)
SECTION-C
5)
a) What is binary search? How does it work? What are some differences between sequential
search and binary search? Explain with examples.
b) Briefly explain how Merge Sort works. List important advantages of Merge Sort, compared
with other sortingg algorithms. (8, 8)
 Sub. Code: 3871

(2)
6)
a) What is a linear queue? Write an algorithm for adding an element to a linear queue. How is
circular queue better than linear queue?
b) Write arecursive C(or C-lke) functlon max-min to find the largest and the smallest
numbers in a set of Ndifferent integers stored in an array A. (8, 8)

SECTION-D
7)
a) What are the differences between sequential and direct file organization? Under what
conditions, if any, is it advantageous to have the file organized as a direct file rather than
sequential file?
b) What are varlous applications of a blnary search tree? Create a Binary Search Tree for the
following data and perform In-order, Preorder and Post-order traversal of the tree: 40, 65,
25,55, 10, 70, 30, 50, 15,80, and 75. (8, 8)

8) Define spanning tree and its applications. Find the minimum spanning tree for the graph given
below:

(16)

SECTION-E
9)
a) Explain the syntax and importance of automatic and statiç as types of storage classes in 'C
with examples.
b) in C' programming language, how do you read from a file and write into a file? Explain.
c) Doubly linked list takes more space than singly linked list for storing one extra address. ln
whatcondition a doubly linked list could be more beneficial than singly linked list?
d) What is alm of hashing in the context of direct file organizatlon? What are different
hashing techniques? (4, 4, 4, 4)

X-X-X
 Exam.Code:0505
Sub. Code: 3873
2123
Master of Computer Applications
First Semester
CS-2126: MathematicalStructures and Linear Programming
Time allowed: 3 Hours Max. Marks: 80

NOTE: Attempt five questions in all, inchuding QuestionNo.9 (Unit-) which is compulsory
and selecting one question each from Unit -IV.
X-X-X

UNIT I
1 fa)Write short notes for: Pigeonhole principleand asymptotic notations. (8)
o) ) Let f:R ’ R and g:R ’Rbe defined by f(*) = 2x +1and g()= x'-2. Find composition
functions g f,fof,g"g and f o g
i) Find the minimum number of students that can be admitted to a college so that there are at least 15
students from one of the 50 states. (4+4=8)
2.) (a) Write short notes for: invertible, one-to-one, defined everywhere and onto functions using
examples. (8)
(b) (1) Prove using mathematical induction, 1 + 2 + 22 4 .. + 2n = 27+1 - 1
(ii) Prove that, 1 -x+x2-x3 + x4 + = 1 (4+4-8)
1+x

UNIT I
3.) (a) Prove that expressions are tautologies or not for, (iYt(AA(~BA ~C)) v (B AC) V(AAC)))
((p ’q)^(q ’r)) ’ ’r). (4+4-8)
(b} Prove that, P’ (QV R) (P ’ )v(P ’R) and 7(P ) (PV0)A7(P AQ). (4+4-8)
4.) (a) Write eight rules of inference in logics. (8)
(b) What is truth table for: T(P v (QA R)) ((Pv)A (PV R)) (8)

UNIT III
5.) (a} For an undirected graph G= (V, E), prove that sum of degree of vertices is equal to two times
number of edges. Also prove that graph Ghas an even number of vertices with odd degree.
b) Afair coin tossed three times, find probabilities for:(i) first toss is head, (iüi) second toss is head.
(CWrite short note on partial ordering with examples. (6+6+4-16)
6.) (a) Write formulas for number of verticesand edges in complete graph, cycle graph, wheel graph.
(b) The probability that A hits a target is 0.25, and the probability that Bhits the target is 0.4. Both shoot
at the target. Find the probability that at least one of them hits the target.
(c) Find maximal minimal, greatest lower bound, least upper bound for the set
A={2,4,6,8,12,18,24,36,72}. (6+4+616)
UNIT IV
7.) (a) Write short note on solving LPP using graphical method.
(b) Solve by simplex method, max Z= 2x, +x s.t x + 2x, s10, x, +xs6, xy -x,s2,
X4 - 2x2s1, where x1, X; >0 (6+10=16)
8.) (a)Write short note on applications of Linear programming.
(b}Solve by simplex method, max Z=3x +2x, +5x, s.t. x t+*,s9, 2x, +3x, +5x, s 30,
2x, - X -X; S 8, where x, Xz, X3 0 (6+10-16)
UNIT V
9.) (1)What are negations of the statements in predicate form:
ka "Alldrivers are punctual (b)x (x>x)
(Give two examples each for monotonically increasing and decreasing functions.
(iii) Write formulas for expected values and variance.
iv List assumptions in linear programming models.
(4 x 4 = 16)
X-X-X