Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
517 views222 pages

MCA Sem 1 Question Bank

Uploaded by

aayushsahaywork
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
517 views222 pages

MCA Sem 1 Question Bank

Uploaded by

aayushsahaywork
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 222

ARYABHATTA KNOWLEDGE UNIVERSITY

MCA QUESTION BANK

YEAR(2024-2026)

SEMESTER 1 (ALL SUBJECTS)

Contents of Book

1. Modern Operating Systems


2. Computer Oranisation and Architecture
3. Computer Networks
4. Advanced Database Management Systems
and Data Warehousing
5. CPP Object Orientation + DSA & File
6. Discrete Mathematics
a. Graph Theory
b. Automata
c. Searching Techniques
Introduction

This is a collection of all the previous question papers

for the MCA 1st semester exam.

For More Better Practice , the BCA Level Questions are made
the part of this book.

1. Modern Operating Systems [MCA-AKU]


Operating Systems and Unix [BCA-AKU]
2. Computer Organisation and Architecture[MCA-AKU]
Digital Electronics And COA [BCA-AKU]
3. Computer Networks[MCA-AKU]
Data Communication and Client -Server Architecture [BCA-AKU]
4. Advanced Database Management Concepts + Data warehousing [MCA-AKU]
Relational DBMS and RelationalAlgebra [BCA-AKU]
5. Object Oriented Analysis and Design in cpp [MCA-AKU]
CPP , File and DSA [BCA-AKU]
6. Discrete Mathematics : [MCA-AKU]
a. Graph Theory
b. Searching Algorithms
c. Automata and Language Theory

Collective and Coordinated Efforts

- MCA Batch @
Cimage College , Patna
Modern Operating Systems
www.aktuonline.com
(b) What is access matrix? Why an operating system needs Printed Pages : 4
matrix? Discuss. NBC203
194403
(c) Write and find safe sequence using the banker's algorithm (Following Paper ID and Roll No. to be filled in your Answer Book)
for the following snapshot PAPER ID : 194403
Allocation Max Available
Roll No.
ABC ABC ABC
P0 010 753 332
MCA-DUAL DEGREE
P1 200 322
(SEM. II) THEORY EXAM. 2014-15
P2 302 902 OPERATING SYSTEM
P3 211 222
Time : 3 Hours] [Total Marks : 100
P4 002 433
i) What is the content of matrix need?
Note : Attempt the questions as indicated.
ii) Check the system for safe stage. Q1. Attempt any four questions from the following : 5x4=20
iii) Process P1 request (1,0,2). Can the request be (a) What is an operating system? Discuss the main services
granted? of the operating system.
(b) Discuss the main purpose of system call and system pro-
grams.
(c) What are the difference between hard real time system
and soft real time system?
(d) What is multiprogramming and multitasking?
194403] 4 [JJ5] 194403] 1 [Contd...
www.aktuonline.com
(e) What do you mean by Kernel? Explain microkernel. (a) Define deadlock. Give four conditions for occurrence of
(f) What is process control block? Explain all its components. deadlock. How it can be prevented?
Q2. Attempt any four questions from the following : 5x4=20 (b) Explain Banker's algorithm.What is its use? Explain using
suitable example.
(a) Briefly discuss the virtual machine.
(c) What is safe state? What is its use in deadlock
(b) Explain the term CPU scheduling. Discuss the scheduling
avoidance? Explain it using an example.
objectives in brief.
Q4. Attempt any two questions from the following : 10x2=20
(c) Write an algorithm to explain the producer / consumer
(a) What is disk scheduling? Explain it using an example
using semaphore.
taking any two-disk scheduling.
(d) Consider the following set of process, with the length of
(b) Consider the following page reference string :
CPU burst time given in milliseconds
1, 2, 3, 4, 2, 4, 5, 6, 3, 1, 2, 3, 4, 6, 4, 5, 2, 6.
Process Burst Time
Calculate number of page faults using LRU and
P1 12 OPTIMAL page replacement algorithm. Assume number
P2 8 of frames as three.
P3 4 (c) Define the following :
P4 6 i) Virtual memory
ii) Thrashing
Calculate the average waiting time and turn around time
iii) Compaction
for SJF scheduling.
Q5. Attempt any two questions from the following : 10x2=20
(e) Define multilevel feedback queue in brief.
(a) What are the protection and security methods used in an
(f) What is inter process communication? Discuss.
operating system? Explain domain of protection.
Q3. Attempt any two questions from the following : 10x2=20
194403] 2 [Contd... 194403] 3 [Contd...
www.uptuonline.com
www.aktuonline.com
www.aktuonline.com

=
Frinted Ilages: 4
NMCA 3I I
(Following Paper ID and RoH No. to tre tilled in your
Ansrver Books)

M.C.A
Regular Theory Examination (Odd Sem -II!, 2016-17
OPERATINGSYSTEMS
Time: 3 Hours Mux. Marks: 100

Section - A
l. Attempt all,parts. All parts carry equal marks. Write
answer of each part in short. (10x2:20)
www.aktuonline.com

a) Give the features of symmetric multiprocessing


systems?

b) What do you understand by System call? Explain.

c) Differentiate between Program and process.


d) What is virtual memory?

e) What is thread? State the benefits ofthreads.

0 List the various approaches used for deadlock


recovery.

s) What are the three requirements to be met by a


solution to the critical section problem?

31U12t2016t3540 (1)
lP.T.O.

www.aktuonline.com
www.aktuonline.com

fiMCA 31L
h) What is thrashing?
physical
i) What is difference between logical and
addresses?

i) How scheduling is performed in Linux systems?


Section - B

Note: Attempt any five questions from this


section

(5x10=50)

2.Brieflyexplainthecommonclassesofservicesprovided
the user and
by the various operating systems for helping
for ensuring the efficient operation of the system'
www.aktuonline.com

aprocess'
With adiagram, explainthe different states of
Differentiate between long-term and short-term
schedulers.

processing at the
4. Suppose the following jobs arrive for
amount
times indicated. Each job will run for the listed
of time.
a
Job I 2 J

Arrivaltime 0.0 0.4 1.0

Burst time 8 4 I

3tu121201613540 Q)

www.aktuonline.com
www.aktuonline.com

NMCA 311

i) Give a Gantt chart illusffating the execution ofthese


jobs, using the non pre-omptive FCFS and SJF
scheduling algorithms.

ii) What is turnaround time and waiting time of each


job for the above algorithms?

iii) Compute average tumaround time if CPU is left idle


for the first 1 unit and then SJF is used. (Jobl and
Job2 will wait during this time).

5. What is producer - consumer problem of


synchronization? Discuss how this classical problems can
be solved by using semaPhore?
www.aktuonline.com

6. What do you understand by Demand Paging? What are


the steps taken by the system when a page fault occurs?
Explain with suitable examPle.

7. Write short on paging and segmentation.

8. Suppose the position of cylinder is at 53. Sketch the


graphical representation for the queue ofpending requests
in the order - 98, 1 83,37 ,122,14,124,65,67 fot FCFS,
SSTF and LOOK scheduling schemes. Give your comment
on this scenario for the above schemes.

9. Describe the access matrix model used for protection in


a computer system.

31u121201613540 (3) lP.T.O.

www.aktuonline.com
asE:
www.aktuonline.com

NMCA 3Ir
Section - C

Note: Attempt any 2 questions


from this section.
(2x15:36;
10. Consider the following page _ reference
string : 7 ,0, l,
2, 0, 3, 0, 4, 2, 3, O, 3, 2, l, 2, 0,
l, 7,0, 1. How many page
faults would occur for the following
replacement
algorithms?

i) LRUreplacement.
ii) FIFOreplacement.

iii) Optimalreplacement.

Assuming
www.aktuonline.com

four frames that all frames are initially


empty.
which ofthe algorithms is most efficient
in this case?
11. "A safe state is not a deadlock state
but a deadlock state
is an unsafe state". Exprain.
Discuss the different methods
for handling deadlocks.

12. Write short notes on any two


of the following :

a) File Systems.

b) Interprocess Communication.

c) Network Structure and Security.

++++
3LU12t2016/3540 (4)

www.aktuonline.com
www.aktuonline.com

Printed Pages: 02 Sub Code: BC203 / NBC203

Paper Id: 1 9 4 2 0 3 Roll No.


MCA (DUAL DEGREE)
(SEM-II) THEORY EXAMINATION 2017-18
OPERATING SYSTEM
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


a. What is the difference between Hard Real Time System and Soft Real Time System?
b. What is the Kernel?
c. What is the advantage of Multiprogramming?
d. What do you mean by Time-Sharing Systems?
e. What are the different types of Multiprocessing?
f. What are the design goals of an Operating System?
g. What is a Process?
h. What is Process Control Block (PCB)?
i. What is meant by Context Switch?
j. What are System Calls?
www.aktuonline.com

SECTION B

2. Attempt any three of the following: 10 x 3 = 30


a. What is a process and process table? What are different states of process
b. What is deadlock? What are the necessary conditions for deadlock?
c. What is Virtual Memory? How is it implemented?
d. Define and differences between mutex and semaphore?
e. Define process synchronization. Discuss critical section problem.

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) How many type of inter process communication. Discuss producer consumer problem.
(b) Define CPU scheduling. Why do we need scheduling?

4. Attempt any one part of the following: 10 x 1 = 10


(a) Consider the following set of processes, with the arrival times and the CPU-burst times
given in milliseconds

Process Arrival time Burst Time


P1 0 5
P2 1 3
P3 2 3
P4 3 1
om

What is the average turnaround time for these processes with the preemptive shortest
e.c

remaining processing time first (SRPT) algorithm?


lin
on
tu
.ak

(b) What is deadlock detection algorithm? Explain it with example.


w
w
w
://
tp
ht
www.aktuonline.com

5. Attempt any one part of the following: 10 x 1 = 10


(a) Discuss Deadlock avoidance using Banker’s algorithm.
(b) Define memory management. How many type of partitions. Discuss it.

6. Attempt any one part of the following: 10 x 1 = 10


(a) Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If
the page size is 4KB, what is the approximate size of the page table?
(b) Define Paging scheme with an example in detail.

7. Attempt any one part of the following: 10 x 1 = 10


(a) Discuss protection and security in Window NT.
(b) Define Access matrix. How it can be implemented.
www.aktuonline.com

om
e.c
lin
on
tu
.ak
w
w
w
://
tp
ht
Printed Pages:02 Sub Code:RCA301
Paper Id: 214301 Roll No.
MCA
(SEM-III) THEORY EXAMINATION 2018-19
OPERATING SYSTEMS
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
a. What are batch systems?
b. What do you mean by system calls?
c. What is the use of job queues?
d. What is independent process?
e. What is dispatcher?
f. Define throughput?
g. Differentiate between process and thread.

