Dark Mode

Recent questions and answers in Others

0 votes

1 answer

1

UGC NET CSE | October 2022 | Part 1 | Question:: 94
In a game playing search tree, upto which depth $\alpha-\beta$ pruning can be applied? (A) Root $\text{(0)}$ level (B) $6$ level (C) $8$ ... only $\text{(A)}$ $\text{(B)}$ and $\text{(C)}$ only $\text{(A)}$ and $\text{(D)}$ only

KHUSHBU BHARTI answered in Others May 2

by KHUSHBU BHARTI

83 views

0 votes

1 answer

2

UGC NET CSE | October 2022 | Part 1 | Question:: 92
A good software requirement specification does $\text{NOT}$ have the characteristic Completeness Consistency Clarity Reliability

KHUSHBU BHARTI answered in Others May 2

by KHUSHBU BHARTI

62 views

0 votes

2 answers

3

UGC NET CSE | October 2022 | Part 1 | Question:: 17
A classless address is given as $167.199 .170 .82 / 27$. The number of addresses in the network is $64$ addresses $32$ addresses $28$ addresses $30$ addresses

artim answered in Others Apr 27

by artim

76 views

0 votes

0 answers

4

Game Theory(Self doubt)

legacy asked in Others Apr 19

by legacy

33 views

0 votes

0 answers

5

Game Theory(Self doubt)

legacy asked in Others Apr 19

by legacy

15 views

0 votes

0 answers

6

Game Theory(Self doubt)

legacy asked in Others Apr 19

by legacy

16 views

0 votes

0 answers

7

Game Theory(self Doubt)

legacy asked in Others Apr 19

by legacy

24 views

1 vote

1 answer

8

I need your Adviice Friends( Try again vs Take admission)
Ladies and gentleman, i could really use some advice from you. About me; 2020 passout , 2 years in TCS and this was my second gate attempt and first serious one. Prepared for around 5 months. Coudlnt preapre at all in December Janurary ... What do you suggest? Take a drop for 2024 and try for old iit's or take admission looking at my age.

Diksha_Gupta answered in Others Mar 26

by Diksha_Gupta

71 views

1 vote

1 answer

9

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 Mar 17

by KAUNIL

196 views

1 vote

1 answer

10

ISI2015-MMA-88
Let $f(x)$ be a given differentiable function. Consider the following differential equation in $y$ $f(x) \frac{dy}{dx} = yf’(x)-y^2.$ The general solution of this equation is given by $y=-\frac{x+c}{f(x)}$ $y^2=\frac{f(x)}{x+c}$ $y=\frac{f(x)}{x+c}$ $y=\frac{\left[f(x)\right]^2}{x+c}$

KAUNIL answered in Others Mar 11

by KAUNIL

213 views

1 vote

2 answers

11

ISI2015-MMA-84
For positive real numbers $a_1, a_2, \cdots, a_{100}$, let $p=\sum_{i=1}^{100} a_i \text{ and } q=\sum_{1 \leq i < j \leq 100} a_ia_j.$ Then $q=\frac{p^2}{2}$ $q^2 \geq \frac{p^2}{2}$ $q< \frac{p^2}{2}$ none of the above

KAUNIL answered in Others Mar 10

by KAUNIL

316 views

0 votes

2 answers

12

ISI2015-MMA-70
Let $w=\log(u^2 +v^2)$ where $u=e^{(x^2+y)}$ and $v=e^{(x+y^2)}$. Then $\frac{\partial w }{\partial x} \mid _{x=0, y=0}$ is $0$ $1$ $2$ $4$

KAUNIL answered in Others Mar 9

by KAUNIL

342 views

1 vote

1 answer

13

Game theory(Self doubt)
What are the winning opening moves in 3x3 and 4x4 Hex?

Bharat Bhushan answered in Others Mar 8

by Bharat Bhushan

94 views

0 votes

0 answers

14

