2023 2024 Student Forum > Management Forum > Main Forum

 
  #2  
16th June 2015, 08:59 AM
Super Moderator
 
Join Date: Apr 2013
Re: IIIT Hyderabad Model Papers for CSE

Here I am providing the list of few Institute of Information Technology Hyderabad PGEE CSE exam questions which you are looking for .

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

PGEE CSE exam syllabus:

The questions asks from following topics :

Fundamental Programming Concepts,
Control Flow,
Digital Building Blocks (AND/OR/NAND/XOR Gates),
Karnaugh's Maps,
Computer Organisation,
Number Systems.
Functions, Recursion,
Basic Data Structures (arrays, lists, stacks, and queues),
Basic algorithms (sorting and searching),
Boolean Algebra,

Capability to write programs in C or C++ is expected, Relational Databases (Functional dependencies, SQL), Computer Networks .
  #3  
14th March 2016, 06:47 PM
Unregistered
Guest
 
Re: IIIT Hyderabad Model Papers for CSE

Hello sir, I am Ranjeet. I am from Hyderabad. I want you to help me by providing some model paper or questions for the IIIT Hyderabad post graduate entrance exam for CSE?
  #4  
14th March 2016, 06:47 PM
Super Moderator
 
Join Date: May 2012
Re: IIIT Hyderabad Model Papers for CSE

As you have asked about the IIIT Hyderabad Model paper for post graduate entrance exam for CSE, check below for the information
The square of the binary number 1001 in hexadecimal is
A) 81 B) 51 C) 121 D) A1

II. Which of the following modes of data transfer is the fastest?
A) DMA B) Interrupt-based C) Polling D) All are equally fast

III. Heap Sort runs at
A) O(log n) B) O(nlog n) C) O(n2) D) O(n2log n)

IV. What is the chance that a leap year selected at random will contain 52 Sundays?
A) 1 B) 1/2 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


Quick Reply
Your Username: Click here to log in

Message:
Options




All times are GMT +5. The time now is 10:41 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4