SECTION B
2. Attempt any three of the following: 7 x 3 = 21
a. Discuss various operating system services with example.
b. What is information in the PCB? Discuss it with diagram.
c. Find the average waiting time (A.W.T) and average turnaround time (A.T.A.T)
for executing the following process using
(i) Preemptive shortest-job first
(ii) Non-preemptive shortest-job first?
Process Arrival time Burst time
P1 0 5
P2 1 13
P3 2 8
P4 3 4
P5 4 10
d. Name four page replacement algorithms. Describe any one with example.
e. Define critical section problem. Explain Peterson’s solution to solve critical
section problem.
SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Discuss DMA transfer and DMA controller.
(b) What do you mean by cache memory? Discuss various mapping technique of
cache memory.

4. Attempt any one part of the following: 7x1=7


(a) What is deadlock? How can we avoiding deadlocks occur? Explain it.

1|Page
(b) Suppose we have five processes and three resources, A, B, and C. A has 10
instances, B has 5 instances and C has 7 instances. Can the system execute the
following processes without deadlock occurring, if yes find safe sequence?
Allocation Maximum need
Process A B C A B C
P1 0 1 0 7 5 3
P2 2 0 0 3 2 2
P3 3 0 2 9 0 2
P4 2 1 1 2 2 2
P5 0 0 2 4 3 3

5. Attempt any one part of the following: 7x1=7


(a) Discuss the following storage placement strategies with suitable examples :
(i) Best fit
(ii) First fit
(iii) Worst fit

(b) Differentiate between:


(i) Hard and soft real time system.
(ii) Paging and segmentation.

6. Attempt any one part of the following: 7x1=7


(a) What is process synchronization? Give the solution to reader writer problem
using semaphores.
(b) Consider the following page reference string :
1 , 2 , 3 , 4 , 2 , 4 , 5 , 6 , 3 , 1 , 2 , 3 , 4 , 6 , 4 , 5 , 2 , 6.
Calculate number of page faults using LRU and OPTIMAL Page replacement
algorithm. Assume number of frames as three.

7. Attempt any one part of the following: 7x1=7


(a) Which allocation scheme will minimize the amount of space required in
directory structure and why?
(b) Explain short seek time first (SSTF) disk scheduling. Why SSTF scheduling
tends to favor middle cylinders over the inner most and outer most cylinders?

2|Page
Printed Page 1 of 2 Sub Code:RCA301
Paper Id: 214301 Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM-III) THEORY EXAMINATION 2019-20
OPERATING SYSTEMS
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
a. What are Multi processor systems?
b. What are CPU bound and I/O bound processes?
c. What is dispatcher?
d. Differentiate between process and thread.
e. Define graceful degradation?
f. What is the use of job scheduler?
g. What do you mean by system calls?
SECTION B
2. Attempt any three of the following: 7 x 3 = 21
a. Discuss various operating system services with example.
b. Find the average waiting time (A.W.T) and average turnaround time (A.T.A.T)
for executing the following process using
www.aktuonline.com

(i) Preemptive shortest-job first


(ii) Non-preemptive shortest-job first?
Process Arrival time Burst time
P1 0 5
P2 1 13
P3 2 8
P4 3 4
P5 4 10
c. What is information in the PCB? Discuss it with diagram.
d. Define critical section problem. Explain Peterson’s solution to solve critical
section problem for three processes.
e. What is process synchronization? Give the solution to reader writer problem
using semaphores.

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Differentiate between:
(i) Hard and soft real time system. (ii) Paging and segmentation.
(b) Suppose we have five processes and three resources, A, B, and C. A has 10
instances, B has 5 instances and C has 7 instances. Can the system execute the
following processes without deadlock occurring, if yes find safe sequence?
Process Allocation Maximum
ABC ABC
P1 010 753
P2 200 322
P3 302 902
P4 211 222
P5 002 433

1|P a ge
http://www.aktuonline.com
Printed Page 2 of 2 Sub Code:RCA301
Paper Id: 214301 Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

4. Attempt any one part of the following: 7x1=7


(a) Discuss the following storage placement strategies with suitable examples :
(i) Best fit
(ii) First fit
(iii) Worst fit
(b) Consider the following page reference string :
1 , 2 , 3 , 4 , 2 , 4 , 5 , 6 , 3 , 1 , 2 , 3 , 4 , 6 , 4 , 5 , 2 , 6.
Calculate number of page faults using LRU and OPTIMAL Page replacement
algorithm. Assume number of frames as three.

5. Attempt any one part of the following: 7x1=7


(a) Which allocation scheme will minimize the amount of space required in
Directory structure and why?
(b) Explain the concept of segmentation with proper diagram.

6. Attempt any one part of the following: 7x1=7


(a) What is deadlock? How can we avoiding deadlocks occur? Explain it.
(b) Given the following queue -- 95, 180, 34, 119, 11, 123, 62, 64 with the Read-
write head initially at the track 50 and the tail track being at 199. Find the head
movement for Shortest Seek Time First (SSTF)
www.aktuonline.com

SCAN and Circular SCAN Algorithm.

7. Attempt any one part of the following: 7x1=7


(a) Discuss DMA transfer and DMA controller.
(b) What do you mean by cache memory? Discuss various mapping technique of
cache memory.

2|P a ge
http://www.aktuonline.com
Printed Page: 1 of 2
Subject Code: RCA301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM III) THEORY EXAMINATION 2020-21
OPERATING SYSTEM
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
a. What are Multi processor systems?
b. What are CPU bound and I/O bound processes?
c. What is dispatcher?
d. Differentiate between process and thread.
e. Define graceful degradation?
f. What is the use of job scheduler?
g. What do you mean by system calls?

SECTION B
2. Attempt any three of the following: 7 x 3 = 21
a. Discuss various operating system services with example.
b. Find the average waiting time (A.W.T) and average turnaround time (A.T.A.T)
for executing the following process using
(i) Preemptive shortest-job first
(ii) Non-preemptive shortest-job first?
Process Arrival time Burst time
P1 0 5
P2 1 13
P3 2 8
P4 3 4
P5 4 10
c. What is information in the PCB? Discuss it with diagram.
d. Define critical section problem. Explain Peterson’s solution to solve critical
section problem for three processes.
e. What is process synchronization? Give the solution to reader writer problem
using semaphores.

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Differentiate between:
(i) Hard and soft real time system. (ii) Paging and segmentation.
(b) Suppose we have five processes and three resources, A, B, and C. A has 10
instances, B has 5 instances and C has 7 instances. Can the system execute the
following processes without deadlock occurring, if yes find safe sequence?
Process Allocation Maximum
ABC ABC
P1 010 753
P2 200 322
P3 302 902
P4 211 222
P5 002 433

1|Page
Printed Page: 2 of 2
Subject Code: RCA301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

4. Attempt any one part of the following: 7x1=7


(a) Discuss the following storage placement strategies with suitable examples :
(i) Best fit
(ii) First fit
(iii) Worst fit
(b) Consider the following page reference string :
1 , 2 , 3 , 4 , 2 , 4 , 5 , 6 , 3 , 1 , 2 , 3 , 4 , 6 , 4 , 5 , 2 , 6.
Calculate number of page faults using LRU and OPTIMAL Page replacement
algorithm. Assume number of frames as three.
5. Attempt any one part of the following: 7x1=7
(a) Which allocation scheme will minimize the amount of space required in
Directory structure and why?
(b) Explain the concept of segmentation with proper diagram.
6. Attempt any one part of the following: 7x1=7
(a) What is deadlock? How can we avoiding deadlocks occur? Explain it.
(b) Given the following queue -- 95, 180, 34, 119, 11, 123, 62, 64 with the Read-
write head initially at the track 50 and the tail track being at 199. Find the head
movement for Shortest Seek Time First (SSTF)
SCAN and Circular SCAN Algorithm.
7. Attempt any one part of the following: 7x1=7
(a) Discuss DMA transfer and DMA controller.
(b) What do you mean by cache memory? Discuss various mapping technique of
cache memory.

2|Page
Printed Page: 1 of 2
Subject Code: RCA301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM. III) THEORY EXAMINATION 2021-22
OPERATING SYSTEM
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
a. Define seek latency and rotational latency
b. Define SCAN and C-SCAN scheduling algorithms.
c. What is a safe state and an unsafe state?
d. Explain the logical address space and physical address space diagrammatically.
e. Outline the methods to avoid mutual exclusion?
f. Illustrate an example to show the race condition.
g. Explain the terms Sector, block, track and cylinder

SECTION B
2. Attempt any three of the following: 7 x 3 = 21

1
32

22
a. Using semaphore show the solution of Reader- Writer problem.
_1

b. Explain why do page fault occurs? Describe in detail the action taken by

6.
1P

operating system when a page fault occurs?

19
c. classify various techniques used for free space management of disk.
2O

0.
d. What is real time Operating Systems? Discuss their utilities.
e. 23
Illustrate the page-replacement algorithms (i) FIFO (ii) Optimal Page
P2

3.
Replacement use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1,
Q

|4

7, 0,1 for a memory with three frames.


32

SECTION C
4:

3. Attempt any one part of the following: 7x1=7


:2
13

(a) Classify various disk-scheduling algorithms with suitable diagram.


(b) Illustrate various disk allocation techniques.
2
02

4. Attempt any one part of the following: 7x1=7


-2

(a) Justify the use of semaphore to overcome busy waiting problem.


an

(b) Discuss the mechanism of deadlock avoidance and deadlock prevention?


J
5-
|0

5. Attempt any one part of the following: 7x1=7


(a) Consider dynamic partitioning scheme is being used and the following is the
memory configuration at a given point in time (the shaded area represents
allocated blocks and white area represents free blocks):
25K 10K 5K 10K 25K 5K 25K 20K 30K 12K
The next memory requests are 5K, 15K and 25K. Would any of the First-fit,
Best-Fit and Worst-Fit algorithms service all the three requests? Explain. Also
give memory loss due to fragmentation in the all the cases.

QP22O1P_132 | 05-Jan-2022 13:24:32 | 43.230.196.221


Printed Page: 2 of 2
Subject Code: RCA301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

(b) Calculate the number of page faults that would occur in case of optimal page
replacement algorithm for the following reference string? Assuming the
demand paging technique is used by OS
2,3,4,3,4,1,6,7,8,7,1,8,9,8,9,5,4,2,1

6. Attempt any one part of the following: 7x1=7


(a) Give some benefits of multithreaded programming.
(b) What do you mean by deadlock? Discuss various conditions for occurring of
deadlock. Also differentiate between deadlock detection and avoidance

7. Attempt any one part of the following: 7x1=7


(a) Discuss the terms with example:
i. Multitasking
ii. Time Sharing

(b) Write short notes on:


i. SPOOLING
ii. Batch processing

1
32

22
_1

6.
1P

19
2O

0.
23
P2

3.
Q

|4
32
4:
:2
13
2
02
-2
J an
5-
|0

QP22O1P_132 | 05-Jan-2022 13:24:32 | 43.230.196.221


Printed Page: 1 of 3
Subject Code: KCA203
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS

Time: 3 Hours Total Marks: 100