Numerical Method Analysis :
Solve the following system using Gauss seidal iterative method with initial guess (0, 0, 0) and tolerance 0.001. $\left\{\begin{matrix} 2x_{1}-3x_{2}+x_{3} = 5\\ x_{1}+4x_{2}+12x_{3} = 10\\ 6x_{1}+x_{2}+5x_{3} = 9 \end{matrix}\right.$

kidussss asked in Others Mar 8

96 views

0 votes

0 answers

15

Game theory(Self doubt)
Let (s, t) and (s’, t’) be two different saddle points for a strictly competitive game. Prove that (s, t’) and (s’, t) are also saddle points.

legacy asked in Others Feb 20

by legacy

65 views

0 votes

0 answers

16

Game theory(self doubt)
The figure below illustrates the tree of a strictly competitive game G of perfect information without chance moves. (a) How many pure strategies does each player have? (b) List each player's pure strategies using the notation introduced in class. (c) ... not selected by Zermelo's algorithm? (h) Find all Nash equilibria of the game. Which of these are subgame-perfect?

legacy asked in Others Feb 20

by legacy

68 views

0 votes

0 answers

17

Game theory(self doubt)
Dominos can be placed on an m by n board so as to cover two squares exactly. Two players alternate in doing this. The first to be unable to place a domino is the loser. For each case below draw the game tree and identify, with justifications, the player who has a winning strategy. Hint: the conclusion ... = 3 and n = 2 (c) m = 4 and n = 2 (d) m = 2 and n =5 (e) m = n = 3.

legacy asked in Others Feb 20

by legacy

45 views

0 votes

1 answer

18

Class Test AFLL Revision
How many states does the DFA and NFA constructed for the “set of all binary strings where the second last symbol will never be a 1” have?

Johnny1001 answered in Others Jan 15

266 views

0 votes

1 answer

19

UGC NET CSE | October 2022 | Part 1 | Question:: 80
$\text{RAD}$ software process model stands for Rapid Application Development Relative Application Development Rapid Application Design Recent Application Development,

rsansiya111 answered in Others Dec 19, 2022

58 views

0 votes

1 answer

20

UGC NET CSE | October 2022 | Part 1 | Question:: 77
Consider $\text{L =a b, a a, b a a}$ Which of the following string is $\text{NOT}$ in $\mathrm{L}^{*}$ ? $\text{baaaaabaaaaa}$ $\text{abaabaaabaa}$ $\text{aaaabaaaa}$ $\text{baaaabaa}$

DebRC answered in Others Nov 25, 2022

by DebRC

64 views

0 votes

2 answers

21

UGC NET CSE | October 2022 | Part 1 | Question:: 74
Which of the following algorithm design approach is used in Quick sort algorithm? Dynamic programming Back Tracking Divide and conquer Greedy approach

Hira Thakur answered in Others Nov 22, 2022

122 views

1 vote

1 answer

22

UGC NET CSE | October 2022 | Part 1 | Question:: 60
What is called Journalling in Linux operating system? Process scheduling File saving as transaction, A type of thread An editor,

ajayraho answered in Others Nov 21, 2022

95 views

0 votes

2 answers

23

UGC NET CSE | October 2022 | Part 1 | Question:: 45
Match List I with List II : List I List II (A) Type $0$ (I) Finite automata (B) Type $1$ (II) Tuning machine (C) Type $2$ (III) Linear bound automata (D) Type $3$ ...

supreetshukla answered in Others Nov 15, 2022

by supreetshukla

223 views

0 votes

1 answer

24

UGC NET CSE | October 2022 | Part 1 | Question:: 87
Consider the following algorithms and their running times : Algorithms Complexities (A) Breadth First Search (I) $\theta(v+E)$ (B) Rabin-Karp Algorithm (II) $O(v+E)$ (C) Depth-First Search (III) $\theta((n-m-1) m)$ (D) Heap sort (worst case) (IV) $O\left(n^2\right)$ (E) ... $\text{(A)-(III), (B)-(I), (C)-(II), (D)-(IV), (E)-(V)}$

Himanshu555 answered in Others Nov 12, 2022

77 views

0 votes

1 answer

25

UGC NET CSE | October 2022 | Part 1 | Question:: 37
The logic expression $(\bar{P} \wedge Q) \vee(P \wedge \bar{Q}) \vee(P \wedge Q)$ is equivalent to $\bar{P} \vee Q$, $P \vee \bar{Q}$ $P \vee Q$ $\bar{P} \vee \bar{Q}$

Hira Thakur answered in Others Nov 7, 2022

93 views

1 vote

2 answers

26

UGC NET CSE | October 2022 | Part 1 | Question:: 76
Consider the following statements: Statement $\text{I}$: $\text{LALR}$ parser is more powerful than canonical $\text{LR}$ Parser. Statement $\text{II}$: $\text{SLR}$ parser is more powerful than $\text{LALR}$ Which of the following is ... Statement $\text{I}$ and Statement $\text{II}$ false Both Statement $\text{I}$ and Statement $\text{II}$ true

Hira Thakur answered in Others Nov 5, 2022

154 views

0 votes

1 answer

27

UGC NET CSE | October 2022 | Part 1 | Question:: 4
Consider the following statements about Context Free Language $\text{(CFL)}$ : Statement I: $\text{CFL}$ is closed under homomorphism. Statement II: $\text{CFL}$ ... $\text{I}$ and Statement $II$ are true Neither Statement $\text{I}$ nor Statement $\text{II}$ is true

Hira Thakur answered in Others Nov 5, 2022

182 views

0 votes

1 answer

28

UGC NET CSE | October 2022 | Part 1 | Question:: 103
Based on the following passage, answer the Questions : A $3000 \mathrm{~km}$ long trunk operates at $1.536 \mathrm{mbps}$ ... $T_{\mathrm{t}}=1800 \mu \mathrm{sec}, T_{\mathrm{P}}=33.33 \mu \mathrm{sec}$

Hira Thakur answered in Others Nov 5, 2022

97 views

0 votes

1 answer

29

UGC NET CSE | October 2022 | Part 1 | Question:: 33
Which of the following is correct for the destination address $4 \mathrm{~A}: 30: 10: 21: 10: 1 \mathrm{~A}$ ? unicast address multicast address broadcast address unicast and broadcast address

Hira Thakur answered in Others Nov 5, 2022

112 views

0 votes

1 answer

30

UGC NET CSE | October 2022 | Part 1 | Question:: 2
Consider two lists $\mathrm{A}$ and $\mathrm{B}$ of three strings on $\{0,1\}$ $X$ : List A List B $1$ $111$ $10111$ $10$ $10$ $0$ $Y$: List A List B $10$ $101$ $011$ $11$ $101$ $011$ Which of the following is true? ... solution., PCP in both $\mathrm{X}$ and $\mathrm{Y}$ has solution. PCP neither in $\mathrm{X}$ nor in $\mathrm{Y}$ has solution.,

afroze answered in Others Oct 23, 2022

by afroze

341 views

1 vote

0 answers

31

UGC NET CSE | October 2022 | Part 1 | Question:: 3
Using $\text{'RSA'}$ algorithm, if $p=13, q=5$ and $e=7$. the value of $d$ and cipher value of $'6'$ with $(e, n)$ key are $7, 4$ $7, 1$ $7, 46$ $55,1$

admin asked in Others Oct 23, 2022

by admin

307 views

0 votes

0 answers

32

UGC NET CSE | October 2022 | Part 1 | Question:: 5
Size and complexity are a part of People Metrics Project Metrics Process Metrics Product Metrics

admin asked in Others Oct 23, 2022

by admin

116 views

1 vote

0 answers

33

UGC NET CSE | October 2022 | Part 1 | Question:: 6
The solution of the recurrence relation $T(n)=3 T(n / 4)+n \lg n$ is $\theta\left(n^{2} \lg n\right)$ $\theta(n \lg n)$ $\theta(n \lg n)^{2}$ $\theta(n \lg \lg n)$

admin asked in Others Oct 23, 2022

by admin

134 views

0 votes

0 answers

34

UGC NET CSE | October 2022 | Part 1 | Question:: 7
Match List $\text{I}$ with List $\text{II}$ : List I List II (A) Ontological Engineering (I) Organizing subclass relations (B) Taxonomy Hierarchy (II) Organizing knowledge into category and sub category (C) Inheritance (III) Attaches a number with each possibility (D) Probability mode ... ), (C)-(I), (D)-(II) (A)-(IV), (B)-(I), (C)-(II), (D)-(III)

admin asked in Others Oct 23, 2022

by admin

150 views

0 votes

0 answers

35

UGC NET CSE | October 2022 | Part 1 | Question:: 8
A $4$-stage pipeline has the stage delay as $150,120,160$ and $140$ ns respectively. Registers that are used between the stages have delay of $5 \mathrm{~ns}$. Assuming constant locking rate, the total time required to process $1000$ data items on this pipeline is $160.5 \mathrm{~ms}$ $165.5 \mathrm{~ms}$ $120.5 \mathrm{~ms}$ $590.5 \mathrm{~ms}$

admin asked in Others Oct 23, 2022

by admin

135 views

1 vote

0 answers

36

UGC NET CSE | October 2022 | Part 1 | Question:: 9
The number of nodes of height $\mathrm{h}$ in any $\mathrm{n}$-element heap is atmost: $n / 2^{n+1}$ $\frac{n}{2^{h-1}}$ $\frac{n}{2^{h}}$ $\frac{n-1}{2^{h-1}}$

admin asked in Others Oct 23, 2022

by admin

230 views

0 votes

0 answers

37

UGC NET CSE | October 2022 | Part 1 | Question:: 10
Consider the following statements: Statement $I$: Conservative $2 \mathrm{PL}$ is a deadlock-free protocol. Statement $II$: Thomas's write rule enforces conflict serializability. Statement $III$: Timestamp ordering protocol ensures serializability based ... $II$ false and Statement $III$ true Statement $I$, Statement $II$ and Statement $III$ true

