Questions by Arjun

3 votes

1 answer

1

Best Open Video Playlist for Recurrence relation Topic | Discrete Mathematics
Please list out the best free available video playlist for Recurrence relation Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom ... ones are more likely to be selected as best. For the full list of selected videos please see here

asked in Study Resources Aug 8, 2022

153 views

1 vote

0 answers

2

Can anyone explain about the User Circles feature on GO site?
This is part of the site features explanation videos contest as explained here

asked in Others Feb 28, 2022

206 views

0 votes

0 answers

3

Can anyone explain about the free resources available on GO classroom in a video?
This is part of the site features explanation videos contest as explained here

asked in Others Feb 28, 2022

172 views

0 votes

0 answers

4

Can anyone explain about GO PDFs (using GO 2022 PDFs) in a video?
This is part of the site features explanation videos contest as explained here

asked in Others Feb 28, 2022

151 views

0 votes

1 answer

5

Can anyone explain about the free exams on GO site in a video?
This is part of the site features explanation videos contest as explained here Exam links: https://gateoverflow.in/blog/5682/list-of-available-exams

asked in Others Feb 28, 2022

319 views

0 votes

0 answers

6

Can anyone explain Userlists on GO site in a video tutorial?
This is part of the site features explanation videos contest as explained here

asked in Others Feb 28, 2022

335 views

20 votes

1 answer

7

GATE CSE 2022 | Question: 1
Which one of the following statements is $\text{TRUE}$ for all positive functions $f(n)?$ $f(n^{2}) = \theta (f(n)^{2}),$ when $f(n)$ is a polynomial $f(n^{2}) = o (f(n)^{2})$ $f(n^{2}) = O (f(n)^{2}),$ when $f(n)$ is an exponential function $f(n^{2}) = \Omega (f(n)^{2})$

asked in Algorithms Feb 15, 2022

7.1k views

23 votes

4 answers

8

GATE CSE 2022 | Question: 2
Which one of the following regular expressions correctly represents the language of the finite automaton given below? $ab^{\ast}bab^{\ast} + ba^{\ast}aba^{\ast}$ $(ab^{\ast}b)^{\ast}ab^{\ast} + (ba^{\ast}a)^{\ast} ba^{\ast}$ $(ab^{\ast}b + ba^{\ast}a)^{\ast} (a^{\ast} + b^{\ast})$ $(ba^{\ast}a + ab^{\ast}b)^{\ast} (ab^{\ast} + ba^{\ast})$

asked in Theory of Computation Feb 15, 2022

6.4k views

7 votes

1 answer

9

GATE CSE 2022 | Question: 3
Which one of the following statements is $\text{TRUE}?$ The $\textit{LALR}(1)$ parser for a grammar $\textit{G}$ cannot have reduce-reduce conflict if the $\textit{LR}(1)$ parser for $\textit{G}$ does not have reduce-reduce ... Data flow analysis is necessary for run-time memory management. $\textit{LR}(1)$ parsing is sufficient for deterministic context-free languages.

asked in Compiler Design Feb 15, 2022

3.1k views

8 votes

2 answers

10

GATE CSE 2022 | Question: 4
In a relational data model, which one of the following statements is $\text{TRUE}?$ A relation with only two attributes is always in $\text{BCNF}.$ If all attributes of a relation are prime attributes, then the relation is in $\text{BCNF}.$ Every relation has at least one non-prime attribute. $\text{BCNF}$ decompositions preserve functional dependencies.

asked in Databases Feb 15, 2022

3.1k views

9 votes

3 answers

11

GATE CSE 2022 | Question: 5
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is $\text{TRUE}$ about the time complexity of algorithms that solve the above problem ... $O(1)$ space.

asked in DS Feb 15, 2022

3.6k views

11 votes

1 answer

12

GATE CSE 2022 | Question: 6
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ for the odd keys and $h_{2}$ for the even keys. What is the expected number of keys in a slot? $\frac{m}{n}$ $\frac{n}{m}$ $\frac{2n}{m}$ $\frac{n}{2m}$

