Dark Mode

Recent questions and answers

4 votes

1 answer

1

GATE CSE 2023 | Question: 42
Suppose in a web browser, you click on the $\textsf{www. gate-2023.in}\; \text{URL}$. The browser cache is empty. The $\text{IP address}$ for this $\text{URL}$ is not cached in your local host, so a $\text{DNS}$ lookup is triggered (by the ... $5$ parallel $\text{TCP}$ connections. $6\; \text{RTT}$s, in case of persistent $\text{HTTP}$ with pipelining.

nihal_chourasiya answered in Computer Networks 2 hours ago

by nihal_chourasiya

2.2k views

0 votes

2 answers

2

Can any one solve this , 6B and 4G ,at least 2 girls should be together in circular arrangement

saiyam answered in Combinatory 2 hours ago

by saiyam

33 views

0 votes

0 answers

3

Context Free Language
The complement of the languages: i) {ww | w in (0+1)*} ii) {$a^n b^nc^n$ | n>1} are a) Context Free b) Not Context Free c)are DCFL’s d)None

practicalmetal asked in Theory of Computation 2 hours ago

by practicalmetal

6 views

0 votes

0 answers

4

Context Free Languages
Is the following language CFL : { ww | w in (a+b)* and |w| <1000 }

practicalmetal asked in Theory of Computation 2 hours ago

by practicalmetal

6 views

0 votes

1 answer

5

self doubt
how to write if and only if symbolic form explain in detail????

AviDhakane answered in Mathematical Logic 2 hours ago

16 views

4 votes

2 answers

6

Nullity of matrix
Nullity of a matrix = Total number columns – Rank of that matrix But how to calculate value of x when nullity is already given(1 in this case)

39Gaurav_singh answered in Linear Algebra 7 hours ago

by 39Gaurav_singh

2.5k views

3 votes

4 answers

7

ISI2018-MMA-12
The rank of the matrix $\begin{bmatrix} 1 &2 &3 &4 \\ 5& 6 & 7 & 8 \\ 6 & 8 & 10 & 12 \\ 151 & 262 & 373 & 484 \end{bmatrix}$ $1$ $2$ $3$ $4$

39Gaurav_singh answered in Linear Algebra 8 hours ago

by 39Gaurav_singh

1.2k views

0 votes

0 answers

8

Fork() system call.
main(){ int i,n; for(int i=0;i<n;i++){ fork(); printf("*"); } } How many times ‘*’ will be printed? The answer is not 2^n ? why?

vikranty2j asked in Operating System 9 hours ago

26 views

0 votes

0 answers

9

GATE CS 2023
Got 262 Rank,Score 746 and 67.67 marks in Gen Category in GATE CS 2023., Which IITs can offer direct admission and in which courses.

rajdkaur asked in Written Exam 12 hours ago

37 views

0 votes

0 answers

10

Float representation using normalised mantissa
while representing an exponent in floating point number why do we add a biased term? What is the benifit of adding this??

Sk Jamil Ahemad asked in Digital Logic 1 day ago

by Sk Jamil Ahemad

16 views

26 votes

5 answers

11

GATE CSE 2017 Set 1 | Question: 30
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$

KG answered in Linear Algebra 1 day ago

by KG

11.2k views

2 votes

4 answers

12

GATE CSE 2023 | GA Question: 1
We reached the station late, and _______ missed the train. near nearly utterly mostly

gate_asp24 answered in Verbal Aptitude 2 days ago

1.4k views

0 votes

1 answer

13

physics wallah dpp #clanguage #pointer

anirudhkumar18 answered in Programming 2 days ago

by anirudhkumar18

70 views

1 vote

1 answer

14

GATE2023
Okay in this year GATE-2023, i have got 56.67 marks, Rank-1024, GATE score-622 and my category is SC. I just want to know that what are my chances in top or any IIT's. And which IIT takes a separate test/interview other than gate score. Please be kind.

Bharat Bhushan answered in IISc/IITs 2 days ago

by Bharat Bhushan

104 views

45 votes

9 answers

15

GATE CSE 2011 | Question: 29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$

Vasudevarnabmessi answered in DS 2 days ago

by Vasudevarnabmessi

24.3k views

0 votes

1 answer

16

