Question papers for IIIT Hyderabad of Computer Science for M.Tech

Will you please share with me the last year question papers for IIIT Hyderabad of Computer Science for M.Tech?

[Arun Vats]

As you want to get the question papers for IIIT Hyderabad of Computer Science for M.Tech so here it is for you:

1. Illustrate the following concepts in one or two lines: [15]
a. Minimal pair
b. Obstruents
c. Hypercorrection
d. Loan Translation
e. Control verb
f. Co-indexing
g. Hyponymy
h. Metathesis
i. Compounding
j. Recursion
2. Answer the following questions: [ 5 ]
a. The linguists Leonard Bloomfield and Ferdinand de Saussure belonged to which of the following tradition:
i. Generativism
ii. Behaviorism
iii. Structuralism
b. Which subpart of linguistics may be defined as the “meaning of language in context”:
i. Pragmatics
ii. Semiotics
iii. Semantics
iv. Relevance Theory
c. The overwhelming majority of sounds in the world’s language use which airstream mechanism:
i. Velaric
ii. Pulmonic
iii. Alveolar
iv. Glottalic
d. Which of these books was not written by Noam Chomsky:
i. Syntactic Structure
ii. The Language Instinct
iii. Knowledge of Language
iv. Barriers
e. There is usually no natural connection between linguistic form and meaning
i. True
ii. False
3. What inflectional categories are there for nouns and verbs in your language and in which order do they occur? Illustrate with suitable examples. [8]
4. Read the following sentences: [10]
a. John will answer the question precisely at noon
b. The professor’s appointment was shocking
The above sentences are ambiguous. What are the readings involved? Try to explain their structural ambiguity with the help of tree diagram and/or rules.
5. Read the following sentences: [5+2]
1a. The butcher cuts the meat
b. The meat cuts easily
2a. Jane broke the crystal
b. Crystal breaks at the slightest touch
3a. John opened the door
b. The door opened with a bang
4a. Kelly adores French fabric
b.*French fabric adores easily
5a. Joan knows the answer
b. *The answer knows easily
Study the above data. Consider syntax and semantics of the verbs and explain why the verbs are behaving differently. Give one more example for each of the above patterns.
6. Read the following sentences and answer the questions: [4+4+4] [20 min]
a. Mithu’s mother draws a picture of herself
How do you determine whether ‘herself’ should co-refer to Mithu or Mithu’s mother?
b. *Ratna tries Meera to learn English
Why is the above sentence ungrammatical in English?
c. Have all the boys done their homework?
How will you account for the agreement between the subject and the verb in the above sentence?
SECTION B
[For students from a background other than Linguistics]
1. Consider the following sentences of English: [8]
a. Is Sheela coming for dinner tomorrow?
b. What are you cooking for dinner tomorrow?
Sentence (a) is an example of ‘yes-no’ question and sentence (b) is an example of ‘wh-question’. Now answer the following:
i. Give the equivalent sentences for (a) and (b) in your language
ii. What are the structural differences between the two types of questions in your
language?
iii. How does the structure of (a) and (b) in English differ from their equivalents in
your language?
2a. Mark the following sentences with Noun group (NG) and Verb group (VG) as shown in the example:
(Remember pronoun is also a kind of noun.) [6+2]
Example:
[The post office]NG [is situated]VG near [the bus stop]NG.
a. John’s sister is very smart
b. Mandy carefully explained it to him.
c. The boys are playing with a ball in the garden
b. Label the part of speech of the words which are left in the sentences above after doing the grouping?
3. Give one example each of the following concepts from your language and English [5]
a. Second person plural pronoun
b. Suffix
c. Imperative sentence
d. Past continuous tense
e. Intransitive verb
4. Read the following pairs of words. State how the words in the pairs are related. [1+5]
bag : bags
hut : huts
house : houses
class : classes
bus : buses
child : children
ox : oxen
man : men
foot : feet
tooth : teeth
State how to form the words of the right column from those of the corresponding left column. Try to propose generalized statements that will explain as many changes as possible at one go.
5. Sate the difference in meaning of the words underlined in the paired sentences below. Can you state the context that helps you infer the particular reading of these words? [6]
a. At one stage it looked as though they would win
b. The drama was performed on the stage
a. Put the book on the table
b. The child is learning multiplication tables
a. Please book the ticket early.
b. They put the book on the table
6. Translate the following sentences into your mother tongue and observe how the preposition 'of' is getting translated: [7]
a. Two of us visited my grandmother yesterday
b. The Queen of England will visit India next year
c. The arrival of the police shocked us
d. Please give me a glass of milk
SECTION C
[Compulsory for all the students]
1. Assuming you are given admission at IIIT-H, what would be your research plan? [15]
2. Translate the following English passage into any of the following languages – Hindi, Telugu, Bengali, Malayalam, Tamil, Marathi. You can select the language you are most comfortable in. [15]
It was raining cats and dogs in the afternoon. It was my niece’s birthday and we were very keen on attending it. Even though we tried to move out of the house, we could not do so. Our car was out of order and we had no other conveyance at our disposal. Finally we decided to walk down. But the umbrella which I had bought the previous day was misplaced. Since we could not attend the party we called her up and wished her. However, we kept missing the joy of attending the party in person.
a. State with examples what kind of structural differences do you observe between the source language and target language
b. Discuss the issues that you encounter while translating the above passage.

Sir I want to do M.Tech form the IIIT Hyderabad so can you please provide me the entrance exam paper for the Computer Science branch

[Shaleen]

Hey buddy the IIIT Hyderabad gives admission to its college on the basis of GATE score so I am giving you the last year GATE question paper below


Q.1 A binary operation ⊕ on a set of integers is defined as 2 2
x⊕ y = x + y . Which one of the following
statements is TRUE about ⊕?
(A) Commutative but not associative (B) Both commutative and associative
(C) Associative but not commutative (D) Neither commutative nor associative
Q.2 Suppose p is the number of cars per minute passing through a certain road junction between 5 PM
and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer
than 3 cars during any given minute in this interval?
(A) 8/(2e3
) (B) 9/(2e3
) (C) 17/(2e3
) (D) 26/(2e3
)

Q.4 The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(A) -256 (B) -128 (C) -127 (D) 0
Q.5 In the following truth table, V = 1 if and only if the input is valid.
Inputs Outputs
D0 D1 D2 D3 X0 X1 V
0 0 0 0 x x 0
1 0 0 0 0 0 1
x 1 0 0 0 1 1
x x 1 0 1 0 1
x x x 1 1 1 1
What function does the truth table represent?
(A) Priority encoder (B) Decoder
(C) Multiplexer (D) Demultiplexer
Q.6 Which one of the following is the tightest upper bound that represents the number of swaps
required to sort n numbers using selection sort?
(A) O(log n) (B) O(n) (C) O(n log n) (D) O(n
2
)
Q.7 Which one of the following is the tightest upper bound that represents the time complexity of
inserting an object into a binary search tree of n nodes?
(A) O(1) (B) O(log n) (C) O(n) (D) O(n log n)
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 3/20
Q.8 Consider the languages L1 =Φ and L2 ={a }. Which one of the following represents L L L 1 2 1
∗ ∗ U ?
(A) {є} (B) Φ (C) a* (D) {є, a}
Q.9 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a
grammar with no epsilon- and unit-production (i.e., of type A → є and A → a) to parse a string
with n tokens?
(A) n/2 (B) n-1 (C) 2n-1 (D) 2n
Q.10 A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process
starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every
T time units and decides the next process to schedule. Which one of the following is TRUE if the
processes have no I/O operations and all arrive at time zero?
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.
Q.11 Match the problem domains in GROUP I with the solution technologies in GROUP II.
GROUP I GROUP II
(P) Service oriented computing (1) Interoperability
(Q) Heterogeneous communicating systems (2) BPMN
(R) Information representation (3) Publish-find-bind
(S) Process description (4) XML
(A) P-1, Q-2, R-3, S-4 (B) P-3, Q-4, R-2, S-1
(C) P-3, Q-1, R-4, S-2 (D) P-4, Q-3, R-2, S-1
Q.12 The transport layer protocols used for real time multimedia, file transfer, DNS and email,
respectively are
(A) TCP, UDP, UDP and TCP
(B) UDP, TCP, TCP and UDP
(C) UDP, TCP, UDP and TCP
(D) TCP, UDP, TCP and UDP
Q.13 Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ>, and
sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the
operations?
(A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed
by Y’s public key
(B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed
by Y’s private key
(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed
by X’s private key
(D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed
by X’s public key
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 4/20
Q.14 Assume that source S and destination D are connected through two intermediate routers labeled R.
Determine how many times each packet has to visit the network layer and the data link layer during
a transmission from S to D.
(A) Network layer – 4 times and Data link layer – 4 times
(B) Network layer – 4 times and Data link layer – 3 times
(C) Network layer – 4 times and Data link layer – 6 times
(D) Network layer – 2 times and Data link layer – 6 times
Q.15 An index is clustered, if
(A) it is on a set of fields that form a candidate key.
(B) it is on a set of fields that include the primary key.
(C) the data records of the file are organized in the same order as the data entries of the index.
(D) the data records of the file are organized not in the same order as the data entries of the index.
Q.16 Three concurrent processes X, Y, and Z execute three different code segments that access and
update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores
a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the
P operation on semaphores c, d, and a before entering the respective code segments. After
completing the execution of its code segment, each process invokes the V operation (i.e., signal) on
its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the
following represents a deadlock-free order of invoking the P operations by the processes?
(A) X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
(B) X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
(C) X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
(D) X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)
Q.17 Which of the following statements is/are FALSE?
1. For every non-deterministic Turing machine, there exists an equivalent deterministic
Turing machine.
2. Turing recognizable languages are closed under union and complementation.
3. Turing decidable languages are closed under intersection and complementation.
4. Turing recognizable languages are closed under union and intersection.
(A) 1 and 4 only (B) 1 and 3 only (C) 2 only (D) 3 only
Q.18 Which of the following statements are TRUE?
1. The problem of determining whether there exists a cycle in an undirected graph is in P.
2. The problem of determining whether there exists a cycle in an undirected graph is in NP.
3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm
to solve A.
(A) 1, 2 and 3 (B) 1 and 2 only (C) 2 and 3 only (D) 1 and 3 only
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 5/20

f x dx computed using the trapezoidal rule is
(A) 8.983 (B) 9.003 (C) 9.017 (D) 9.045
Q.24 Consider an undirected random graph of eight vertices. The probability that there is an edge
between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
(A) 1/8 (B) 1 (C) 7 (D) 8
Q.25 Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
(A) P only (B) Q only (C) Both P and Q (D) Neither P nor Q
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 6/20
Q.26 to Q.55 carry two marks each.
Q.26 The line graph L(G) of a simple graph G is defined as follows:
• There is exactly one vertex v(e) in L(G) for each edge e in G.
• For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e'
are incident with the same vertex in G.
Which of the following statements is/are TRUE?
(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.
(A) P only (B) P and R only
(C) R only (D) P, Q and S only
Q.27 What is the logical translation of the following statement?
“None of my friends are perfect.”
(A) ∃x (F (x)∧ ¬P(x)) (B) ∃ x (¬ F (x)∧ P(x))
(C) ∃x (¬F (x)∧¬P(x)) (D) ¬∃ x (F (x)∧ P(x))
Q.28 Consider the following sequence of micro-operations.
MBR ← PC
MAR ← X
PC ← Y
Memory ← MBR
Which one of the following is a possible operation performed by this sequence?
(A) Instruction fetch (B) Operand fetch
(C) Conditional branch (D) Initiation of interrupt service