## PGEE 09, IIIT Hyderabad question paper

Posted by imdad on February 15, 2009

following are some questions that appeared in this paper:

(there were just 6 ques of 25 marks each, with sub questions for every ques .. but here i am just typing down whatever i can remember)

1) find no. of integers between [100,999] that are (a) divisble by 7, (b) divisible by 3 but not by 4

2) if S = {i | 0<i<=50}, |S| = 10, A and B are subsets of S, |A|=|B|=5, sum of all integers in A is equal to that of all integers in B, then prove that there exist atleast one such pair A and B.

3) A sequence of integers was given and we had to show step by step construction of a binary search tree from that sequence. Corresponding in, pre and post order was asked and also the new structure of the tree after deleting a node.

4) if A and B are two sorted arrays (ascending) of integers. write algos to find (a) the closest pair in AUB. (b) the median in AUB.

5) write a C function to take a string and edit it so that all the vowels in it are removed.

6) a C prog was given and its output was asked.

7) design a binary counter to count from 1 to 8 using JK flip-flops, along with the tables, k-maps.

8) point out the adverse effects on TCP due to bit errors over a wireless connection. Design a parity check code for two bit error.

## Leave a Reply