International Institute of Information Technology
Gachibowli, Hyderabad 500 032
Andhra Pradesh, INDIA
Phone : +91-40-6653 1000
Fax : +91-40-6653 1413
Post-Graduate Entrance Examination 2010 (PGEE2010) on 18th April 2010 Wed, 11/04/2009 - 10:35 — admin
Post-Graduate Entrance Examination 2010 (PGEE2010) of International Institute Of Information Technology, Hyderabad (IIIT-H) will be held on 18th April 2010 (10 AM to 1 PM) in Bangalore, Calcutta, Delhi, Hyderabad and Mumbai.
Further details will be announced in due course.
For more details, visit: www.iiit.net
Gachibowli, Hyderabad 500 032
Andhra Pradesh, INDIA
Phone : +91-40-6653 1000
Fax : +91-40-6653 1413
Post-Graduate Entrance Examination 2010 (PGEE2010) on 18th April 2010 Wed, 11/04/2009 - 10:35 — admin
Post-Graduate Entrance Examination 2010 (PGEE2010) of International Institute Of Information Technology, Hyderabad (IIIT-H) will be held on 18th April 2010 (10 AM to 1 PM) in Bangalore, Calcutta, Delhi, Hyderabad and Mumbai.
Further details will be announced in due course.
For more details, visit: www.iiit.net
where can i get previous question papers of pgee....
ReplyDeleteany one who know his can mail me to shwanth.rangaa@gmail.com please
I want to get the names of reference books for PGEE 2010 exam preparation, and the previous year question papers for ECE, please mail me to: tomhawk7@gmail.com
ReplyDeleteheyy i wanr previous quesion papers on pgee 2010 CS branch
ReplyDeleteplease send mee
my id is y6it222@gmail.com
following are some questions that appeared in 2009 paper:
ReplyDelete(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.
can anyone suggest certain books to refer for pgee exam. for ECE & also the previous papers where can i find them..pls mail to neeha.eliza@gmail.com
ReplyDeletehi
ReplyDeletecan someone help me in mailing the previous papers of PGEE cse (krishnapriya57@gmail.com)
plzzz
Last year when i attempted for PGEE 2010, i searched for previous year questions but they were hard to find, only found PGEE 2009 ques, which are already posted here.
ReplyDeleteSo just to help others, I specially noted down immediately after the exam as question papers are not allowed to take home. So here are the ques I faced in PGEE 2010. Hope you find them helpful.
Any though, I didn't got through PGEE 2010 :-)
PGEE 2010
APTITUDE(90 mins)
45 ques, 2 marks each, -1/2 for wrong ans
Q1-Q5) Short comprehensions and ques depending on it.
Q6-Q10) Data was given, 1 boxes are kept on 1 another, labelled 1, 2 and 3, with box1 at top and box3 at bottom.
3 green hats: G1, G2, G3. 3 red hats:R1,R2,R3
Condition 1: R1 must be above the G3
Condition 2 : No green hats can be kept in a single box.
Condition 3 :
Another 5 ques of similar data and logical type.
Ques range from differentiation, limits, graphs, almost everything that comes in btech mathematics.
SUBJECTIVE
6 ques, 15 marks each.
(1) Find last digit of value of 2^2010. Justify your answer also.
Give 2 fns f(n) and g(n) such that, f(n) != O(g(n)) and g(n) != O(f(n))
(2) Form a 4 to 1 multiplexer from a given 2 to 1 multiplexer. Also realize logic circuit for 2 to 1 multiplexer.
x1 x2 x3 C
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
S C
0 A
1 B
x1, x2 and x3 are inputs. S is select line. C is output.
(3) Write a C function to reverse a given no. Consider last digit can't be zero.
What's the time complexity of your algo?
Can you check whether this no is palindrome or not? If yes, how?
int reverseNum(int inputNum);
(4) A skeleton of some coding was provided to create a hash function. Create a function to compute hash value of string provided. Means "meat", "team", "mate" should have different values.
int hashValue(char *wrd, int nmax)
{ int i, hv; //nmax is maximun size of Hash Table
int _____
while(wrd[i] != '\0')
{
}
return hv;
}
(5) Sample data given with Processes names like P1,P2 etc with their respective burst times in millisec and priorities.
(a) Draw time lines for FCFS, shortest job first, non-preemptive priority and Round Robin(1ms window)
(b) Which schedule has minimum average waiting time? Justify.
(c) Differentiate between deadlock, livelock and starvation. Does any of the above schedules lead to starvation? If yes, how to fix it?
(6) Some question in Graph, its verices and edge set were provided, sort of like that. Don't remember, as didn't attempted it.