Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.


Please wait...

  Take Quiz (Monsoon) Beta Version !!
  Do You have Qs. in your Mind ??? Ask it as Qs. or MCQs or create it as polling Live Now !!

Data Structures :: Basic Concepts

Home > Data Structures > Basic Concepts > General Questions

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

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

2 / 18

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

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

3 / 18

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

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

4 / 18

 Representation of data structure in memory is known as:

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

5 / 18

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

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

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.

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

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

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Capgemini

8 / 18

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

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

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

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

10 / 18

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

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!