University of Mumbai

Examination 2021 under cluster __ (Lead College: _________)

Examinations Commencing from 1st June 2021 to 10th June 2021
Program: S.E.(Computer Engineering)
Curriculum Scheme: Rev-2019 ‘C’ Scheme
Examination: S.E. Semester IV
Course Code: CSC401 Course Name: Engineering Mathematics IV
Time: 2 hour Max. Marks: 80
=====================================================================

Choose the correct option for following questions. All the Questions are
Q1. compulsory and carry equal marks

1. The region of rejection of the null hypothesis is known as

Option A: Critical region

Option B: Favourable region

Option C: Domain

Option D: Confidence region

2. Sample of two types of electric bulbs were tested for length of life and the
following data were obtained
Size Mean SD
Sample 1 8 1234 h 36 h
Sample 2 7 1036 h 40 h

The absolute value of test statistic in testing the significance of difference

between means is

Option A: t=10.77
Option B: t=9.39
Option C: t=8.5
Option D: t=6.95

3. If X is a poisson variate such that ( ) ( ) then ( ) is

Option A:

Option B:
Option C:

Option D:

1|Page
 4.
If [ ] , Then following is not the eigenvalue of

Option A: 6
Option B: 2
Option C: 4
Option D: 3

5.
For the matrix[ ] the eigenvector corresponding to the distinct

eigenvalue is
Option A:
[ ]

Option B:
[ ]

Option C:
[ ]

Option D:
[ ]

6. The necessary and sufficient condition for a square matrix to be diagonalizable is

that for each of it’s eigenvalue
Option A: algebraic multiplicity > geometric multiplicity
Option B: algebraic multiplicity = geometric multiplicity
Option C: algebraic multiplicity < geometric multiplicity
Option D: algebraic multiplicity geometric multiplicity

7. If the characteristic equation of a matrix A of order is

, then by the Cayley-Hamilton theorem is equal to
Option A:
( )
Option B: ( I)
Option C:
( )
Option D:
( )

8. Value of an integral ∫ ( ) along the path is

Option A:

Option B:

Option C:

Option D:

2|Page
 9. Integral ∫ along a circle | | is equal to

Option A: 1
Option B: -1
Option C: 3/2
Option D: 0

10. Analytic function gets expanded as a Laurent series if the region of convergence
is
Option A: rectangular
Option B: triangular
Option C: circular
Option D: annular

11. Residue of ( ) at a pole is

( ) ( )
Option A: 4/9
Option B: 2/9
Option C: 1/2
Option D: 0

12.
z-transform of an unit impulse function ( ) is
Option A: 1
Option B: 0
Option C: -1
Option D: k

13. * ( )+ is
Option A:

Option B:

Option C:

Option D:

14. The inverse z-transform of ( ) | | is

( )( )
Option A:
Option B:
Option C:
Option D:

15. If the basic solution of LPP is then the solution is

Option A: Feasible and non-Degenerate
Option B: Non-Feasible and Degenerate
Option C: Feasible and Degenerate
Option D: Non-Feasible and non-Degenerate

3|Page
 16. If the primal LPP has an unbounded solution then the dual has
Option A: Unbounded solution
Option B: Bounded solution
Option C: Feasible solution
Option D: Infeasible solution

17. Dual of the following LPP is

Maximize

Subject to

Option A: Minimize

Subject to

, y’ unrestricted
Option B: Minimize

Subject to

Option C: Minimize

Subject to

, y’ unrestricted
Option D: Minimize

Subject to

, y’ unrestricted

18. Consider the NLPP:

Maximize ( ), subject to the constraint ( ) .
Let , then the Kuhn-Tucker conditions are
Option A:

Option B:

Option C:

Option D:

19. In a non-linear programming problem,

Option A: All the constraints should be linear
Option B: All the constraints should be non-linear

4|Page
Option C: Either the objective function or atleast one of the constraints should be non-linear
Option D: The objective function and all constraints should be linear.

20. Pick the non-linear constraint

Option A:
Option B:
Option C:
Option D:

