Without Book Interview Questions and Answers | Online Test | Moct Test
Download Android App in your Android Device from Google Play Store
- Search for "Withoutbook Practice Exam Test" in Mobile/Tablet Play Store
Institute Training Search by Name or Email

Exams Attended

Make Homepage

Bookmark this page

Subscribe Email Address

C++ Interview Questions and Answers

Ques 136. What is the difference between a Java application and a Java applet?

Ans.
The difference between a Java application and a Java applet is that a Java application is a program that can be executed using the Java interpeter, and a JAVA applet can be transfered to different networks and executed by using a web browser (transferable to the WWW).

Is it helpful? Add Comment View Comments
Ques 137. Name 7 layers of the OSI Reference Model?
Ans.
-Application layer
-Presentation layer
-Session layer
-Transport layer
-Network layer
-Data Link layer
-Physical layer
Is it helpful? Add Comment View Comments
Ques 138. What are the advantages and disadvantages of B-star trees over Binary trees?
Ans.
Answer1
B-star trees have better data structure and are faster in search than Binary trees, but it?s harder to write codes for B-start trees.

Answer2
The major difference between B-tree and binary tres is that B-tree is a external data structure and binary tree is a main memory data structure. The computational complexity of binary tree is counted by the number of comparison operations at each node, while the computational complexity of B-tree is determined by the disk I/O, that is, the number of node that will be loaded from disk to main memory. The comparision of the different values in one node is not counted.
Is it helpful? Add Comment View Comments
Ques 139. Write the psuedo code for the Depth first Search.
Ans.
dfs(G, v) //OUTLINE
Mark v as "discovered"
For each vertex w such that edge vw is in G:
If w is undiscovered:
dfs(G, w); that is, explore vw, visit w, explore from there as much as possible, and backtrack from w to v. Otherwise:
"Check" vw without visiting w. Mark v as "finished".
Is it helpful? Add Comment View Comments
Ques 140. Describe one simple rehashing policy.
Ans.
The simplest rehashing policy is linear probing. Suppose a key K hashes to location i. Suppose other key occupies H[i]. The following function is used to generate alternative locations:
rehash(j) = (j + 1) mod h
where j is the location most recently probed. Initially j = i, the hash code for K. Notice that this version of rehash does not depend on K.
Is it helpful? Add Comment View Comments
2) Name 7 layers of the OSI Reference Model? 3) What are the advantages and disadvantages of B-star trees over Binary trees?
4) Write the psuedo code for the Depth first Search.
5) Describe one simple rehashing policy.
" />

Most helpful rated by users:

©2016 WithoutBook