menu
Recent questions tagged gate2020-cs
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate2020-cs
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged gate2020-cs
0
votes
0
answers
55
views
Gate Notes - Others
Can I use Manu Thakur standard book notes in place of standard books? If anyone has used them, then, please help!!
gk_8235
asked
in
Study Resources
May 1, 2021
by
gk_8235
5
points
55
views
gate2020-cs
0
votes
1
answer
101
views
Preparation Strategy Doubt
Can Someone please suggest good Gate CS Short Notes?
Aaftab V
asked
in
GATE
Jan 22, 2021
by
Aaftab V
5
points
101
views
gate2020-cs
0
votes
0
answers
51
views
GATE 2022 Preparation
Hello everyone, I am currently final year student in tier 3 college, I paid moderate attention to my studies during my first 2 years so my aggregate CGPA is down to 6. I am interested in AL/ML domain but it's really hard to find job and I think if ... and I read so much good stuff about it so please help me through this problem so I can prepare clearly. Thank you for reading!
jp2373
asked
in
GATE
Jan 22, 2021
by
jp2373
5
points
51
views
gate2020-cs
self-doubt
preperation
1
vote
0
answers
39
views
please guide me sir or maam please
I'm from third year computer science branch and I have filled the gate form 2021 in full Hosh but as time passed away the Hosh also gone and I haven't studied a single page yet and sir now I'm getting tensed as how will I qualify this gate exam. ... and help how to prepare for gate in this last 50 days so that I qualify and get the rank. Please sir help me out.
shekhawat_tarun7773
asked
in
GATE
Dec 18, 2020
by
shekhawat_tarun7773
9
points
39
views
gate2020-cs
2
votes
2
answers
359
views
UGC NET 2020 CSE
fork(); printf(“1”); fork(); printf(“2”); fork(); printf(“3”); Above question is similar to the UGC NET 2020 question. I have changed the content of printf(“ ”) statements for my better understanding. What will be the output of the above code? Can anyone explain me above code clearly? Original question had all printf(“ ”) statements with hello inside the quotes.
tanmaybhadra
asked
in
Operating System
Dec 5, 2020
by
tanmaybhadra
13
points
359
views
ugc-net
gate2020-cs
fork
1
vote
1
answer
790
views
GATE2020-CS-53 Video Solution
Consider a paging system that uses $1$-level page table residing in main memory and a TLB for address translation. Each main memory access takes $100$ ns and TLB lookup takes $20$ ns. Each page transfer to/from the disk takes $5000$ ns. ... from disk. TLB update time is negligible. The average memory access time in ns (round off to $1$ decimal places) is ___________
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
790
views
gate2020-cs
numerical-answers
operating-system
video-solution
1
vote
1
answer
180
views
GATE2020-CS-16 Video Solution
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
180
views
gate2020-cs
linked-lists
video-solution
1
vote
1
answer
85
views
GATE2020-CS-21 Video Solution
A direct mapped cache memory of $1$ MB has a block size of $256$ bytes. The cache has an access time of $3$ ns and a hit rate of $94 \%$. During a cache miss, it takes $2$0 ns to bring the first word of a block from the main memory, while ... word takes $5$ ns. The word size is $64$ bits. The average memory access time in ns (round off to $1$ decimal place) is______.
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
85
views
gate2020-cs
numerical-answers
co-and-architecture
video-solution
1
vote
1
answer
146
views
GATE2020-CS-37 Video Solution
Consider a schedule of transactions $T_1$ and $T_2$ ...
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
146
views
gate2020-cs
databases
video-solution
1
vote
1
answer
110
views
GATE2020-CS-7 Video Solution
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
110
views
gate2020-cs
regular-expressions
normal
theory-of-computation
video-solution
0
votes
0
answers
45
views
GATE2020-CS-39 Video Solution
Which one of the following predicate formulae is NOT logically valid? Note that $W$ is a predicate formula without any free occurrence of $x$. $\forall x (p(x) \vee W) \equiv \forall x \: ( px) \vee W$ ... $\exists x(p(x) \rightarrow W) \equiv \forall x \: p(x) \rightarrow W$
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
45
views
gate2020-cs
engineering-mathematics
video-solution
1
vote
1
answer
62
views
GATE2020-CS-2 Video Solution
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is $\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$) $\Theta (\log_{b} \log_{a} \: n$) $\Theta (\log_{2} \log_{2} n$)
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
62
views
gate2020-cs
algorithms
video-solution
0
votes
0
answers
27
views
GATE2020-CS-40 Video Solution
Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in E$, define ${w}'(u,v)$ as $w(u,v)+f(u)-f(v)$. Which one of the ... from $s$ to $u$ in the graph obtained by adding a new vertex $s$ to $G$ and edges of zero weight from $s$ to every vertex of $G$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
27
views
gate2020-cs
algorithms
video-solution
0
votes
0
answers
31
views
GATE2020-CS-GA-1 Video Solution
Raman is confident of speaking English _______six months as he has been practising regularly_______the last three weeks during, for for, since for, in within, for
admin
asked
in
Verbal Ability
Apr 18, 2020
by
admin
585
points
31
views
gate2020-cs
video-solution
0
votes
0
answers
26
views
GATE2020-CS-1 Video Solution
Consider the functions $e^{-x}$ $x^{2}-\sin x$ $\sqrt{x^{3}+1}$ Which of the above functions is/are increasing everywhere in $[ 0,1]$? Ⅲ only Ⅱ only Ⅱ and Ⅲ only Ⅰ and Ⅲ only
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
26
views
gate2020-cs
engineering-mathematics
video-solution
1
vote
1
answer
63
views
GATE2020-CS-38 Video Solution
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space $202.61.0.0/17$. The ... $202.61.144.0/21$ I and II only II and III only III and IV only I and IV only
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
63
views
gate2020-cs
computer-networks
subnetting
video-solution
0
votes
0
answers
22
views
GATE2020-CS-42 Video Solution
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
admin
asked
in
Combinatory
Apr 18, 2020
by
admin
585
points
22
views
gate2020-cs
numerical-answers
engineering-mathematics
video-solution
1
vote
1
answer
65
views
GATE2020-CS-31 Video Solution
Let $G = (V, G)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) \in V \times V$ is added to $G$. The worst case time complexity of determining if $T$ is still an MST ... $\Theta(E \mid \log \mid V \mid) \\$ $\Theta( \mid V \mid)$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
65
views
gate2020-cs
algorithms
video-solution
0
votes
1
answer
58
views
GATE2020-CS-GA-3 Video Solution
Select the word that fits the analogy: Cook : Cook :: Fly : _______ Flyer Flying Flew Flighter
admin
asked
in
Verbal Ability
Apr 18, 2020
by
admin
585
points
58
views
gate2020-cs
word-pairs
verbal-ability
video-solution
0
votes
0
answers
25
views
GATE2020-CS-41 Video Solution
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
25
views
gate2020-cs
data-structures
video-solution
1
vote
1
answer
37
views
GATE2020-CS-23 Video Solution
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Assume that the table size is $23$. Then the address returned by probe $1$ in the probe sequence (assume that the probe sequence begins at probe $0$) for key value $k=90$ is_____________.
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
37
views
gate2020-cs
numerical-answers
algorithms
hashing
video-solution
0
votes
0
answers
27
views
GATE2020-CS-3 Video Solution
Consider the following statements. Daisy chaining is used to assign priorities in attending interrupts. When a device raises a vectored interrupt, the CPU does polling to identify the source of interrupt. In polling,the CPU periodically checks the status bits to know if any ... . Which of the above statements is/are TRUE? Ⅰ and Ⅱ only Ⅰ and Ⅳ only Ⅰ and Ⅲ only Ⅲ only
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
27
views
gate2020-cs
co-and-architecture
video-solution
0
votes
0
answers
62
views
GATE2020-CS-9 Video Solution
Consider the following statements. Symbol table is accessed only during lexical analysis and syntax analysis. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment. Errors violating the condition any ... the above statements is/are TRUE? I only I and III only Ⅱ only None of Ⅰ, Ⅱ and Ⅲ
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
62
views
gate2020-cs
compiler-design
video-solution
1
vote
1
answer
33
views
GATE2020-CS-10 Video Solution
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements. $L$ is deterministic context-free. $L$ is context-free but not deterministic context-free. $L$ is not $LL(k)$ for any $k$. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Ⅰ and Ⅲ only Ⅲ only
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
33
views
gate2020-cs
theory-of-computation
video-solution
1
vote
1
answer
49
views
GATE2020-CS-20 Video Solution
If there are $m$ input lines $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is ________ .
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
49
views
gate2020-cs
numerical-answers
digital-logic
video-solution
1
vote
1
answer
50
views
GATE2020-CS-43 Video Solution
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this processor. Overheads associated with pipelining force you to ... , the speedup achieved by the pipelined processor over the non-pipelined processor (round off to $2$ decimal places) is_____________.
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
50
views
gate2020-cs
numerical-answers
co-and-architecture
video-solution
1
vote
1
answer
181
views
GATE2020-CS-34 Video Solution
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shared variable initialized to $0$ and not used in CODE SECTION P. ... all processes execute CODE SECTION P mutually exclusively. It ensures that at most $n-1$ processes are in CODE SECTION P at any time.
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
181
views
gate2020-cs
operating-system
semaphores
video-solution
0
votes
0
answers
22
views
GATE2020-CS-52 Video Solution
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is _______
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
22
views
gate2020-cs
numerical-answers
grab
graph-theory
video-solution
1
vote
1
answer
42
views
GATE2020-CS-44 Video Solution
A processor has $64$ registers and uses $16$-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a $4$-bit immediate value. Each R-type instruction ... two register names. If there are $8$ distinct I-type opcodes, then the maximum number of distinct R-type opcodes is _______.
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
42
views
gate2020-cs
numerical-answers
instruction-format
machine-instructions
video-solution
1
vote
1
answer
53
views
GATE2020-CS-54 Video Solution
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ ... that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
53
views
gate2020-cs
numerical-answers
databases
video-solution
1
vote
1
answer
43
views
GATE2020-CS-5 Video Solution
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree? $10,11,12,15,16,18,19,20$ $11,12,10,16,19,18,20,15$ $20,19,18,16,15,12,11,10$ $19,16,18,20,11,12,10,15$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
43
views
gate2020-cs
binary-search-tree
video-solution
1
vote
1
answer
30
views
GATE2020-CS-17 Video Solution
Let $\mathcal{R}$ be the set of all binary relations on the set $\{1,2,3\}$. Suppose a relation is chosen from $\mathcal{R}$ at random. The probability that the chosen relation is reflexive (round off to $3$ decimal places) is ______.
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
30
views
gate2020-cs
numerical-answers
probability
video-solution
0
votes
0
answers
20
views
GATE2020-CS-GA-2 Video Solution
His knowledge of the subject was excellent but his classroom performance was_______. extremely poor good desirable praiseworthy
admin
asked
in
Verbal Ability
Apr 18, 2020
by
admin
585
points
20
views
gate2020-cs
video-solution
1
vote
1
answer
41
views
GATE2020-CS-55 Video Solution
Consider a TCP connection between a client and a server with the following specifications; the round trip time is $6$ ms, the size of the receiver advertised window is $50$ KB, slow-start threshold at the client is $32$ KB, and the maximum segment ... size of the congestion window (in $\text{KB}$) at time $t+60$ ms after all acknowledgements are processed is _______
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
41
views
gate2020-cs
numerical-answers
computer-networks
video-solution
1
vote
1
answer
56
views
GATE2020-CS-29 Video Solution
Consider three registers $R1$, $R2$, and $R3$ that store numbers in $IEEE-754$ single precision floating point format. Assume that $R1$ and $R2$ contain the values (in hexadecimal notation) $0x42200000$ and $0xC1200000$, respectively. If $R3=\frac{R1}{R2}$, what is the value stored in $R3$? $0x40800000$ $0xC0800000$ $0x83400000$ $0xC8500000$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
56
views
gate2020-cs
floating-point-representation
video-solution
0
votes
0
answers
16
views
GATE2020-CS-GA-7 Video Solution
If $P = 3$, $R = 27$, $T = 243$, then $Q + S =$ ________ $40$ $80$ $90$ $110$
admin
asked
in
Verbal Ability
Apr 18, 2020
by
admin
585
points
16
views
gate2020-cs
video-solution
0
votes
0
answers
21
views
GATE2020-CS-4 Video Solution
Consider the following data path diagram. Consider an instruction: $R0 \leftarrow R1 +R2$. The following steps are used to execute it over the given data path. Assume that PC is incremented appropriately. The subscripts $r$ and $w$ ... of the above steps? $2,1,4,5,3$ $1,2,4,3,5$ $3,5,2,1,4$ $3,5,1,2,4$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
21
views
gate2020-cs
co-and-architecture
data-path
video-solution
1
vote
1
answer
157
views
GATE2020-CS-48 Video Solution
Consider the following C functions. int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } return (i); } int pp(int a, int b) { int arr[20]; int i, tot = 1, ex, len; ex = a; len = tob( ... ; i<len ; i++) { if (arr[i] ==1) tot = tot * ex; ex= ex*ex; } return (tot) ; } The value returned by $pp(3,4)$ is _______.
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
157
views
gate2020-cs
numerical-answers
programming-in-c
video-solution
1
vote
1
answer
51
views
GATE2020-CS-22 Video Solution
Consider the following C program. #include <stdio.h> int main () { int a[4] [5] = {{1, 2, 3, 4, 5}, {6, 7,8, 9, 10}, {11, 12, 13, 14, 15}, {16, 17,18, 19, 20}}; printf(“%d\n”, *(*(a+**a+2)+3)); return(0); } The output of the program is _______.
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
51
views
gate2020-cs
numerical-answers
programming-in-c
video-solution
1
vote
1
answer
456
views
GATE2020-CS-46 Video Solution
Consider the following C functions. int fun1(int n) { static int i= 0; if (n > 0) { ++i; fun1(n-1); } return (i); } int fun2(int n) { static int i= 0; if (n>0) { i = i+ fun1 (n) ; fun2(n-1) ; } return (i); } The return value of $\text{fun}2 (5)$ is _________
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
456
views
gate2020-cs
numerical-answers
programming-in-c
video-solution
Page:
1
2
next »
Ask a Question
Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts