GATE 2019 PAST Question Papers with Correct Answer Keys

Overseen by: Archangel Macsika
Nov. 27, 2020  |  25 minutes

GATE 2019 General Aptitude (GA) Set-6

Q.1 – Q.5 carries one mark each.

Q.1 (MCQ)

 The expenditure on the project _____ as follows: equipment Rs.20 lakhs, salaries Rs.12 lakhs, and contingency Rs.3 lakhs.

A break down

B break

C breaks down

D breaks

The Answer is: C

Q.2 (MCQ)

 The search engine’s business model ___________ around the fulcrum of trust.

A revolves

B plays

C sinks

D burst

The Answer is: A

Q.3 (MCQ)

 Two cars start at the same time from the same location and go in the same direction. The speed of the first car is 50 km/h and the speed of the second car is 60 km/h. The number of hours it takes for the distance between the two cars to be 20 km is ___.

A 1

B 2

C 3

D 6

The Answer is: B

Q.4 (MCQ)

 Ten friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs 150 more. The cost of the gift was Rs. ____.

A 666

B 3000

C 6000

D 12000

The Answer is: C

Q.5 (MCQ)

 A court is to a judge as _____________ is to a teacher.

A a student

B a punishment

C a syllabus

D a school

The Answer is: D

Q.6 – Q.10 carries two marks each.

Q.6 (MCQ)

 The police arrested four criminals – P, Q, R and S. The criminals knew each other. They made the following statements:
P says “Q committed the crime.”
Q says “S committed the crime.”
R says “I did not do it.”
S says “What Q said about me is false.”
Assume only one of the arrested four committed the crime and only one of the statements made above is true. Who committed the crime?





The Answer is: B

Q.7 (MCQ)

 In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentage of administrators shall be in the range of ___________.

Diagram of teachers are represented in the triangle, researchers in the circle and administrators in the rectangle.

A 0 to 15

B 16 to 30

C 31 to 45

D 46 to 60

The Answer is: C

Q.8 (MCQ)

 “A recent High Court judgement has sought to dispel the idea of begging as a disease — which leads to its stigmatization and criminalization — and to regard it as a symptom. The underlying disease is the failure of the state to protect citizens who fall through the social security net.”
Which one of the following statements can be inferred from the given passage?

A Beggars are lazy people who beg because they are unwilling to work

B Beggars are created because of the lack of social welfare schemes

C Begging is an offence that has to be dealt with firmly

D Begging has to be banned because it adversely affects the welfare of the state

The Answer is: B

Q.9 (MCQ)

 In a college, there are three student clubs. Sixty students are only in the Drama club, 80 students are only in the Dance club, 30 students are only in the Maths club, 40 students are in both Drama and Dance clubs, 12 students are in both Dance and Maths clubs, 7 students are in both Drama and Maths clubs, and 2 students are in all the clubs. If 75% of the students in the college are not in any of these clubs, then the total number of students in the college is _____.

A 1000

B 975

C 900

D 225

The Answer is: C

Q.10 (MCQ)

 Three of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.
Request by X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.

A GATE 2019 CS Question 10

B GATE 2019 CS Question 10

C GATE 2019 CS Question 10

D GATE 2019 CS Question 10

The Answer is: D

End of the General Aptitude Section of the Question Paper.

Computer Science and Information Technology Set-2

Q.1 – Q.25 carries one mark each.

Q.1 (MCQ)

 A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?

A 24 bits and 0 bits

B 28 bits and 4 bits

C 24 bits and 4 bits

D 28 bits and 0 bits

The Answer is: D

