Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged memorybased-gatecse2023
1
votes
0
answers
1
GATE CSE 2023 | Memory Based Question: 57
The country of Zombieland is in distress since more than 75% of its working population is suffering from serious health issues. Studies conducted by competent health experts concluded that a complete lack of physical exercise among its working ... as mandatory. (D) The Government of Zombieland believes that riding bicycles is a form of physical exercise.
The country of Zombieland is in distress since more than 75% of its working population is suffering from serious health issues. Studies conducted by competent health expe...
GO Classes
3.2k
views
GO Classes
asked
Feb 8, 2023
Verbal Aptitude
memorybased-gatecse2023
goclasses
verbal-aptitude
passage-reading
+
–
0
votes
2
answers
2
GATE CSE 2023 | Memory Based Question: 11
Let $f(x)=x^3+15 x^2-33 x-36$ be a real valued function. Which statement is/are TRUE? $f(x)$ has a local maximum. $f(x)$ does NOT have a local maximum. $f(x)$ has a local minimum. $f(x)$ does NOT have a local minimum.
Let $f(x)=x^3+15 x^2-33 x-36$ be a real valued function. Which statement is/are TRUE?$f(x)$ has a local maximum.$f(x)$ does NOT have a local maximum.$f(x)$ has a local mi...
GO Classes
3.9k
views
GO Classes
asked
Feb 5, 2023
Calculus
memorybased-gatecse2023
goclasses
calculus
maxima-minima
+
–
4
votes
2
answers
3
GATE CSE 2023 | Memory Based Question: 13
Let $ A=\left[\begin{array}{llll} 1 & 2 & 3 & 4 \\ 4 & 1 & 2 & 3 \\ 3 & 4 & 1 & 2 \\ 2 & 3 & 4 & 1 \end{array}\right] $ ... $\operatorname{det} \mathrm{B}=-\operatorname{det} \mathrm{A}$ $\operatorname{det} \mathrm{A}=\operatorname{det} \mathrm{B}$
Let$$A=\left[\begin{array}{llll}1 & 2 & 3 & 4 \\4 & 1 & 2 & 3 \\3 & 4 & 1 & 2 \\2 & 3 & 4 & 1\end{array}\right]$$And$$B=\left[\begin{array}{llll}3 & 4 & 1 & 2 \\4 & 1 & 2...
GO Classes
2.4k
views
GO Classes
asked
Feb 5, 2023
Linear Algebra
memorybased-gatecse2023
goclasses
linear-algebra
determinant
+
–
0
votes
1
answer
4
GATE CSE 2023 | Memory Based Question: 15
The Lucas sequence $L_n$ is defined by the recurrence relation: $L_n=L_{n-1}+L_{n-2}$, for $n \geq 3$ with $L_1=1$ and $L_2=3$. Which one of the options given is TRUE? $L_n=\left(\frac{1+\sqrt{5}}{2}\right)^n+\left(\frac{1-\sqrt{5}}{3}\right)^n$ ... $L_n=\left(\frac{1+\sqrt{5}}{2}\right)^n+\left(\frac{1-\sqrt{5}}{2}\right)^n$
The Lucas sequence $L_n$ is defined by the recurrence relation:$L_n=L_{n-1}+L_{n-2}$, for $n \geq 3$ with $L_1=1$ and $L_2=3$.Which one of the options given is TRUE?$L_n=...
GO Classes
1.4k
views
GO Classes
asked
Feb 5, 2023
Combinatory
memorybased-gatecse2023
goclasses
combinatory
recurrence-relation
+
–
1
votes
1
answer
5
GATE CSE 2023 | Memory Based Question: 16
How many permutations of $U$ separate $A$ from $B?$ $2\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k) !(k!)^2$ $\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k)!(n!)$ $n!$ $\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k) !(k !)^2$
How many permutations of $U$ separate $A$ from $B?$$2\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k) !(k!)^2$$\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2...
GO Classes
993
views
GO Classes
asked
Feb 5, 2023
Combinatory
memorybased-gatecse2023
goclasses
combinatory
counting
+
–
1
votes
2
answers
6
GATE CSE 2023 | Memory Based Question: 17
Let $x$ be a set, $2^x=$ power $2 \mathrm{k}$ set of $\mathrm{X}$. define A binary operation $\Delta$ on $2^x$ as $A \Delta B=(A-B) \cup(B-A)$. Let $H=\left(2^x, \Delta\right)$, then for every $A \in 2^x$; inverse of $A$ ... $\mathrm{H}$ is a group. $\mathrm{H}$ satisfies inverse prop, but not a group for every $A \in 2^x$; the inverse of $A$ is $A$.
Let $x$ be a set, $2^x=$ power $2 \mathrm{k}$ set of $\mathrm{X}$. define A binary operation $\Delta$ on $2^x$ as $A \Delta B=(A-B) \cup(B-A)$. Let $H=\left(2^x, \Delta\r...
GO Classes
860
views
GO Classes
asked
Feb 5, 2023
Set Theory & Algebra
memorybased-gatecse2023
goclasses
set-theory&algebra
group-theory
multiple-selects
+
–
1
votes
0
answers
7
GATE CSE 2023 | Memory Based Question: 18
In general which of the following CPU scheduling algorithms suffers from starvation? SJF FCFS Round robin Priority
In general which of the following CPU scheduling algorithms suffers from starvation?SJFFCFSRound robinPriority
GO Classes
1.1k
views
GO Classes
asked
Feb 5, 2023
Operating System
memorybased-gatecse2023
goclasses
operating-system
process-scheduling
multiple-selects
+
–
0
votes
1
answer
8
GATE CSE 2023 | Memory Based Question: 19
incr() { wait(s) x = x+1 signal(s) } decr() { wait(s) x = x-1 signal(s) } Shared integer variable $\mathrm{x}$ initialized with $10.$ There are five threads which are calling incr() and there are three threads which are calling decr() ... $s=2$ minimum possible value of $\mathrm{x}$ is $\mathrm{V}_2$ $15,8$ $12,8$ $15,7$ $12,7$
incr(){ wait(s) x = x+1 signal(s) } decr() { wait(s) x = x–1 signal(s) }Shared integer variable $\mathrm{x}$ initialized w...
GO Classes
1.5k
views
GO Classes
asked
Feb 5, 2023
Operating System
memorybased-gatecse2023
goclasses
operating-system
process-synchronization
binary-semaphore
+
–
1
votes
1
answer
9
GATE CSE 2023 | Memory Based Question: 20
Which of the following option guarantee that a computer system transit from user mode to kernel mode malloc call system call function call page fault
Which of the following option guarantee that a computer system transit from user mode to kernel modemalloc callsystem callfunction callpage fault
GO Classes
1.1k
views
GO Classes
asked
Feb 5, 2023
Operating System
memorybased-gatecse2023
goclasses
operating-system
page-fault
multiple-selects
+
–
2
votes
1
answer
10
GATE CSE 2023 | Memory Based Question: 22
The initial state of a given sequential circuit is $Q_0 Q_1 Q_2=011$. Which of the following state does not occur $101$ $111$ $001$ $100$
The initial state of a given sequential circuit is $Q_0 Q_1 Q_2=011$. Which of the following state does not occur$101$$111$$001$$100$
GO Classes
1.1k
views
GO Classes
asked
Feb 5, 2023
Digital Logic
memorybased-gatecse2023
goclasses
digital-logic
sequential-circuit
flip-flop
+
–
1
votes
2
answers
11
GATE CSE 2023 | Memory Based Question: 25
Consider the following finite automata and find the correct regular expression. $0(0+11)^*$ $1(0+11)^*$ $1(0 * 11)^*$ $0\left(0^* 11\right)^*$
Consider the following finite automata and find the correct regular expression.$0(0+11)^*$$1(0+11)^*$$1(0 * 11)^*$$0\left(0^* 11\right)^*$
GO Classes
1.4k
views
GO Classes
asked
Feb 5, 2023
Theory of Computation
memorybased-gatecse2023
goclasses
theory-of-computation
regular-expression
+
–
0
votes
1
answer
12
GATE CSE 2023 | Memory Based Question: 34
Which one of the options given below refers to the degree (or arity) of a relation in relational database systems? Number of tuples stored in relation. Number of distinct domains of its relation schema. Number of attributes in relation. Number of entries in relation.
Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?Number of tuples stored in relation.Number of distinct d...
GO Classes
1.7k
views
GO Classes
asked
Feb 5, 2023
Databases
memorybased-gatecse2023
goclasses
databases
relational-algebra
+
–
0
votes
0
answers
13
GATE CSE 2023 | Memory Based Question: 37
Time complexity f( ) { while(n>1) { for (i = 1 to n) { } n = n/2 } } g ( ) { for (i = 1 to 100n) { } } $f(x)=O(g(x))$ $f(x)=\theta(g(x))$ $f(x)=o(g(x))$ $f(x)=\omega(g(x))$
Time complexity f( ) { while(n>1) { for (i = 1 to n) { } n = n/2 } } g ( ) { for (i = 1 to 100n) { } } $f(x)...
GO Classes
1.4k
views
GO Classes
asked
Feb 5, 2023
Algorithms
memorybased-gatecse2023
goclasses
algorithms
time-complexity
multiple-selects
+
–
2
votes
1
answer
14
GATE CSE 2023 | Memory Based Question: 41
Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap? $23\; 17\; 10\; 6\; 13\; 14\; 1\; 5 \;9 \;12$ $23 \;14 \;19 \;1 \;10 \;13 \;16 \;12 \;7 \;5$ $23 \;17\; 14\; 6\; 13\; 10\; 1\; 5\; 7\; 15$ $23 \;17\; 14\; 7\; 13\; 10\; 1\; 5\; 6\; 12$
Which one of the following sequences when stored in an array at locations A ,...,A[10] forms a max-heap?$23\; 17\; 10\; 6\; 13\; 14\; 1\; 5 \;9 \;12$$23 \;14 \;19 \;1 \;1...
GO Classes
4.9k
views
GO Classes
asked
Feb 5, 2023
DS
memorybased-gatecse2023
goclasses
data-structures
binary-heap
+
–
3
votes
1
answer
15
GATE CSE 2023 | Memory Based Question: 46
A link is point-to-point connected and using stop and wait protocol, which of the following correctly states lowest link utilization. Lower link length and lower transmission rate. Lower link length and higher transmission rate. Higher link length and lower transmission rate. Higher link length and higher transmission rate.
A link is point-to-point connected and using stop and wait protocol, which of the following correctly states lowest link utilization.Lower link length and lower transmiss...
GO Classes
1.7k
views
GO Classes
asked
Feb 5, 2023
Computer Networks
memorybased-gatecse2023
goclasses
computer-networks
stop-and-wait
+
–
1
votes
0
answers
16
GATE CSE 2023 | Memory Based Question: 47
Which of the following is incorrect in the case of OSPF protocol? OSPF uses the Dijkstra algorithm shortest path algorithm to implement the least cost path routing OSPF uses the Bellman-Ford algorithm to determine the shortest path. OSPF uses an inter-domain routing protocol OSPF employs hierarchical routing
Which of the following is incorrect in the case of OSPF protocol?OSPF uses the Dijkstra algorithm shortest path algorithm to implement the least cost path routingOSPF use...
GO Classes
1.4k
views
GO Classes
asked
Feb 5, 2023
Computer Networks
memorybased-gatecse2023
goclasses
computer-networks
link-state-routing
multiple-selects
+
–
1
votes
1
answer
17
GATE CSE 2023 | Memory Based Question: 48
3 DNS iterative queries each has RTT time. One HTTP server sending 10 small objects, HTTP server to clieent also takes RTT time. 9 in nonpersistent with 5 parallel connection 7 in non persistent with 5 parallel connection 5 in persistent pipelined 6 in persistent pipelined
3 DNS iterative queries each has RTT time. One HTTP server sending 10 small objects, HTTP server to clieent also takes RTT time. 9 in nonpersistent with 5 parallel conne...
GO Classes
1.7k
views
GO Classes
asked
Feb 5, 2023
Computer Networks
memorybased-gatecse2023
goclasses
computer-networks
stop-and-wait
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register