mRrj izns”k jktf’kZ V.

Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZdksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdrevad % 30
Course Code: BCA-111 DBMS Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. Consider a car-insurance company whose customers own one or more cars each. Each car
has associated with it zero to any number of recorded accidents.
(i) Draw an E-R diagram
(ii) Transform the E-R diagram to a Relational Schema.

2. Consider the following ER diagram.

Explain how many tables are needed to represent M, N, P, R1, R2?

3. Consider the relation R(A,B,C,D,E,G) with functional dependencies given by {AB->C,

AC->B, AD-> E, B->D, BC->A, E-> G}. Consider the decomposition of R into {AB,
BC, ABDE,EG}.

a) Is this decomposition lossy or lossless? Explain why?

b) Is this decomposition is dependency preserving or not? Explain why?

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
 Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. Identify the Normal Forms of the relation R(ABCDEF) Functional dependencies given by
{AB → C, C → D, B → E, B → F}

5. Let R (ABCDEF) is a relational schema having FDs {A→BCDEF, BC→ADEF, B→C,

D→E} Find out the Candidate Key ?

6. What is derived attribute? Explain the differences between single-valued attributes and
multi-valued attributes.

7. The employee information in a company is stored in the relation.

Employee:(name,sex,salary,deptName)
Assume name is primary key and consider the following SQL query:
SELECT deptName FROM Employee WHERE sex='M' GROUP BY deptName
HAVING AVG (salary)> (SELECT AVG(salary) FROM Employee);
Explain the output of above SQL query?
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZdksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdrevad % 30
Course Code: BCA-112 Operating System Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. Consider the following page reference string: 1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6. How

many page faults would occur for the LRU, FIFO, LFU and optimal page replacement
algorithms assuming three and five frames?
2. Consider the following table of arrival time and burst time for three processes P0, P1 and
P2.

Process Arrival time Burst Time

P0 0 ms 9 ms

P1 1 ms 4 ms

P2 2 ms 9 ms

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out
only at arrival or completion of processes. What is the average waiting time for the three
processes?

3. Assuming the current disk cylinder to be 50 and the sequence for the cylinders to
be 1,36,49,65,53,12,3,20,55,16,65 and 78 find the sequence of servicing using

(a) Shortest seek time first (SSTF)

(b) SCAN disk scheduling policies.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA
4. How does thrashing occurs? Explain with an example.
5. How does a deadlock happens in a system?
6. What are the minimum requirements that should be satisfied by a solution to critical
section problem?
7. What is purpose of Process Control Block?
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZdksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdrevad % 30
Course Code: BCA-113 Software Engineering Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. What is Risk Management? How does software risk management related to software
process improvement?
2. Define Software Development life cycle (SDLC). List the advantage and disadvantage of
spiral model.
3. What is Software Testing? What are the various characteristics of a good testable
software?

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. Explain differences between prototype model and spiral model.

5. Discuss the role of PERT Chart in software development.
6. What is Cohesion? How it is different from of coupling?
7. What do you understand by Software Configuration Management?
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZdksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdrevad % 30
Course Code: BCA-114 Principle of Programming Languages Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. Write any four important uses of programming languages. List the design
principles of imperative languages.
2. Write brief notes on following:
(a) Abstract data types (b) Polymorphism (c) Recursive sub-programs (d) Encapsulation
3. Write three applications of functional programming. Outline the pros and cons of
procedures and functions.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. Distinguish between dangling pointers and memory leakage.

5. List the benefits of modular development approach.
6. What are the differences between static and dynamic allocation?
7. Discuss the important features of a programming language.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZdksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdrevad % 30
Course Code: BCA-116 Computer Network Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. Describe the differences between the following:

(i) Half Duplex and Full Duplex (ii) mutlicast addressing and Unicast addressing. (iii) packet
switching and Circuit Switching.
2. Explain the OSI reference model with the help of a diagram. List the important functions
of each layer of the model.
3. Assume message M: 1010101010 bits and generator G: 10001 bits. Explain how CRC is used for
error detection using above message bits and generator bits.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. How classful addressing is different from class-less addressing? Give the range of IP addresses
used in different classes in class addressing mode.
5. Write the similarities between TCP/IP and OSI model.
6. Explain the format of TCP header through illustration.
7. Explain the working of Link State Routing Algorithm using an example.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZdksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdrevad % 30
Course Code: BCA-117 Java Programming Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. What is overloading of methods? Explain with an example how overloading of methods is

different from overriding of methods.
2. What is a constructor? Write a Java program to explain how super class constructors are called in
their subclasses.
3. How Access Control Mechanism is implemented in Java? What Method does subclass inherit
from superclass.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. Explain the use of ‘this’ keyword with an example.