Subjective/descriptive questions
Q2 Solve any Four out of Six5 marks each
(20 Marks )
In an exam taken by 800 candidates, the average and standard deviation of
A marks obtained (normally distributed) are 40% and 10% respectively. What
should be the minimum score if 350 candidates are to be declared as passed

If A= [ ] , By using Cayley-Hamilton theorem find the matrix

B
represented by
Evaluate the following integral using Cauchy-Residue theorem.
C ∫ where c is the circle | |
( ) ( )

D Obtain inverse z-transform | |

Solve by the Simplex method
Maximize
E
Subject to

Using Lagrange’s multipliers solve the following NLPP

Optimise
F
Subject to

Q3 Solve any Four out of Six5 marks each

(20 Marks )
When the first proof of 392 pages of a book of 1200 pages were read, the
distribution of printing mistakes were found to be as follows.
No of 0 1 2 3 4
mistakes in
A page (X)
No. of pages 275 72 30 7 5
(f)

Fit a poisson distribution to the above data and test the goodness of fit.

5|Page
 Show that the matrix [ ] is not diagonalizable.
B

If ( ) obtain Taylor’s and Laurent’s series expansions of f(z)

( )( )
C in the domain | | & | | respectively.

If ( ) find * ( )+
D

Solve using dual simplex method

Minimize

E Subject to

Solve following NLPP using Kuhn-Tucker method

Maximize
F Subject to

6|Page
7|Page
8|Page
9|Page
 University of Mumbai
Examination June 2021
Examinations Commencing from 1st June 2021
Program: Computer Engineering
Curriculum Scheme: Rev2019
Examination: SE Semester IV
Course Code: CSC402 and Course Name: Analysis of Algorithm
Time: 2 hour Max. Marks: 80
=====================================================================

Choose the correct option for following questions. All the Questions are
Q1. compulsory and carry equal marks

1. Which of the following is not O(n2)?

Option A: (510) * n + 990
Option B: N1.45
Option C: n3 / ( )
Option D: (350) * n

2. If A is asymptotically less efficient than B, it means?

Option A: B will be a better choice for all inputs
Option B: B will be a better choice for all inputs except possibly small inputs
Option C: B will be a better choice for all inputs except possibly large inputs
Option D: B will be a better choice for small inputs

3. In Quicksort algorithm, there is a procedure for finding a pivot element that splits
the array into two sub-arrays, each of which contains at least Two-fifth of the
elements. Let T(n) be the number of comparisons required to sort n elements.
Then
Option A: T(n) <= 2T(n/5) + n
Option B: T(n) <= T(2n/5) + T(3n/5) + n
Option C: T(n) <= 2T(4n/5) + n
Option D: T(n) <= 2T(n/2) + n

4. What is the result of following recurrences T(n)=aT(n/b)+nc?

Option A: T(n) = O(nlogba)
Option B: T(n) = O(nclog n)
Option C: T(n) = O(f(n))
Option D: T(n) = O(n2)

5. The class of decision problems that can be solved by non-deterministic

polynomial algorithms are called as.
Option A: NP
Option B: P
Option C: Hard
Option D: Complete

6. If you are sorting in ascending order with insertion sort, average case running
time it will take is?
Option A: O(N)

1|Page
Option B: O(N log N)
Option C: O(log N)
Option D: O(N2)

7. Worst case time complexity of merge sort is

Option A: O(n log n)
Option B: O(n2)
Option C: O(n2 log n)
Option D: O(n log n2)

8. Apply Quick sort on a given sequence 6 10 13 5 8 3 2 11. What is the sequence

after first phase, pivot is first element?
Option A: 5 3 2 6 10 8 13 11
Option B: 5 2 3 6 8 13 10 11
Option C: 6 5 13 10 8 3 2 11
Option D: 6 5 3 2 8 13 10 11

9. Consider the graph M with 3 vertices. Its adjacency matrix is shown below.
Which of the following is true?

Option A: Graph M has no minimum spanning tree

Option B: Graph M has a unique minimum spanning trees of cost 4
Option C: Graph M has 3 distinct minimum spanning trees, each of cost 4
Option D: Graph M has 3 spanning trees of different costs

