mid

Question 1

Which of the following are types of LinkedList?

Answer 1

d.
singly-linked, doubly-linked, multi-linked

Question 2

An example of logarithmic time complexity is:

Answer 2

a.
Binary search

Question 3

Consider the following recursive function fun(x, y).

What is the value of fun(4, 3)

int fun(int x, int y){

  if (x == 0)

      return y;

  return fun(x - 1,  x + y);

}

Answer 3

d.
13

Question 4

Linear data structure that follows a particular order in which the operations are performed

Answer 4

c.
Queue

Question 5

Look at square numbers: square(1) = 1; square(N) = square(N-1) + 2N -1

Which method below successfully implements this definition?

Answer 5

d.
int square( int N ){

if ( N==1 ) {

return 1;

}

else

{

return square(N-1) + 2*N - 1;

}

}

Question 6

Algorithm times are measured in terms of growth of an algorithm.

Answer 6

False

Question 7

What does the notation O(n) represent in asymptotic analysis?

Answer 7

b.
The worst-case time complexity of an algorithm

Question 8

Which of the following is not a typical application of stacks?

Answer 8

c.
Sorting algorithms

Question 9

What is the time complexity of deleting an element from a singly linked list?

Answer 9

c.
O(n)

Question 10

What is complexity independent of inputs?

Answer 10

a.
Complexity that doesn’t depend on the number of inputs

Question 11

Which of the following usees FIFO method?

Answer 11

a.
Queue

Question 12

For a binary search algorithm to work, it is necessary that the array list must be

Answer 12

a.
sorted

Question 13

When the function with loops or recursive calls can have constant complexity?

Answer 13

b.
Number of iterations or calls independent of input size

Question 14

What is the limitation of calling recursion?

Answer 14

limit of the heap memory

Question 15

Specify ArrayList advantages over LinkedList

Answer 15

c.
arrayList is better for storing and accessing the data

Question 16

What will Repeat(82, 3) return from the following method declaration?

public static int Repeat(int i, int j){

if (i==0)

  return 0;

else

  return Repeat(i/j, j)+1;

}

Answer 16

b.
6

Question 17

Algorithm speed is measured in seconds.

Answer 17

False

Question 18

Can a program have loops or recursive calls and still have time complexity that is constant?

Answer 18

c.
Yes, as long as the loops or recursive calls have a constant number of iterations or calls

Question 19

Which operation returns the front element from the queue without removing it?

Answer 19

b.
peek()

Question 20

What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

Answer 20

X will always be a better choice for large inputs

Question 21

Which one of the below mentioned is linear data structure

Answer 21

a.
All of the above
b.
Queue
c.
Arrays
d.
Stack

Question 22

Queue operation .Pop:

Answer 22

d.
remove from the front

Question 23

Recursion is implemented by the queue, and each time you invoke a method, the method is placed on top of the queue.

Answer 23

False

Question 24

What is the main difference between a stack and a queue?

Answer 24

a.
A stack is a LIFO data structure, a queue is a FIFO data structure.

Question 25

How does the call stack work in relation to recursive functions?

Answer 25

d.
It keeps track of the function calls made

Question 26

What is the time complexity of popping an element from a stack?

Answer 26

d.
O(1)

Question 27

Which of the following is not a typical application of queues?

Answer 27

d.
Depth-first search algorithm

Question 28

Which of the following factors does not affect the time complexity of an algorithm?

Answer 28

c.
The speed of the computer executing the algorithm

Question 29

Linearithmic complexity’s Big-O notation is:

Answer 29

c.
O(nlogn)

Question 30

The run time of algorithms is expressed in Big O notation.

Answer 30

False