Q.2 (MCQ)

 The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by A15 to A0. What is the range of addresses (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?

Diagram of a chip select logic for a certain DRAM chip in a memory system design

A C800 to CFFF

B CA00 to CAFF

C C800 to C8FF

D DA00 to DFFF

The Answer is: A

Q.3 (MCQ)

 Which one of the following kinds of derivation is used by LR parsers?

A Leftmost

B Leftmost in reverse

C Rightmost

D Rightmost in reverse

The Answer is: D

Q.4 (MCQ)

 In 16-bit 2’s complement representation, the decimal number −28 is:

A 1111 1111 0001 1100

B 0000 0000 1110 0100

C 1111 1111 1110 0100

D 1000 0000 1110 0100

The Answer is: C

Q.5 (MCQ)

 Let 𝑈 = {1,2, ... , 𝑛}. Let 𝐴 = {(𝑥, 𝑋)|𝑥 ∈ 𝑋, 𝑋 ⊆ 𝑈}. Consider the following two statements on |𝐴|.
I. |𝐴| = 𝑛2𝑛−1
II. |𝐴| = ∑𝑛𝑘=1k(𝑛𝑘)
Which of the above statements is/are TRUE?

A Only I

B Only II

C Both I and II

D Neither I nor II

The Answer is: C

Q.6 (MCQ)

 Which one of the following is NOT a valid identity?

A (x⊕y)⊕z = x⊕(y⊕z)

B (x+y)⊕z = x⊕(y+z)

C x ⊕ y = x + y, if xy = 0

D x ⊕ y = (xy + x′y′)′

The Answer is: B

Q.7 (MCQ)

 If 𝐿 is a regular language over Σ = {𝑎, 𝑏}, which one of the following languages is NOT regular?

A 𝐿⋅𝐿R ={𝑥𝑦 |𝑥 ∈ 𝐿,𝑦R ∈𝐿}

B {𝑤𝑤R | 𝑤 ∈ 𝐿}

C Prefix(𝐿)={𝑥 ∈ 𝛴*|∃𝑦∈ 𝛴* such that 𝑥𝑦 ∈ 𝐿}

D Suffix(𝐿)={𝑦 ∈ 𝛴*|∃𝑥∈ 𝛴*such that 𝑥𝑦 ∈ 𝐿}

The Answer is: B

Q.8 (MCQ)

 Consider Z = X – Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in 𝑛 bits. To avoid overflow, the representation of Z would require a minimum of:

A 𝑛 bits

B 𝑛−1 bits

C 𝑛+1 bits

D 𝑛+2 bits

The Answer is: C

Q.9 (MCQ)

 Let 𝑋 be a square matrix. Consider the following two statements on 𝑋.
I. 𝑋 is invertible.
II. Determinant of 𝑋 is non-zero.
Which one of the following is TRUE?

A I implies II; II does not imply I.

B II implies I; I does not imply II.

C I does not imply II; II does not imply I.

D I and II are equivalent statements.

The Answer is: D

Q.10 (MCQ)

 Let 𝐺 be an arbitrary group. Consider the following relations on 𝐺:
𝑅1:∀𝑎,𝑏∈𝐺, 𝑎𝑅1𝑏 if and only if ∃𝑔∈𝐺 such that 𝑎=𝑔−1𝑏𝑔
𝑅2:∀𝑎,𝑏∈𝐺, 𝑎𝑅2𝑏 if and only if 𝑎=𝑏-1
Which of the above is/are equivalence relation/relations?

A 𝑅1 and 𝑅2

B 𝑅1 only

C 𝑅2 only

D Neither 𝑅1 nor 𝑅2

The Answer is: B

Q.11 (MCQ)

 Consider the following two statements about database transaction schedules:
I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable.
Which of the above statements is/are TRUE?

A I only

B II only

C Both I and II

D Neither I nor II

The Answer is: C

Q.12 (MCQ)

 Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to

A n!

B (𝑛 − 1)!

C 1

D (𝑛 − 1)!/2

The Answer is: D

Q.13 (MCQ)

 Compute \$ \lim_{x\to 3}\frac{x^4-81}{2x^2-5x-3}\$

A 1

B 53/12

C 108/7

D Limit does not exist

The Answer is: C

Q.14 (MCQ)

 Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?

A B+ Tree is a height-balanced tree

B Non-leaf nodes have pointers to data records

C Key values in each node are kept in sorted order

D Each leaf node has a pointer to the next leaf node

The Answer is: B

Q.15 (MCQ)

 For Σ = {𝑎, 𝑏}, let us consider the regular language 𝐿 = { 𝑥 |𝑥 = 𝑎2+3𝑘 or 𝑥 = 𝑏10+12𝑘, 𝑘 ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for 𝐿 ?

A 3

B 5

C 9

D 24

The Answer is: D

Q.16 (MCQ)

 Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)?





The Answer is: B

Q.17 (NAT)

 The following C program is executed on a Unix/Linux system:

#include <unistd.h>
int main()
    int i;
    for (i=0; i<10; i++)
    if (i%2 == 0) fork(); return 0;

 The total number of child processes created is ________.


 31 to 31

Q.18 (NAT)

 Consider the following C program:

#include <stdio.h\>
int jumble(int x, int y){
    return x;
int main(){
    int x=2, y=5;
    printf("%d \n", x);
    return 0;

 The value printed by the program is ________.


 26 to 26

Q.19 (NAT)

 Consider the grammar given below:
S → Aa
A → BD
B → b |ε
D → d |ε
Let a, b, d, and $ be indexed as follows:


Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b, d, $}, then the answer should be 3210).
Answer: ________.


 31 to 31

Q.20 (NAT)

 An array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places) is ________.


 0.08 to 0.08