5. Write down a java program to display number in word format, for Example: 123 will be shown as
“One Two Three”.
6. Differentiate between components and containers in AWT
7. What is the difference between Overloading and Overriding? Is it possible to override a inner
classes.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZdksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdrevad % 30
Course Code: BCA-118 Windows Programming Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. What are the advantages and disadvantages of Visual Basic over any other object-
oriented language? Explain with suitable examples.
2. Write a program in VB for adding List Box, List Items, Check Box, Radio Button and
Menus to your Window.
3. What are the important features of Visual Basic? Explain various control structures in
Visual Basic?

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. What is event? Discuss any four events supported by visual basic.

5. What are the basic differences between checkbox and radio buttons?
6. Write a Visual Basic program to design a digital clock.
7. Explain the concept of database connectivity.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA-119 Computer Organization Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1 ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. (a)Implement the following Boolen Expression with NOR GATE only.

F (A, B, C) = Π(0, 2, 4, 6, 7)
(b) Why NAND and NOR gates are called as Universal gate.
2. What do you mean by Flip-Flop? Discuss the functions and circuits diagram of different
type of flip flop?
3. What is the difference between combinational and sequential circuit? Explain with
appropriate example.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. Differentiate Hardware and Micro-programmed control unit with their advantages and
disadvantages.
5. What is instruction cycle? When will be any interrupt processed during the instruction
cycle?
6. What is DMA? Explain DMA transfer modes in detail.
7. What do you mean by memory hierarchy? Why registers are present in CPU?
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]ç;kxjkt
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA 121 Information and Network Security Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1 ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. Differentiate between the following:

a. Authentication and Authorization
b. Active Attack and Passive Attack
c. Direct and arbitrated digital signatures
d. Session key and master key

2. i) What does Triple DES use and what does triple DES guarantee?
ii) Show the steps involved in DES round key generation for key: OIFE OIFE OIFE
OIFE.

3. i) What is a replay attack? Show various approaches against it.

ii) Mention properties and requirements of digital signatures.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. What are the overall goals of information security?

5. For the intercepted ciphertext C = 10 and public key e = 5 and n = 35, identify the
plaintext M.
6. What are the key features and characteristics of secure hash function?
7. Encrypt the message "Russians are Indian friends" using Hill Cipher with the following
key.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;] bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code:BCA-122 Design and Analysis Of Algorithms Maximum Marks : 30

[k.M v vf/kdre vad % 18

Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions from 1 to 3. Answer should
be in 800 to 1000 words.

1. Show the results of inserting the keys: F, S, Q, K, C, L, H, T, V, W, M, R and N in order

to an empty B-Tree with minimum degree 2.
2. Solve the recurrence relation by iteration
T(n) = T(n-1) + n4
3. Find the minimum spanning tree using Prims algorithm for the following graph.
6 7

3
12
5

8 5

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions from 4 to 7. Answer

should be in 200 to 300 words.

4. Solve the following recurrence. :

T(1) = 1
T(n) = 4T (n/3) + n2 for x <= 2
5. Show the trace of heapsort algorithm for following input data :
30, 50, -100, 200, 50, 30, 60, 80, 200 in order.
6. Give an algorithm for Strassens’s multiplication. Explain how a divide and conquer
strategy is applicable to it? Also analyze your algorithm.
7. Find the optimal solution using greedy criterion for a knapsack having capacity 50 kg.
The list of items having values and weight as are shown in the table:

Item I1 I2 I3 I4 I5
Profit 10 20 24 9 8
weight 8 14 34 5 4
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;] bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA-123 Computer Graphics Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions from 1 to 3. Answer should
be in 800 to 1000 words.

1. List the hardware and software components essential for professional multimedia
development. Also, justify the need of each of the hardware components.
2. Describe the matrix formulation of 2D Translation, Scaling and Rotation.
3. Define following terms:
a) Refresh buffer/frame buffer.
b) Pixel?
c) Aspect ratio.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions from 4 to 7. Answer

should be in 200 to 300 words.

4. Explain the various digital movie tools.

5. Write short note on:
(a) MPEG
(b) MP3
6. What are the differences between the GIF and JPEG?
7. Explain Bresenham’s circle generating algorithm.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;] bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA-EA Web Technology Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions from 1 to 3. Answer should
be in 800 to 1000 words.

1. Explain the servlet API life cycle methods in brief.

2. Discuss the basic differences between Servlet and JSP.
3. Explain in detail the creation, instantiation and usage of java beans objects.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions from 4 to 7. Answer

should be in 200 to 300 words.

4. Explain the way in which a DNS server resolves addresses.

5. Give some advantages of using cascading style sheets.
6. Compare DOM and SAX in XML processing.
7. Write a CSS which adds background images and indentation?
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;] bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA-EB Client Server Technology Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions from 1 to 3. Answer should
be in 800 to 1000 words.

1. Draw the block diagram of client/server architecture and explain the advantages of
client/server computing with the help of suitable example.
2. Explain about network management and remote system management. How can security
be provided to network?
3. Explain Connectivity and Communication Interface Technology in client/server
application. How does transmission protocol work in client/server application?

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions from 4 to 7. Answer

should be in 200 to 300 words.

4. Why OLE is needed? Explain its importance.