Note: Attempt all Sections. If you require any missing data, then choose suitably.
SECTION A
1. Attempt all questions in brief. 2x10 = 20
Qno Questions CO
(a) Describe all operating system services. 1
(b) Defend timesharing differ from multiprogramming? If so, how? 1
(c) Discuss the uses of mutex? 2
(d) Describe race condition for cooperating processes. 2
(e) Compare and contrast Single-threaded and multi-threaded process. 3
(f) Distinguish between CPU bounded, I/O bounded processes. 3
(g) What are the conditions under which a deadlock situation may arise? 4
(h) What is resource-allocation graph? 4
(i) Define Belady’s Anomaly. 5
(j) Explain logical address space and physical address 5space
diagrammatically.
SECTION B

2. Attempt any three of the following: 10x3 = 30


Qno Questions CO
(a) Describe operating system functions. Also, explain monolithic, and 1
microkernel systems.
(b) Define critical section problem. Write the Peterson’s solution to solve 2
critical section problem.
(c) Illustrate process states and process transition diagram. 3
(d) Discuss the following storage placement strategies with suitable 4
examples:
(i) Best fit
(ii) First fit
(iii)Worst fit
(e) What are the three methods for allocating disk space? Explain. 5
SECTION C
3. Attempt any one part of the following: 10x1 = 10
Qno Questions CO
(a) Explain the following terms and their working with diagram 1
i) Buffering ii) Spooling iii) Time sharing iv) Distributed system
(b) Differentiate between multiprocessor, multiuser, and Batch operating 1
system.

4. Attempt any one part of the following: 10x1 = 10


Qno Questions CO
(a) Interpret Dining philosopher problem. 2
(b) A shared variable x, initialized to zero, is operated on 2 by four
concurrent processes W, X, Y, Z as follows. Each of the processes W
Printed Page: 2 of 3
Subject Code: KCA203
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS

and X reads x from memory, increments by one, stores it to memory,


and then terminates. Each of the processes Y and Z reads x from
memory, decrements by two, stores it to memory, and then terminates.
Each process before reading x invokes the P operation (i.e., wait) on a
counting semaphore S and invokes the V operation (i.e., signal) on the
semaphore S after storing x to memory. Semaphore S is initialized to
two. What is the maximum possible value of x after all process’s
complete execution?

5. Attempt any one part of the following: 10x1 = 10


Qno Questions CO
(a) Illustrate process states and process transition diagram. 3
(b) Consider the set of 4 processes whose arrival time and burst time are 3
given below-
Burst Time
Process Arrival
No. Time CPU
I/O Burst CPU Burst
Burst

P1 0 3 2 2

P2 0 2 4 1

P3 2 1 3 2

P4 5 2 2 1

If the CPU scheduling policy is Shortest Remaining Time First,


calculate the average waiting time and average turnaround time.

6. Attempt any one part of the following: 10x1 = 10


Qno Questions CO
(a) Considering a system with five processes 0 through
P P4 and three 4
resources of type A, B, C. Resource type A has 10 instances, B has 5
instances and type C has 7 instances. Suppose at0 following time t
snapshot of the system has been taken.
Printed Page: 3 of 3
Subject Code: KCA203
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS

Then,
I. What will be the content of the Need matrix?
II. Is the system in a safe state? If Yes, then what is the safe
sequence?
III. What will happen if process P1 requests one additional instance
of resource type A and two instances of resource type C?

(b) Apply banker’s algorithm for a system in which, there are three types of 4
resources: E, F and G. Four processes P0, P1, P2 and P3 execute
concurrently. At the outset, the processes have declared their maximum
resource requirements using a matrix named Max as given below. For
example, Max [P2, F] is the maximum number of instances of F that
P2 would require. The number of instances of the resources allocated to
the various processes at any given state is given by a matrix named
Allocation. Consider a state of the system with the Allocation matrix as
shown below, and in which 3 instances of E and 3 instances of F are the
only resources available.

Find the safe sequence.

7. Attempt any one part of the following: 10x1 = 10


Qno Questions CO
(a) A system uses 3-page frames for storing process pages in5 main
memory. Assume that all the page frames are initially empty. What is
the total number of page faults that will occur while processing the
page reference string given below for FIFO, LRU and Optimal Page
Replacement algorithm? Also calculate the hit ratio and miss ratio.
4 , 7, 6, 1, 7, 6, 1, 2, 7, 2
(b) Explain the three methods available for allocating disk space? 5
Printed Pages:03 Sub Code: KCA203
Paper Id: 238083 Roll No.

MCA
(SEM II) THEORY EXAMINATION 2022-23
OPERATING SYSTEMS
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


(a) Define operating system and mention its major functions.
(b) Differentiate between times sharing and real time system.
(c) Distinguish between multilevel queue scheduling and multilevel feedback
queue scheduling
(d) How the starvation is different from deadlock? Explain.
(e) Semaphore gives its implementation to avoid busy waiting. Justify.
(f) Compare and contrast Single-threaded and multi-threaded process
(g) What are the Performance Criteria in CPU Scheduling? Explain.
(h) Differentiate between paging and segmentation.
90

2
(i) What do you mean by file directories? Explain.

13
_2
(j) Define link file allocation method.

2.
P2

24
SECTION B
3E

5.
.5
2. Attempt any three of the following: 10x3=30
P2

(a) Explain batch operating system with example.


17
Q

(b) What is semaphore? Classify the semaphore with their synchronization code.
|1
(c) Define the following terms:-
(i) Dispatcher
58

(ii) Dispatch Latency


8:

(iii) Optimization of scheduling criteria


:4

(iv) Swapping
08

(v) Context switching


(d) Five memory partitions of 100, 500, 200, 300 & 600 (all in KB) are in order,
23

how would the ‘first-fit, best-fit & worst-fit’ shall place processes of size 212,
417, 112, & 426 ((all in KB). Deduce the most efficient memory management
20

technique
-

(e) Discuss in detail the ‘Linked, Contiguous, Index & Multi-level Indexing’ file
08

allocation schemes.
3-
|0

SECTION C
3. Attempt any one part of the following: 10x1=10
(a) Define Process. Explain various steps involved in change of process state with
neat transition diagram.
(b) What is the purpose of the System Calls or Application Programming Interface
(APIs).Enumerate five system calls used in process management or file
management?

QP23EP2_290 | 03-08-2023 08:48:58 | 117.55.242.132


4. Attempt any one part of the following: 10x1=10
(a) Define critical section problem. Write the Peterson’s solution to solve critical
section problem.
(b) What is Producer Consumer problem? How it can illustrate the classical
problem of synchronization? Explain.

5. Attempt any one part of the following: 10x1=10

(a) Consider three processes, all arriving at time zero, with total execution time of
10, 20 and 30 units respectively. Each process spends the first 20% of execution
time doing I/O, the next 70% of time doing computation, and the last 10% of
time doing I/O again. The operating system uses a shortest remaining compute
time first scheduling algorithm and schedules a new process either when the
running process gets blocked on I/O or when the running process finishes its
compute burst. Assume that all I/O operations can be overlapped as much as
possible. For what percentage of does the CPU remain idle?
1. 0%
2. 10.6%
3. 30%
4. 89.4%
(b) Consider the set of 4 processes whose arrival time and burst time are given
below- 90

2
13
Process Arrival Priority Burst Time
_2
No. Time

2.
CPU Burst I/O Burst CPU Burst
P2

24
3E

P1 0 2 1 5 3

5.
.5
P2

P2 2 3 3 3 1
17
Q

|1
P3 3 1 2 3 1
58

If the CPU scheduling policy is Priority Scheduling, calculate the average


8:

waiting time and average turnaround time. (Lower number means higher
:4

priority)
08
23
-20
08
3-
|0

QP23EP2_290 | 03-08-2023 08:48:58 | 117.55.242.132


6. Attempt any one part of the following: 10x1=10
(a) Illustrate the following page-replacement algorithms.
i) FIFO
ii) LRU
Use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1 for a
memory with four frames
(b) Discuss Resource Allocation Graph (RAG)? Find how many cycles’ deadlocks
reside in given figure.

7. Attempt any one part of the following: 10x1=10


(a) A hard disk having 2000 cylinders, numbered from 0 to 1999. The drive is currently
serving the request at cylinder 143,and the previous request was at cylinder 125.The
status of the queue is as follows 86, 1470, 913, 1774, 948, 1509, 1022,1750,130.
What is the total distance (in cylinders) that the disk arm moves to satisfy the entire
90

2
pending request for each of the following disk scheduling algorithms?

13
_2
(i) SSTF

2.
(ii) FCFS
P2

24
(b) Write short note on(any three):
3E

(i)I/O buffering

5.
(ii) Disk storage & scheduling

.5
P2

(iii) File Directory


(iv) RAID
17
Q

|1
58
8:
:4
08
23
- 20
08
3-
|0

QP23EP2_290 | 03-08-2023 08:48:58 | 117.55.242.132


Operating Systems

And Unix
Computer Organisation and Arch.
Printed Page: 1 of 2
Subject Code: KCA105

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2023-24
COMPUTER ORGANIZATION & ARCHITECTURE
TIME: 3HRS M.MARKS: 100

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


Q no. Question Marks CO
a. Let M = 11111010 and N = 00001010 be two 8-bit two’s compliment number.
2 1
Their product in two’s complement is --------------.
b. Differentiate between clock cycles and clock frequency. 2 1
c. Explain the role of program counter. 2 2
d. A bulb in a staircase has two switches, one switch being on the ground floor
and the other one on the first floor. The bulb can be turned ON and also can
2 2
be turned OFF by any one of the switches, irrespective of the state of the other
switch. The logic of switching of the bulb resembles to which gate.
e. Describe any four status bits in detail by taking suitable example. 2 3
f. Discuss the concept of PSW. 2 3
g. Differentiate between write back and write through in cache memory. 2 4
90

2
h. Differentiate between SRAM and DRAM. 2 4

13
i.
_2

Explain maskable and non-maskable interrupt. 2 5

2.
j. Distinguish between burst transfer and cycle stealing method. 2 5
P2

24
SECTION B
4D

5.
2. Attempt any three of the following:
.5
P2

a. Explain the function of control unit in general register organization with the
17
10 1
Q

help of diagram.
|1

b. Describe BOOTH multiplication algorithm and Multiply (-13) x (-21) and


10 2
draw the flowchart of Booth’s algorithm.
50

c. Show the block diagram of microprogram sequencer. Consider a


3:

microprogrammed CU, where 1024-word control memory is used. The CU


:5

has to support 40 control signals and 32 flag conditions. How many bits are 10 3
08

required in the control word? What is the size of horizontal and vertical control
memory
4

d. A block-set associative cache memory consists of 128 blocks divided into four
2

block sets. The main memory consists of 16,384 blocks and each block
20

contains 256 eight-bit words.


3-

10 4
1. How many bits are required for addressing the main memory?
0

