GATE 2018 Computer Science Questions and Solution

# Recent questions tagged gate2018

1
Each of the letters arranged as below represents a unique integer from 1 to 9. The letters are positioned in the figure such that (A × B × C), (B × G × E) and (D × E × F) are equal. Which integer among the following choices cannot be represented by the letters A, B, C, D, E, F or G? (A)4 (B)5 (C)6 (D)9 Please explain with proper reason.
2
Rank = 744 Score = 683 category = OBC-NCL what are my chances for IITG, IITR, IITM, IITKGP M.tech admission ? should I apply for NITs ?
3
Do we have to submit(How to submit) the Declaration / Undertaking – for OBC Candidates? I mean I understand that we have to submit the obc-ncl certificate but do we have to submit the declaration/undertaking form as well at the time of applying online?
4
Does previous year gate score degrade for next year. Like if I have say 700 score in 2017. When I apply to some college using 2017 score will it remain 700 or it is reduced this year? what is the criteria?
1 vote
5
why every iit has their own fee for registration ?
1 vote
6
Gate 2018 CSE score 532,rank 3039 OBC NCL. Please suggest which college I can get best out of this score.. Thanks in advance...
7
I am a mechanical Engineer. I have gate Score 727 with rank 453 ( CS),So which IIT I can get with this score? Category OBC NCL Considering working in TCS with 1 year work Experience.
8
my GATE score is 429 and my marks is 31.67 ,category OBC in which college i can get admission? can i get admission in NITs? what are good options for this score?
9
While applying for IISc, I have paid the required application fee. The amount has been debited from my bank account but it is not yet reflected in the application. If anyone here who has applied for IISc, could tell me how long he/she had to wait for the fee to be reflected in their application, then that will be of great help. Thanks.
10
Hi , My GATE 2018 score is 411 and my graduation score is 6.2 out of 10. For applying to various NITs, the minimum eligibility criteria is 60% or CGPA 6.5/10. By this criteria I'll not be able to apply for the Central Government Institutes. But when my ... am getting 62% which makes me eligible to apply. So my doubt is whether I can convert CGPA into % or not while filling the application.
11
It seems to be an utter clusterfuck in the official answer key. It also seems that GO's key is way more reliable and accurate. The official key seems to have gotten it's questions shuffled up and out of order.
12
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense based medium access protocol. A node that receives a packet to transmit will ... ) that allows $Q$ to successfully avoid a collision between its proposed transmission and $P$'s ongoing transmission is _______.
13
A processor has $16$ integer registers $(R0, R1, \ldots , R15)$ and $64$ floating point registers $(F0, F1, \ldots , F63).$ It uses a $2- byte$ instruction format. There are four categories of instructions: $Type-1, Type-2, Type-3,$ and $Type-4.$ $Type-1$ ... $Type-4$ category consists of $N$ instructions, each with a floating point register operand $(1F).$ The maximum value of $N$ is _____
14
Given a language $L$, define $L^i$ as follows:$L^0 = \{ \varepsilon \}$$L^i = L^{i-1} \bullet L \text{ for all } I >0$The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1$ (over alphabet O) accepted by the following automaton. The order of $L_1$ is ____
15
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, , 199$), and $256$ sectors per track (numbered as $0, 1, 255$). The following $6$ disk requests of the ... platters is negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____
16
Consider an IP packet with a length of $4,500$ $bytes$ that includes a $20-byte$ IPv4 header ans $40-byte$ TCP header. The packet is forwarded to an IPv4 router that supports a Maximum Transmission Unit (MTU) of $600$ $bytes$. Assume that the ... Assume that the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is _____.
17
Consider the weights and values of items listed below. Note that there is only one unit of each item. $\begin{array}{|c|c|c|}\hline \textbf{Item number} & \textbf{Weight (in Kgs) }& \textbf{Value (in rupees)} \\\hline \text{$1$} & \text{$10$} & \text{$ ... the ordered list. The total value of items picked by the greedy algorithm is denoted by $V_{greedy}$. The value of $V_{opt}-V_{greedy}$ is ____
18
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$ and Writeback $(WB)$, The $IF$, $ID$, $OF$ and $WB$ stages take $1$ ... there are no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.
19
Consider the following undirected graph $G$: Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $G$ for this value of $x$ is ____.
20
Consider the minterm list form of a Boolean function $F$ given below. $F(P, Q, R, S) = \Sigma m(0, 2, 5, 7, 9, 11) + d(3, 8, 10, 12, 14)$ Here, $m$ denotes a minterm and $d$ denotes a don't care term. The number of essential prime implicants of the function $F$ is ___
21
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
22
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers. Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else { y=y-1; Count (1024, y); } } } The number of times that the $print$ statement is executed by the call $Count(1024, 1024)$ is _____
23
Consider Guwahati, (G) and Delhi (D) whose temperatures can be classified as high $(H)$, medium $(M)$ and low $(L)$. Let $P(H_G)$ denote the probability that Guwahati has high temperature. Similarly, $P(M_G)$ and $P(L_G)$ denotes the probability of ... , then the probability (correct to two decimal places) that Guwahati has high temperature given that Delhi has high temperature is _____
24
Let $G$ be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent numbers in the label of $v$. Let $y$ denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z$ = ____
25
Consider the following four relational schemas. For each schema , all non-trivial functional dependencies are listed, The bolded attributes are the respective primary keys. Schema I: Registration(rollno, courses) Field courses' is a set-valued attribute containing the set of courses ... Which one of the relational schemas above is in 3NF but not in BCNF? Schema I Schema II Schema III Schema IV
26
In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ ... of $F$ were available The system is not in $safe$ state, but would be $safe$ if one more instance of $G$ were available
27
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined with respective initial values of $0, N$ and $1$. Semaphore $empty$ denotes the number of available slots in the buffer, for the consumer to read ... $P: empty, \ \ \ Q:full, \ \ \ R:full, \ \ \ S:empty$
Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query $Q: r \bowtie (\sigma_{B<5} (s))$ Let LOJ denote the natural left outer-join operation. Assume that $r$ and $s$ contain no null values. Which of the following ... $\sigma_{B<5} (r \: LOJ \: s)$ $r \: LOJ \: (\sigma_{B<5} (s))$ $\sigma_{B<5} (r) \: LOJ \: s$
The size of the physical address space of a processor is $2^P$ bytes. The word length is $2^W$ bytes. The capacity of cache memory is $2^N$ bytes. The size of each cache block is $2^M$ words. For a K-way set-associative cache memory, the length (in number of bits) of the tag field is $P-N- \log_2K$ $P-N+ \log_2 K$ $P-N-M-W- \log_2 K$ $P-N-M-W+ \log_2 K$
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$. For an unrestricted grammar $G$ and a string $w$, whether $w \in L(G)$ Given a Turing machine $M$, ... following statement is correct? Only I and II are undecidable Only II is undecidable Only II and IV are undecidable Only I, II and III are undecidable