MCA Sem 1 Question Bank
MCA Sem 1 Question Bank
YEAR(2024-2026)
Contents of Book
For More Better Practice , the BCA Level Questions are made
the part of this book.
- 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
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?
(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
Burst time 8 4 I
3tu121201613540 Q)
www.aktuonline.com
www.aktuonline.com
NMCA 311
www.aktuonline.com
asE:
www.aktuonline.com
NMCA 3Ir
Section - C
i) LRUreplacement.
ii) FIFOreplacement.
iii) Optimalreplacement.
Assuming
www.aktuonline.com
a) File Systems.
b) Interprocess Communication.
++++
3LU12t2016/3540 (4)
www.aktuonline.com
www.aktuonline.com
SECTION A
SECTION B
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?
What is the average turnaround time for these processes with the preemptive shortest
e.c
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.
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
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
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
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
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
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
SECTION C
4:
(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
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
MCA
(SEM II) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS
MCA
(SEM II) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS
P1 0 3 2 2
P2 0 2 4 1
P3 2 1 3 2
P4 5 2 2 1
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.
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
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
(b) What is semaphore? Classify the semaphore with their synchronization code.
|1
(c) Define the following terms:-
(i) Dispatcher
58
(iv) Swapping
08
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?
(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
waiting time and average turnaround time. (Lower number means higher
:4
priority)
08
23
-20
08
3-
|0
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
|1
58
8:
:4
08
23
- 20
08
3-
|0
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
2
h. Differentiate between SRAM and DRAM. 2 4
13
i.
_2
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
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
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
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
c. How many bits are left to select an input for the multiplexers.
|1
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
Hit ratio.
3-
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
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
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
(e) Discuss interrupt handling process with the help of flow chart.
:0
09
SECTION C
3
(a) Design four bit arithmetic unit and discuss various operation performed
-2
by it.
03
32
90
.1
_2
42
P2
.2
3D
5
.5
P2
17
Q
|1
40
5:
:0
09
3
02
-2
03
1-
|2
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?
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
Q3(b) What is the Stack organization? Compare register stack and memory stack.
0:
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
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-
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.
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| 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
M.C.A.
(SEM. IiiYODD SEMESTER THEORY EXAMINATION
2010-11
COMPUTER NETWORKS
TiJ1,1e : 3 Hours
(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
SECTION B
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
2|Page
Printed Pages:02 Sub Code:KCA-303
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
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
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
packet.
0-
(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.
98
_0
9.
24
P1
1.
3D
.2
P2
25
|1
Q
35
2:
:4
13
0 23
-2
02
0-
|1
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
2.
b. Explain different error detection and correction mechanisms used in data 10 5
P2
24
communication.
4D
5.
and Circuit Switching.
.5
P2
SECTION C
04
b. A bit stream 1010101010 is transmitted using the standard CRC method. The 10 3
20
a. Describe fragmentation. How does the network layer handle fragmentation and 10 2
0
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
MCA
(SEM II) THEORY EXAMINATION 2021-22
DATABASE MANAGEMENT SYSTEMS
SECTION A
SECTION B
MCA
(SEM II) THEORY EXAMINATION 2021-22
DATABASE MANAGEMENT SYSTEMS
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
MCA
(SEM II) THEORY EXAMINATION 2021-22
DATABASE MANAGEMENT SYSTEMS
e) Display the employees who are getting more salary than what
‘Rohan’ is getting.
Instructions:
(c) Which of the following access specifies is used in a class definition by default?
(d) What happens when a class with parameterized constructor and having no default
arguments constructor?
(e) If the programmer does not explicitly provide a destructor, then creates an empty
(i) What does derived class not inherit from the base class?
(j) Which other keyword are also used to declare the class other than class?
(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.
3. (a) What is function overloading? What are the rules for defining overloaded functions? Precautions
(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
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
(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
www.aktuonline.com
www.aktuonline.com
RCA.I03
SECTION-B
Attempt any five questions from this section.
a
(SxB=40)
A - {1,2,3,4,5\ B - {2,3,4,6} .
103/12t2016n420 (2)
www.aktuonline.com
www.aktuonline.com
RCA. 103
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')*(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.
103/12t20r6n42fi (4)
www.aktuonline.com
www.aktuonline.com
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
SECTION B
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.
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
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
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
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
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
32
90
(i) Solve the recurrence relation:𝑎 3𝑎 2𝑎 = 0.
.1
_2
42
P2
.2
SECTION B
3D
5
.5
P2
|1
1,2,3 , 𝑌
: 𝑓 ∶ 𝑋 → 𝑌 be 𝑓 1, 𝑝 , 2, 𝑝 , 3, 𝑞 ,
1:
(b) Let L be the set of all factor of 12 and let ‘/’ be the divisibility relation on L.
08
SECTION C
9-
|2
(a) Define the function and explain the difference between function and relation with
example
(b) For any set A and B, Prove that ∶ 𝑃 𝐴 ∩ 𝐵 𝑃 𝐴 ∩ 𝑃 𝐵 .
(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
32
90
(b) Show that G= {0,1,2,3,4} is a cyclic group under addition modulo 5.
.1
_2
42
P2
.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
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
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:
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
MCA
(SEM I) THEORY EXAMINATION 2023-24
DISCRETE MATHEMATICS
TIME: 3HRS M.MARKS: 100
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