GATE Computer Science: Questions 442 - 448 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: 442

» Algorithms » Sorting

MCQ▾

Question

What is an infix notation to postfix notation of following question -?

A * B+C/D

Choices

Choice (4) Response

a.

AB * CD/+

b.

AB*

c.

AB*+CD/

d.

All of the above

Question number: 443

» Information Systems and Software Engineering » Information Gathering

MCQ▾

Question

A record is related to a file, as statement is related to a –

Choices

Choice (4) Response

a.

Procedure

b.

Program

c.

Data

d.

File

Question number: 444

» Programming and Data Structures » Programming in C

MCQ▾

Question

What will be output if you will compile and execute the following code?

  1. void main()
  2. {
  3.     int i=10;
  4.     static int x=i;
  5.     if(x==iprintf("Equal");
  6.     else if(x>iprintf("Greater than");
  7.     else printf("Less than");
  8. }

Choices

Choice (4) Response

a.

error

b.

Greater than

c.

Less than

d.

Equal

Question number: 445

» Programming and Data Structures » Programming in C

MCQ▾

Question

What will be output if you will compile and execute the following c code?

  1. void main()
  2. {
  3.     int a=-12;
  4.     a=a>>3;
  5.     printf("%d",a);
  6. }

Choices

Choice (4) Response

a.

96

b.

2

c.

3

d.

4

Question number: 446

» Information Systems and Software Engineering » Information Gathering

MCQ▾

Question

Numbers in table columns are usually –

Choices

Choice (4) Response

a.

Right-aligned

b.

Justified

c.

Left-aligned

d.

center

Question number: 447

» Algorithms » Worst and Average Case Analysis

MCQ▾

Question

When consider n elements are to be sorted then the Average case time complexity of selection sort is-

Choices

Choice (4) Response

a.

0 (log2n)

b.

0 (n)

c.

0 (n^2)

d.

None of the above

Question number: 448

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

If each node in a tree has value greater than every value in its left sub tree and has value less than every in the its right sub tree, the tree is called

Choices

Choice (4) Response

a.

Full binary tree

b.

Complete tree

c.

Binary search tree

d.

Thread tree

Sign In