1) A machine has a physical memory of 64 Mbyte and a virtual address space of 32 - bit. The page size is 4kbyte, What is the approximate size of the page table?
a. 24 Mbyte
b. 16 Mbyte
c. 2 Mbyte
d. 8 Mbyte
|
Answer
Explanation
|
ANSWER: 2 Mbyte
Explanation:
No explanation is available for this question!
|
|
2) We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process :
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
If Optimal Page Replacement policy is used, _______ page faults will occur for the above reference string.
a. 7
b. 8
c. 9
d. 6
|
Answer
Explanation
|
ANSWER: 7
Explanation:
No explanation is available for this question!
|
|
3) We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process :
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
How many page faults will occur for the above reference string with the Least Recently Used(LRU) Page Replacement Policy in comparison to an Optimal Page Replacement policy?
a. 3
b. 2
c. 1
d. 0
|
Answer
Explanation
|
ANSWER: 2
Explanation:
No explanation is available for this question!
|
|
4) We have three processes P0, P1 and P2 whose arrival time and burst time are given below.
If the preemptive Shortest Job First (SJF) scheduling algorithm is carried out only at arrival or completion of processes then the average waiting time for the three processes is ________.
a. 7.33ms
b. 6.33ms
c. 5.0ms
d. 4.33ms
|
Answer
Explanation
|
ANSWER: 5.0ms
Explanation:
No explanation is available for this question!
|
|
5) Which of the following statements is not true for the deadlock prevention and deadlock avoidance schemes?
a. Deadlock avoidance is less restrictive than deadlock prevention.
b. In deadlock prevention, the request for resources is always granted, if the resulting state is safe.
c. It is the priority to have the knowledge of resource requirements for deadlock avoidance.
d. In deadlock avoidance, the request for resources is always granted, if the resulting state is safe.
|
Answer
Explanation
|
ANSWER: In deadlock avoidance, the request for resources is always granted, if the resulting state is safe.
Explanation:
No explanation is available for this question!
|
|
6) The Remote Procedure call is not Inter - Process Communication.
a. True
b. False
|
Answer
Explanation
|
ANSWER: False
Explanation:
No explanation is available for this question!
|
|
7) What is TCP / IP Protocol?
a. It receives data from application as a single stream.
b. It uses a three way handshake to establish a connection.
c. It is a Connection Oriented Program
d. All the Above
|
Answer
Explanation
|
ANSWER: All the Above
Explanation:
No explanation is available for this question!
|
|
8) Which command gets set as a trunk port on a 2960 Switch?
a. switchport mode trunk
b. trunk on
c. trunk all
d. switchport trunk on
|
Answer
Explanation
|
ANSWER: switchport mode trunk
Explanation:
No explanation is available for this question!
|
|
9) What does the Cryptographic hash function return when it takes an arbitrary block of data?
a. Variable size bit string
b. Fixed size bit string
c. All of the Above
d. None of the Above
|
Answer
Explanation
|
ANSWER: Fixed size bit string
Explanation:
No explanation is available for this question!
|
|
10) Data Encryption Standard (DES) is a __________.
a. Stream Cipher
b. Bit Cipher
c. Block Cipher
d. Substitution Cipher
|
Answer
Explanation
|
ANSWER: Block Cipher
Explanation:
No explanation is available for this question!
|
|
11) Which HTML is a container for meta data?
a. <body>
b. <html>
c. <head>
d. <p>
|
Answer
Explanation
|
ANSWER: <head>
Explanation:
No explanation is available for this question!
|
|
12) Entity names are case sensitive.
a. True
b. False
|
Answer
Explanation
|
ANSWER: True
Explanation:
No explanation is available for this question!
|
|
13) Which of the following statements is true about a URL?
a. It is used to address a document on the web
b. It is known as Uniform Resource Locator
c. The web pages from the web servers are requested by the URL
d. All of the above
|
Answer
Explanation
|
ANSWER: All of the above
Explanation:
No explanation is available for this question!
|
|
14) Abbreviate XHTML.
a. Extensible HyperText Markup Language
b. Extensive High Text Markup Language
c. Extensive HyperText Markup Language
d. Extensible High Text Markup Language
|
Answer
Explanation
|
ANSWER: Extensible HyperText Markup Language
Explanation:
No explanation is available for this question!
|
|
15) If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m ' where n <= m . What is the expected number of collisions involving a particular key ' x ' ?
a. less than 1.
b. less than n.
c. less than m.
d. less than n / 2.
|
Answer
Explanation
|
ANSWER: less than 1.
Explanation:
No explanation is available for this question!
|
|
16) What time is required for deleting a node ' x ' from a Doubly Linked List whose having ' n ' nodes?
a. O (n)
b. O (log n)
c. O (1)
d. O (n log n)
|
Answer
Explanation
|
ANSWER: O (1)
Explanation:
No explanation is available for this question!
|
|
17) If a binary tree of depth is “ d ”, then when can we say that it is an almost complete binary tree?
a. Each leaf in the tree is either at level “ d ” or at level “ d –1 ” .
b. For any node “ n ” in the tree with a right descendent at level “ d ” all the left descendants of “ n ” that are leaves, are also at level “ d ”.
c. Both A and B.
d. None of the above.
|
Answer
Explanation
|
ANSWER: Both A and B.
Explanation:
No explanation is available for this question!
|
|
18) What is the postfix form of the following prefix expression?
A / B * C $ DE
a. ABCDE $ * / -
b. A - BCDE $ * / -
c. ABC $ ED * / -
d. A - BCDE $ * /
|
Answer
Explanation
|
ANSWER: ABCDE $ * / -
Explanation:
No explanation is available for this question!
|
|
19) Which of the following is the depth of a Complete Binary Tree?
a. Dn = n log2n
b. Dn = n log2n + 1
c. Dn = log2n
d. Dn = log2n + 1
|
Answer
Explanation
|
ANSWER: Dn = log2n + 1
Explanation:
No explanation is available for this question!
|
|
20) Which of the following is the Worst-case of Quick Sort?
a. O (n log n)
b. O (N2)
c. O (log n)
d. O (n2 / 4)
|
Answer
Explanation
|
ANSWER: O (N2)
Explanation:
No explanation is available for this question!
|
|
21) Which of the following sorting methods would be most suitable for sorting a list?
a. Bubble Sort
b. Insertion Sort
c. Selection Sort
d. Quick Sort
|
Answer
Explanation
|
ANSWER: Bubble Sort
Explanation:
No explanation is available for this question!
|
|
22) In graphs, A hyperedge is an edge that is allowed to take on any number of _____________.
a. vertices
b. edges
c. both a and b
d. labels
|
Answer
Explanation
|
ANSWER: vertices
Explanation:
No explanation is available for this question!
|
|
23) A Vertex comprising only incoming edges without any outgoing edges, specifically known as _________.
a. Source
b. Sink
c. Isolated
d. None of the above.
|
Answer
Explanation
|
ANSWER: Sink
Explanation:
No explanation is available for this question!
|
|
24) Which command helps to display schema of a table?
a. DESCRIBE
b. DISPLAY
c. DESC
d. SHOW
|
Answer
Explanation
|
ANSWER: DESCRIBE
Explanation:
No explanation is available for this question!
|
|
25) What is degree 0 isolation?
a. Transaction does not read dirty data from other transactions.
b. Transaction does not commit any writes until it completes all its writes.
c. Transactions do not dirty data read by a transaction before the transaction commits.
d. A transaction does not overwrite data updated by another user or process.
|
Answer
Explanation
|
ANSWER: A transaction does not overwrite data updated by another user or process.
Explanation:
No explanation is available for this question!
|
|
26) Which type of lock ensures that multiple updates cannot be made to the same resource at the same time?
a. Schema
b. Shared
c. Exclusive
d. Intent
|
Answer
Explanation
|
ANSWER: Exclusive
Explanation:
No explanation is available for this question!
|
|
27) Attribute B has a functional dependency on attribute A if, for each value of attribute A, there is exactly one value of attribute B. (Database)
a. True
b. False
|
Answer
Explanation
|
ANSWER: True
Explanation:
No explanation is available for this question!
|
|
28) Under which category do the commands CREATE and ALTER belong to?
a. DML
b. DDL
c. UML
d. None of the above.
|
Answer
Explanation
|
ANSWER: DDL
Explanation:
No explanation is available for this question!
|
|
29) What is a degree of relation?
a. It is the number of attributes of its relation schema.
b. The number of relationships with other tables
c. Number of association among two or more entities
d. Number of foreign key dependencies
|
Answer
Explanation
|
ANSWER: It is the number of attributes of its relation schema.
Explanation:
No explanation is available for this question!
|
|
30) Which of the following is / are known as a minimal superkey?
a. Primary key
b. Foreign key
c. Unique key
d. Candidate key
|
Answer
Explanation
|
ANSWER: Candidate key
Explanation:
No explanation is available for this question!
|
|