asked in Algorithms Feb 15, 2022

4.4k views

6 votes

3 answers

13

GATE CSE 2022 | Question: 7
Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput? $\text{DMA}$ based $\text{I/O}$ transfer Interrupt driven $\text{I/O}$ transfer Polling based $\text{I/O}$ transfer Programmed $\text{I/O}$ transfer

asked in CO and Architecture Feb 15, 2022

2.2k views

6 votes

3 answers

14

GATE CSE 2022 | Question: 8
Let $\text{R1}$ and $\text{R2}$ be two $4 - \text{bit}$ registers that store numbers in $2\text{'s}$ complement form. For the operation $\text{R1 + R2},$ which one of the following values of $\text{R1}$ and $\text{R2}$ ... and $\text{R2 = 1010}$ $\text{R1 = 0011}$ and $\text{R2 = 0100}$ $\text{R1 = 1001}$ and $\text{R2 = 1111}$

asked in Digital Logic Feb 15, 2022

3.3k views

10 votes

3 answers

15

GATE CSE 2022 | Question: 9
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\text{S}_{1}, \text{S}_{2},$ and $\text{S}_{3},$ operated upon using standard $\textsf{wait}()$ ... $\text{S}_{1} = 0; \text{S}_{2} = 1; \text{S}_{3} = 1$

asked in Operating System Feb 15, 2022

4.6k views

8 votes

2 answers

16

GATE CSE 2022 | Question: 10
Consider the following two statements with respect to the matrices $\textit{A}_{m \times n}, \textit{B}_{n \times m}, \textit{C}_{n \times n}$ and $ \textit{D}_{n \times n}.$ Statement $1: tr \text{(AB)} = tr \text{(BA)}$ ... $2$ is correct. Both Statement $1$ and Statement $2$ are correct. Both Statement $1$ and Statement $2$ are wrong.

asked in Linear Algebra Feb 15, 2022

3.5k views

7 votes

2 answers

17

GATE CSE 2022 | Question: 11
What is printed by the following $\text{ANSI C}$ program? #include<stdio.h> int main(int argc, char *argv[]) { int x = 1, z[2] = {10, 11}; int *p = NULL; p = &x; *p = 10; p = &z[1]; *(&z[0] + 1) += 3; printf(“%d, %d, %d\n”, x, z[0], z[1]); return 0; } $1, 10, 11$ $1, 10, 14$ $10, 14, 11$ $10, 10, 14$

asked in Programming Feb 15, 2022

2.3k views

10 votes

3 answers

18

GATE CSE 2022 | Question: 12
Consider an enterprise network with two Ethernet segments, a web server and a firewall, connected via three routers as shown below. What is the number of subnets inside the enterprise network? $3$ $12$ $6$ $8$

asked in Computer Networks Feb 15, 2022

7.1k views

4 votes

2 answers

19

GATE CSE 2022 | Question: 13
Which of the following statements is/are $\text{TRUE}?$ Every subset of a recursively enumerable language is recursive. If a language $\textit{L}$ and its complement $\overline{\textit{L}}$ are both recursively enumerable, then $\textit{L}$ must be recursive. ... $\textit{L}_{1} \cap \textit{L}_{2}$ must be deterministic context-free.

asked in Theory of Computation Feb 15, 2022

5.8k views

12 votes

1 answer

20

GATE CSE 2022 | Question: 14
Let $\text{WB}$ and $\text{WT}$ be two set associative cache organizations that use $\text{LRU}$ algorithm for cache block replacement. $\text{WB}$ is a write back cache and $\text{WT}$ ... cache to main memory. A read miss in $\text{WB}$ will never lead to eviction of a dirty block from $\text{WB}.$

asked in CO and Architecture Feb 15, 2022

3.2k views

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

Questions by Arjun

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Subjects

Questions by Arjun

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Recent Posts

Subjects

Recent Blog Comments