Q.21 (NAT)

 The value of 351 mod 5 is ________.


 2 to 2

Q.22 (NAT)

 Two numbers are chosen independently and uniformly at random from the set {1, 2 , . . . , 13}. The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) binary representations have the same most significant bit is ___________.


 0.502 to 0.504

Q.23 (NAT)

  Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100.

D = D + 20
D = D - 50
D = D + 10

The processes are executed on a uniprocessor system running a time-shared operating system. If the minimum and maximum possible values of D after the three processes have completed execution are X and Y respectively, then the value of Y – X is _____________.


 80 to 80

Q.24 (NAT)

  Consider the following C program:

#include <stdio.h\>
int main(){
    int arr[]={1,2,3,4,5,6,7,8,9,0,1,2,5}, *ip=arr+4;
    printf(“%d\n”, ip[1]);
    return 0;

The number that will be displayed on execution of the program is ___________ .


 6 to 6

Q.25 (NAT)

 Consider a sequence of 14 elements: A = [−5, −10, 6, 3, −1, −2, 13, 4, −9, −1, 4, 12, −3, 0]. The subsequence sum 𝑆(𝑖,𝑗) = ∑𝑗k=i𝐴[𝑘]. Determine the maximum of 𝑆(𝑖,𝑗), where 0 ≤ 𝑖 ≤ 𝑗 < 14. (Divide and conquer approach may be used.)
Answer: ________.


 29 to 29

Q.26 – Q.55 carries two marks each.

Q.26 (MCQ)

  Consider the following C function.

void convert(int n){
    else {

Which one of the following will happen when the function convert is called with any positive integer n as argument?

A It will print the binary representation of n and terminate

B It will print the binary representation of n in the reverse order and terminate

C It will print the binary representation of n but will not terminate

D It will not print anything and will not terminate

The Answer is: D

Q.27 (MCQ)

 Consider the following C program:

#include <stdio.h>
int r(){
    static int num=7;
    return num--;
int main(){
    for (r();r();r())
    return 0;

Which one of the following values will be displayed on execution of the programs?

A 41

B 52

C 63

D 630

The Answer is: B

Q.28 (MCQ)

 Consider three machines M, N, and P with IP addresses,, and respectively. The subnet mask is set to for all the three machines. Which one of the following is true?

A M, N, and P all belong to the same subnet

B Only M and N belong to the same subnet

C Only N and P belong to the same subnet

D M, N, and P belong to three different subnets

The Answer is: C


 Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?

A X sends an ARP request packet to the local gateway’s IP address which then finds the MAC address of Y and sends to X

B X sends an ARP request packet to the local gateway’s MAC address which then finds the MAC address of Y and sends to X

C X sends an ARP request packet with broadcast MAC address in its local subnet

D X sends an ARP request packet with broadcast IP address in its local subnet

The Answer is: C

Q.30 (MCQ)

 Consider three 4-variable functions f1, f2, and f3, which are expressed in sum-of-minterms as
f1 = ∑ (0, 2, 5, 8, 14), f2 = ∑ (2, 3, 6, 8, 14, 15), f3 = ∑ (2, 7, 11, 14)
For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as:

diagram of a circuit with one AND gate and one XOR gate

A ∑(7, 8, 11)

B ∑(2, 7, 8, 11, 14)

C ∑(2, 14)

D ∑(0, 2, 3, 5, 6, 7, 8, 11, 14, 15)

The Answer is: A

Q.31 (MCQ) 

 Which one of the following languages over ∑ = {𝑎, 𝑏} is NOT context-free?

A {𝑤𝑤𝑅 |𝑤 ∈ {𝑎, 𝑏}}

B {𝑤𝑎n𝑏n𝑤𝑅 |𝑤 ∈ {𝑎, 𝑏}*,𝑛 ≥ 0}

C {𝑤𝑎nwRbn |𝑤 ∈ {𝑎, 𝑏}*,𝑛 ≥ 0}

D {𝑎n𝑏i | 𝑖 ∈ {𝑛, 3𝑛, 5𝑛},𝑛 ≥ 0}

The Answer is: C

Q.32 (MCQ)

 Let the set of functional dependencies F = {QR → S, R → P, S → Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS).
Consider the two statements given below.
I. Both Y and Z are in BCNF
II. Decomposition of X into Y and Z is dependency preserving and lossless
Which of the above statements is/are correct?

A Both I and II

B I only

C II only

D Neither I nor II

The Answer is: C

Q.33 (MCQ)

 Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressible. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?

A 16×210

B 256×210

C 4×220

D 8×220

The Answer is: B

Q.34 (MCQ)

 Consider the following sets:
S1. Set of all recursively enumerable languages over the alphabet {0,1}
S2. Set of all syntactically valid C programs
S3. Set of all languages over the alphabet {0,1}
S4. Set of all non-regular languages over the alphabet {0,1}
Which of the above sets are uncountable?

A S1 and S2

B S3 and S4

C S2 and S3

D S1 and S4

The Answer is: B

Q.35 (MCQ)

 Consider the first order predicate formula 𝜑:
∀𝑥[(∀𝑧 𝑧|𝑥⇒((𝑧=𝑥)∨(𝑧=1)))⇒∃𝑤 (𝑤>𝑥)∧(∀𝑧 𝑧|𝑤⇒((𝑤=𝑧)∨(𝑧=1)))]
Here ‘𝑎|𝑏’ denotes that ‘𝑎 divides 𝑏’, where 𝑎 and 𝑏 are integers. Consider the following sets:
S1. {1,2,3, ... , 100}
S2. Set of all positive integers
S3. Set of all integers
Which of the above sets satisfy 𝜑?

A S1 and S2

B S1 and S3

C S2 and S3

D S1, S2 and S3

The Answer is: C

Q.36 (MCQ)

 Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let 𝑋1, 𝑋2, 𝑋3, 𝑋4, 𝑋5, and 𝑋6 be the placeholders for the non- terminals D, T, L or L1 in the following table:

Production ruleSemantic action
D → T L𝑋1.type = 𝑋2.type
T → intT.type = int
T → floatT.type = float
L → L1 , id𝑋3.type = 𝑋4.type
addType(id.entry, 𝑋5.type)
L → idaddType(id.entry, 𝑋6.type)

Which one of the following are the appropriate choices for 𝑋1, 𝑋2, 𝑋3 and 𝑋4?

A 𝑋1 = 𝐿, 𝑋2 = 𝑇, 𝑋3 = 𝐿1, 𝑋4 = 𝐿

B 𝑋1 = T, 𝑋2 = L, 𝑋3 = 𝐿1, 𝑋4 = T

C 𝑋1 = 𝐿, 𝑋2 = L, 𝑋3 = 𝐿1, 𝑋4 = T

D 𝑋1 = T, 𝑋2 = L, 𝑋3 = T, 𝑋4 = 𝐿1

The Answer is: A

Q.37 (MCQ)

 There are n unsorted arrays: A1, A2, ..., An. Assume that n is odd. Each of A1, A2, ..., An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, ..., An is

A O(n)

B O(n log n)

C O(n2)

D Ω(n2 log n)

The Answer is: C

Q.38 (MCQ)

 Let 𝐺 be any connected, weighted, undirected graph.
I. 𝐺 has a unique minimum spanning tree, if no two edges of 𝐺 have the same weight.
II. 𝐺 has a unique minimum spanning tree, if, for every cut of 𝐺, there is a unique minimum-weight edge crossing the cut.
Which of the above two statements is/are TRUE?

A I only

B II only

C Both I and II

D Neither I nor II

The Answer is: C

Q.39 (MCQ)

 Consider the following snapshot of a system running 𝑛 concurrent processes. Process 𝑖 is holding 𝑋𝑖 instances of a resource R, 1 ≤ 𝑖 ≤ 𝑛. Assume that all instances of R are currently in use. Further, for all 𝑖, process 𝑖 can place a request for at most 𝑌𝑖 additional instances of R while holding the 𝑋𝑖 instances it already has. Of the 𝑛 processes, there are exactly two processes 𝑝 and 𝑞 such that 𝑌p = 𝑌q = 0. Which one of the following conditions guarantees that no other process apart from 𝑝 and 𝑞 can complete execution?

A 𝑋p + 𝑋q < Min {𝑌k | 1 ≤ 𝑘 ≤ 𝑛,k ≠ p,k ≠ q}

B 𝑋p + 𝑋q < Max {𝑌k | 1 ≤ 𝑘 ≤ 𝑛,k ≠ p,k ≠ q}

C Min(𝑋p, 𝑋q) ≥ Min {𝑌k | 1 ≤ 𝑘 ≤ 𝑛,k ≠ p,k ≠ q}

D Min(𝑋p, 𝑋q) ≤ Max {𝑌k | 1 ≤ 𝑘 ≤ 𝑛,k ≠ p,k ≠ q}

The Answer is: A

Q.40 (MCQ)

 Consider the following statements:
I. The smallest element in a max-heap is always at a leaf node
II. The second largest element in a max-heap is always a child of the root node
III. A max-heap can be constructed from a binary search tree in Θ(𝑛) time
IV. A binary search tree can be constructed from a max-heap in Θ(𝑛) time
Which of the above statements are TRUE?

A I, II and III

B I, II and IV

C I, III and IV

D II, III and IV

The Answer is: A

Q.41 (NAT)

 Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:

Arrival Time0123
CPU burst time313Z

These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is________.


 2 to 2

Q.42 (NAT)

  The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) _________ GB.


 4.0 to 4.1

Q.43 (NAT)

 Consider the augmented grammar given below:
S' → S
S → 〈L〉|id
L → L,S | S
Let I0 = CLOSURE ({[S' → •S]}). The number of items in the set GOTO (I0,〈) is: ________.


 5 to 5

Q.44 (NAT)

 Consider the following matrix:

\$ R = \left[ \begin{matrix} 1 \quad 2 \quad 4 \quad 8 \\ 1 \quad 3 \quad 9 \quad 27 \\ 1 \quad 4 \quad 16 \quad 64 \\ 1 \quad 5 \quad 25 \quad 125 \\ \end{matrix} \right] \$

The absolute value of the product of Eigen values of 𝑅 is ___________.


 12 to 12

Q.45 (NAT)

 A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to fetch all the eight words of the block, and finally transmits the words of the requested block at the rate of 1 word per cycle. The maximum bandwidth for the memory system when the program running on the processor issues a series of read operations is __________× 106 bytes/sec.


 160 to 160

Q.46 (NAT)

  Let 𝑇 be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves 𝑎 and 𝑏 of 𝑇 are chosen uniformly and independently at random. The expected value of the distance between 𝑎 and 𝑏 in 𝑇 (i.e., the number of edges in the unique path between 𝑎 and 𝑏) is (rounded off to 2 decimal places)_________.


 4.25 to 4.25

Q.47 (NAT)

 Suppose 𝑌 is distributed uniformly in the open interval (1,6). The probability that the polynomial 3𝑥2 + 6𝑥𝑌 + 3𝑌 + 6 has only real roots is (rounded off to 1 decimal place) ________.


 0.8 to 0.8

Q.48 (NAT)

 Let Σ be the set of all bijections from {1, ... , 5} to {1, ... , 5}, where 𝑖𝑑 denotes the identity function, i.e. 𝑖𝑑(𝑗) = 𝑗, ∀𝑗. Let ∘ denote composition on functions. For a string 𝑥 = 𝑥1𝑥2...𝑥n ∈ Σn,𝑛 ≥ 0, let𝜋(𝑥) = 𝑥1∘𝑥2∘⋯∘𝑥n.
Consider the language 𝐿 = {𝑥 ∈ Σ*| 𝜋(𝑥) = 𝑖𝑑 }. The minimum number of states in any DFA accepting 𝐿 is ________.


 120 to 120

Q.49 (NAT)

  Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is__________.


 3 to 3

Q.50 (NAT)

  What is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of-minterms form as f = ∑ (0, 2, 5, 7, 8, 10, 13, 15)? Assume that all the inputs and their complements are available. Answer: _______________.


 4 to 4

Q.51 (NAT)

 A relational database contains two tables Student and Performance as shown below:





The primary key of the Student table is Roll_no. For the Performance table, the columns Roll_no. and Subject_code together form the primary key. Consider the SQL query given below:

SELECT S.Student_name, sum(P.Marks)
FROM Student S, Performance P
WHERE P.Marks > 84
GROUP BY S.Student_name;

The number of rows returned by the above SQL query is ________.


 5 to 5

Q.52 (NAT)

 Consider the following C program:

int main(){
    float sum = 0.0, j = 1.0, i = 2.0;
    while (i/j > 0.0625){
        j = j + j;
        sum = sum + i/j;
        printf("%f\n", sum);
    return 0;

The number of times the variable sum will be printed, when the above program is executed, is _________________.


 5 to 5

Q.53 (NAT)

 Consider the following C program:

int main()
    int a[] = {2, 4, 6, 8, 10};
    int i, sum = 0, *b = a + 4;
    for (i = 0; i < 5; i++)
        sum = sum + (*b – i) – *(b – i);
    printf (“%d\n”, sum);
    return 0;

The output of the above C program is __________.


 10 to 10

Q.54 (NAT)

 In an RSA cryptosystem, the value of the public modulus parameter 𝑛 is 3007. If it is also known that φ(𝑛) = 2880, where φ() denotes Euler’s Totient Function, then the prime factor of 𝑛 which is greater than 50 is ____________________.


 97 to 97

Q.55 (NAT)

 Consider the following relations P(X,Y,Z), Q(X,Y,T) and R(Y,V).







How many tuples will be returned by the following relational algebra query?

\$\prod_x(\sigma_{(P.Y=R.Y \land R.V = V2)(P\times R)} ) -\prod_x(\sigma_{(Q.Y=R.Y \land Q.T \gt 2)(Q\times R)} )\$

Answer: ___________.


 1 to 1

Was this prep resource helpful?

Please don't forget to share.