2. How many bits are needed to represent the TAG, SET and WORD
6-

fields?
|1

e. Outline the block diagram of DMA controller. Illustrate, why are the read and
10 5
write control lines in a DMA controller bidirectional?
SECTION C
3. Attempt any one part of the following:
a. Illustrate a BUS system? Implement a BUS of 4 lines with MUX. 10 1
b. Demonstrate the concept of addressing modes. The instruction is stored at
location 700 with its address fields at location 701. The address field has the 10 1
value 1000. A processor register contains the value 500 and index register
1|Page
QP24DP2_290 | 16-03-2024 08:53:50 | 117.55.242.132
Printed Page: 2 of 2
Subject Code: KCA105

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2023-24
COMPUTER ORGANIZATION & ARCHITECTURE
TIME: 3HRS M.MARKS: 100

contains the value 300. Evaluate the effective address if the addressing mode
of the instruction is
(a) Direct (b) Indirect (c) Immediate (d) Relative (e) Register Indirect (f)
Autoincrement (g) Autodecrement
4. Attempt any one part of the following:
a. Explain the concept of 4-bit fast adder in detail along with neat & clean
10 2
diagram.
b. Perform the division process of 00001111 by 0011 using division restore
10 2
method.
5. Attempt any one part of the following:
a. Determine a program to evaluate the arithmetic statement.
X = (A*B-C) / (D+E/F)
 Using general register computer with 3-address instruction.
10 3
 Using general register computer with 2-address instruction.
 Using an accumulator type computer with 1-address instruction.
 Using a stack organized computer with 0-address instruction
90

2
b. Compare horizontal microprogramming and vertical microprogramming. The

13
_2

microprogrammed control unit has a control memory of 1024 words of 32 bits

2.
each. The micro construction has three fields, and the micro-operations field
P2

24
has 16 bits.
10 3
4D

a. How many bits are there in the branch address field and the select field?

5.
b. If there are 16 status bits in the system, how many bits of the branch logic
.5
P2

are used to select a status bit?


17
Q

c. How many bits are left to select an input for the multiplexers.
|1

6. Attempt any one part of the following:


50

a. Examine the following organizations of cache memory:


(i). Associative mapping (ii). Direct Mapping
3:

(iii). Set associative mapping.


:5

Consider memory block request: 3, 4, 8, 3, 9, 6, 16, 13, 35, 12, 3, 8, 6, 7, 30,


08

45, 12, 67, 22. Consider a full associative mapping for the 8 cache blocks 10 4
find the following values for LRU and FIFO
2 4

 Number of miss and Number of hits


20

 Hit ratio.
3-

 Cache block number which contains main memory block 6


0

b. A processor has 40 distinct instructions and 24 general purpose registers. A


6-

32-bit instruction word has an opcode, two register operands and an immediate
10 4
|1

operand. Then find the number of bits available for the immediate operand
field.
7. Attempt any one part of the following:
a. Describe asynchronous data transfer? What are the methods through which it
10 5
can be achieved?
b. Discuss the modes of transfer & explain the following.
(i) Programmed I/O 10 5
(ii) Interrupt initiated I/O

2|Page
QP24DP2_290 | 16-03-2024 08:53:50 | 117.55.242.132
Printed Pages:02 Sub Code: KCA-105

Paper Id: 233052 Roll No.

MCA
(SEM I) THEORY EXAMINATION 2022-23
COMPUTER ORGANIZATION & ARCHITECTURE
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


(a) List out various functional units of a digital computer.
(b) Define bus and memory transfer.
(c) What do you mean by carry generation and carry propagation?
(d) Represent -14 using 2’s complement method.
(e) What are the various types of instructions?
(f) Define logic micro-operation.
(g) What do you mean by 2D memory organization?
(h) What is page replacement?
(i) Define the term interrupt.

32
90
(j) What do you mean by serial communication?

.1
_2

42
P2

SECTION B

.2
2. Attempt any three of the following: 3x10=30
3D

5
.5
P2

(a)
(b)
Discuss any five addressing modes with example.
Multiply -8 and -14 using signed operand multiplication method.
17
Q

|1
(c) Write short note on Reduced Instruction Set Computers (RISC).
(d) Discuss FIFO and LRU page replacement policies for the reference
40

string 3, 4, 0, 1, 4, 3, 2, 0, 1, 2, 0, 4 and find out page faults in each case.


5:

(e) Discuss interrupt handling process with the help of flow chart.
:0
09

SECTION C
3

3. Attempt any one part of the following: 10x1=10


02

(a) Design four bit arithmetic unit and discuss various operation performed
-2

by it.
03

(b) How the operation performed by stack? Evaluate X:=5 + 6(8 – 2 * 3)


using stack.
1-
|2

4. Attempt any one part of the following: 10x1=10


(a) Discuss register organization if a computer system has seven registers
R1 to R7. How the operation R1 R2 + R3 can be performed? Discuss.
(b) Design the circuit for 4 by 3 array multiplier.

QP23DP2_290 | 21-03-2023 09:05:40 | 117.55.242.132


5. Attempt any one part of the following: 10x1=10
(a) What are various types of computer instructions? Discuss register
reference, memory reference and I/O instructions.
(b) What do you mean by pipelining? Discuss arithmetic pipeline.

6. Attempt any one part of the following: 10x1=10


(a) What do you mean by memory hierarchy? Discuss memory hierarchy
in detail.
(b) Discuss address mapping of RAM and ROM by taken an example.

7. Attempt any one part of the following: 10x1=10


(a) Write short note on IBM 370 I/O channel.
(b) Discuss any two data transfer mode for peripheral devices.

32
90

.1
_2

42
P2

.2
3D

5
.5
P2

17
Q

|1
40
5:
:0
09
3
02
-2
03
1-
|2

QP23DP2_290 | 21-03-2023 09:05:40 | 117.55.242.132


Printed Page: 1 of 1
Subject Code: KCA105
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2021-22
COMPUTER ORGANIZATION & ARCHITECTURE
Time: 3 Hours Total Marks: 100
Notes:
 Attempt all Sections and assume any missing data.
 Appropriate marks are allotted to each question, answer accordingly.
SECTION-A Attempt All of the following Questions in brief Marks(10X2=20) CO
Q1(a)What are the various facts related to bus and bus system?
Q1(b)What is arithmetic and logic circuit?
Q1(c)Describe the micro-programming sequencing.
Q1(d)What do you mean by programming of ROM?
Q1(e)What is the function of I/O interface?
Q1(f)Discuss the basic component of register transfer logic.
Q1(g)What is the main advantage of RTL?
Q1(h)Define the goal of CISC architecture.
Q1(i)Define the goal of RISC architecture.
Q1(j)What are the modes of data transfer?

SECTION-B Attempt ANY THREE of the following Questions Marks(3X10=30) CO


Q2(a) What is programmable logic device? List various techniques to program PLD. Explain any
one technique with example.

8
Q2(b) Write Short Notes on any two of the following:
2

.1
i) Central Processing Unit (CPU). iii) Input/output Interface.
13

38
ii) Input/output Ports.
2_

Q2(c) Show step by step the multiplication process using booth’s algorithm when (+15) and (-13)

.1
numbers are multiplied.
2P

6
Q2(d) Assume 5 – bit registers that hold signed numbers.

.7
P2

Q2(e) Explain various types of processor organization. 03


Q

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO


|1

Q3(a) Explain General-purpose register based organization.


57

Q3(b) What is the Stack organization? Compare register stack and memory stack.
0:

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO


:4

Q4(a) Explain the Booth’s algorithm in depth with the help of flowchart. Give an example for
multiplication using Booth’s algorithm.
09

Q4(b) Perform the division process of 00001111 by 0011 (use a dividend of 8 bits).
2
02

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO


Q5(a) Evaluate the arithmetic statements X=(A+B)*(C+D) using a general register computer with
-2

three address, two address and one address instruction format a program to evaluate the
ar

expression.
M

Q5(b) Explain hardwired control unit. What are the methods to design hardwired controllers?
3-

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO


|2

Q6(a) A ROM chip of 1024*8 has four select inputs and operates from a 5volt power supply. How
many pins are needed for the IC package? Draw a block diagram and label all input and
output terminals in the ROM.
Q6(b) Explain 2D, 2 ½D memory organizations.

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO


Q7(a) Give the block diagram of DMA controller. Why are the read and write control lines in a
DMA controller bidirectional?
Q7(b) What do you mean by serial communication? What are the transmission modes of serial
communication?

QP22P2_132 | 23-Mar-2022 09:40:57 | 103.76.138.18


Printed Page 1 of 1 Sub Code:RCA104
Paper Id: 214104 Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2019-20
COMPUTER ORGANIZATION AND ARCHITECTURE
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 7 = 14


a. How does computer organization affect the performance of the computer?
b. Find 2’s and 1’s complement of the number -17 and 18.
c. What is IEEE standard for floating point number?
d. Find the values of 16 after right shift and left shift operations.
e. Why Cache memory is faster than main memory?
f. Differentiate between RISC and CICS architecture.
g. Consider the equation (43)x=(y3)8, where x and y are unknown. What are the possible
solutions for this equation?
SECTION B

2. Attempt any three of the following: 7 x 3 = 21


a. Explain the memory hierarchy in detail.
b. Perform multiplication of two (-7) and (5) number using Booth’s algorithm and verify
your answer.
www.aktuonline.com

c. Discuss the term hardwired control logic in detail.


d. Minimize the Boolean expression using K-Man f (w, x, y, z) = Σ (0, 1, 2, 3, 4, 5, 6, 7,
14, 15) and suitable circuit diagram.
e. How the execution of a complement instruction takes place in Multiple-bus
organization explain in detail.
SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Explain different type of addressing mode in detail.
(b) What is 2D and 21/2 D memory organization explain in detail with suitable diagram?
Explain the difference between these two with suitable example.
4. Attempt any one part of the following: 7x1=7
(a) What do you mean by programmed I/O explain in detail with suitable flow chart.
(b) Explain the features of RISC and CISC processor in detail.
5. Attempt any one part of the following: 7x1=7
(a) What is Flynn’s Classification and why it is called architectural classification, explain
it in detail.
(b) What is pipeline explain it with example. What are the different types of pipeline?
6. Attempt any one part of the following: 7x1=7
(a) What is input-output processor explain in detail with suitable diagram?
(b) What is serial communication? What is different between I/O processor and serial
communication processor?
7. Attempt any one part of the following: 7x1=7
(a) What is fast adder? Generate the expression for the 4 bit fast adder.
(b) What half adder and full adder? Design a logic circuit diagram of full adder using
truth table and k-map?

1| P a g e
http://www.aktuonline.com
onlineBU.com

m
co
u.
eb
lin
on
onlineBU.com

m
co
u.
eb
lin
on
onlineBU.com

m
co
u.
eb
lin
on
onlineBU.com

m
co
u.
eb
lin
on
Scanned by CamScanner
Scanned by CamScanner
Digital Electronics

Computer Organisation and Arch.


Computer Networks MCA
http://www.aktuonline.com

Following Paper IDand Roll No. to be fi lied il'fyOUi'Answer Book)


• R{)U No.

M.C.A.
(SEM. IiiYODD SEMESTER THEORY EXAMINATION
2010-11
COMPUTER NETWORKS
TiJ1,1e : 3 Hours

Note: (1) Attempt all questions.


(2) All questions carry equal marks.

1: _ Attempt any four parts: . (5x4=20)


(a) What do you mean by channel capacity? Discuss design
issues for a physical layer.
(b) What are relationship between services, interface~ and
protocols with respect to I}etwork's layered architecture.
(c) What are the channel types in ISDN to construct
transmission structure of any access link? Discuss.
I •

(d) What are difference between message switching and


packet switching?
(e) Discuss different design issues for the layers in computer
\ ' network? Explain them with the help of a diagram.
(f) Describe the features offollowing:
(i) Gateways
(ii) Bridges.

2. Attempt any two parts: (lOx2=20)


(a) What are hamming codes? What will be the hamming
code for the bit pattern 1100 I] 0 I. If during transmission
http://www.aktuonline.com
an error occurs at 7m bit, explain with reasons how this
error \ ill be detected.
(b) What is a slotted ring protocol? Compare it with CSMA/
CD protocol.
(c) Write a short note on pure ALOHA.

Attempt any two parts: (lOx2=20)


(a) Discuss steps involved in finding shortest route between
node A and B shown in the network below, using
Dij ikstra's Algorithm.
C 2 G

(b) What do you mean by routing algorithms? Discuss their


applications in computer network and explain one of them .
..
(c) Discuss the important aspects ofTCP/IP.

4. Attempt any two parts: (lOx2=20)


(a) What do you mean by public key cryptographic system?
Explain the role ofpubli e and private key.
(b) ,
State different protocols used. for E-mails. Differentiate" " .,J
betweenIMAP, POP3 an . ITP protocol.
(c) Discuss the UDP operatio Tief. How it is possible to
execute se eral internet a Ii ion over a single IP
address .
http://www.aktuonline.com

(a) Explain the role of domain name server and explain its
functional parts. In DNS, why a hierarchical naming
structure is used instead of a flat structure?
(b) What are functions of SMTP ? Differentiate between a
user agent and a mail transfer agent. How does MIME
enhance SMTP ?
(c) Write short notes on following:
(i) TELNET
(ii) RSA Encryption Algorithm.
Printed Page: 1 of 2
Subject Code: KCA303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM III) THEORY EXAMINATION 2021-22
COMPUTER NETWORK
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


Qno. Question Marks CO
a. Describe Data communication. 2 2
b. Differentiate between serial communication and parallel 2 4
communication.
c. Discuss about Protocol. 2 2
d. How would you formulate Shanon’s Theorem? 2 1
e. What is the purpose of hamming code? 2 1
f. How would you formulate Efficiency of Standard Ethernet? 2 1
g. Discuss about Fragmentation. 2 2
h. List the responsibilities of Transport Layer. 2 1
i. What is mean by Piggybacking? 2 2
j. Illustrate about Sockets. 2 3

SECTION B

2. Attempt any three of the following:


Qno. Question Marks CO
a. Explain the duties of each layer in TCP/IP model. 10 2
b. What is Transmission media ? Describe in detail about unguided 10 3
transmission media.
c. What are the Unicast , Multicast and Broadcast Address ? Define the 10 6
type of the following destination addresses:
a. 4A:30:10:21:10:1A
b. 47:20:1B:2E:08:EE
c. FF:FF:FF:FF:FF:FF
d. Explain any two transport-layer protocol 10 4
a. Stop-and-Wait b. Go-Back-N c. Selective-Repeat
e. Explain the Bluetooth architecture with the help of a neat diagram. 10 5

SECTION C
3. Attempt any one part of the following:
Qno. Question Marks CO
a. Define multiplexing. Explain various types of multiplexing. 10 4
b. What do you mean by Transmission Impairment ? Explain. 10 3

1|Page
Printed Page: 2 of 2
Subject Code: KCA303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

4. Attempt any one part of the following:


Qno. Question Marks CO
a. Discuss about Error Detection methods . Describe any one technique 10 4
used for error detection with suitable example.
b. Briefly explain about multiple-access protocol . 10 4

5. Attempt any one part of the following:


Qno. Question Marks CO
a. What is meant by congestion control? What are the techniques 10 3
involved in eliminating it.
b. What do you mean by IP address? Explain IP addressing method. 10 3

6. Attempt any one part of the following:


Qno. Question Marks CO
a. The content of a UDP header in hexadecimal format is 10 5
CB84000D001C001C. Give the answer of following questions
a. What is the source port number?
b. What is the destination port number?
c. What is the total length of the user datagram?
d. What is the length of the data?
b. Explain any two protocols in the TCP/IP protocol suite 10 4
a.SCTP b. TCP c. UDP

7. Attempt any one part of the following:


Qno. Question Marks CO
a. Explain any two 10 3
a) URL b) Cookies c) API d) NVT

b. Define network management. Explain five areas of network 10 4


management.

2|Page
Printed Pages:02 Sub Code:KCA-303

Paper Id: 2 3 2 3 0 1 Roll No.

MCA
(SEM III) THEORY EXAMINATION 2022-23
COMPUTER NETWORKS
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


(a) List out components of data communication system.
(b) Discuss various transmission modes.
(c) Discover how many times a packet has to visit the network layer and data link
layerduring a transmission from S to D? Assume that Source S and Destination D
areconnected through an intermediate router R.
(d) Discuss CSMA/CD.
(e) Discuss Dynamic Host Configuration Protocol(DHCP).
(f) Explain Round-Trip Time (RTT).
(g) Describe sockets with respect to communication system.
29

98
(h) What is three-way handshaking?
_0

9.
(i) Discuss role of SMTP in email communication system.

24
(j) Define cookies with respect to computer networks.
P1

1.
3D

.2
SECTION B
P2

2. Attempt any three of the following:


25 10 x 3 = 30
|1
Q

(a) Discuss various computer network topologies with suitable diagrams.


(b) A bit stream 10011101 is transmitted using the standard CRC method. The generator
35

polynomial is x^3 + 1. Show the actual bit string transmitted. Suppose the third bit
2:

from the left is inverted during transmission. Show that this error is detected at the
receiver’s end.
:4

(c) Consider an IP address 196.10.19.10 /26. Solve the following:


13

(i) Network Address


(ii) Custom subnet mask
23

(iii) Total Number of available subnets


(iv) Total number of host addresses
0
-2

(v) e. Subnet address and broadcast address of every subnet.


(d) Justify the statement “TCP is reliable than UDP”. Also elaborate format for TCP
02

packet.
0-

(e) Write short notes on any two:


(i) Domain Name Systems
|1

(ii) Telnet
(iii) FTP

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) Discuss various types of transmission media with their applications areas.
(b) Explain responsibilities each layer in ISO/OSI Model with suitable diagrams.

QP23DP1_029 | 10-02-2023 13:42:35 | 125.21.249.98


4. Attempt any one part of the following: 10 x 1 = 10
(a) Explain Selective Reject and Go-Back-N-ARQ with reference to sliding window
protocol.
(b) What do you mean error handling at data link layer? Discuss hamming code with
suitable example.

5. Attempt any one part of the following: 10 x 1 = 10


(a) What is need of IP address? Discuss Classful addressing in IPv4.
(b) Discuss IPv4 packet format with suitable diagram the at network layer.

6. Attempt any one part of the following: 10 x 1 = 10


(a) Differentiate between Open Loop and Closed Loop Congestion Control at transport
layer.
(b) Explain various traffic shaping algorithms.

7. Attempt any one part of the following: 10 x 1 = 10


(a) Define network security and discuss various network security services in computer
networks.
(b) Discuss E-mail architectures with its components.
29

98
_0

9.
24
P1

1.
3D

.2
P2

25
|1
Q

35
2:
:4
13
0 23
-2
02
0-
|1

QP23DP1_029 | 10-02-2023 13:42:35 | 125.21.249.98


Printed Page: 1 of 1
Subject Code: KCA303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM III) THEORY EXAMINATION 2023-24
COMPUTER NETWORK
TIME: 3HRS M.MARKS: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief.
Qno. Question Marks CO
a. Identify the five components of a data communication system. 2 1
b. Discuss the differences between simplex, half-duplex, and full-duplex 2 2
communication.
c. Explain various types of data errors in data communication. 2 4
d. Define the term piggybacking. 2 2
e. Differentiate between Datagram approach and Virtual circuit approach. 2 2
f. Define the function of router? 2 3
g. What are the characteristics of data communication? 2 1
h. What are the advantages of using Port numbers? 2 4
i. Define security goals of Information. 2 3
j. What is a firewall, and how does it contribute to network security? 2 1
SECTION B
90

2
2. Attempt any three of the following:

13
_2

a. With a neat diagram, explain OSI reference model. 10 4

2.
b. Explain different error detection and correction mechanisms used in data 10 5
P2

24
communication.
4D

c. Define switching. Briefly explain about Packet Switching, Message Switching 10 4

5.
and Circuit Switching.
.5
P2

d. Explain a congestion control algorithm. 10 5


17
Q

e. Write short notes on a) VPN b) NAT 10 4


|1

SECTION C
04

3. Attempt any one part of the following:


a. Explain the various media used for data transmission in computer networks. 10 4
3:

b. Describe the relative advantages and disadvantages of STAR, MESH, RING 10 4


:2

and BUS topologies.


13

4. Attempt any one part of the following:


a. Briefly explain the various media access protocol. 10 4
2 4

b. A bit stream 1010101010 is transmitted using the standard CRC method. The 10 3
20

generator polynomial is x4+x3+1. What is the actual bit string transmitted?


5. Attempt any one part of the following:
3-

a. Describe fragmentation. How does the network layer handle fragmentation and 10 2
0

reassembly of data packets during transmission?


5-

b. What is Internet Protocol (IP)? State and describe various classes used for IP 10 4
|1

addressing.
6. Attempt any one part of the following:
a. Write short notes on a) UDP b) TCP c) SCTP 10 2
b. Describe the QoS and explain techniques to improve QoS. 10 4
7. Attempt any one part of the following:
a. What is significance of cryptography? Compare between public-key and 10 4
private key cryptography
b. Write short notes on i) Domain Name System ii) Hyper Text Transfer Protocol 10 2
iii) World Wide Web iv)TELNET

QP24DP2_290 | 15-03-2024 13:23:04 | 117.55.242.132


Computer Networks BCA

Data Communications and Client Server


Architecture
Advanced Database Concepts MCA
Printed Page: 1 of 3
Subject Code: KCA204
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2021-22
DATABASE MANAGEMENT SYSTEMS

Time: 3 Hours Total Marks: 100


Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A

1. Attempt all questions in brief. 2*10 = 20