functional dependency
given an instance of relation R(ABC). find all non-trivial FDsare AB->C, AC->B, BC→ A true ??

chinmay_rajpurohit answered in Databases 2 days ago

by chinmay_rajpurohit

47 views

32 votes

10 answers

17

GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.

Vasudevarnabmessi answered in DS 2 days ago

by Vasudevarnabmessi

14.3k views

29 votes

2 answers

18

GATE IT 2008 | Question: 73
How many distinct BSTs can be constructed with $3$ distinct keys? $4$ $5$ $6$ $9$

Vasudevarnabmessi answered in DS 2 days ago

by Vasudevarnabmessi

10.4k views

0 votes

2 answers

19

made easy test series for gate cse 2023
please help me out in solving this question. the solution provided there is not upto the mark

Ujjaval251 answered in Programming 2 days ago

450 views

24 votes

6 answers

20

GATE CSE 2004 | Question: 4, ISRO2009-26
The following numbers are inserted into an empty binary search tree in the given order: $10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? $2$ $3$ $4$ $6$

Vasudevarnabmessi answered in DS 2 days ago

by Vasudevarnabmessi

19.5k views

24 votes

5 answers

21

GATE CSE 1996 | Question: 2.14
A binary search tree is generated by inserting in order the following integers: $50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$ The number of nodes in the left subtree and right subtree of the root respectively is $(4, 7)$ $(7, 4)$ $(8, 3)$ $(3, 8)$

Vasudevarnabmessi answered in DS 2 days ago

by Vasudevarnabmessi

27.5k views

40 votes

8 answers

22

GATE CSE 2005 | Question: 2
An Abstract Data Type (ADT) is: same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used, but none else all of the above

Vasudevarnabmessi answered in DS 2 days ago

by Vasudevarnabmessi

16.7k views

4 votes

1 answer

23

GATE CSE 2023 | Question: 38
Let $U=\{1,2, \ldots, n\},$ where $n$ is a large positive integer greater than $1000.$ Let $k$ be a positive integer less than $n$. Let $A, B$ be subsets of $U$ with $|A|=|B|=k$ and $A \cap B=\emptyset$. We say that a permutation of $U$ separates $A$ from $B$ if ... $2\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k) !(k !)^{2}$

susmitbasu answered in Combinatory 3 days ago

912 views

1 vote

3 answers

24

Unacademy AIMT question on Fork()
Given the following piece of code : Main() { Int child = fork(); Int c = 5; if (child == 5) { C + = 5; } Else { Child = fork(); C + = 5; } } What are the different values of the variable c? First of all checking child == ... a pseudocode as some of the syntaxes are wrong. Also I am getting the answer as 10,10,10. Given answer is 20,10,15. Can someone please check?

Ujjal roy answered in Operating System 3 days ago

390 views

56 votes

7 answers

25

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

KG answered in Linear Algebra 3 days ago

by KG

15.3k views

1 vote

1 answer

26

ISI2015-MMA-89
Let $y(x)$ be a non-trivial solution of the second order linear differential equation $\frac{d^2y}{dx^2}+2c\frac{dy}{dx}+ky=0,$ where $c<0$, $k>0$ and $c^2>k$. Then $\mid y(x) \mid \to \infty$ as $x \to \infty$ $\mid y(x) \mid \to 0$ as $x \to \infty$ $\underset{x \to \pm \infty}{\lim} \mid y(x) \mid$ exists and is finite none of the above is true

KAUNIL answered in Others 3 days ago

by KAUNIL

175 views

39 votes

7 answers

27

GATE CSE 2015 Set 2 | Question: 29
Consider the intermediate code given below. (1) i=1 (2) j=1 (3) t1 = 5 * i (4) t2 = t1 + j (5) t3 = 4 * t2 (6) t4 = t3 (7) a[t4] = -1 (8) j = j + 1 (9) if j <= 5 goto (3) (10) i = i +1 (11) if i < 5 goto (2) The number of nodes and edges in control-flow-graph constructed for the above code, respectively, are $5$ and $7$ $6$ and $7$ $5$ and $5$ $7$ and $8$

Rohit gundeti answered in Compiler Design 3 days ago

by Rohit gundeti

20.2k views

3 votes

1 answer

