Time Left - 10:00 mins

ECIL GET 2018 : Topic wise test-1 (Algorithms )

Attempt now to get your rank among 579 students!

Question 1

Given the symbols A, B, C, D, E, F, G and H with the probabilities and respectively. The average Huffman code size in bits per symbol is:

Question 2

Consider the following pseudo-code:

The cyclomatic complexity of the pseudo-code is

Question 3

To determine the efficiency of an algorithm the time factor is measured by:

Question 4

In general, in a recursive and non-recursive implementation of a problem (program):

Question 5

Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by

Question 6

Output of following program
#include <stdio.h>
int mian()
int i = 5;
printf(“%d %d %d”, i++, i++, i++);
return 0;

Question 7

Which of the following statements are TRUE?
I. The context diagram should depict the system as a single bubble.
II. External entities should be identified clearly at all levels of DFDs.
III. Control information should not be represented in a DFD.
IV.A data store can be connected either to another data store or to an external entity

Question 8

Kadane algorithm is used to find

Question 9

The concept of order Big O is important because :

Question 10

What is the solution to the recurrence T(n)=T(n/2) +n ?
  • 579 attempts

Posted by:

Anand PandeyAnand PandeyMember since Aug 2017
Stay Hungry Stay Foolish !
Share this quiz   |