Qno Questions CO
(a) What do you mean by logical data independence? 1
(b) What do you mean by domain integrity? 1
(c) Define entity and entity set. 2
(d) Explain with suitable example: Simple – Composite Attribute. 2
(e) Determine the Relational Algebra expression for following- 3
For a relation Employee(EID, Ename, city), find the name of
employees who either live in Delhi or live in Mumbai.
(f) There is a table named CUSTOMER (ID, Name, DOR). Write the sql 3
query to display all the customer details. Note –( Early Date of
registration must be displayed first)
(g) What will be the possible superkeys for the relation schema 4
R(E,F,G,H) with EF as key ?
(h) Consider a relation R (A, B, C, D, E) with following FD’s: 4
A ->BC, CD -> E, B -> D, E -> A
Does B -> CD? Exists over the relation R?
(i) “A transaction must follow Durability property”. What do you 5
mean by Durability?
(j) There is a schedule S having 5 transactions. How many serial schedules 5
can be made possible?

SECTION B

2. Attempt any three of the following: 10*3 = 30


Qno Questions CO
(a) “Data redundancy leads to data inconsistency”. Justify your 1
answer.
(b) Explain participation constraint in E-R diagram with a suitable
2
example.
(c) Write the SQL command to Create the table named STUDENT 3

Column Name Data Type Size Remark


Roll Number 5 Primary Key, must start with
‘S’
Name Varchar2 25 Null values are not allowed
DOB Date
Email Varchar2 30 Must take unique values only
DOR Date Must not less than DOB
(d) Suppose a relational schema R (P, Q, R, S), and set of functional 4
dependency as following
F: {P -> QR, Q -> R, P-> Q, PQ -> R}
Printed Page: 2 of 3
Subject Code: KCA204
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2021-22
DATABASE MANAGEMENT SYSTEMS

Find the canonical cover Fc


(e) What is system log? What are the record entries done into the system 5
log during execution of a transaction?

SECTION C
3. Attempt any one part of the following: 10*1 = 10
Qno Questions CO
(a) With a neat diagram discuss the three-level architecture of DBMS 1
(b) What are the advantages of Database over file system? 1

4. Attempt any one part of the following: 10 *1 = 10


Qno Questions CO
(a) Consider the assumptions 2
a) Employee works for a department
b) In one department there are many employees
c) Each employee have some dependents
d) Employee works in some projects
Considering the above assumptions, draw an E‐R Diagram. Convert
the diagram to Relational Model.
(b) A relation named STUDENT(Roll, Name, DOB, Address, AdharNo, 2
Email) is there. Find out the following:
a) Alternative Keys
b) Non‐key Attributes
c) Non‐Prime attributes
d) Prime Attribute

5. Attempt any one part of the following: 10*1 = 10


Qno Questions CO
(a) How a trigger is different from procedure? What are the uses of a 3
trigger? Write a trigger which will insert the updated salary, the old
salary of an employee along with the date of updation into a table
named Employee_Backup.
(b) Find out the tables named EMP(Id, Name, DOJ, DeptID, Salary), 3
Dept(DeptId, Name, Location)

Write the SQL query for the following


a) Display the employee details along with the department name
where the employee is working.
b) Display the employees according to date of joining. (Recent
joins should come first)
c) Display the number of employees working in \MCA
Department.
d) Display the employee names whose name starts with ‘Ra’.
Printed Page: 3 of 3
Subject Code: KCA204
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2021-22
DATABASE MANAGEMENT SYSTEMS

e) Display the employees who are getting more salary than what
‘Rohan’ is getting.

6. Attempt any one part of the following: 10*1 = 10


Qno Questions CO
(a) What do you mean by lose-less decomposition of a relation? 4
Consider the relational scheme R (A,B,C,D,E,F) and FDs
AB -> C, C -> A, D -> E, F -> A, E -> D
Is the decomposition of R into R1 (A, C, D), R2 (B, C, D) and R3 (E,
F, D) lossless?
(b) What is partial functional dependency? Explain how insertion 4
anamoly, updation anamoly and deletion anamoly occurs when a
relation is having partial dependency?

7. Attempt any one part of the following: 10*1 = 10


Qno Questions CO
(a) What do you mean by concurrency control? What is a timestamp? 5
Discuss basic timestamp and strict timestamp protocol as concurrency
control mechanism.
(b) How serial schedule is different from non-serial schedule? What is a 5
serializable schedule?
A schedule is given as follows

S: r1(X), r2(X), w1(X), r1(Y), w2(X), W1(Y)

Check whether schedule S is a conflict serializable schedule or not?


MCA

questions on data mining and warehousing


BCA

Relational Database and Relational


Algebra
MCA

Object Oriented Analysis and Design using


CPP
BCA

Object Oriented Programming in CPP


Page 1 of 2
onlineqp.com

BCA 3rd SEMESTER EXAM. 2014


OBJECT-ORIENTED PROGRAMMING USING C++ CODE- 303301

Time: 3 hours Full Marks: 60

Instructions:

i. The Marks are indicated in the right -hand margin.


ii. There are SEVEN questions in this paper.
iii. Attempts FIVE question in all.
iv. Question Nos. 1 and 2 are compulsory.

1. Answer the following as directed (any six). 6*2=12

(a) Base class pointer cannot point to derived class

(State True or False)

(b) Which of the following is not the member of class

(I) Static function (II) Friend function

(III) Const function (IV) Virtual function

(c) Which of the following access specifies is used in a class definition by default?

(I) Protected (II) Pubic

(III) Private (IV) Friend

(d) What happens when a class with parameterized constructor and having no default

Constructor is used in a program and we create an object that needs a zero-

arguments constructor?

(e) If the programmer does not explicitly provide a destructor, then creates an empty

destructor. (Fill In the blanks)

(f) What is the use of function call operator?

(I) Overloading the method (II) Overloading the objects

(III) Overloading the parameters (IV) none of the above

(g) Which of the following advantages we lose by using multiple inheritances?

(I) Dynamic binding (II) Polymorphism

(III) Both (i) and (ii) (IV) none of the above


akubihar.com (h) Which of the following is referred by pointers to member?
Page 2 of 2
onlineqp.com
(I) Static members of class objects (II) Non-static members of class objects
(III) Referring to whole class (IV) none of the above

(i) What does derived class not inherit from the base class?

(I) Friends (II) Operator = () members

(III) Constructor and destructor (IV) A of the above

(j) Which other keyword are also used to declare the class other than class?

(I) Struct (II) Union

(III) Object (IV) both (i) and (ii)

2. Answer any three of the following: 3*4=12

(a) What is an operator function? Describe its syntax.

(b) Explain the characters of constructor and destructor.

(c) Write syntax for overloading extraction and insertion operator with friend function.

(d) Explain the mechanism for accessing private member of the base class using pointers.

(e) Describe various errors trapping function.

Answer any three of the following: 3*12=36

3. (a) What is function overloading? What are the rules for defining overloaded functions? Precautions

should us tae while overdoing function? 6

(b) Write a program in C++ to use bit fids with cases display the contents of the objects. 6

4. (a) How are the constructor and destructor called explicitly? What is the difference between
their calling methods? 6

(b) Write a program in C++ to pass an object to constructor and carry out copy constructor

display contents of the objects. 6

5. What is operator overloading? Explain the conversion of basic data type to class type and class
type to basic type with appropriate example. 12

6. (a) Describe various type of inheritance with example. 6

(b) Write a program in C++ to declare class X Y and Z. Each class contains one character array as

a data member. Apply multiple inheritance. Concatenate strings of class X and Y and store it in Z.
Show all the three strings. Use constructor and destructor. 6

7. (a) What are templates? Explain its need. How can normal function be declared as template function?

(b) Write a program in C++ to use exception handing with constructor and destructor.
akubihar.com 6*2=12
BCA

DSA in C/C++
MCA

Discrete Mathematics
www.aktuonline.com

Printed Pages: 4
RCA I1O3
(Following Paper ID and RoIl No. to be filled in your
Answer Books)

Roll Nlo.

M.C.A.
Regular Theory Examination (Odd Sem-I) 201 G-17
DISCRETE I\{ATHEMATIC S
Time : 3 Hours Msx. Marls: 70

SECTION.A
www.aktuonline.com

1. Answer all parts.Alt parts carry equal marks. Write answer


of each paft in short. (5*2=10)
a) Definearelation Rwhich Reflexive, Symmetric,
is
Anti-symmetric and Transitive for a set
A - {1,2,3,4,51
b) Define the bounded lattice.

c) Write the conjunctive normal form for the


expression (y + r') ofthree variable x,y,z.

d) Wtite converse and inverse for the following


stateme nt "Ifx+3 = S then x - 6"

e) Given an example of homogenous and non-


homogeneous recurrence relation of ord er 4 and
degree 3.

r03n2t2016n420 (l) [P.T.O.

www.aktuonline.com
www.aktuonline.com

RCA.I03
SECTION-B
Attempt any five questions from this section.
a
(SxB=40)

2. Show that for arrytwo sets A and B. A - (l n B) = A - B .

Also find the values A - (a ^.B) and A - B for set

A - {1,2,3,4,5\ B - {2,3,4,6} .

3. What is composition of functions? Also prove that


www.aktuonline.com

-f'o g-t -(gof)-'where f :Q+Q suchthat fx)-4x


and f : Q + Q such that g(x) - x*4 are two functions.

4. Let S - {l ,2,3......,12} be a poset under divisibility


relatiorl. Draw Flasse diagram and find first element &
Last element. Also find upperbound, lowe bound, Least
Upper Bound & Greatest Lower Bound for the subset
{5,7 ,8}.

t.- Simplify the Boolean expression f(w, x, y, z) L

I(0, 1,3,5,9,11,12,14) by using K-map. Also draw the


logic and circuit diagram ofthe simplified expression.

6. Define Boolean algebra. If (f ,*, o ,' ,0, l) is a Boolean

algebra and o,b e B then prove that (a + b)' = ct, * b,

103/12t2016n420 (2)

www.aktuonline.com
www.aktuonline.com

RCA. 103

7. Explain the quantifiers in details. Also write the following


English l.anguage into symbolic statement.
o'Every
students of this university is either academician
or sportsman".

8. Define Inference theory. Also explain the rules of


inference with example.

9. Find complete solution of the recurrence relation


r.rn - 4un-, +3ur-, = 5n + n
www.aktuonline.com

SECTION.C
Attempt any trvo questions from this section.
(Z*10:20)
10. a) If A be non empty set with n elements then prove
that the number of function from A
-> A is less
than the number ofrelation from A + A i.e. nn (
2"2

b) If ( A,<) (r,<) are posets, then (e" B,<) is a poset

with partial order defined by (a,b) s (o' ,b') ifa I a,


inAand b sb' ints.

11. a) Define disjunctive normal form (DNF). Also find


the DNF for the following Boolean expression.

(,*b')*(bxc') + (t*a')
t03n2l20t6lMza (3) [P.T.O.

www.aktuonline.com
www.aktuonline.com

RCA-I03
b) Define tautology. Prove that the statement
(p q) -> (p q) is tautology.
" "
12. a) Define pigeon hole principle. Find the minimum
nurnber ofboys born in the same minute out of 3000
boys on a day.

b) In a MCA class of 40 students 5 are weak.


