人気の面接質問と回答・オンラインテスト
面接対策、オンラインテスト、チュートリアル、ライブ練習のための学習プラットフォーム

集中型学習パス、模擬テスト、面接向けコンテンツでスキルを伸ばしましょう。

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。