admin asked in Others Oct 23, 2022

by admin

125 views

0 votes

0 answers

38

UGC NET CSE | October 2022 | Part 1 | Question:: 11
In reference to Big data, consider the following database : (A) Memcached (B) Couch $\text{DB}$ (C) Infinite graph Choose the most appropriate answer from the options given below : $(A)$ and $(B)$ only $(B)$ and $(C)$ only, $(C)$ and $(A)$ only $(A)$ $(B)$ and $(C)$

admin asked in Others Oct 23, 2022

by admin

125 views

0 votes

0 answers

39

UGC NET CSE | October 2022 | Part 1 | Question:: 12
Consider the hash table of size $11$ that uses open addressing with linear probing. Let $h(k)=k$ $\text{mod}$ $11$ be the hash function. A sequence of records with keys $43, 36, 92, 87. 11 . 47. 11, 13, 14$ is inserted into an initially ... from $0$ to $10$. What is the index of the bin into which the last record is inserted? $8$ $7$ $10$ $4$

admin asked in Others Oct 23, 2022

by admin

64 views

0 votes

0 answers

40

UGC NET CSE | October 2022 | Part 1 | Question:: 13
Consider the primal problem : Maximize $z=5 x_{1}+12 x_{2}+4 x_{3}$ Subject to \[ \begin{array}{l} x_{1}+2 x_{2}+x_{3}=10\\ 2 x_{1}-x_{2}+3 x_{3}=8 \\ x_{1}, x_{2}, x_{3} \geq 0 \end{array} \] its dual problem is ... unrestricted $y_{1} \geq 0, y_{2} \geq 0$ $y_{1}$ is unrestricted, $y_{2} \geq 0$ $y_{1}$ is unrestricted. $y_{2}$ restricted

admin asked in Others Oct 23, 2022

by admin

73 views

To see more, click for all the questions in this category.

Recent questions and answers in Others