Dark Mode

Recent activity

14 votes

4 answers

1

GATE CSE 2021 Set 1 | Question: 46
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in line $\#1$. Assume that the increment operation in line $\#7$ ... is $0$ after all the threads successfully complete the execution of $\textsf{parop}$ There is a deadlock involving all the threads

sk91 comment edited in Operating System 6 hours ago

by sk91

8.9k views

21 votes

3 answers

2

GATE CSE 1992 | Question: 02,xvi
Which of the following is/are a tautology? $a \vee b \to b \wedge c$ $a \wedge b \to b \vee c$ $a \vee b \to \left(b \to c \right)$ $a \to b \to \left(b \to c \right)$

-RahulKumar- answered in Mathematical Logic 7 hours ago

by -RahulKumar-

4.9k views

26 votes

4 answers

3

GATE CSE 2001 | Question: 1.3
Consider two well-formed formulas in propositional logic $F_1: P \Rightarrow \neg P$ $F_2: (P \Rightarrow \neg P) \lor ( \neg P \Rightarrow P)$ Which one of the following statements is correct? $F_1$ is satisfiable, $F_2$ is valid $F_1$ unsatisfiable, $F_2$ is satisfiable $F_1$ is unsatisfiable, $F_2$ is valid $F_1$ and $F_2$ are both satisfiable

-RahulKumar- answered in Mathematical Logic 8 hours ago

by -RahulKumar-

7.1k views

0 votes

1 answer

4

NIELIT 2021 Dec Scientist A - Section B: 95
The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is : ($m$ and $n$ are lengths of subsequences) $\text{O(m.n)}$ $\text{O(m+n)}$ $\text{O(log m.n)}$ $\text{O(m/n)}$

Sandeep652025 answered in Others 9 hours ago

by Sandeep652025

62 views

0 votes

1 answer

5

NIELIT 2021 Dec Scientist A - Section B: 94
The number of full and half-adders required to add $16$-bit numbers is : $8$ half-adders, $8$ full-adders $1$ half-adders, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders

Sandeep652025 answered in Others 9 hours ago

by Sandeep652025

67 views

0 votes

1 answer

6

NIELIT 2021 Dec Scientist A - Section B: 90
To simulate a analog signal of frequency $\text{f}$, bandwidth requirement of channel is : $\text{2f}$ $\text{f}$ $\text{f/2}$ $\text{f/4}$

Sandeep652025 answered in Others 9 hours ago

by Sandeep652025

71 views

0 votes

2 answers

7

NIELIT 2021 Dec Scientist A - Section B: 87
The postfix equivalent of the infix expression $(a+b)^{*}(c^{*}d-e)^{*}f/g$ is : $ab + cd^{*}e – fg^{*}/^{*}$ $ab + cd^{*}e - fg/^{**}$ $ab + cde^{*} – fg/^{**}$ $abcd + e^{*} fg – /^{**}$

Sandeep652025 answered in Others 10 hours ago

by Sandeep652025

74 views

0 votes

1 answer

8

NIELIT 2021 Dec Scientist A - Section B: 83
Consider the following statements : The primary key of a relation cannot contain null values. Unique Key can have null values. Which among the following is true ? Both $\text{I}$ and $\text{II}$ are true Both $\text{I}$ and $\text{II}$ are false Only $\text{I}$ is true Only $\text{II}$ is true

Sandeep652025 answered in Others 10 hours ago

by Sandeep652025

79 views

0 votes

1 answer

9

NIELIT 2021 Dec Scientist A - Section B: 81
Elicitation of requirements is a _______________ . $\text{SDLC}$ Process Cyclic Process $\text{SRS}$ Process Development Process

Sandeep652025 answered in Others 10 hours ago

by Sandeep652025

91 views

0 votes

0 answers

10

Iiiid
PGCAT-IIITD (Part-II)  Only those candidates who qualify PGCAT (Part-I) will be allowed to appear in PGCAT (Part-II).  PGCAT-IIITD (Part-II) will consist of a Programming Test with language options as C/C++/Java/Python.  The duration of PGCAT-IIITD (Part-II) will be 40 minutes. How to prepare programming test in minimum time & reference ?

makhdoom ghaya edited in Others 10 hours ago

by makhdoom ghaya

21 views

0 votes

1 answer

11

NIELIT 2021 Dec Scientist A - Section B: 76
When the left sub-tree of the tree is one level higher than that of the right sub-tree, then the balance factor is _____________ . $0$ $1$ $-1$ $2$

Sandeep652025 commented in Others 10 hours ago

by Sandeep652025

109 views

1 vote

2 answers

12

GATE CSE 2023 | Question: 32
A $4$ kilobyte $\text{(KB)}$ byte-addressable memory is realized using four $1 \mathrm{~KB}$ memory blocks. Two input address lines $\text{(IA4 and IA3)}$ are connected to the chip select $\text{(CS)}$ port of these memory blocks through a decoder as shown in the figure. The ... options is $\text{CORRECT}?$ $(0,1,2,3)$ $(0,1024,2048,3072)$ $(0,8,16,24)$ $(0,0,0,0)$

Bhaskar_Saini answered in CO and Architecture 12 hours ago

by Bhaskar_Saini

1.2k views

0 votes

0 answers

13

Subject : Databse Topic: 2pl locking protocol..... If the given schedule is allowed under any 2pl( basic 2pl,strict or rigorous) then it is also allowed in conflict serializble , so if the schedule which is allowed in conflict serializable then also we can say it will be allowed in 2pl?

