Go Back   2023 2024 MBA > MBA > Main Forum > Previous Question Papers of IIIT Hyderabad

Thread: Previous Question Papers of IIIT Hyderabad Reply to Thread
Your Username: Click here to log in
Title:
  
Message:
Trackback:
Send Trackbacks to (Separate multiple URLs with spaces) :
Post Icons
You may choose an icon for your message from the following list:
 

Additional Options
Miscellaneous Options

Topic Review (Newest First)
8th October 2016 08:57 AM
shikha
Re: Previous Question Papers of IIIT Hyderabad

As you want I am here giving you Previous Question Papers of PGEE (post graduation Entrance exam ) of IIIT Hyderabad.

PGEE Exam Paper
The square of the binary number 1001 in hexadecimal is

A) 81 B) 51 C) 121 D) A1
Which of the following modes of data transfer is the fastest?

A) DMA B) Interrupt-based C) Polling D) All are equally fast
Heap Sort runs at

A) O(log n) B) O(nlog n) C) O(n2) D) O(n2log n)
What is the chance that a leap year selected at random will contain 52 Sundays?

A) 1 B) ½ C) 1/7 D) 2/7

Engineering Mathematics

T is a tree and V is a vertex of T of maximum degree in T, say the degree of V in n. Prove that T has atleast n vertices of degree 1.

One bag contains 4 white balls and 3 black balls, and second bag contains 3 white balls and 5 black balls. One ball is drawn from the first bag and placed unseen in the second bag. What is the probability that a ball now drawn from second bag is black?

Let an denote the number of bit strings of length n that do not have two consecutive zeroes. Find a recurrence relation for the number of bit strings of length n that do not have two consecutive zeroes. Hence find a4.

Apply Newton’s method to compute the approximate value of root 2. Start the iteration from x0=1, and obtain two iterations.

Computer Science & Engineering
Write a nonrecursive routine to reverse a singly linked list in O(N) time.

Prove that in a self-complementing code the sum of the weights must be 9.

An inversion is an array of numbers is any pair (i,j) such that i<j and A[i]>A[j]. What is the average number of inversions in an array of n distinct numbers?

Design a counter for the following binary sequence: 0,4,5,3,1,6,2,7 and repeat.Use JK flip-flops

Here I s the attachment.
PGEE Exam Paper


The square of the binary number 1001 in hexadecimal is

A) 81 B) 51 C) 121 D) A1

Which of the following modes of data transfer is the fastest?

A) DMA B) Interrupt-based C) Polling D) All are equally fast

Heap Sort runs at

A) O(log n) B) O(nlog n) C) O(n2) D) O(n2log n)

What is the chance that a leap year selected at random will contain 52 Sundays?

A) 1 B) ½ C) 1/7 D) 2/71. The square of the binary number 1001 in hexadecimal is
A) 81 B) 51 C) 121 D) A1
2. Which of the following modes of data transfer is the fastest?
A) DMA B) Interrupt-based C) Polling D) All are equally fast
3. Heap Sort runs at
A) O(log n) B) O(nlog n) C) O(n2) D) O(n2log n)
4. What is the chance that a leap year selected at random will contain 52 Sundays?
A) 1 B) ½ C) 1/7 D) 2/7



Engineering Mathematics

1. T is a tree and V is a vertex of T of maximum degree in T, say the degree of V in n. Prove that T has atleast n vertices of degree 1.
2. One bag contains 4 white balls and 3 black balls, and second bag contains 3 white balls and 5 black balls. One ball is drawn from the first bag and placed unseen in the second bag. What is the probability that a ball now drawn from second bag is black?
3. Let an denote the number of bit strings of length n that do not have two consecutive zeroes. Find a recurrence relation for the number of bit strings of length n that do not have two consecutive zeroes. Hence find a4.
4. Apply Newton’s method to compute the approximate value of root 2. Start the iteration from x0=1, and obtain two iterations.


Computer Science & Engineering

1. Write a nonrecursive routine to reverse a singly linked list in O(N) time.
2. Prove that in a self-complementing code the sum of the weights must be 9.
3. An inversion is an array of numbers is any pair (i,j) such that i<j and A[i]>A[j]. What is the average number of inversions in an array of n distinct numbers?
4. Design a counter for the following binary sequence: 0,4,5,3,1,6,2,7 and repeat.Use JK flip-flops



Electronics and Communication Engineering
1. Realize a RS flip flop using a JK flip flop.
2. What is the auto correlation function of a discrete time white noise?
3. Which of the following modulation schemes are constant energy modulation?
A) 8-PSK B) 16 QAM C) 8-FSK D) 8-PAM
4. Human code is a
1) error correcting code 2) lossless source code
3) lossy source code 4) error detecting code



Structural Engineering
1. A short CI column of hollow circular section has projecting bracket carrying a load of 10 tonnes. The load line is off the column by 20cm. The external diameter of the column is 350mm and thickness of metal is 25 mm. Find the maximum stress intensity in the section.
2. A rectangular beam section of 300 mm width and 500 mm effective depth is reinforced with 4 bars of 20 mm diameter, what shear reinforcement is required to resist 200 kN shear (use working stress method).
3. A bar of steel 24 mm in diameter was subjected to a tensile load of 60 kNs and measured extension on a 20-cm gauge length was 0.009 cm and the change in diameter was 0.00375 cm. Calculate the Bulk modulus?
4. What is the allowable load carrying capacity of a circular column section of 400 mm diameter reinforced with 6x25 mm diameter bars adequately tied with spirals? Consider concrete of grade M25 and steel of grade Fe 415.






Contact :
IIIT Hyderabad
Gachibowli, Hyderabad,
Telangana 500032
040 6653 1000
7th October 2016 06:59 PM
Unregistered
Previous Question Papers of IIIT Hyderabad

Will you please give here Previous Question Papers of PGEE (post graduation Entrance exam ) of IIIT Hyderabad?

Posting Rules
You may post new threads
You may post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off


All times are GMT +5.5. The time now is 01:12 PM.


Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2024, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2