Determine how many ways we can make agroup of
students

i) Five good students


www.aktuonline.com

ii) Five students in which exactly three are weak.

103/12t20r6n42fi (4)

www.aktuonline.com
www.aktuonline.com

Printed pages: 2 Paper id: 1403 Sub Code: RCA103

M.C.A.
(SEM I) THEORY EXAMINATION 2017-18
DISCRETE MATHEMATICS
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
2. Any special paper specific instruction.

SECTION A

1. Attempt all questions in brief. 2 x 7 = 14


a. What do you mean by power set? Illustrate with an example.
b. Let f and g: R → R, be defined as follows:
f(x) = x + 2, g(x) = 1 / (x2 + 1). Compute f o g(x)
c. State and prove De Morgan‟s law for logic.
d. What do you mean by equivalence relations?
e. Draw the hasse diagram of poset (D72, „|‟). „|‟ represent the divisibility operation.
f. Write and prove „Modus Ponens‟ rule of inference.
g. Let A = {1, 2, 3, 4, 5, 6}. Compute (4, 1, 3, 5) o (5, 6, 3).
www.aktuonline.com

SECTION B

2. Attempt any three of the following: 7 x 3 = 21


a. Show that for any two sets, A and B:
A - (A ∩ B) = A - B.
Also draw Venn diagrams for both.
b. Define linearly orders set and partially ordered set. Explain the properties, a poset
must satisfy?
c. Using mathematical induction, show that 11n+1 + 122n-1 is divisible by 133 for all n ≥ 1.
d. Solve the following recurrence relations:
(i) fn =5 fn-1 +6 fn-2
(ii) dn = 2dn-1 – dn-2
e. Prove the validity of the following argument without using truth table:
“If I get the job and work hard, then I will get promoted. If I get promoted, then I will
be happy. I will not be happy. Therefore, either I will not get the job or I will not work
hard”.

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Prove that the relation “Congruence Modulo m”, given by „Ξ‟ = { (x, y) | x – y is
divisible by m}, over the set of positive integers is an equivalence relation.
Also, show that if X1 Ξ y1 and x2 Ξ y2, then (x1 + x2) Ξ (y1 + y2)
(b) What do you mean by function? Explain different types of functions with proper
examples.
4. Attempt any one part of the following: 7x1=7
(a) Define Supremum and infimum for a partial order. Determine LUB and GLB of
following subsets for Hasse diagram given below:
(i) {a, b, c}
(ii) {f, g, h}
www.aktuonline.com
www.aktuonline.com

(b) What do you mean by distributed lattice and complemented lattice? Consider the
bounded lattice L, given below. Check whether it is distributive or not.

5. Attempt any one part of the following: 7x1=7


(a) Use a K-map to find a minimal sum for:
www.aktuonline.com

E = y‟t‟ + y‟z‟t + x‟y‟zt + yzt‟


Also draw the circuit diagram for the expression obtained.
(b) Define minterms and maxterms with examples. Express the Boolean function f (x, y,
z) = x + y‟z as a sum of minterms.
6. Attempt any one part of the following: 7x1=7
(a) Write the following conditional statement in symbolic form. Also give the converse,
inverse and contra-positive of the statement:
“If the flood destroys Mohan‟s house or the fire destroy Mohan‟s house, then Mohan‟s
insurance company will pay him.”
(b) What do you mean by existential quantifiers and universal quantifiers? Explain with
proper examples.
Find a counterexample, if possible, to these universally quantified statements, where
the domain for all variables consists of all integers.
(i) ∀x(x2 ≥ x)
(ii) ∀x(x > 0 ∨ x < 0)
(iii) ∀x(x = 1)

7. Attempt any one part of the following: 7x1=7


(a) Solve the following linear nonhomogeneous recurrence relation with
constant coefficient:
an = 5an−1 + 6an−2 + 3.5n where a0 = 4 and a1 = 7
Verify your answer for a2.
(b) Write short notes on following:
(i) Poyla‟s Counting Theorem
(ii) Pigeonhole Principle

www.aktuonline.com
Printed Page: 1 of 2
Subject Code: RCA103
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM. I) THEORY EXAMINATION 2020-21
DISCRETE MATHEMATICS
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
a. State the Commutative and Distributive Laws of Set theory.
b. Define the Equivalence Relation.
c. Define the following terms (any two) with example:
i) DNF, ii) CNF, iii) Universal Gates
d. State the Idempotent, Involution laws of Boolean Algebra.
e. State the Modus Ponens and Hypothetical Syllogism Inference Rules.
f. What do you mean by Bound and Free variable with example?
g. State Generating Function.

SECTION B
2. Attempt any three of the following: 7 x 3 = 21
a. Show that relation “ xRy iff (x-y) is divisible by 3” is an equivalence relation
on the set of integers.
b. Let S = {x, y, z} and P(S) be its power set. Show that (P(S), ⊆) is a Lattice.
c. State and Prove the Associative Laws of Boolean Algebra.
d. If 𝐴 1, 2, 3, 4, 5, 6, 7, 8, 9. 𝐷𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑒 the truth value of each of the
following statement:
i) ∀𝑥 ∈ 𝐴𝑥 4 15
ii) ∋ 𝑥 ∈ 𝐴 𝑥 4 10
iii) ∀𝑥 ∈𝐴 𝑥 4 10

e. An examination paper containing 12 questions consists of two parts, A and B,


part A contains 7 questions and part B contains 5 questions. A candidate is
required to attempt 8 questions, selecting at least 3 from each part. In how
many ways the candidate selects the questions?

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) For any set A and B, Prove that ∶ 𝑃 𝐴 ∩𝐵 𝑃 𝐴 ∩ 𝑃 𝐵 .

(b) Define the function. And also explain the various types of functions.

1|Page
Printed Page: 2 of 2
Subject Code: RCA103
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

4. Attempt any one part of the following: 7x1=7


(a) Define Dual Lattice. And Show that Dual of a lattice is a lattice.
(b) If D = {1, 2, 4, 8, 16, 32, 64} be ordered by the relation “a divides b”.
Then show that D is a Poset. Also draw the Hasse diagram.
5. Attempt any one part of the following: 7x1=7
(a) Draw Karnaugh map (K-map) and simplify the following Boolean expression:
𝑓 𝑎, 𝑏, 𝑐, 𝑑 ∑ 0,2,6,8,10,12,14,15 .
(b) Show that 𝐴 ⊕ 𝐵 𝐴. 𝐵′ ′ . 𝐴′ . 𝐵 ′ ′ and hence design a logic circuit of
𝑋𝑂𝑅 gate using 𝑁𝐴𝑁𝐷 only.
6. Attempt any one part of the following: 7x1=7
(a) Show that: (p → q) ʌ (r → q) ≡ (p ∨ r) → q.
(b) Construct the truth table: ((p⇒ q) ∨ (q ⇒ p)) ⟺ p
Is the preposition: Tautology, Contradiction or Contingency?
7. Attempt any one part of the following: 7x1=7
(a) Solve the following recurrence relation:
𝑎 7𝑎 10𝑎 0 𝑤𝑖𝑡ℎ 𝑖𝑛𝑖𝑡𝑖𝑎𝑙 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛𝑠 𝑎 0 𝑎𝑛𝑑 𝑎 3
(b) Explain the difference between Permutation and Combination. And solve:
Everybody in a room shakes hands with everybody else. The total number of
handshakes is 66. Find how many people are there in the room?

2|Page
Printed Page: 1 of 2
Subject Code: KCA104
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2021-22
DISCRETE MATHEMATICS

Time: 3 Hours Total Marks: 100


Note: 1. Attempt all Sections. All the symbols have their usual meaning.

SECTION A
1. Attempt all questions in brief.
Qno. Question Marks CO
a. What is the cardinality of the set? 2 1
Find the cardinality of the set {1, {2, ϕ, { ϕ }}, { ϕ }}.
b. Let the two following functions be defined on set of real numbers be as: 2 1
f(x) = 2x+3 and g(x) = x2+1. Find the (fog)(x).
c. Define the well-ordered set? Give an example of well-ordered set. 2 2
d. Draw the Hasse diagram of the lattice of (D6, |). 2 2
e. Define Tautology and Contradiction. 2 3
f. Discuss the truth table of p  q . 2 3
g. What is the generator of a cyclic group? 2 4
h. Find the order of each element in the group ({1, -1}, .). 2 4
i. Find the number of handshakes in party of 12 people, where each two of 2 5
them shake hands with each other.
j. Discuss the pigeonhole principle? 2 5

SECTION B
2. Attempt any three of the following:
Qno. Question Marks CO
a. Prove that the relation (x, y) ∈ R, if x ≥ y defined on the set of positive 10 1
integers is a partial order relation.
b. If B = {1, 3, 5, 15}, then show that  B, , . , ' is a Boolean Algebra, 10 2
15
where a + b = lcm (a, b), a .b = gcd (a, b) and a'  .
a
c. (i) Prove that conditional proposition and its contrapositive are 10 3
equivalent, i.e. 𝑝 → 𝑞 ≡ ~𝑞 →. ~𝑝
(ii) Prove the equivalence:  p  q   q  p  q
d. Show that set ℤ 0,1,2,3,4,5 forms a group with respect to addition 10 4
modulo 6.
e. (i) State all PEANO’s axioms. 10 5
(ii)In how many ways, can 7 boys and 5 girls be seated in a row, so that
no two girls may sit together?

SECTION C
3. Attempt any one part of the following:
Qno. Question Marks CO
a. In a survey of 60 people, it was found that 25 eatApple, 26 eatOrange 10 1
and 26 eatBanana fruit. Also 9 eat both Apple and Banana, 11 eat both
Orangeand Apple, and 8 eat both Orangeand Banana. 8eat no fruit at
all. Then determine
i. the number of people who eat all three fruit.
ii. the number of people who eat exactly two fruit.
Printed Page: 2 of 2
Subject Code: KCA104
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2021-22
DISCRETE MATHEMATICS

iii. the number of people who eat exactly one fruit


b. State and Prove De Morgan’s laws for set theory. 10 1

4. Attempt any one part of the following:


Qno. Question Marks CO
a. (i)Write the definition of the maximal, minimal, greatest and least 10 2
element of a Poset.
(ii)If S = {10, 11, 12}. Determine the power set of S. Draw the Hasse
diagram of Poset (P(S),  ).
(iii)Find the maximal, minimal, greatest and least element of the Poset in
Part (ii).
b. i) Determine the DNF of Boolean expression f  x, y, z   x  y'. z 10 2
ii) Simplify the following Boolean expression using K-Map method:
A' B 'C ' A' B 'C  A' BC  A' BC ' AB 'C  ABC .

5. Attempt any one part of the following:


Qno. Question Marks CO
a. (i) Given the value of p → q is false, determine the value of 10 3
~𝑝⋁~𝑞 → .𝑞
(ii) Prove the equivalence:  p  q   q  p  q .
b. State and Prove De Morgan’s laws for propositions using truth table. 10 3

6. Attempt any one part of the following:


Qno. Question Marks CO
a. Show that set of all integers ℤ forms a group with respect to binary 10 4
operation * defined as a * b = a + b + 1, where a,b ∈ ℤ.
b. (i)Define Ring and Field. Give an example of a Ring and a Field. 10 4
(ii)Prove that every cyclic group is abelian.

7. Attempt any one part of the following:


Qno. Question Marks CO
a. State Mathematical Induction. Using the Mathematical Induction, show 10 5
n  n  1 (2n  1)
that 12  22  32  ...  n2  , n  1.
6
b. Use generating functions to solve the recurrence relation, 10 5
an  9an 1  20 an 2  0 where ao  3 and a1  10 .
Printed Pages:02 Sub Code: KCA104
Paper Id: 233508 Roll No.

MCA
(SEM. I) THEORY EXAMINATION 2022-23
DISCRETE MATHEMATICS
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

(a) State the Distributive and Associative laws of set theory.


(b) Write down the properties of Equivalence Relation.
(c) Define the Hasse diagram with example.
(d) What do you mean by Normal Form in Boolean algebra?
(e) Define the term Proposition.
(f) Negate the statement “He is poor and laborious”
(g) Define Monoid with example.
(h) Define the Commutative Ring with unity.

32
90
(i) Solve the recurrence relation:𝑎 3𝑎 2𝑎 = 0.

.1
_2

(j) Write down the properties of Generating function.

42
P2

.2
SECTION B
3D

5
.5
P2

2. Attempt any three of the following: 17 10x3=30


Q

|1

(a) If 𝑋 𝑝, 𝑞 and 𝑍 𝑎, 𝑏 and the functions f and g are define as


00

1,2,3 , 𝑌
: 𝑓 ∶ 𝑋 → 𝑌 be 𝑓 1, 𝑝 , 2, 𝑝 , 3, 𝑞 ,
1:

𝑔 ∶ 𝑌 → 𝑍 be 𝑔 𝑝, 𝑞 , 𝑞, 𝑏 then find 𝑓𝑜𝑔 𝑎𝑛𝑑 𝑔𝑜𝑓.


:5

(b) Let L be the set of all factor of 12 and let ‘/’ be the divisibility relation on L.
08

Then show that (L, ‘/’) is a lattice.


(c) Show that: (p ⟷ 𝑞 ∧ 𝑞 ⟷ 𝑟 ⟶ 𝑝 ⟷ 𝑟 is a Tautology.
3

(d) What do mean by Order of an element in a group?


02

Find the order of each element of the multiplicative group g= {1,-1,i,-i}.


-2

(e) Solve the recurrence 𝑎 4𝑎 4𝑎 2


03

SECTION C
9-
|2

3. Attempt any one part of the following: 10x1=10

(a) Define the function and explain the difference between function and relation with
example
(b) For any set A and B, Prove that ∶ 𝑃 𝐴 ∩ 𝐵 𝑃 𝐴 ∩ 𝑃 𝐵 .

QP23DP2_290 | 29-03-2023 08:51:00 | 117.55.242.132


4. Attempt any one part of the following: 10x1=10

(a) Define Modular Lattice. Also Prove that: Every Distributive lattice is Modular.
(b) Solve using K-map:𝐹 𝐴, 𝐵, 𝐶, 𝐷 ∑ 0,1,2,3,4,5,6,7,8,9,11

5. Attempt any one part of the following: 10x1=10

(a) Show that s is a valid conclusion from the premises:


𝑝 → 𝑞, 𝑝 → 𝑟, ∼ 𝑞∧𝑟 𝑎𝑛𝑑𝑠 ∨ 𝑝.
(b) If 𝐾 𝑥 ∶ 𝑥 𝑖𝑠 𝑠𝑡𝑢𝑑𝑒𝑛𝑡, 𝑀 𝑥 : 𝑥 𝑖𝑠 𝑐𝑙𝑒𝑣𝑒𝑟, 𝑁 𝑥 ∶ 𝑥 𝑖𝑠 𝑠𝑢𝑐𝑐𝑒𝑠𝑠𝑓𝑢𝑙.
Express the following using quantifiers:
(i) There exists a student
(ii) Some students are clever
(iii) Some students are not successful.

6. Attempt any one part of the following: 10x1=10

(a) Define the permutation group. If A= {1, 2, 3, 4, 5} then find:


(1 3) 0 (2 4 5) 0 (2 3).

32
90
(b) Show that G= {0,1,2,3,4} is a cyclic group under addition modulo 5.

.1
_2

42
P2

7. Attempt any one part of the following: 10x1=10

.2
3D

5
.5
(a) Determine the numeric function corresponding to the following Generating function:
P2

𝐴 𝑍 17
Q

|1
(b) Prove by mathematical induction that 𝑛 2𝑛 is divisible by 3 for each positive
integer 𝑛.
00
1:
:5
08
3
02
-2
03
9-
|2

QP23DP2_290 | 29-03-2023 08:51:00 | 117.55.242.132


Printed Page: 1 of 2
Subject Code: KCA104
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2023-24
DISCRETE MATHEMATICS
TIME: 3HRS M.MARKS: 100

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief.
Qno. Question Marks
a. Define the Cartesian Product of sets with example. 2
b. If set 𝐴has 𝑛 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 , how many relations are there from𝐴 𝑡𝑜 𝐴 ? 2
c. Draw the Hasse diagram of 𝐷 , / . 2
d. Express the following Boolean function in Sum of minterms: 2
𝐹 𝑥, 𝑦, 𝑧 𝑥 𝑦𝑧
e. Prove the following Equivalences by using Truth table: 2
𝑝 → 𝑞 →𝑞 ≡𝑝 ∨ 𝑞
f. Define Bound and Free variables with example. 2
g. Define Order of an element of a Group with example 2
h. What do you mean by Even and Odd Permutation? 2
i. State the Mathematical Induction Law. 2
90
j. Find the minimum number of students in a class so that three of them are born 2

2
13
in the same month.
_2

SECTION B

2.
P2

24
2. Attempt any three of the following:
4D

5.
a. Define the composition of function. If 𝑓 𝑥 𝑥 1 𝑎𝑛𝑑 𝑔 𝑥 10
3𝑥 1 , 𝑓𝑖𝑛𝑑: 𝑖 𝑔𝑜𝑓, 𝑖𝑖 𝑓𝑜𝑔 , 𝑖𝑖𝑖 𝑔𝑜𝑔, 𝑖𝑣 𝑓𝑜𝑓
.5
P2

b. IF𝐴 𝑎, 𝑏, 𝑐 , show that 𝑃 𝐴 , ⊆ is a Poset and draw its Hasse diagram. 10


17
Q

c. Rewrite the following argument using quantifiers, variables and predicate 10


|1

symbols. Prove the validity of the argument: “If it rains then it will be cold. If it
is cold then I shall stay at home. Since it rainstherefore, I shall stay home”.
39

d. Define the Subgroup. Prove that the additive group of even integers is a 10
7:

subgroup of the additive group of all integers.


:5

e. Prove that:8 – 3 is a multipleof 5for all n≥1by mathematical induction. 10


08

SECTION C
3. Attempt any one part of the following:
2 4

a. In a group of 850 person, 600 can speaks Hindi and 340 can speak Tamil. Find 10
20

:i) How many can speak both Hindi and Tamil?


3-

ii) How many can speak Hindi only?


iii) How many can speak Tamil only?
0
2-

b. If 𝑅 be the relation on set 𝐴 𝑎, 𝑏, 𝑐, 𝑑 and𝑅 10


𝑎, 𝑏 , 𝑏, 𝑐 , 𝑑, 𝑐 , 𝑑, 𝑎 , 𝑎, 𝑑 , 𝑑, 𝑑 .
|1

Determine: i) Reflexive closure of 𝑅, ii) Symmetric closure of 𝑅, iii) Transitive


closure of 𝑅
4. Attempt any one part of the following:
a. Express the Boolean expression: 𝑓 𝑥 , 𝑦 , 𝑧 𝑥 𝑦 𝑥 𝑧 in both 10
𝑑𝑖𝑠𝑗𝑢𝑛𝑐𝑡𝑖𝑣𝑒 𝑎𝑛𝑑 𝑐𝑜𝑛𝑗𝑢𝑛𝑐𝑡𝑖𝑣𝑒 𝑛𝑜𝑟𝑚𝑎𝑙 𝑓𝑜𝑟𝑚𝑠.
b. Use Karnaugh map representation to find minimal sum of products expression 10
for the following Boolean function:
𝐹 𝐴, 𝐵, 𝐶, ∑ 0,2,3,4,7
5. Attempt any one part of the following:
1|Page
QP24DP2_290 | 12-03-2024 08:57:39 | 117.55.242.132
Printed Page: 2 of 2
Subject Code: KCA104
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM I) THEORY EXAMINATION 2023-24
DISCRETE MATHEMATICS
TIME: 3HRS M.MARKS: 100

a. Prove the following Equivalence:𝑝 → 𝑞 ∨ 𝑟 ≡ 𝑝 → 𝑞 ∨ 𝑝 → 𝑟 10


b. Obtain the 𝑑𝑖𝑠𝑗𝑢𝑛𝑐𝑡𝑖𝑣𝑒 𝑛𝑜𝑟𝑚𝑎𝑙 𝑓𝑜𝑟𝑚 𝐷𝑁𝐹 of the following logical 10
expression:𝑝 → 𝑝 → 𝑞 ∧ ∼ ∼ 𝑞 ∨ ∼ 𝑝 .
6. Attempt any one part of the following:
a. If the Inverse of an element “𝑎” in a group is "𝑎 " , then the Inverse 10
𝑎 𝑖𝑠 𝑎, 𝑖𝑒 𝑎 𝑎.
b. Show that the set of fourth roots of unity forms an abelian group with respect to 10
multiplication.
7. Attempt any one part of the following:
a. Solve the following Recurrence Relation: 10
𝑎 7𝑎 10𝑎 0 𝑤𝑖𝑡ℎ 𝑖𝑛𝑖𝑡𝑖𝑎𝑙 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛𝑠 𝑎 0 𝑎𝑛𝑑 𝑎 3
b. What do mean by Generating function. Find the Generating function of the 10
following series:1,1,1,1,1,1,1.

90

2
13
_2

2.
P2

24
4D

5.
.5
P2

17
Q

|1
39
7:
:5
08
2 4
20
0 3-
2-
|1

2|Page
QP24DP2_290 | 12-03-2024 08:57:39 | 117.55.242.132
MCA

Automata

You might also like