Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
TusharRana
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by TusharRana
8
answers
1
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$?$\exists y(\ex...
17.1k
views
answered
2 days
ago
Mathematical Logic
gatecse-2017-set1
mathematical-logic
first-order-logic
+
–
1
answer
2
if p implies q is true then the truth value of which of the following cannot be determined
a) ~p\/q b) ~q=>~p c) ~p=>~q d) ~(p/\~q) can someone provide the solution?
a) ~p\/q b) ~q=>~pc) ~p=>~q d) ~(p/\~q)can someone provide the solution?
153
views
commented
2 days
ago
Mathematical Logic
engineering-mathematics
propositional-logic
+
–
9
answers
3
GATE CSE 2020 | Question: 39
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$
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) \equ...
16.9k
views
answered
3 days
ago
Mathematical Logic
gatecse-2020
first-order-logic
mathematical-logic
2-marks
+
–
7
answers
4
GATE IT 2006 | Question: 21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable
Consider the following first order logic formula in which $R$ is a binary relation symbol.$∀x∀y (R(x, y) \implies R(y, x))$The formula issatisfiable and validsatisfia...
13.2k
views
answered
3 days
ago
Mathematical Logic
gateit-2006
mathematical-logic
normal
first-order-logic
+
–
4
answers
5
Self Doubt: Mathematical Logic
Is the assertion "This statement is false" a proposition?
Is the assertion "This statement is false" a proposition?
2.1k
views
answered
Mar 18
Mathematical Logic
mathematical-logic
+
–
1
answer
6
From PYQs and CAT Exam Books
If a Complete Square board has 204 Squares than How many squares are there in 1/4th of the board?
If a Complete Square board has 204 Squares than How many squares are there in 1/4th of the board?
115
views
answered
Feb 20
Spatial Aptitude
query
+
–
1
answer
7
GATE CSE 2024 | Set 1 | GA: 2
If two distinct non-zero real variables $x$ and $y$ are such that $(x+y)$ is proportional to $(x-y)$ then the value of $\frac{x}{y}$ depends on $x y$ depends only on $x$ and not on $y$ depends only on $y$ and not on $x$ is a constant
If two distinct non-zero real variables $x$ and $y$ are such that $(x+y)$ is proportional to $(x-y)$ then the value of $\frac{x}{y}$depends on $x y$depends only ...
2.9k
views
commented
Feb 19
Quantitative Aptitude
gatecse2024-set1
quantitative-aptitude
+
–
1
answer
8
GATE CSE 2024 | Set 1 | Question: 7
Given an integer array of size $N$, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The ... $\Omega(N)$ but not $\mathrm{O}(N)$ neither $\mathrm{O}(N)$ nor $\Omega(N)$
Given an integer array of size $N$, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single...
3.0k
views
commented
Feb 18
Algorithms
gatecse2024-set1
algorithms
time-complexity
+
–
3
answers
9
GATE CSE 2024 | Set 1 | Question: 9
Consider the following $\mathrm{C}$ program: #include <stdio.h> void fX () { void fX () ; char a; int main() { if ((a=g e t c h a r()) ! = '\n') fX}() ; fX(); return 0 ; if (a ! ... program will not terminate The program will terminate with no output The program will terminate with $4321$ as output The program will terminate with $1234$ as output
Consider the following $\mathrm{C}$ program:#include <stdio.h void fX () {void fX () ; char a;int main() { if ((a=g e t c h a r()) ! = '\n')fX}() ; fX();return 0 ; if ...
2.7k
views
commented
Feb 18
Programming in C
gatecse2024-set1
programming
programming-in-c
+
–
1
answer
10
Doubt on OS Syllabus (Galvin)
Hi, i'm starting my GATE journey and wanted to verify if these are the topics which should be learnt for GATE. The book is Operating Systems by Avi Silberschatz, Greg Gagne, and Peter Baer Galvin (9th Edition). Also have 10th edition but it seems to have rearranged a lot of topics and chapters.
Hi, i'm starting my GATE journey and wanted to verify if these are the topics which should be learnt for GATE. The book is Operating Systems by Avi Silberschatz, Greg Gag...
160
views
answered
Feb 18
Operating System
syllabus
operating-system
+
–
3
answers
11
GATE CSE 2024 | Set 1 | Question: 8
Consider the following $\mathrm{C}$ program: #include <stdio.h> int main() { int a=6; int b = 0; while (a<10) { a = a / 12+1 ; a += b ;} printf ("%d", a); return 0 ; } Which one of the following ... The program prints $9$ as output The program prints $10$ as output The program gets stuck in an infinite loop The program prints $6$ as output
Consider the following $\mathrm{C}$ program:#include <stdio.h>int main() {int a=6;int b = 0;while (a<10) {a = a / 12+1 ;a += b ;}printf ("%d", a);return 0 ; }Which one ...
5.6k
views
answered
Feb 17
Programming in C
gatecse2024-set1
programming
programming-in-c
+
–
5
answers
12
GATE CSE 2024 | Set 1 | Question: 3
Consider a system that uses $5$ bits for representing signed integers in $2$ 's complement format. In this system, two integers $A$ and $B$ are represented as $A$=$01010$ and $B$=$11010$. Which one of the following operations will result in either an arithmetic overflow or an arithmetic underflow? $A+B$ $A-B$ $B-A$ $2 * B$
Consider a system that uses $5$ bits for representing signed integers in $2$ 's complement format. In this system, two integers $A$ and $B$ are represented as $A$=$01010$...
3.4k
views
answered
Feb 17
Digital Logic
gatecse2024-set1
digital-logic
+
–
8
answers
13
GATE CSE 2024 | Set 1 | Question: 2
The product of all eigenvalues of the matrix $\left[\begin{array}{lll}1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9\end{array}\right]$ is $-1$ $0$ $1$ $2$
The product of all eigenvalues of the matrix $\left[\begin{array}{lll}1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9\end{array}\right]$ is$-1$$0$$1$$2$
2.6k
views
answered
Feb 17
Linear Algebra
gatecse2024-set1
linear-algebra
+
–
1
answer
14
Permutation and combination
121
views
answered
Feb 15
Mathematical Logic
combinatory
engineering-mathematics
discrete-mathematics
+
–
1
answer
15
lost my gate 2023 scorecard,, Help
Hello GO , I'm GO reader from last 2 years and I love this forum so I have given gate 2024 also but the thing is I lost my gate 2023 scorecard it wasn't good rank and I didn't know about last date to download I downloaded ... though it was bad rank but i qualified after studying what should i do , I sent mail to iitK today evening I'm worried
Hello GO , I'm GO reader from last 2 years and I love this forum so I have given gate 2024 also but the thing is I lost my gate 2023 scorecard it wasn't good rank and I d...
222
views
commented
Feb 14
Others
admissions
+
–
1
answer
16
Memory Based GATE DA 2024 | Question: 40
Match the following: $ \begin{array}{|p{0.3\linewidth}|p{0.6\linewidth}|} \hline \textbf{Technique} & \textbf{Characteristic} \\ \hline FIFO & (ii) Queue \\ \hline Look Up & (i) Hash Table\\ \hline LIFO & (iii) Stack \\ \hline \end{array} $
Match the following:$$\begin{array}{|p{0.3\linewidth}|p{0.6\linewidth}|} \hline \textbf{Technique} & \textbf{Characteristic} \\ \hline FIFO & ...
159
views
answered
Feb 13
DS
gate2024-da-memory-based
goclasses
data-structures
stack
+
–
1
answer
17
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 29
The largest positive number in 2's complement format represented with 8-bits is: $(\mathrm{FF})_{16}$ $(128)_{10}$ $(777)_8$ $(01111111)_2$
The largest positive number in 2's complement format represented with 8-bits is:$(\mathrm{FF})_{16}$$(128)_{10}$$(777)_8$$(01111111)_2$
430
views
answered
Feb 13
Digital Logic
goclasses2024-mockgate-14
digital-logic
number-representation
1-mark
+
–
0
answers
18
GATE 2024
Consider an n element array which is to be sorted either in ascending or descending order. The given restriction is only one pass will be used for completely sorting the array and an element can compare with only it's adjacent pair. What will be the worst time complexity? Is this related to bubble sort algorithm or not?
Consider an n element array which is to be sorted either in ascending or descending order. The given restriction is only one pass will be used for completely sorting the ...
347
views
commented
Feb 12
Algorithms
algorithms
sorting
+
–
1
answer
19
GATE 2024 CS set-1
If a process perform IO time first and then performing cpu, in that case process is going from ready state to wait state, is that true?
If a process perform IO time first and then performing cpu, in that case process is going from ready state to wait state, is that true?
250
views
answer edited
Feb 11
0
answers
20
Gate 2016
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________. I am confused with the question's language. please correct me if I have a wrong assumption. We need to tell the minimum colors required for a planar graph. Suppose I start ... is only fixed to 4. I understand the answer not to be less than 4. What does the word "any" means here?
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.I am confused with the question's language.please correct me if I have a wr...
180
views
asked
Feb 8
11
answers
21
GATE CSE 2016 Set 2 | Question: 01
Consider the following expressions: $false$ $Q$ $true$ $P\vee Q$ $\neg Q\vee P$ The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.
Consider the following expressions:$false$$Q$$true$$P\vee Q$$\neg Q\vee P$The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$...
19.7k
views
answered
Feb 8
Mathematical Logic
gatecse-2016-set2
mathematical-logic
normal
numerical-answers
propositional-logic
+
–
6
answers
22
GATE CSE 2010 | Question: 46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: $\text{if} (i\%2==0) \{$ $\quad\text{if} (i<n) \text{ request } R_i;$ ... which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...
29.0k
views
commented
Feb 7
Operating System
gatecse-2010
operating-system
resource-allocation
normal
+
–
6
answers
23
GATE CSE 2022 | Question: 26
Which one of the following is the closed form for the generating function of the sequence $\{ a_{n} \}_{n \geq 0}$ defined below? $ a_{n} = \left\{\begin{matrix} n + 1, & \text{n is odd} & \\ 1, & \text{otherwise} & \end{matrix}\right.$ ... $\frac{2x}{(1-x^{2})^{2}} + \frac{1}{1-x}$ $\frac{x}{(1-x^{2})^{2}} + \frac{1}{1-x}$
Which one of the following is the closed form for the generating function of the sequence $\{ a_{n} \}_{n \geq 0}$ defined below?$$ a_{n} = \left\{\begin{matrix} n + 1, &...
9.3k
views
commented
Jan 31
Combinatory
gatecse-2022
combinatory
generating-functions
2-marks
+
–
8
answers
24
GATE CSE 2006 | Question: 46
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets are ready and immediately available for transmission. If every $5$th packet that $A$ ... what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets ...
40.7k
views
answer reshown
Jan 22
Computer Networks
gatecse-2006
computer-networks
sliding-window
normal
+
–
7
answers
25
GATE IT 2006 | Question: 67
A link of capacity $100$ $\text{Mbps}$ is carrying traffic from a number of sources. Each source generates an on-off traffic stream; when the source is on, the rate of traffic is $10$ $\text{Mbps}$, and when the source is off, the rate of traffic is zero. The duty cycle, which ... $\text{and}$ $30$ $12$ $\text{and}$ $25$ $5$ $\text{and}$ $33$ $15$ $\text{and}$ $22$
A link of capacity $100$ $\text{Mbps}$ is carrying traffic from a number of sources. Each source generates an on-off traffic stream; when the source is on, the rate of tr...
11.1k
views
answered
Jan 20
Computer Networks
gateit-2006
computer-networks
network-flow
normal
+
–
3
answers
26
GATE IT 2004 | Question: 80
In a data link protocol, the frame delimiter flag is given by $0111$. Assuming that bit stuffing is employed, the transmitter sends the data sequence $01110110$ as $01101011$ $011010110$ $011101100$ $0110101100$
In a data link protocol, the frame delimiter flag is given by $0111$. Assuming that bit stuffing is employed, the transmitter sends the data sequence $01110110$ as$011010...
9.9k
views
answered
Jan 20
Computer Networks
gateit-2004
computer-networks
network-flow
normal
+
–
3
answers
27
GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$?$\Theta(...
11.5k
views
commented
Nov 27, 2022
DS
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
1-mark
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register