Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Godlike
1
answer
1
#GATE CSE 2024
I have graduated from ECE in 2020 but I have been working in IT sector for last one year. I plan to learn programming better and hence I would like to crack GATE and pursue masters in CS. I have limited knowledge of programming and hence a ... while answering and any other suggestions will be welcome. If there are already any answers provided on this topic, please list the link.
I have graduated from ECE in 2020 but I have been working in IT sector for last one year. I plan to learn programming better and hence I would like to crack GATE and purs...
613
views
commented
Apr 20, 2023
GATE
normal
study-resources
+
–
8
answers
2
ISI2017-MMA-29
Suppose the rank of the matrix $\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$ is $2$ for some real numbers $a$ and $b$. Then $b$ equals $1$ $3$ $1/2$ $1/3$
Suppose the rank of the matrix$$\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$$is $2$ for some real numbers $a$ and $b$. Then $b$ equals$1$$3$$1/2$$1/3$
2.8k
views
commented
Mar 10, 2023
Linear Algebra
isi2017-mma
engineering-mathematics
linear-algebra
rank-of-matrix
+
–
1
answer
3
GATE Overflow Test Series | Mock GATE | Test 5 | Question: 52
The following pushdown automata (PDA) recognizes the language $L = \{wcw^{R} \mid w \in \{a,b\}^{\ast}\}$ $(w_R$ being the reverse of $w)$ and is accepting by empty stack (denoted by $\varepsilon$ in the transitions). Which ... $\langle q_1, (a,b,\varepsilon) \rangle$ $\langle q_1, (b,a,\varepsilon) \rangle$
The following pushdown automata (PDA) recognizes the language $L = \{wcw^{R} \mid w \in \{a,b\}^{\ast}\}$ $(w_R$ being the reverse of $w)$ and is accepting by empty stack...
269
views
commented
Feb 1, 2023
Theory of Computation
go2025-mockgate-5
theory-of-computation
pushdown-automata
2-marks
+
–
0
answers
4
SQL
consider following relation How many number of records resulted by following SQL query? Select $T_{1}.A$ From R Where Exists (Select Count (*) From S Where R .C<S.F and S. E > 10 ); A 3 B 2 C 1 D 0
consider following relation How many number of records resulted by following SQL query?Select $T_{1}.A$From RWhere Exists (Select Count (*) From S Where R .C<S.F and S....
278
views
commented
Jan 17, 2023
Databases
made-easy-test-series
+
–
0
answers
5
toc
is it a regular language? why?
is it a regular language? why?
356
views
commented
Jan 17, 2023
Theory of Computation
theory-of-computation
regular-language
+
–
1
answer
6
Operating System
When a page is referred for the first time, then it will be counted in page fault or not?. E.g page reference 1,2,3,4,2,1. LRU is used with 3 frames(initially empty).
When a page is referred for the first time, then it will be counted in page fault or not?.E.g page reference 1,2,3,4,2,1.LRU is used with 3 frames(initially empty).
688
views
commented
Jan 7, 2023
Operating System
operating-system
self-doubt
page-fault
+
–
1
answer
7
Lock Compatibility in GATE IT 2007 | Question: 66
With reference to the GATE IT 2007 | Question : 66 In the following article from GeeksForGeeks : Lock Compatibility Diagram It can be clearly seen that if a transaction Ti owns a Shared lock on A, then a transaction Tj cannot take an Exclusive lock on ... (A) call in T2 will wait for T1, and T1 will wait for Lock_X(B) from T2, so hence a deadlock ?
With reference to the GATE IT 2007 | Question : 66In the following article from GeeksForGeeks : Lock Compatibility DiagramIt can be clearly seen that if a transaction Ti ...
302
views
answered
Jan 6, 2023
Databases
databases
gateit-2007
+
–
1
answer
8
#testbook
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
296
views
commented
Jan 5, 2023
Algorithms
testbook-test-series
+
–
1
answer
9
Made Easy Full Syllabus Test 3 Logic
Could anyone give an example why 2nd and 3rd were false.
Could anyone give an example why 2nd and 3rd were false.
306
views
answered
Jan 5, 2023
Mathematical Logic
made-easy-test-series
propositional-logic
+
–
2
answers
10
GATE CSE 2021 Set 2 | Question: 27
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements. $S_1$: Read misses in a write through $L1$ cache do not result in writebacks of dirty lines to the $L2$ $S_2$: Write ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements.$S_1$: Read misses i...
8.1k
views
commented
Jan 1, 2023
CO and Architecture
gatecse-2021-set2
co-and-architecture
cache-memory
2-marks
+
–
2
answers
11
GATE CSE 2021 Set 2 | GA Question: 7
A jigsaw puzzle has $2$ pieces. One of the pieces is shown above. Which one of the given options for the missing piece when assembled will form a rectangle? The piece can be moved, rotated or flipped to assemble with the above piece.
A jigsaw puzzle has $2$ pieces. One of the pieces is shown above. Which one of the given options for the missing piece when assembled will form a rectangle? The piece can...
4.9k
views
commented
Jan 1, 2023
Spatial Aptitude
gatecse-2021-set2
spatial-aptitude
assembling-pieces
2-marks
+
–
2
answers
12
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 16
Let $P(X)$ be the collection of all the subset of a set $X$ with at least three elements. Consider the following two relations on $P(X):$ $R:A \subseteq B$ $S: A \cap B = \phi$. Which of the following is true ... -symmetric. $R$ is not anti-symmetric but $S$ is anti-symmetric. Both $R$ and $S$ are anti-symmetric None of these
Let $P(X)$ be the collection of all the subset of a set $X$ with at least three elements. Consider the following two relations on $P(X):$$R:A \subseteq B$$S: A \cap B = \...
298
views
commented
Jan 1, 2023
Set Theory & Algebra
go2025-dm-1
relations
normal
+
–
2
answers
13
GATE CSE 2022 | Question: 15
Consider the following three relations in a relational database. $\text{Employee} (\underline{\text{eId}},\text{Name}), \; \text{Brand}(\underline{\text{bId}},\text{bName}), \; \text{Own}(\underline{\text{eId}},\underline{\text{bId}})$ Which of the following relational ... $ \Pi_{eId} \left( (\Pi_{eId}(Own) \times \Pi_{bId} (Own)) / \Pi_{bId} (Brand) \right)$
Consider the following three relations in a relational database.$\text{Employee} (\underline{\text{eId}},\text{Name}), \; \text{Brand}(\underline{\text{bId}},\text{bName}...
8.4k
views
commented
Dec 31, 2022
Databases
gatecse-2022
databases
relational-algebra
multiple-selects
1-mark
+
–
2
answers
14
GATE CSE 1988 | Question: 10ia
Consider the following grammar: $S \rightarrow S$ $S \rightarrow SS \mid a \mid \epsilon$ Construct the collection of sets of $\text{LR (0)}$ items for this grammar and draw its goto graph.
Consider the following grammar:$S \rightarrow S$$S \rightarrow SS \mid a \mid \epsilon$Construct the collection of sets of $\text{LR (0)}$ items for this grammar and draw...
3.7k
views
commented
Dec 18, 2022
Compiler Design
gate1988
compiler-design
descriptive
grammar
parsing
+
–
1
answer
15
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 10
Which of the following is/are correct? (Mark all the appropriate choices) Both the first-fit and best-fit strategies for memory allocation suffer from external fragmentation. Best-fit strategy for memory allocation avoids ... when there is enough total memory space to satisfy a request but the available spaces are not contiguous.
Which of the following is/are correct? (Mark all the appropriate choices)Both the first-fit and best-fit strategies for memory allocation suffer from external fragmentati...
390
views
commented
Dec 14, 2022
Operating System
go2025-os-2
memory-management
multiple-selects
+
–
2
answers
16
ISI 2019 | PCB CS | Question: 11
Consider an array of length $n$ consisting only of positive and negative integers. Design an algorithm to rearrange the array so that all the negative integers appear before all the positive integers, using $O(n)$ time and only constant amount of extra space.
Consider an array of length $n$ consisting only of positive and negative integers. Design an algorithm to rearrange the array so that all the negative integers appear bef...
357
views
commented
Aug 17, 2022
Others
isi2019-pcb-cs
descriptive
+
–
0
answers
17
ISI 2019 | PCB CS | Question: 9
Consider a byte addressable memory with $16$ bit addresses and a $2$- way set associative $\mathrm{L} 1$ cache of size $8 \mathrm{ kB}$ (kilobyte). Each cache line is $4$ words long. A process sequentially accesses the following memory ... replacement policy is used, indicate whether the cache access will result in a hit or a miss for each of the above addresses.
Consider a byte addressable memory with $16$ bit addresses and a $2$- way set associative $\mathrm{L} 1$ cache of size $8 \mathrm{ kB}$ (kilobyte). Each cache line is $4$...
214
views
commented
Aug 15, 2022
Others
isi2019-pcb-cs
descriptive
+
–
3
answers
18
GO Classes Scholarship 2023 | Test | Question: 2
Let $\text{S}$ be the set of all bit-strings of length $7 .$ We define a relation $\mathrm{R}$ on the set $\mathrm{S}$ by the rule that $x\mathrm{R}y$ iff $x$ and $y$ ... such that $\forall j \neq i, x_{j}=y_{j}$ and $x_{i} \neq y_{i}$. What is the cardinality of relation $\mathrm{R}$?
Let $\text{S}$ be the set of all bit-strings of length $7 .$ We define a relation $\mathrm{R}$ on the set $\mathrm{S}$ by the rule that $x\mathrm{R}y$ iff $x$ and $y$ dif...
948
views
answer edited
Aug 9, 2022
Set Theory & Algebra
goclasses-scholarship-test1
numerical-answers
goclasses
set-theory&algebra
relations
2-marks
+
–
3
answers
19
GO Classes Scholarship 2023 | Test | Question: 16
Consider the following declaration of variables $a$ and $b.$ int a = 1, b = 0; Which of the following is/are will evaluate to TRUE? b++ && b == a b++ && a == 0 a || b == --a a || ++b == 0
Consider the following declaration of variables $a$ and $b.$int a = 1, b = 0;Which of the following is/are will evaluate to TRUE?b++ && b == ab++ && a == 0a || b == aa |...
717
views
commented
Aug 9, 2022
Programming in C
goclasses-scholarship-test1
goclasses
programming
programming-in-c
multiple-selects
2-marks
+
–
1
answer
20
ISI 2019 | PCB Mathematics | Question: 2
Consider an $n \times n$ matrix $A=I_{n}-\alpha \alpha^{T}$, where $I_{n}$ is the identity matrix of order $n$ and $\alpha$ is an $n \times 1$ column vector such that $\alpha^{T} \alpha=1$. Prove that $A^{2}=A.$
Consider an $n \times n$ matrix $A=I_{n}-\alpha \alpha^{T}$, where $I_{n}$ is the identity matrix of order $n$ and $\alpha$ is an $n \times 1$ column vector such that $\a...
108
views
answered
Aug 9, 2022
Others
isi2019-pcb-mathematics
descriptive
+
–
2
answers
21
GO Classes Scholarship 2023 | Test | Question: 29
In which of the following case(s) character array must end with null char? char c[] = "GATE"; char c[] = {'2', '0', '2', '3'}; char c[4] = "GATE"; char c[16] = "2023";
In which of the following case(s) character array must end with null char?char c[] = "GATE";char c[] = {'2', '0', '2', '3'};char c[4] = "GATE";char c[16] = "2023";
1.2k
views
commented
Aug 7, 2022
Programming in C
goclasses-scholarship-test1
goclasses
programming
programming-in-c
array
multiple-selects
1-mark
+
–
1
answer
22
Recursive function
Consider the following recursive function which is used by dynamic programming. T(n) = { 0; if n<1 1; if n=1 T(n-1)+T(n-2)+1; if n>1} Assume for every function call T(i) it checks the table first , if it's value is ... of 'n' so that overflow cannot occur . ( Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
Consider the following recursive function which is used by dynamic programming. T(n) = { 0; if n<1 1; if n=1 T(n-1)+T(n-2)+1; if n>1}Assume ...
653
views
answered
Aug 6, 2022
Programming in C
recursion
dynamic-programming
+
–
2
answers
23
Made easy || Operating system
While of the following is incorrect? (a) if a system uses preemptive CPU scheduler then deadlock is not possible in system (b) Deadlock state is an unsafe state. (c) If a system has total ordering of all resource types ... disabled) therefore deadlock should not possible in preemptive scheduling then how can this statement could be incorrect. please clarify the doubt
While of the following is incorrect?(a) if a system uses preemptive CPU scheduler then deadlock is not possible in system(b) Deadlock state is an unsafe state.(c) If a sy...
1.3k
views
answered
Aug 5, 2022
Operating System
operating-system
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
6
answers
24
GATE CSE 2005 | Question: 79
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in the ... $2$ $3$ $4$ $5$
Consider the following data path of a $\text{CPU}.$The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including increm...
24.4k
views
commented
Jul 30, 2022
CO and Architecture
gatecse-2005
co-and-architecture
machine-instruction
data-path
normal
+
–
6
answers
25
GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion
Two processes $X$ and $Y$ need to access a critical section. Consider the following synchronization construct used by both the processes$$\begin{array}{|l|l|}\hline \text...
20.8k
views
answered
Jun 24, 2022
Operating System
gatecse-2015-set3
operating-system
process-synchronization
normal
+
–
1
answer
26
GO Classes 2023 | Weekly Quiz 3 | Question: 19
Let $F$ and $G$ be two propositional formula. Which of the following is/are TRUE? If $F \rightarrow G$ is satisfiable and $F$ is satisfiable, then $G$ is satisfiable. If two statements(propositions) are logically equivalent, then so are their ... . If a statement $q$ is true, then, for any statement $p$, the statement $p \rightarrow q$ is true.
Let $F$ and $G$ be two propositional formula. Which of the following is/are TRUE?If $F \rightarrow G$ is satisfiable and $F$ is satisfiable, then $G$ is satisfiable.If tw...
943
views
answered
Jun 22, 2022
Mathematical Logic
goclasses
goclasses_wq3
mathematical-logic
propositional-logic
multiple-selects
2-marks
+
–
1
answer
27
About set identities
Does associative properties follows only when all the operators in the given expression same (union or intersection) or it do follows when there are different symbols present in the given expression. E.g. a U (b U c) U d = a U b U (c U d) ; (a U b) /\ c U d = a U (b /\ c) U d.
Does associative properties follows only when all the operators in the given expression same (union or intersection) or it do follows when there are different symbols pre...
272
views
answered
Jun 22, 2022
4
answers
28
GATE IT 2007 | Question: 68
Consider the following relation schemas : b-Schema = (b-name, b-city, assets) a-Schema = (a-num, b-name, bal) d-Schema = (c-name, a-number) Let branch, account and depositor be respectively instances of the above schemas. Assume that account and ... depositor) Пc-name (σb-city = "Agra" branch ⋈ (σb-city = "Agra" ⋀ bal < 0 account ⋈ depositor))
Consider the following relation schemas :b-Schema = (b-name, b-city, assets)a-Schema = (a-num, b-name, bal)d-Schema = (c-name, a-number)Let branch, account and depositor ...
12.9k
views
commented
Jun 17, 2022
Databases
gateit-2007
databases
joins
relational-algebra
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register