5. Why Network Management is needed? Explain.
6. Differentiate between stateful and stateless servers.
7. Explain asynchronous Transfer mode (ATM) in detail.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]ç;kxjkt
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA 127 Python Programming Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1 ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. i)What is type casting? How are the variables types casted in Python?
ii) What are the major in-built data structures in Python? Explain with their features
and associated operations and methods.

2. i) What do you understand by data types? What are the major categories of data types
in Python? Give some examples of data types in each category.
ii) What is the utility of selection or conditional statements in a program? What are
different conditional statements in Python?

3. i) How do you create a module in Python? Explain with the help of suitable programs.
ii) Write a Python program to demonstrate NumPy, Pandas, and SciPy packages in a
single program.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. Explain the role of lambda function in Python. Illustrate with the help of a Python
program.
5. Create a list of number and perform major operations with built-in functions.
6. Demonstrate the creation of a dictionary in Python. Perform the allowed the
operations on the created dictionary.
7. Explain the usage of import and from statements. What is the purpose of __init__.py
file in module package directory?
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;]ç;kxjkt
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA 128 Soft Computing Maximum Marks : 30
[k.M v vf/kdre vad % 18
Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions. Answer should be in 800
to 1000 words. Attempt all three questions from this section.
Ikz”u la[;k 1 ls 3 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. List any four activation functions with their equations and graphs. Obtain the output of
neuron Y in following network using activation functions as:
i) Sigmoid ii)Rectified Linear Unit (ReLU)

2. Consider two fuzzy sets A = { 0.2/0 + 0.3/1 + 1/2 + 0.1/3 + 0.5/4 }

B = { 0.1/0 + 0.25/1 + 0.9/2 + 0.7/3 + 0.3/4 + 0.2/5 }
Find the following: (a) Algebraic sum (b) Bounded sum (c) Bounded Difference
3. Consider the fuzzy relation

Perform λ-cut operations for the values of λ = 0.9, 0+

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions. Answer should be in 200

to 300 words. Attempt all four questions from this section.
 Ikz”u la[;k 4 ls 7 rd लघु mRrjh; iz”u gS ftudk mRrj 200 ls 300 “kCnksa esa fy[kuk gSA

4. Explain the differences between supervised and unsupervised learning in artificial neural
network?
5. Explain the architecture of Adaptive Linear Neural Element Network (ADALINE) and
Many ADALINE (MADALINE) Network.
6. Draw the architecture of Back-Propagation network. List all the tuning parameters of
Back propagation Neural Network and their selection criteria.
7. What is Fuzzy Inference System (FIS)? Illustrate Mamdani FIS and Sugeno FIS with
examples?
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;] bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA-EC Computer Architecture Maximum Marks : 30

[k.M v vf/kdre vad % 18

Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions from 1 to 3. Answer should
be in 800 to 1000 words.
Ikz”u la[;k 1ls 10 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSAइस खंड सेकिसी भी तीन प्रश्नों
िा उत्तर दें।

1. What are the similarities and differences between multiprocessor and multicomputer
system? Explain the classification of multiprocessor system.
2. Explain the Pipline scheduleing in detail.
3. Identify the dependences in the following code snippet:
ADD R1, R2, R3
DIV R4, R1, R5
ADD R5, R7, R4
AND R5, R4, R2

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions from 4 to 7. Answer

should be in 200 to 300 words.

4. What is cache coherency and how is it eliminated?

5. What are different pipelining hazards and how are they eliminated?
6. Suppose a cache is 10 times faster than main memory & suppose the cache can be used
70% of the time. How much speedup do we gain by using cache?
7. Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss
and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that
80% of the processor’s read requests result in a cache hit. Find the average read access
time in nanoseconds.
 mRrj izns”k jktf’kZ V.Mu eqDr fo”ofo|ky;] bykgkckn
Bachelor of Computer Application dk;Zdze vf/kU;kl l= 2023&24
dkslZ dksM % dkslZ “kh’kZd%& ¼Course Title½ vf/kdre vad % 30
Course Code: BCA-ED Microprocessor and its Applications Maximum Marks : 30

[k.M v vf/kdre vad % 18

Section-A Maximum Marks: 18
uksV&(Instructions): Section A consists of long answer questions from 1 to 3. Answer should
be in 800 to 1000 words.
Ikz”u la[;k 1ls 9 rd nh?kZ mRrjh; iz”u gS ftudk mRrj 800 ls 1000 “kCnksa esa fy[kuk gSA

1. Explain the following.

(i) Data Bus. (ii) Address Bus. (iii) Control Bus.
2. Explain I/O addressing scheme used in 8086 with neat block diagram.
3. With block diagram describe the working of a DMA controller.

[k.M c vf/kdre vad % 12

Section –B Maximum Mark : 12

uksV&(Instructions): Section B consists of short answer questions from 4 to 7. Answer

should be in 200 to 300 words.

4. What do you mean by Conditional Flag?

5. What are the advantages of segmented memory scheme?
6. What are the flags in machine status word?
7. What is the difference between a microprocessor and a CPU?