Computer Science Questions

What will be the output of the following code?a = [1, 2, 3, 4, 5]b = a[3:4]print(b)A. [3]B. [4]C. [4, 5]D. [3, 4, 5]

What will be the output of the following code?def func(n): if (n > 0): func(int(n / 2)) print(n % 2)func(11)A. 11B. 1011C. 1101D. 0

A hash function h defined h(key) = key mod 6, linear probing is used to insert the keys 1, 6, 11, 17 into a table with size = 6. What will the location of key 12 be?A. 0B. 1C. 2D. 3

What is visited first in Post-order traversal of binary tree?A. The left subtreeB. The right subtreeC. The root

Given a sorted array as follows: [2, 4, 5, 6, 8] and a search key x using binary search? The Best case of searching occurs when value of x is:A. 2B. 5C. 8D. None of these

Given a hash table of size S and a division hash function h(), an element with key k is stored at index:A. kB. k / SC. k % SD. h(k / S)

Following function is used to calculate factorial number of n. What is the missing line?def fact(num): if num == 0: return 1 else: return ...A. num * fact(num - 1)B. num * (num - 1)C. fact(num) * fact(num - 1)D. num * fact(num + 1)

What will be the output of the following code?S = []S.append(1)S.append(2)S.append(3)print(S.peak())A. [1, 2, 3]B. 1C. 3D. Error

Given an array as follows: [6, 1, 5, 3, 7]. What is the number of key comparisons done to check if 9 is in the array or not by using linear search?A. 0B. 1C. 5D. 6

According to Stack data structure, what is output for input "finaltest" (each element of the stack is a character of the string)?A. tsetlanifB. final testC. testD. final

List A is defined as follows:A = [1, 2, 3, 4, 5]Select all of the following statements that remove the middle element 3 from A so that it equals [1, 2, 4, 5]:A. del A[2]B. A[2] = []C. A[2:2] = []D. A[2].remove()

The height of an AVL tree storing n entries approximates:A. log nB. n log nC. nD. N * n

Given a function as follows:def rec(n): if (n == 0): return n else: return n + rec(n-1)What is statement "return n + rec(n-1)" called in a recursive algorithm?A. Base caseB. Recursive callsC. Anchor caseD. Nothing

Which is sorting algorithms that maintain two sub-lists, one sorted and one to be sorted?A. Selection SortB. Merge SortC. Quick SortD. None of these

What will be the output of the following code?b = [1] * 5print(b)A. 0B. 5C. [1, 1, 1, 1, 1]D. Error

Which of the following algorithms has a logarithmic runtime complexity?A. Binary searchB. Linear searchC. Merge sortD. Selection sort

What is a tree data structure?A. A set of nodes connected by edgesB. A set of nodesC. A set of edgesD. A set of vertices

The worst case occurs in linear search algorithm when:A. Item is somewhere in the middle of the arrayB. Item is not in the array at allC. Item is the last element in the arrayD. Item is the last element in the array or is not there at all

Which field in the IP header is used to prevent an IP packet from continuously looping through a network?A. IdentifierB. Header ChecksumC. Hop CountD. Time-to-Live (TTL)

TCP assigns a sequence number to each segment that is being sent. The sequence number for each segment is the number of the _______ byte carried in that segment.A. lastB. firstC. None is correctD. middle