GATE Computer Science: Questions 359 - 364 of 913
Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 359
» Web Technologies » Basic Concepts of Client-Server Computing
Question
The process of writing out computer instruction is known as-
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | codeing |
|
| b. | Compiling |
|
| c. | Assembling |
|
| d. | Executing |
|
Question number: 360
» Computer Networks » Application Layer Protocols
Question
The Internet Model Consists of ________ Layers.
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | 3 |
|
| b. | 4 |
|
| c. | 5 |
|
| d. | 7 |
|
Question number: 361
» Information Systems and Software Engineering » Information Gathering
Question
Which is the type of memory for information that does not change on your computer?
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | RAM |
|
| b. | EROM |
|
| c. | ROM |
|
| d. | RW/RAM |
|
Question number: 362
» Algorithms » Tree and Graph Traversals
Question
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | T (n) =2T (n1) +1 |
|
| b. | T (n) =2T (n1) / 1 |
|
| c. | T (n) =2T (n1) - 2 |
|
| d. | All of the above |
|
Question number: 363
» Programming and Data Structures » Programming in C
Question
What will be output if you will compile and execute the following c code?
#define message "union is power of c" void main(){clrscr();printf("%s",message);getch();}
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | union is power of c |
|
| b. | power of c |
|
| c. | Compiler error |
|
| d. | Question does not provide sufficient data or is vague |
|
Question number: 364
» Programming and Data Structures » Programming in C
Question
If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in a tree?
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | It is an even number |
|
| b. | It cannot be equal to the number of leaves. |
|
| c. | It is always greater than twice the number of leaves. |
|
| d. | It is an odd number |
|