Recent questions tagged goclasses2023-iiith-mock-1 / GATE Overflow for GATE CSE

1 votes

1 answer

1

GO Classes 2023 | IIITH Mock Test 1 | Question: 1
Let $\text{R}$ be a relation from a set $\text{A}$ to a set $\text{B}.$ The inverse relation from $\text{B}$ to $\text{A},$ denoted by $\text{R}^{-1},$ is the set of ordered pairs $\{(b,a) \mid (a,b) \in R\}$ ... $\text{S1}$ Only $\text{S2}$ Both $\text{S1}$ and $\text{S2}$ None of the above

Let $\text{R}$ be a relation from a set $\text{A}$ to a set $\text{B}.$ The inverse relation from $\text{B}$ to $\text{A},$ denoted by $\text{R}^{-1},$ is the set of orde...

GO Classes

741 views

GO Classes asked Mar 26, 2023

4 votes

2 answers

2

GO Classes 2023 | IIITH Mock Test 1 | Question: 2
Given a set of values $\text{R} = \{1,2,3,4,5,6,7\}.$ The number of relations on this set which are both partial-order and equivalence relation is? $128$ $1$ $0$ $2^{42}$

Given a set of values $\text{R} = \{1,2,3,4,5,6,7\}.$ The number of relations on this set which are both partial-order and equivalence relation is?$128$$1$$0$$2^{42}$

GO Classes

794 views

GO Classes asked Mar 26, 2023

6 votes

2 answers

3

GO Classes 2023 | IIITH Mock Test 1 | Question: 3
Let $\text{G}$ be a graph on $10$ vertices. We delete one vertex from $\text{G}.$ Since we have $10$ vertices, hence we get $10$ different subgraphs depending on which vertex we have deleted. Suppose that the number of edges in the vertex-deleted subgraphs of ... $\text{G}?$ $14$ $16$ $13$ $15$

Let $\text{G}$ be a graph on $10$ vertices. We delete one vertex from $\text{G}.$ Since we have $10$ vertices, hence we get $10$ different subgraphs depending on which ve...

GO Classes

948 views

GO Classes asked Mar 26, 2023

3 votes

2 answers

4

GO Classes 2023 | IIITH Mock Test 1 | Question: 4
How many ways are there to arrange the $12$ letters of $\text{AAABBBBCCCCC}$ without having two $\text{Cs}$ together? $2652$ $1960$ $1826$ $2260$

How many ways are there to arrange the $12$ letters of $\text{AAABBBBCCCCC}$ without having two $\text{Cs}$ together?$2652$$1960$$1826$$2260$

GO Classes

742 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

5

GO Classes 2023 | IIITH Mock Test 1 | Question: 5
$(\text{Q}, \ast)$ is an algebraic structure where $\text{Q}$ represents rational numbers and $\ast$ denotes multiplication. Which one of the following statements is true? $\text{Q}$ is an abelian group. $\text{Q}$ is a group but not abelian. $\text{Q}$ is a semigroup but not a monoid. $\text{Q}$ is monoid but not group.

$(\text{Q}, \ast)$ is an algebraic structure where $\text{Q}$ represents rational numbers and $\ast$ denotes multiplication. Which one of the following statements is true...

GO Classes

638 views

GO Classes asked Mar 26, 2023

2 votes

1 answer

6

GO Classes 2023 | IIITH Mock Test 1 | Question: 6
What will be the output of the following C program? #include<stdio.h> int main(){ int x=3; int y; switch(x++){ x++; case 3: printf("Three %d",x); break; case 4: printf("Four %d",x); break; case 5: printf("Five %d",x); break; default: printf("Default %d",x); } } Three $3$ Four $4$ Three $4$ Four $5$

What will be the output of the following C program?#include<stdio.h int main(){ int x=3; int y; switch(x++){ x++; case 3: printf("Three %d",x); break; case 4: printf("Fou...

GO Classes

744 views

GO Classes asked Mar 26, 2023

2 votes

3 answers

7

GO Classes 2023 | IIITH Mock Test 1 | Question: 7
If $x$ is a one dimensional array, then $^*(x+i)$ is same as $^*(\&x[i])$ $\&x[i]$ is same as $x+i-1$ $^*(x+i)$ is same as $^*x[i]$ $^*(x+i)$ is same as $^*x+i$

If $x$ is a one dimensional array, then$^*(x+i)$ is same as $^*(\&x[i])$$\&x[i]$ is same as $x+i-1$$^*(x+i)$ is same as $^*x[i]$$^*(x+i)$ is same as $^*x+i$

