Question 1

ADTS allow programmers to

Accepted Answer

Focus on higher level operations as per a program's needs

Question 2

An algorithm is written to return the first name beginning with " L " in a list of employee names . Which of the following is the algorithm's worst case scenario ?

Accepted Answer

No names in the list begin with " L "

Question 3

In a linked list , each node stores a _____the next node .

Accepted Answer

pointer to

Question 4

Which of the following is correct for a list ADT ?

Accepted Answer

An element can be found and removed from the end of the list .

Question 5

An algorithm that uses a constant number k of integer variables to find a number list's minimum value has space complexity S ( N ) = ________ and auxiliary space complexity S ( N ) =

Accepted Answer

N,k

Question 6

Which algorithm is best suited for a plagiarism check ?

Accepted Answer

Longest common substring

Question 7

A stack abstract data type ( ADT ) is implemented using a ( n ) _____data structure .

Accepted Answer

linked list

Question 8

An algorithm's is the scenario where the algorithm does the minimum possible number of operations .

Accepted Answer

best case

Question 9

Which data type is best suited to store the names and grades of students ?

Accepted Answer

record

Question 10

Which abstract data type ( ADT ) is suited to check whether a given string is a palindrome ?

Accepted Answer

A deque

Question 11

Appending an element in an array involves increasing the array's

Accepted Answer

size

Question 12

The process of providing only the essentials and hiding the details is known as

Accepted Answer

abstraction

Question 13

What is the space complexity the algorithm ? ArithmeticSeries (list listSize ) {
i = 0
arithmeticSum = 0
while ( i < listSize ) {
arithmeticSum arithmeticSum + list [ i ]
i = i + 1
}
return arithmeticSum
}

Accepted Answer

S ( N ) = N + k

Question 14

Which XXX will complete the algorithm to separate numberList into two lists ( even and odd ) using an array ?

Accepted Answer

if ( numberList [ i ] % 2 == 0 )

Question 15

Which of the following is best represented by a graph ?

Accepted Answer

A telephone network .

Question 16

Which is an abstract data type ( ADT ) ?

Accepted Answer

a list

Question 17

A manufacturing plant has many ways to assemble a product . Which algorithm will be useful to find the quickest way ?

Accepted Answer

Dijkstra's shortest path

Question 18

Which abstract data type ( ADT ) is best suited to store the names of all currently available smartphone models ?

Accepted Answer

A set

Question 19

What values are stored in the list numList ?

numberList ( ) {
    for ( i = 0 ; i < 10 ; i ++ ) {
        if ( i % 2 == 0 ) {
           numList [ i ] = i
        }
    }
}

Accepted Answer

[0 , 2 , 4 , 6 , 8 ]

Question 20

The worst - case runtime of an algorithm is  ______ number of steps taken to execute a program .

Accepted Answer

the maximum

Question 21

The Big O notation of the composite function 5 N 3 + 0 ( N2 ) is_

Accepted Answer

0 ( N3 )

Question 22

Which of the following is an example of a recursive function ?

Accepted Answer

MySalaryCalculator ( tempSal ) {
if ( tempSal < = 500 )
      return -1
else
     tempSal = tempSal + 1000
}

Question 23

Which of the following is the main requirement for a binary search algorithm ?

Accepted Answer

The list must be sorted in ascending order

Question 24

Which of the following is an example of constant time O ( 1 ) ?

Accepted Answer

Accessing an element of an array

Question 25

Identify the correct sequence of performing a binary search .

Accepted Answer

1st, it checks the mid element of the list. If the key is found it returns the matching location. If not found, the algorithm repeats the search on the remaining left sublist( if key < mid element) or the remaining right sublist( if key > mid element).

Question 26

A ( n )_____ . is a function f ( N ) that is defined in terms of the same function and operates on a value less than N.

Accepted Answer

a  recurrence relation

Question 27

second recursive call ? Given a list ( 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 17 ) the binary search algorithm calls Binary Search ( list , 0 , 8 , 5 ) . What will the low and high argument values be for the

Accepted Answer

low =5 , high = 8

Question 28

Given the following code for generating the Fibonacci series for N numbers which XXX would replace the missing statement ? FibonacciNumber ( N ) { XXX return 0 else if ( N == 1 ) return 1 else return FibonacciNumber ( N - 1 ) + FibonacciNumber ( N - 2 ) }

Accepted Answer

if ( N == 0 )

Question 29

Which of the following statements is true with reference to an algorithm's runtime ?

Accepted Answer

A single algorithm can execute more quickly on a faster processor .

Question 30

In a recursive function , the base case_____ the function .

Accepted Answer

terminates

Question 31

ctr = 0 while ( ctr < N ) { myAge = ctr val = ctr + 1 while ( val < N ) { if( age OfPeople [ val ] <ageOfPeople [ myAge ] ) myAge = val ++ val } tempList ageOfPeople [ ctr ] ageOfPeople [ctr] = ageOfPeople [ myAge ] ageOfPeople [myAge] = tempList ++ ctr }

Accepted Answer

0 ( N2 )

Question 32

A list of employees that has been sorted in descending order needs to be reversed .Which X completes the algorithm to sort the list in ascending order? AscendingList (empLis,begin,end){if(begin>=end) return .else (Swap empLis [begin] and empLis [end] X}}

Accepted Answer

AscendingList ( empList , begin + 1 , end - 1 )

Question 33

The upper bound of an algorithm with best case runtime T ( N ) = 3 N + 16 and worst case runtime 
T (N) = 4 N2 + 10 N + 5 is

Accepted Answer

19 N 2

Question 34

Which XX base case completes the algorithm to count the num of occurrences of a val in a list of nums?
CountOccur (num,numLen,val,startIn){XXif(num[startIn]==val)return1+CountOccur(num,numLen,val,startIn+1)else returnCountOccur(num,numLen,val startIn+1)}

Accepted Answer

If(startIndex>= numbersLength) return 0

Question 35

Which of the following algorithms is correct for applying linear search to find the element findEle in a list StudentlDs ?

Accepted Answer

LinearSearch ( StudentIDs , int listSize , int findEle ) { for ( ctr = 0 ; i < listSize ; ++ ctr ) { if ( StudentIDs [ findEle ] == ctr ) return findEle
}
}

Question 36

The Big O notation of the algorithm 7+ 12 N +3 N 2 is

Accepted Answer

N. 2

Question 37

Which XXX completes the binary search algorithm ? BinarySearch (arr, arrSize, key ){ mid=0 low=0 high arrSize-1 XXX {mid=( high + low ) / 2 f ( arr [ mid ] < key ) { low = mid + 1 else if (  arr[ mid ] > key ) { high = mid - 1 else { return mid return -1}

Accepted Answer

While(high>=low)

Question 38

Identify the notation for algorithm complexity that has a positive constant c for all T ( N ) 2 c f ( N ) .

Accepted Answer

T ( N ) = Q ( f ( N ) )

Question 39

The following algorithm is an example of 
def MyMath ( num )
 if (num < = 1){ return num}
 return MyMath ( num - 2 ) + MyMath ( num - 1 )

Accepted Answer

an exponential runtime complexity

"Know" box contains:
Time elapsed:
Retries:

285 test 1 study