makhdoom ghaya retagged in Databases 13 hours ago

by makhdoom ghaya

12 views

0 votes

0 answers

14

How much time I should alot to each subject for GATE CSE?
How much time I should give each subject approx for gate cse?

makhdoom ghaya retagged in Study Resources 13 hours ago

by makhdoom ghaya

22 views

68 votes

5 answers

15

GATE CSE 1992 | Question: 92,xv
Which of the following predicate calculus statements is/are valid? $(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$ $(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))$ ... $(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)$

darshan9784 commented in Mathematical Logic 13 hours ago

13.1k views

0 votes

0 answers

16

Self Doubt
In Token Ring protocol how are the priority and reservation fields used to obtain the token?

Sagnick12 commented in Computer Networks 14 hours ago

150 views

0 votes

1 answer

17

Computer networks
Is it possible for an organization’s Web server and mail server to have the same alias for a hostname (for example, foo.com)? What would be the type for the RR that contains the hostname of the mail server?

Sagnick12 answered in Computer Networks 14 hours ago

51 views

5 votes

3 answers

18

ISRO2020-46
A magnetic disk has $100$ cylinders, each with $10$ tracks of $10$ sectors. If each sector contains $128$ bytes, what is the maximum capacity of the disk in kilobytes? $1,280,000$ $1280$ $1250$ $128,000$

Bhaskar_Saini answered in CO and Architecture 14 hours ago

by Bhaskar_Saini

2.4k views

0 votes

1 answer

19

NIELIT 2021 Dec Scientist A - Section B: 61
Let $\text{T(n)}$ be the number of different binary search trees on $\text{n}$ distinct elements-then $\text{T(n)} = \displaystyle{\sum_{k=1}^{n}} \text{T(K-1)} \; T(x)$ where $x$ is: $\text{ n – k + 1}$ $\text{ n – k}$ $\text{ n – k – 1}$ $\text{ n – k – 2}$

Sandeep652025 answered in Others 14 hours ago

by Sandeep652025

100 views

0 votes

1 answer

20

NIELIT 2021 Dec Scientist A - Section B: 56
A demultiplexer is used to : Route the data from single input to one of many outputs Perform serial to parallel conversion Both $\text{(A)}$ and $\text{(B)}$ Select data from several inputs and route it to single output

Sandeep652025 answered in Others 15 hours ago

by Sandeep652025

104 views

1 vote

1 answer

21

DRDO CSE 2022 Paper 2 | Question: 27
A transposition cipher (but not a rail-fence cipher) was used to produce the following ciphertext: $\text{X 2! H M E S S S E 2 Y T A 2 I I A}$ The key used was: $5 \; 2 \; 6 \; 3 \; 4 \; 1.$ What was the plaintext used (in English)?

chandira answered in Computer Networks 15 hours ago

50 views

0 votes

0 answers

22

Admissions
I have given GATE CSE 2 times (2022 & 2023) and unfortunately, I got the same Score in both 2022 & 2023 but the rank get decreased this year( decreased means poor as compared to last year) So, My question is which gate scorecard should I used in the admission process (2022 with better rank but same score says ‘X’ or 2023 with the poor rank but some score ‘X’).

TusharKumar commented in IISc/IITs 16 hours ago

53 views

1 vote

1 answer

23

I didn't get call from iisc interview at gate rank 546 and score 705 (gate 2022) what should I do?

Doddi Guna Venkat commented in IISc/IITs 17 hours ago

by Doddi Guna Venkat

355 views

0 votes

0 answers

24

My gate 2021 cse score is 571 and rank is 2589. Please let me know which colleges can I get at this score.

Doddi Guna Venkat commented in Others 17 hours ago

by Doddi Guna Venkat

197 views

0 votes

1 answer

25

unacademy AIMT 2
In go back 5, if every 7th packet that is being transmitted is lost and if we have to send 10 packets, then how many transmissions are required____. I’m getting 15 but the given answer is 14

chandira answered in Computer Networks 17 hours ago

213 views

0 votes

0 answers

26

Capgemini Mock Test 2023
int sum(int A[], int n) { int sum = 0, i; for(i = 0; i< n; i++) sum = sum + A[i]; return sum; } What is the space complexity? Select one: a. 2n + 8 b. 2n + 16 c. n^2 d. n + 8 What is the space complexity?

*nikhil* commented in Programming 23 hours ago

211 views

22 votes

6 answers

27

GO Classes Weekly Quiz 4 | Propositional Logic | Question: 14
Consider the following popular puzzle. When asked for the ages of her three children, Mrs. Baker says that Alice is her youngest child if Bill is not her youngest child, and that Alice is not her youngest child if ... Bill is her youngest child. Carl is her youngest child. Information is not sufficient to find out the youngest child.

Soujit answered in Mathematical Logic 1 day ago

by Soujit

1.2k views

0 votes

2 answers

28

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 14 (Page No. 175)
In Fig. $2-12$ the register set is listed as a per-thread rather than a per-process item. Why? After all, the machine has only one set of registers.

firefrost_ind_125 answered in Operating System 1 day ago

by firefrost_ind_125

539 views

0 votes

0 answers

29

discrete mathematics
The maximum number of edges possible in a graph G with 9 vertices which is 3 colourable is equal to A 24 B 27 C 36 D None of the above

Kabir5454 commented in Graph Theory 1 day ago

43 views

56 votes

8 answers

30

GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions

-RahulKumar- answered in Linear Algebra 1 day ago

by -RahulKumar-

15.4k views

To see more, click for the full list of questions or popular tags.

Recent activity