10. Given items as {value, weight} pairs {{60,10}, {20,10}, {40,5}}. The capacity of
knapsack=20. Find the maximum value output assuming items to be divisible.
Option A: 110
Option B: 80
Option C: 100
Option D: 40

11. A graph with negative weight cycle is having ______no. of shortest paths
Option A: One
Option B: Two
Option C: Zero
Option D: Infinite

12. Floyd Warshall Algorithm falls into _______

Option A: Greedy technique
Option B: Dynamic Programming
Option C: Linear Programming
Option D: Backtracking

13. In assembly line scheduling problem, _____ lookup tables are required.
Option A: 0
Option B: 1
Option C: 2
Option D: 3
2|Page
 14. A travelling salesman problem with 55 cities has____________no. of feasible
tours.

Option A: 37 arcs

Option B: 54 arcs

Option C: 55 arcs

Option D: 990 arcs

15. ________is not a branch and bound strategy to generate branches

Option A: LIFO branch and bound
Option B: FIFO branch and bound
Option C: Lowest cost branch and bound
Option D: Highest cost branch and bound

16. Of the following given options, which one of the following is a correct option that
provides an optimal solution for 4-queens problem?
Option A: (3,1,4,2)
Option B: (2,3,1,4)
Option C: (4,3,2,1)
Option D: (4,2,3,1)

17. Chromatic number of a graph is ______no of colors required to color the vertices
in graph.
Option A: Maximum
Option B: Same
Option C: Minimum
Option D: More than Number of vertices

18. In Rabin and Karp Algorithm, preprocessing can be done in

Option A: θ(m2)
Option B: θ (mlogn)
Option C: θ (m)
Option D: O(n)

19. What happens when the modulo value(q) is taken large?

Option A: Complexity increases
Option B: Spurious hits occur frequently
Option C: Cost of extra checking is low
Option D: Matching time increases

20. Given a pattern of length- 5 window, find the spurious hit in the given text string.

Pattern: 7 3 9 9 2
Modulus: 13
Index: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Text: 2 3 5 9 0 2 3 1 4 1 5 2 6 7 3 9 9 2 1 3 9

3|Page
Option A: 6-10
Option B: 12-16
Option C: 3-7
Option D: 13-17

Solve any Four out of Six 5 marks each

Q2
A Explain Master theorem with example
B Define P, NP, NP-Hard and NP-Complete Complexity Classes.
C Discuss Complexity of Quicksort Algorithm in all cases.
D Rewrite Binary Search Algorithm and Explain its complexity
E Find LCS for strings X= “ABSDG” and Y= “GBSTR”
F Write short note on Rabin Karp Algorithm

Q3. Solve any Two Questions out of Three 10 marks each

Apply Dijkstra algorithm on following graph. Show all intermediate steps.

B Explain 15 Puzzle problem with Branch and Bound method

Find a minimum cost path from A to L in the following multistage graph

4|Page
 University of Mumbai
Examination June 2021
Examinations Commencing from 1st June 2021
Program: SE SEM IV R2019 C Scheme May 2021
Curriculum Scheme: Rev2019
Examination: SE Semester IV
Course Code: CSC403 and Course Name: Database Management System
Time: 2 hour Max. Marks: 80
=====================================================================
Choose the correct option for following questions. All the Questions are
Q1. compulsory and carry equal marks

1. Which of the following is true about Data Independence? It is the ability:

Option A: To modify schema definition in one level without affecting schema definition in
the next lower level.
Option B: To modify schema definition in one level without affecting schema definition in
the next higher level.
Option C: To modify data in one level without affecting the data in the next lower level.
Option D: To modify data in one level without affecting the data in the next higher level.

2. Data redundancy leads to higher storage and access cost. It may lead to
Option A: Data isolation
Option B: Data inconsistency
Option C: Integrity problem
Option D: Atomicity

3. The an attribute (say X) of entity set is calculated from other attribute value
(say Y). The attribute X is called
Option A: Single valued
Option B: Multi valued
Option C: Composite
Option D: Derived

4. A weak entity type always has a total participation constraint w.r.t. its identifying
relationship, because