GO Classes

600 views

GO Classes asked Mar 26, 2023

4 votes

2 answers

8

GO Classes 2023 | IIITH Mock Test 1 | Question: 8
If we have an array of size $\mathrm{N}$ with only $3$ different values for its elements, what is the probability that the first partition results in a completely sorted array? Assume there are an equal number of each element in the array. $1 / 2$ $1 / 3$ $1 / 4$ $2 / 3$

If we have an array of size $\mathrm{N}$ with only $3$ different values for its elements, what is the probability that the first partition results in a completely sorted ...

GO Classes

780 views

GO Classes asked Mar 26, 2023

2 votes

1 answer

9

GO Classes 2023 | IIITH Mock Test 1 | Question: 9
Let $T(n)=4 T(n / 3)+n^{\log _{3} 4}.$ What will be asymptotic bound on $T(n)?$ $T(n)=\Theta\left(n^{\log _{3} 4} \log n\right)$ $T(n)=\Theta(n \log n)$ $T(n)=\Theta\left(4^{\log _{3} n} \log \log n\right)$ None of these

Let $T(n)=4 T(n / 3)+n^{\log _{3} 4}.$ What will be asymptotic bound on $T(n)?$$T(n)=\Theta\left(n^{\log _{3} 4} \log n\right)$$T(n)=\Theta(n \log n)$$T(n)=\Theta\left(4^...

GO Classes

569 views

GO Classes asked Mar 26, 2023

2 votes

1 answer

10

GO Classes 2023 | IIITH Mock Test 1 | Question: 10
$\text{G}$ is a directed graph with negative weight edges but NO negative weight cycles. Which of the following hold for Dijkstra's algorithm on $\text{G}:$ Dijkstra's algo will always give the correct output since there is no ... if we add large positive weight to every edge then it will work. Dijkstra's algo may not terminate in this case.

$\text{G}$ is a directed graph with negative weight edges but NO negative weight cycles. Which of the following hold for Dijkstra’s algorithm on $\text{G}:$Dijkstra’s...

GO Classes

672 views

GO Classes asked Mar 26, 2023

1 votes

2 answers

11

GO Classes 2023 | IIITH Mock Test 1 | Question: 11
Suppose that a MST of the following edge-weighted graph contains the edges with weights $x, y$, and $z$. What will be the maximum value of $x+y+z?$ $200$ $250$ $300$ $350$

Suppose that a MST of the following edge-weighted graph contains the edges with weights $x, y$, and $z$.What will be the maximum value of $x+y+z?$$200$$250$$300$$350$

GO Classes

860 views

GO Classes asked Mar 26, 2023

7 votes

1 answer

12

GO Classes 2023 | IIITH Mock Test 1 | Question: 12
A list of $n$ arrays, each of length $n$, is passed to an algorithm like merge-sort. The algorithm recursively divides a set of arrays into two parts until there are only two arrays. If there are two arrays, then, as a base case, the algorithm combines or merges both in cost of ... $T(n)=2 T(n / 2)+n$ $T(n)=2 T(n / 2)+n^ 3$ None of these

A list of $n$ arrays, each of length $n$, is passed to an algorithm like merge-sort. The algorithm recursively divides a set of arrays into two parts until there are only...

GO Classes

1.1k views

GO Classes asked Mar 26, 2023

3 votes

0 answers

13

GO Classes 2023 | IIITH Mock Test 1 | Question: 13
Arrange the following functions in their increasing order of growth. In options $\log ^{2} n$ means $(\log n)^{2}$ $\log (n !), \log ^{2} n, (\lg n) !, e^{n}$ $\log (n !), \log ^{2} n, e^{n}, (\lg n) !$ $\log ^{2} n, \log (n !), (\lg n) !, e^{n}$ $\log ^{2} n, (\lg n) !, \log (n !), e^{n}$

Arrange the following functions in their increasing order of growth. In options $\log ^{2} n$ means $(\log n)^{2}$$\log (n !), \log ^{2} n, (\lg n) !, e^{n}$$\log (n !)...

GO Classes

647 views

GO Classes asked Mar 26, 2023

3 votes

0 answers

14

GO Classes 2023 | IIITH Mock Test 1 | Question: 14
Consider a perfect binary tree with $\mathrm{n}$ nodes and $\mathrm{h}$ height. A tree is perfect when all levels of the tree are completely full. Let root is at depth $0$ and leaves are at height $0.$ Assume Expected height of any ... $S1$ is correct but $S2$ is incorrect $S1$ is incorrect but $S2$ is correct Both are correct Both are incorrect

Consider a perfect binary tree with $\mathrm{n}$ nodes and $\mathrm{h}$ height. A tree is perfect when all levels of the tree are completely full. Let root is at depth $0...

GO Classes

718 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

15

GO Classes 2023 | IIITH Mock Test 1 | Question: 15
In an array-based implementation of a Heap, the right-child of the right-child of the node at index $i,$ if it exists, can be found at what array location? Index of the array starts from $1.$ $4i + 3$ $2i + 1$ $4i + 1$ $2i + 2$

In an array-based implementation of a Heap, the right-child of the right-child of the node at index $i,$ if it exists, can be found at what array location? Index of the a...

GO Classes

903 views

GO Classes asked Mar 26, 2023

2 votes

4 answers

16

GO Classes 2023 | IIITH Mock Test 1 | Question: 16
Consider a hash table of $9$ slots implemented with linear probing. Suppose we insert $2$ elements in a sequence to a hash table with a simple uniform hashing assumption. What is the probability that we end up with $2$ consecutive slots of the hash table filled? ... $1/2$ $1/3$ $1/4$ $2/3$

Consider a hash table of $9$ slots implemented with linear probing. Suppose we insert $2$ elements in a sequence to a hash table with a simple uniform hashing assumption....

GO Classes

894 views

GO Classes asked Mar 26, 2023

2 votes

1 answer

17

GO Classes 2023 | IIITH Mock Test 1 | Question: 17
Consider the following ER diagram : borrower mapping cardinality is many-to-many. While converting the ER diagram into a relational DBMS model, the relationship set borrower is converted into a relation borrower(cust_id, loan_id, ... , what is the primary key of borrower ? cust_id loan_id (cust_id, loan_id) (cust_id, loan_id, access_date)

Consider the following ER diagram :“borrower” mapping cardinality is many-to-many. While converting the ER diagram into a relational DBMS model, the relationship set ...

GO Classes

682 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

18

GO Classes 2023 | IIITH Mock Test 1 | Question: 18
Consider the following schema: ... have reserved a blue AND a white boat. The names of sailors who have reserved neither a blue nor a white boat. Empty set.

Consider the following schema:$$\begin{array} {l} \text{Sailors}(\; \underline{\textit{sid: } \textsf{integer}}, \textit{ sname: } \textsf{string}, \textit{ rating: } \te...

GO Classes

550 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

19

GO Classes 2023 | IIITH Mock Test 1 | Question: 19
Assume by "Serializability", we mean "Conflict Serializability". For the given schedule, which of the following is TRUE? $\text{T}_1$ $\text{T}_2$ $\text{T}_3$ $\text{T}_4$ Read(A) Read(A) Read(A) Write(B) Write(A) Read ... $\text{T}_2, \text{T}_3, \text{T}_1, \text{T}_4$

Assume by "Serializability", we mean "Conflict Serializability".For the given schedule, which of the following is TRUE?$\text{T}_1$$\text{T}_2$$\text{T}_3$$\text{T}_4$ ...

GO Classes

571 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

20

GO Classes 2023 | IIITH Mock Test 1 | Question: 20
The routing table below uses the longest prefix match in its routing decisions. ...

The routing table below uses the longest prefix match in its routing decisions.$$\begin{array}{|c|c|}\hline \text{Network Address/Length} & \text{Next Hop} \\\hline \hlin...

GO Classes

568 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

21

GO Classes 2023 | IIITH Mock Test 1 | Question: 21
A protocol used by a router or destination host to communicate with the source, typically to report errors in IP datagram processing. ARP ICMP TCP DNS

A protocol used by a router or destination host to communicate with the source, typically to report errors in IP datagram processing.ARPICMPTCPDNS

GO Classes

492 views

GO Classes asked Mar 26, 2023

2 votes

1 answer

22

GO Classes 2023 | IIITH Mock Test 1 | Question: 22
Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$ If the network follows link state routing algorithm to determine next hop for least cost path then which constraints on $x$ and $y$ guarantee traffic from $\text{B}$ to $\text{C}$ will always flow through node $\text{A}?$ $x>4$ $y+x<6$ $y+x<4$ $x<4$

Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$If the network follows link state routing algorithm to determine next hop for least cost ...

GO Classes

679 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

23

GO Classes 2023 | IIITH Mock Test 1 | Question: 23
TCP connection termination using three-way handshaking is shown below. Consider the following statements about this termination: Between $\text{B}$ and $\text{C},$ both-way communication is possible. Between $\text{B}$ and $\text{C, T}$ can still ... the above statements is/are true? II only I, III, and IV only I and II only II, III, and IV only

TCP connection termination using three-way handshaking is shown below.Consider the following statements about this termination:Between $\text{B}$ and $\text{C},$ both-way...

GO Classes

615 views

GO Classes asked Mar 26, 2023

2 votes

1 answer

24

GO Classes 2023 | IIITH Mock Test 1 | Question: 24
Which of the following statements are true about TCP? It is a byte-oriented port-to-port communication It uses flow control mechanism protocol Its connections are link to link and full duplex It uses piggybacking whenever possible (i), (iii) and (iv) only (i), (ii) and (iv) only (ii), (iii) and (iv) only All of the given

Which of the following statements are true about TCP?It is a byte-oriented port-to-port communicationIt uses flow control mechanism protocolIts connections are link to li...

GO Classes

555 views

GO Classes asked Mar 26, 2023

1 votes

0 answers

25

GO Classes 2023 | IIITH Mock Test 1 | Question: 25
What do persistent connections refer to in the context of HTTP? A single TCP connection is used to send and receive multiple HTTP requests and responses. A single HTTP connection is used to send and receive multiple IP requests ... HTTP request and response. A single HTTP connection is used to send and receive multiple TCP requests and responses.

What do persistent connections refer to in the context of HTTP?A single TCP connection is used to send and receive multiple HTTP requests and responses.A single HTTP conn...

GO Classes

428 views

GO Classes asked Mar 26, 2023

2 votes

2 answers

26

GO Classes 2023 | IIITH Mock Test 1 | Question: 26
Four processes- $\text{P}_1, \text{P}_2, \text{P}_3,$ and $\text{P}_4-$ ... -job-first scheduling algorithm, what is the average waiting time for the four processes, in seconds? $2$ $3$ $4$ $5$

Four processes- $\text{P}_1, \text{P}_2, \text{P}_3,$ and $\text{P}_4-$ are scheduled to use a single processor. The following table shows the arrival time and duration o...

GO Classes

1.1k views

GO Classes asked Mar 26, 2023

3 votes

3 answers

27

GO Classes 2023 | IIITH Mock Test 1 | Question: 27
When a process creates a new process using the $\textsf{fork()}$ operation, which of the following are shared between the parent process and the child process? Stack Heap Shared memory segments Page table

When a process creates a new process using the $\textsf{fork()}$ operation, which of the following are shared between the parent process and the child process?StackHeapSh...

GO Classes

794 views

GO Classes asked Mar 26, 2023

2 votes

1 answer

28

GO Classes 2023 | IIITH Mock Test 1 | Question: 28
Given the following piece of code: main(int argc, char ** argv) { int child = fork(); int c = 5; if(child == 0) { c += 5; } else { child = fork(); c += 10; if(child) c += 5; } } How many different copies of the variable $\textsf{c}$ are there? $2$ $3$ $4$ $1$

Given the following piece of code:main(int argc, char argv) { int child = fork(); int c = 5; if(child == 0) { c += 5; } else { child = fork(); c += 10; if(child) c += 5...

GO Classes

706 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

29

GO Classes 2023 | IIITH Mock Test 1 | Question: 29
Consider a system with $\mathrm{N}$ bytes of physical RAM, and $\mathrm{M}$ bytes of virtual address space per process. Pages and frames are $\text{K}$ bytes in size. Every page table entry is $\mathrm{P}$ bytes in size, accounting for the extra flags ... $\mathrm{M} / \mathrm{K} \ast \mathrm{P}$ $\mathrm{N} / \mathrm{P} \ast \mathrm{~K}$

Consider a system with $\mathrm{N}$ bytes of physical RAM, and $\mathrm{M}$ bytes of virtual address space per process. Pages and frames are $\text{K}$ bytes in size. Eve...

GO Classes

754 views

GO Classes asked Mar 26, 2023

3 votes

1 answer

30

GO Classes 2023 | IIITH Mock Test 1 | Question: 30
A $\text{10-unit}$ ...

A $\text{10-unit}$ heap of memory uses an allocation algorithm in which a block is allocated at the left end of the leftmost block in which it fits. Which of the followin...

GO Classes

569 views

GO Classes asked Mar 26, 2023

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true