Data Structures :: Basic Concepts

NA
SHSTTON
22
Solv. Corr.
21
Solv. In. Corr.
43
Attempted
0 M:0 S
Avg. Time

1 / 18

The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called


AConcatenation

BGarbage collection

CCollision

DDynamic Memory Allocation

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
12
Solv. Corr.
43
Solv. In. Corr.
55
Attempted
0 M:0 S
Avg. Time

2 / 18

A mathematical-model with a collection of operations defined on that model is called


AData Structure

BAbstract Data Type

CPrimitive Data Type

DAlgorithm

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
45
Solv. Corr.
9
Solv. In. Corr.
54
Attempted
0 M:0 S
Avg. Time

3 / 18

A linear collection of data elements where the linear node is given by means of pointer is called


Alinked list

Bnode list

Cprimitive list

DNone of these

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
16
Solv. Corr.
38
Solv. In. Corr.
54
Attempted
0 M:0 S
Avg. Time

4 / 18

Representation of data structure in memory is known as:


Arecursive

Babstract data type

Cstorage structure

Dfile structure

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
20
Solv. Corr.
40
Solv. In. Corr.
60
Attempted
0 M:0 S
Avg. Time

5 / 18

O(N) (linear time) is better than O(1) constant time.


ATRUE

BFALSE

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
23
Solv. Corr.
27
Solv. In. Corr.
50
Attempted
0 M:0 S
Avg. Time

6 / 18

An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model.


ACardinality

BAssignment

CPrimitive

DStructured

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
19
Solv. Corr.
26
Solv. In. Corr.
45
Attempted
0 M:0 S
Avg. Time

7 / 18

An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of


Af(n) x g(n)

BMax ( f(n),g(n))

CMin (f(n),g(n))

Df(n) + g(n)

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
19
Solv. Corr.
34
Solv. In. Corr.
53
Attempted
0 M:0 S
Avg. Time

8 / 18

Time complexities of three algorithms are given. Which should execute the slowest for large values of N?


AO(N^1/2)

BO(N)

CO(log n)

DNone of these

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
10
Solv. Corr.
15
Solv. In. Corr.
25
Attempted
0 M:40 S
Avg. Time

9 / 18

Ackerman's function is defined on the non-negative integers as follows

a(m,n) = n+1 if m=0
= a(m-1, 1) if m != 0, n=0
= a(m-1, a(m, n-1)) if m != 0, n0
The value of a (1, 3) is


A4

B5

C6

D7

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
2
Solv. Corr.
35
Solv. In. Corr.
37
Attempted
0 M:0 S
Avg. Time

10 / 18

The indirect change of the values of a variable in one module by another module is called


Ainternal change

Binter-module change

Cside effect

Dside-module update

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace