GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1397 - 1402 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1397

Question

True-False▾

Statements

  1. All Recursively Enumerable Languages are Recursive languages.

  2. All Regular languages are Context free languages.

Choices

Choice (4)Response

a.

None of the statements is correct.

b.

Only statement Ⅰ is true.

c.

Only statement Ⅱ is true.

d.

All the statements are correct.

Question 1398

Question

MCQ▾

Stack addressing is an example of ________?

Choices

Choice (4)Response

a.

Direct addressing

b.

Indirect addressing

c.

Immediate addressing

d.

Implied addressing

Question 1399

Question

MCQ▾

Imagine a hash table having space for records, then the probability of collision before the table becomes full will be given as?

Choices

Choice (4)Response

a.

0.42

b.

0.21

c.

0.28

d.

0.35

Question 1400

Question

MCQ▾

What is true about the LEN () function of SQL?

Choices

Choice (4)Response

a.

It can have multiple parameters

b.

Counts leading spaces

c.

Counts trailing spaces

d.

Question does not provide sufficient data or is vague

Question 1401

Question

MCQ▾

What is the minimal number of moves required to solve the “Tower of Brahma” , if we are having 4 disks to transfer with us?

Choices

Choice (4)Response

a.

15

b.

16

c.

7

d.

32

Question 1402

Question

MCQ▾

What is the output of the C program given below?

  1. #include<stdio.h>
  2. int main()
  3. {
  4.     printf("%d",main);
  5.     return0;
  6. }

Choices

Choice (4)Response

a.

Compile time error

b.

Runtime error

c.

Address of main function

d.

Garbage value

Developed by: