热门面试题与答案和在线测试
面向面试准备、在线测试、教程与实战练习的学习平台

通过聚焦学习路径、模拟测试和面试实战内容持续提升技能。

WithoutBook 将分主题面试题、在线练习测试、教程和对比指南整合到一个响应式学习空间中。

面试准备

C++ 面试题与答案

Test your skills through the online practice test: C++ Quiz Online Practice Test

相关差异对比

C vs C++Java vs C++

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


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).

这有帮助吗? 添加评论 查看评论
 

问题 137. Name 7 layers of the OSI Reference Model?


-Application layer
-Presentation layer
-Session layer
-Transport layer
-Network layer
-Data Link layer
-Physical layer

这有帮助吗? 添加评论 查看评论
 

问题 138. What are the advantages and disadvantages of B-star trees over Binary trees?


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.

这有帮助吗? 添加评论 查看评论
 

问题 139. Write the psuedo code for the Depth first Search.


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".

这有帮助吗? 添加评论 查看评论
 

问题 140. Describe one simple rehashing policy.


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.

这有帮助吗? 添加评论 查看评论
 
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.
" />

用户评价最有帮助的内容:

版权所有 © 2026,WithoutBook。