DB/OS/DS/Networking/HTML - 1

1)   Consider an SQL query

SELECT A.Id FROM A WHERE A.Age>
All (SELECT B.Age FROM B WHERE B.name = ‘Anay’)

The result of this query contains


a. 1 tuple
b. 2 tuples
c. 3 tuples
d. 4 tuples
Answer  Explanation 

ANSWER: 3 tuples

Explanation:
No explanation is available for this question!


2)   Which one of the following statements is / are true about SQL?

a. SQL permits attribute names to be repeated in the same relation
b. If there are no indexes on the relations then an SQL query will not work
c. Duplicates are automatically eliminated by an SQL query
d. None of the above
Answer  Explanation 

ANSWER: None of the above

Explanation:
No explanation is available for this question!


3)   Which normal relational database design the form that is considered adequate?

a. 3NF
b. 5NF
c. 2NF
d. 4NF
Answer  Explanation 

ANSWER: 3NF

Explanation:
No explanation is available for this question!


4)   The functional dependencies for the relational schema student performance (name, courseNo, rollno, grade) is given below :

name, courseNo -> grade
rollno, courseNo -> grade
name -> rollno
rollno-> name

What is the highest normal form of this relational schema?


a. 3NF
b. 4NF
c. BCNF
d. 2NF
Answer  Explanation 

ANSWER: 3NF

Explanation:
No explanation is available for this question!


5)   What is the maximum possible size of the file in the index allocation scheme of blocks to a file depend on? (Database)

a. The size of the blocks and the size of the address of the blocks
b. The number of blocks used for the index, the size of the blocks and the size of the address of the blocks
c. The number of blocks used for the index and the size of the blocks
d. None of the above
Answer  Explanation 

ANSWER: The number of blocks used for the index and the size of the blocks

Explanation:
No explanation is available for this question!


6)   What is the Complexity of Binary Search Algorithm?

a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
Answer  Explanation 

ANSWER: O(log n)

Explanation:
No explanation is available for this question!


7)   Which principle works on Queue?

a. FILO
b. FIFO
c. LILO
d. Both a and b above
Answer  Explanation 

ANSWER: FIFO

Explanation:
No explanation is available for this question!


8)   An empty list is the one which has no _________ .

a. nodes
b. data
c. both a and b
d. address
Answer  Explanation 

ANSWER: data

Explanation:
No explanation is available for this question!


9)   What is the pecularity of Red - black Trees?

a. In red-black trees, the root do not contain data.
b. In red-black trees, the leaf nodes are not relevant and do not contain data.
c. In red-black trees, the leaf nodes are relevant but do not contain data.
d. Both a and c above
Answer  Explanation 

ANSWER: In red-black trees, the leaf nodes are not relevant and do not contain data.

Explanation:
No explanation is available for this question!


10)   Can Stack be described as a Pointer?

a. Yes
b. No


Answer  Explanation 

ANSWER: Yes

Explanation:
No explanation is available for this question!


11)   Can Linked List be implemented using Arrays?

a. Yes
b. No


Answer  Explanation 

ANSWER: Yes

Explanation:
No explanation is available for this question!


12)   A tree cannot contain cycles.

a. True
b. False


Answer  Explanation 

ANSWER: True

Explanation:
No explanation is available for this question!


13)   ________ is a tree where each parent node have only one associated child node.

a. Balanced Binary Tree
b. Rooted Complete Binary Tree
c. Complete Binary Tree
d. Degenerate Tree
Answer  Explanation 

ANSWER: Degenerate Tree

Explanation:
No explanation is available for this question!


14)   Which among the following belongs to the category of an In-Order Traversal?

a. Root -> Left Sub Tree -> Right Sub Tree
b. Root -> Right Sub Tree -> Left Sub Tree
c. Right Sub Tree -> Left Sub Tree ->Root
d. Left Sub Tree -> Root -> Right Sub Tree
Answer  Explanation 

ANSWER: Left Sub Tree -> Root -> Right Sub Tree

Explanation:
No explanation is available for this question!


15)   Abbreviate HTML.

a. High Text Marking Language
b. Highlight Text Making Language
c. Hyper Text Markup Language
d. None of the above
Answer  Explanation 

ANSWER: Hyper Text Markup Language

Explanation:
No explanation is available for this question!


16)   HTML cannot have attributes.

a. True
b. False


Answer  Explanation 

ANSWER: False

Explanation:
No explanation is available for this question!


17)   Which of the following is a declaration for an HTML document?

a. <!DOCTYPE html>
b. <html>.....</html>
c. <body>.....</body>
d. <p>.....</p>
Answer  Explanation 

ANSWER: <!DOCTYPE html>

Explanation:
No explanation is available for this question!


18)   What can be used to change the default style of an HTML element?

a. Default attribute
b. Style attribute
c. Text align
d. Both A & B
Answer  Explanation 

ANSWER: Style attribute

Explanation:
No explanation is available for this question!


19)   Which element of the text type shows that it is important?

a. <strong>
b. <em>
c. <bold>
d. Both A & B
Answer  Explanation 

ANSWER: Both A & B

Explanation:
No explanation is available for this question!


20)   Which of the following is / are the Network Topologies?

a. Centralized Topology
b. Decentralized Topology
c. Distributed Topology
d. All of the above
Answer  Explanation 

ANSWER: All of the above

Explanation:
No explanation is available for this question!


21)   What should we call Point-to-Point links that support data transmissions in both directions?

a. Half Duplex
b. Full Duplex
c. Both A and B
d. None of the Above
Answer  Explanation 

ANSWER: Full Duplex

Explanation:
No explanation is available for this question!


22)   How many layers are there in OSI Model?

a. 3
b. 6
c. 7
d. 4
Answer  Explanation 

ANSWER: 7

Explanation:
No explanation is available for this question!


23)   Redundancy and Error - Correcting codes are useful when errors are _________.

a. Randomly Distributed
b. Clustered
c. Interleaving
d. Collected
Answer  Explanation 

ANSWER: Randomly Distributed

Explanation:
No explanation is available for this question!


24)   Which of the following is / are the transmission media that have the highest transmission speed in a Network?

a. Twisted Pair Cable
b. Coaxial Cable
c. Unshielded Twisted Pair Cable
d. Fiber Optic Cable
Answer  Explanation 

ANSWER: Fiber Optic Cable

Explanation:
No explanation is available for this question!


25)   What works on the principle of locality?

a. Cache memory
b. Interrupts
c. Polling
d. DMA
Answer  Explanation 

ANSWER: Cache memory

Explanation:
No explanation is available for this question!


26)   Consider a computer system with 6 tape drives and 'n' processes completing for them. What is the maximum value of 'n' for the system to be deadlock free? (Assuming that each processes may need 3 tape drives)

a. 3
b. 2
c. 4
d. 7
Answer  Explanation 

ANSWER: 2

Explanation:
No explanation is available for this question!


27)   When size of the memory is increased the page replacement policy that sometimes leads to more page faults is called _________ .

a. FIFO
b. Optimal
c. LRU
d. None of the above
Answer  Explanation 

ANSWER: FIFO

Explanation:
No explanation is available for this question!


28)   A program is executing in a pure demand paging system with 100 records per page with 1 free main memory frame. The address sequence that is generated by tracing this program is recorded as follows,
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370
What are the number of page faults?


a. 8
b. 11
c. 7
d. 12
Answer  Explanation 

ANSWER: 7

Explanation:
No explanation is available for this question!


29)   The capacity of a memory unit = (the number of words) * (the number of bits / words). What will be the number of separate address and data lines needed for a memory of 4k * 16 ?

a. 12 address and 16 data lines
b. 12 address and 12 data lines
c. 11 address and 6 data lines
d. 12 address and 8 data lines
Answer  Explanation 

ANSWER: 12 address and 16 data lines

Explanation:
No explanation is available for this question!


30)   Which of the following statement is / are not true about normal forms? (Database)

a. Any relation with two attributes is in BCNF
b. BCNF is stricter than 3NF
c. Lossless, dependency - preserving decomposition into 3NF is always possible
d. Lossless, dependency - preserving decomposition into BCNF is always possible
Answer  Explanation 

ANSWER: Lossless, dependency - preserving decomposition into BCNF is always possible

Explanation:
No explanation is available for this question!