1 | Page
Option A: Weak entity have a partial key
Option B: Weak entity cannot be identified with an owner entity.
Option C: Weak entity cannot be identified without an owner entity.
Option D: Weak entity cannot identified without an identifying relationship

5. In an Entity-Relationship (ER) model, suppose R is a one-to-many relationship

from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in R
and that the cardinality of E2 is greater than the cardinality of E1. Which one of
the following is true about R?
Option A: Every entity in E1 is associated with exactly one entity in E2.
Option B: Some entities in E1 are associated with more than one entity in E2.
Option C: Every entity in E2 is associated with exactly one entity in E1.
Option D: Every entity in E2 is associated with at most one entity in E1.

6. The type of operation which extends the Projection operation by allowing

functions of attributes to be included in the projection list.
Option A: Join
Option B: Generalized Projection
Option C: Projection
Option D: Aggregate functions

7. What is union compatibility ?

Option A: Two or more table share the same number of columns
Option B: Two or more tables share the same number of columns and same domain
Option C: Two or more tables have the same degree
Option D: Two or more tables share the same domains

8. r∩s=
Option A: r – (r – s)
Option B: s – (r – s)
Option C: (r u s) – (r – s)
Option D: (r u s) /(s u r)

2 | Page
 9. Let E1 and E2 be two entities in an E-R diagram with one multi-valued attribute
in E1,R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many,R1 and R2 do not have any attributes of their
own,What is the minimum number of tables required to represent this situation in
the relational model.
Option A: 2
Option B: 4
Option C: 3
Option D: 5

10. Write a query to set default value for salary to 25000 for table employee
Option A: UPDATE employee MODIFY salary DEFAULT 25000
Option B: UPDATE employee SET salary To DEFAULT 25000
Option C: ALTER TABLE employee SET salary To DEFAULT 25000
Option D: ALTER TABLE employee MODIFY salary DEFAULT 25000

11. Consider the employee table:employee ( employee id, name, dept name,
salary )Create a new employee `E-101', named `Ashwin singh', with 50,000 salary
for department `developer'. Identify the appropriate SQL.
Option A: INSERT INTO TABLE employee VALUES (`E-101',`Ashwin Singh',`Wireless',
100000)
Option B: INSERT INTO employee (`E-101',`Ashwin Singh',`DEVELOPER', 50000)
Option C: INSERT INTO employee VALUES(`E-101',`Ashwin Singh',`DEVELOPER',
50000)
Option D: INSERT INTO employee table(employee id, name, dept name, salary) VALUES
(`E-101',`Ashwin Singh',`DEVELOPER', 50000)

12. Consider the following instance:

Name Price
IPHONE 5000
PHONE 1500
LAPTOP 1000
IPAD 5500

3 | Page
 The following Query is executed
SELECT Price from Product order by Name DESC;
Find out correct order of tuple numbers in the output ,if the tuple numbers in the
above table are 1,2,3,4
Option A: 2,3,4,1
Option B: 3,4,2,1
Option C: 4,1,2,3
Option D: 2,3,1,4

13. Which of the following statement is CORRECT ?

Option A: Every relation in 3NF is also in BCNF
Option B: A relation R is in 3NF if every non-prime attribute of R is fully functionally
dependent on every key of R
Option C: Every relation in BCNF is also in 3NF
Option D: No relation can be in both BCNF and 3NF

14. Let R= (A,B,C,D,E,F) be a relation with the following dependencies. C->F, E-

>A, EC->D, A->B. Which of the following is a key for R
Option A: CD
Option B: EC
Option C: AE
Option D: AC

15. Consider relational schema

Member(phone,name,address,room,floor,stay)
which satisfies following FDs:
phone,name->address
Phone->Room
name->floor,stay. The given relation satisfies which highest normal form?
Option A: 1NF
Option B: 2NF
Option C: 3NF

4 | Page
Option D: BCNF

16. What is true about timestamp based ordering protocol

Option A: Ensure both conflict serializability and freedom from deadlock
Option B: Ensure only conflict serializability
Option C: Ensure only freedom from deadlock
Option D: Ensure only view serializability

17. Identify correct rules in growing phase (first phase) in two-phase locking
protocol.
Option A: Transaction can only acquire shared lock(lock-s) and exclusive (lock-X)
Option B: transaction can only acquire shared lock(lock-s) ,exclusive (lock-X) and covert
lock-s to lock-X
Option C: transaction can release shared lock(lock-s) ,release exclusive (lock-X) and covert
lock-s to lock-X
Option D: transaction can acquire only shared lock(lock-s) and release exclusive (lock-X)

18. Suppose in a database, there are three transactions T1, T2 and T3 with timestamp
10, 20 and 30 respectively. T2 is holding a data item which T1 and T3 are
requesting to acquire. Which of the following statement is correct in respect of
Wait-die Deadlock Prevention scheme?
Option A: Transaction T1 will wait for T2 to release the data item.
Option B: Transaction T1 will be aborted.
Option C: Transaction T3 will wait for T2 to release the data item.
Option D: Transaction T2 will wait for T1 to release the data item.

19. Choose correct statement regarding immediate database modification method of

log based recovery method
Option A: Only Redo operation is performed
Option B: Redo and undo operations are performed
Option C: Only undo operation is performed
Option D: No redo and undo operations are performed

5 | Page
 20. When transactions execute properly without interference from concurrently
executing transactions then this property is referred to as.
Option A: Atomicity
Option B: Concurrency
Option C: Consistency
Option D: Isolation

Q2 Solve any Two Questions out of Three 10 marks each

A What are different database users? Give responsibilities of DBA

Produce ER Diagram from the following relational database Schema.

Book( book_id, title,author, cost)

Store(store_no, city, state, inventory_val)
Stock(store_no, book_id,quantity)

Consider above relational schema and formulate SQL queries for the
following:
C
(i)Modify the cost of DBMS books by 10%
(ii)Find the author of the books which are available in Mumbai store
(iii)Find the title of the most expensive book
(iv)Find the total quantity of books in each store
(v) Add a new record in Book(Assume values as per requirement)

Q3 Solve any Two Questions out of Three 10 marks each

Consider a dependency diagram of relation R and normalize it up to third
A
normal form.

6 | Page
B Explain conflict and view serializability with suitable examples .
C Explain deadlock handling in DBMS with suitable examples.

7 | Page
 University of Mumbai
Examination June 2021
Examinations Commencing from 1st June 2021
Program: Computer Engineering
Curriculum Scheme: Rev 2019 “C” Scheme
Examination: SE Semester IV
Course Code: CSC404 and Course Name: Operating System
Time: 2 hour Max. Marks: 80
=====================================================================

Choose the correct option for following questions. All the Questions are
Q1. compulsory and carry equal marks

1. Core of operating system is ________

Option A: Shell
Option B: Script
Option C: Commands
Option D: Kernel

2. Multiprogramming systems__________________

Option A: Are easier to develop than single programming systems

Option B: Execute each job faster
Option C: Execute more jobs in the same time period
Option D: Are used only one large mainframe computers

3. Once operating system is loaded, execution of applications is in _______ mode

Option A: Kernel
Option B: User
Option C: Read-Only
Option D: Standalone

4. We want to keep the CPU as busy as possible, This criteria refers to as

Option A: Burst Time

1 | Page
Option B: CPU utilization
Option C: Response time
Option D: Throughput

5. A Process Control Block (PCB) does not contain which of the following?
Option A: Code
Option B: Data
Option C: Stack
Option D: Bootstrap program

6. Which of the following state transitions is not possible?

Option A: Blocked to running
Option B: Ready to running
Option C: Running to blocked
Option D: Blocked to ready

7. SRTN Scheduling is type of

Option A: Preemptive scheduling
Option B: Non preemptive scheduling
Option C: Multi level scheduling
Option D: Non blocking scheduling

8.
_______is a synchronization tool and _______operation decrements its value.

Option A:
thread, wait

Option B:
semaphore, signal

Option C:
semaphore, wait

2 | Page
Option D:
socket, signal

9.
A scenario in which thread A performs an action that causes thread B to perform
an action that in turn causes thread A to perform its original action is called____

Option A: Spinlock
Option B: Livelock
Option C: Belady’s anomaly
Option D: Deadlock

10.
Which algorithm requires that the system must have some additional a priori
information available about resources?
Option A: Deadlock prevention
Option B: Deadlock recovery
Option C: Deadlock avoidance
Option D: Deadlock allocation

11.
Which one is Reusable resource in the system?

Option A: Interrupts
Option B: Main memory
Option C: Signals
Option D: Information in I/O buffers

12. What is the name of the memory allocation strategy in which the OS allocates the
smallest free partition that is big enough to hold the process?
Option A: Worst Fit
Option B: Best Fit
Option C: First Fit
Option D: Next Fit

3 | Page
 13. If the size of the logical address space is 2^m, and a page size is 2^n addressing
units then how many high order bits of a logical address designate the page
number?
Option A: m-n
Option B: m
Option C: n
Option D: m+n

14. What is the name of the system where processes initially reside in secondary
memory and when it needs to execute a process OS swaps it into main memory?

Option A: Internal fragmentation

Option B: Context Switch
Option C: Demand Paging
Option D: External Fragmentation

15. Instruction or data near to the current memory location that is being fetched , may
be needed soon in near future. this is the principal of _________
Option A: Spatial Locality
Option B: Temporal Locality
Option C: Buffering
Option D: Branching

16. A low-level integer used to identify an opened file at the kernel level, in Linux
called as ______________

Option A: Spin lock

Option B: file pointer
Option C: file descriptor
Option D: Signal

17. a named collection of related information that is recorded on secondary storage is

called as _________

4 | Page
Option A: Process
Option B: Memory
Option C: Interrupt
Option D: File

18.
Which one is not the correct purpose of the device controller?

Option A: Detect/Correct errors

Option B: Accept commands from software
Option C: Control arm motion
Option D: Buffering

19. If the drive controller is busy and a process needs I/O to or from a disk, then ____
Option A: the request will be ignored
Option B: the request will be placed in the queue of pending requests for that drive
Option C: the request will be processed immediately
Option D: the request will be transferred to different controller

20.
In which of the following algorithms, the disk head moves from one end to the
other , servicing requests along the way, when the head reaches the other end, it
immediately returns to the beginning of the disk without servicing any requests on
the return trip?

Option A: LOOK
Option B: SCAN
Option C: C-LOOK
Option D: C-SCAN

subjective/ descriptive questions

Q2 Solve any Four out of Six 5 marks each

5 | Page
A Describe microkernel operating system structure
B What is thread? Describe any four advantages of multithreading model.
C Why is semaphore known as a synchronisation tool?Give an example.
Describe how logical address is converted into physical address when the
D
program and its associated data is divided into segments
E Summarize various File Attributes
F With the help of a diagram explain I/O management.

Q3. Solve any Two Questions out of Three 10 marks each

Compare short term, medium term and long term scheduler along with
A
diagram
Consider a disk with 51(0 to 50) cylinders. While the seek to cylinder 11 is
in progress, the request comes for the following cylinders, in the order 1,
B 36, 16, 34, 9, 12 and 40. The arm moves in an increasing number of
cylinders. What is the total distance the arm moves to complete pending
requests using FCFS and LOOK algorithms?
describe in detail requirements that intends to achieve memory
C
Management

6 | Page
 University of Mumbai
Examination June 2021
Examinations Commencing from 1st June 2021
Program: Computer Engineering
Curriculum Scheme: Rev2019
Examination: SE Semester IV
Course Code: CSC405 and Course Name: Microprocessor

Time: 2 hour Max. Marks: 80

=====================================================================

Choose the correct option for following questions. All the Questions are
Q1. compulsory and carry equal marks

1. In protected mode of 80386, the VM flag is set by using

Option A: IRET instruction or task switch operation

Option B: IRET instruction

Option C: Task switch operation

Option D: NOP

2. The instructions that are used for reading an input port and writing an output port
respectively are
Option A: MOV, XCHG
Option B: MOV, IN
Option C: IN, MOV
Option D: IN, OUT

3. While CPU is executing a program, an interrupt exists then it

Option A: follows the next instruction in the program
Option B: jumps to instruction in other registers
Option C: breaks the normal sequence of execution of instructions
Option D: stops executing the program

4. 8086 can access up to?

Option A: 512KB

1 | Page
Option B: 1MB
Option C: 2MB
Option D: 256KB

5. Because of Pentium’s superscalar architecture, the number of instructions that are

executed per clock cycle is
Option A: 1
Option B: 2
Option C: 3
Option D: 4

6. The paging unit is enabled only in

Option A: virtual mode
Option B: addressing mode
Option C: protected mode
Option D: Real Mode

7. In 8257 register format, the selected channel is disabled after the terminal count
condition is reached when
Option A: Auto load is set
Option B: Auto load is reset
Option C: TC STOP bit is reset
Option D: TC STOP bit is set

8. All the functions of the ports of 8255 are achieved by programming the bits of an
internal register called
Option A: data bus control
Option B: read logic control
Option C: control word register
Option D: Status Register

9. When non-specific EOI command is issued to 8259A it will automatically

2 | Page
Option A: set the ISR
Option B: reset the ISR
Option C: set the INTR
Option D: reset the INTR

10. For a single task in protected mode, the 80386 can address the virtual memory of
Option A: 32 GB
Option B: 64 MB
Option C: 32 TB
Option D: 64 TB

11. The recurrence of the numerical values or constants in a program code is reduced
by
Option A: EQU
Option B: ASSUME
Option C: LOCAL
Option D: LABEL

12. The hyperthreading technology automatically involves the

Option A: decrease of die area

Option B: increase of die area

Option C: decrease of die area to half

Option D: increase of die area to half

13. The 80386 enables itself to organize the available physical memory into pages, which
is known as

Option A: segmentation

Option B: Paging

Option C: memory division

Option D: Virtual memory

3 | Page
 14. The number of debug registers that are available in 80386, for hardware debugging
and control is

Option A: 2
Option B: 4
Option C: 8
Option D: 16

15. The instruction, JMP 5000H:2000H;

is an example of

Option A: intrasegment direct mode

Option B: intrasegment indirect mode

Option C: intersegment direct mode

Option D: intersegment indirect mode

16. The salient feature of Pentium is

Option A: superscalar architecture

Option B: superpipelined architecture

Option C: superscalar and superpipelined architecture

Option D: multiple instruction issue

17. The speed of integer arithmetic of Pentium is increased to a large extent by

Option A: on-chip floating point unit

Option B: superscalar architecture

Option C: 4-stage pipelines

Option D: instruction cache

18. For 8086 microprocessor, the stack segment may have a memory block of a
maximum of

Option A: 32K bytes

Option B: 64K bytes

Option C: 16K bytes

4 | Page
Option D: 128K bytes

19. Which of the following is not a module of Pentium 4 architecture?

Option A: front end module

Option B: execution module

Option C: control module

Option D: Memory subsystem module

20. The type of the interrupt may be passed to the interrupt structure of CPU from

Option A: interrupt service routine

Option B: Stack

Option C: interrupt controller

Option D: Segments

Q2 Solve any Four out of Six 5 marks each

Explain different types of Interrupts? Explain Interrupt Vector table for

A
8086
Draw and explain the internal block diagram of 8257? How DMA
B
operations are performed?
Explain what is Branch Prediction Logic in Pentium? Explain working of
C
Branch Prediction with suitable diagram?
D Compare the 8086, 80386, Pentium Processor.
E Draw and explain the internal architecture of 80386 microprocessor?
F Explain the operating modes of 80386?

Q3. Solve any Two Questions out of Three 10 marks each

Explain the internal architecture of 8086 microprocessor? Differentiate the

A
functioning of Minimum mode and Maximum mode?
B Write an assembly language program to find the largest number from an

5 | Page
 unordered array of 8-bit numbers?
Interface 32K word of memory to 8086 microprocessor system. Available
C memory chips are 16K*8 RAM. Use suitable decoder for generating chip
logic.

6 | Page