28

UGC NET CSE | August 2016 | Part 3 | Question: 14
Consider a $N$-bit plane frame buffer with $W$-bit wide lookup table with $W > N$. How many intensity levels are available at a time ? $2^{N}$ $2^{W}$ $2^{N+W}$ $2^{N-1}$

chandira answered in Computer Graphics 3 days ago

1.8k views

1 vote

1 answer

29

Operating Systems Galvin
Does Waiting Time and Response TIme remains the same in Preemptive Scheduling Algorithm???

Bharat Bhushan answered in Operating System 4 days ago

by Bharat Bhushan

67 views

0 votes

2 answers

30

Computer Networks
Answer given is d (Question From PW)

Mr_Engineer answered in Computer Networks 4 days ago

132 views

1 vote

1 answer

31

Subnets
Consider the following table with subnets Subnet Subnet Id Subnet Mask $ A$ 150.60.160.0 255.255.240.0 $B $ 150.60.164.0 255.255.252.0 $C $ 150.160.168.0 255.255.252.0 Can we say subnet C exists inside subnet A?

Mr_Engineer answered in Computer Networks 4 days ago

92 views

0 votes

1 answer

32

Context Free Languages
Is the following language context free: The set of all strings with number of a’s equal to number of b’s and the sum of a’s and b’s to be divisible by 3.

GNANESWARA SAI answered in Theory of Computation 4 days ago

by GNANESWARA SAI

65 views

0 votes

1 answer

33

Calcutta University Question Paper
Consider a relation r1(A, B, C), r2(C, D, E) and r3(E, G) with primary keys A, C and E respectively. Assume that r1 has 1000 tuples, r2 has 1500 tuples and r3 has 750 tuples. The number of resultant tuple in are

Ujjal roy answered in Databases 5 days ago

181 views

0 votes

1 answer

34

isro 2018
Consider the following C code segment: #include main() { int i, j , x ; scanf("%d", &x); i = 1 ; j = 1; while ( i< 10 ) { j = j * i; i = i + 1; if (i == x) break ; } } For the program fragment above, which of the following statements about the variables i and j must be true after ... = (x - 1)!) ∧ (i = x )) D (( j = 9!) ∧ (i = 10)) V (( j = (x - 1)!) ∧ (i = x ))

dsujay748 answered in Programming 5 days ago

886 views

1 vote

1 answer

35

DRDO CSE 2022 Paper 2 | Question: 25
Assume when encrypting $3$-bit plaintext with a block cipher with key $\text{K},$ ... with key $\mathrm{K}$ in counter mode (with initial counter value $=0):$ $\text{C}=100110000$ What was the plaintext?

AGNIDEB MUKHERJEE answered in Computer Networks 5 days ago

by AGNIDEB MUKHERJEE

75 views

0 votes

0 answers

36

Self doubt
For barc cse exam, what subjects do i have to prepare other than gate syllabus?

gaddalakonda_ganesh asked in GATE 5 days ago

by gaddalakonda_ganesh

44 views

0 votes

1 answer

37

self doubt
Solve the following recurrences using recursion tree method and write the asymptotic time complexity T(n)=T(n/2)+n^2

Çșȇ ʛấẗẻ asked in Algorithms 6 days ago

by Çșȇ ʛấẗẻ

60 views

0 votes

0 answers

38

doubt
where can I find all barc’s PYQ

someshawasthi asked in BARC 6 days ago

by someshawasthi

36 views

0 votes

1 answer

39

Practice question Avl trees
S1 : An insertion in an AVL with n nodes requires O(n) rotations. answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n). tell me if i am wrong and correct me please.

Ujjaval251 asked in Programming 6 days ago

55 views

1 vote

0 answers

40

TIFR Mathematics 2023 | Part B | Question: 1
Answer whether the following statements are True or False. Let $\alpha$ be a positive real number, and let $f:(0,1) \rightarrow \mathbb{R}$ be a function such that $|f(x)-f(y)| \leq$ $|x-y|^{\alpha}$ for all $x, y \in(0,1)$. Then $f$ can be extended to a continuous function $[0,1] \rightarrow \mathbb{R}$.

admin asked in Others 6 days ago

by admin

17 views

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

Recent questions and answers