GATE Computer Science: Questions 490 - 496 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: 490

» Information Systems and Software Engineering » Information Gathering

MCQ▾

Question

Ctrl, shift, and alt are called – keys.

Choices

Choice (4) Response

a.

Adjacent

b.

Alphanumeric

c.

Modifier

d.

Function

Question number: 491

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

A connected graph T without any cycles is called

Choices

Choice (4) Response

a.

A tree graph

b.

Free tree

c.

A tree

d.

All a. , b. and c. are correct

Question number: 492

» Information Systems and Software Engineering » Information Gathering

MCQ▾

Question

What characteristic of read-only memory (ROM) marks it useful?

Choices

Choice (4) Response

a.

Data in ROM is electrical power.

b.

ROM chip are easily swapped between different brands of computer.

c.

ROM provides very large amounts of inexpensive data storage?

d.

ROM information can be easily updated.

Question number: 493

» Programming and Data Structures » Programming in C

MCQ▾

Question

The channel capacity of a band-limited Gaussian channel is given by

Choices

Choice (4) Response

a.

B log2 (2 + S/N)

b.

B log2 (1 + S/N) < /

c.

B log2 (2 + 2S/N)

d.

B log10 (2 + S/N)

Question number: 494

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

Which of the following data structure is not linear data structure?

Choices

Choice (4) Response

a.

list

b.

Arrays

c.

Tree

d.

All of the above

Question number: 495

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

If in binary tree n > 1, then for any n = key B-tree T of height is h min degree t > 2 has height (h) is-

Choices

Choice (4) Response

a.

h < logt (n + 1/6

b.

h < logt (n + 1/2)

c.

h < logt (2n + 1/2)

d.

None of the above

Question number: 496

» Algorithms » Worst and Average Case Analysis

MCQ▾

Question

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

Choices

Choice (4) Response

a.

0 (1)

b.

0 (n)

c.

0 (n^2)

d.

Question does not provide sufficient data or is vague

f Page
Sign In