GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 79 - 85 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: 79

» Programming and Data Structures » Programming in C

MCQ▾

Question

Length of the linear array can be found by using the formula?

Choices

Choice (4) Response

a.

LB - UB

b.

LB + UB

c.

UB - LB + 1

d.

None of the above

Question number: 80

» Programming and Data Structures » Programming in C

MCQ▾

Question

Shareware is software that is:

Choices

Choice (4) Response

a.

Provided with accompanying source code.

b.

Available for free use for a limited time.

c.

Provided with accompanying code.

d.

Question does not provide sufficient data or is vague

Question number: 81

» Programming and Data Structures » Programming in C

MCQ▾

Question

A DFD is composed of which elements?

Choices

Choice (4) Response

a.

Data sources and destinations

b.

Transformation processes

c.

Data flows, data store

d.

All a. , b. and c. are correct

Question number: 82

» Databases » Database Design

MCQ▾

Question

Which mapping exists between the external and conceptual levels?

Choices

Choice (4) Response

a.

Conceptual

b.

Other

c.

Internal

d.

Both a. and c. are correct

Question number: 83

» Computer Networks » IP(v4)

MCQ▾

Question

Which address is the B class address?

Choices

Choice (4) Response

a.

129.20. 01.0

b.

0.0. 0.1

c.

224.50. 0.1

d.

All of the above

Question number: 84

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

Question

The graphical representation of the transition of finite automata is ________.

Choices

Choice (4) Response

a.

E -R diagram

b.

Finite diagram

c.

state diagram

d.

All of the above

Question number: 85

» Programming and Data Structures » Binary Search Trees

MCQ▾

Question

A binary tree in which every non-leaf node has non-empty left and right sub trees is

Called a strictly binary tree. Such a tree with 10 leaves

Choices

Choice (4) Response

a.

has exactly 19 nodes

b.

cannot have more than 15 nodes

c.

has exactly 12nodes

d.

None of the above

f Page
Sign In