This Test will cover complete Programming and Data Structures with very important questions, starting off from basics to advanced level.

Q. The worst case time required to search a given element in a sorted linked list of length

`n`

is?Q. When key values are real, a similar data representation might be produced by using a hashing function with?

Q. The average time required to perform a successful sequential search for an element in an array

`A(1:n)`

is given by?Q. Using the standard algorithm, what is the time required to determine that a number

`n`

is prime?Q. Which of the following is most appropriate?

Q. If the space occupied by

`null`

terminated string "S1" and "S2" in "c" are respectively "m" and "n", the space occupied by the string obtained by concatenating "S1" and "S2" is always?Q. Given 2 sorted list of size 'm' and 'n' respectively. Number of comparisons needed in the worst case by the Merge Sort algorithm will be?

Q. The order of an algorithm that finds whether a given boolean function of 'n' variables, produces a 1 is?

Q. Which of the following is not a Primitive Recursive but Partially Recursive?

Q. What will be the output of the following line of code?

`Printf("%d" printf("tim"));`

Q. If

`a`

is an unsigned integer variable whose value is `hx6db7`

, what is the value of `-a`

?Q. If initialization is a part of declaration of a structure, then storage class can be?

Q. Which of the following is a collection of items into which items can de inserted arbitrarily and from which only the smallest item can be removed?

Q. Which of the following abstract data types can be used to represent a many to many relation?

Q. The average search time of hashing, with linear probing will be less if the load factor __________?

Tests for various other programming languages and subjects: