Dark Mode

Recent activity by srivivek95

1 answer

1

PGEE 2018
If root of equation f(x) is 0 ar x= -3 and X= 3 then root of equation f(x+3) will be at ? A) X= 0 and X=6 B) X=-3 and X=3 C) X=-6 and X=0; D) X=-6 and X= 6

commented in Set Theory & Algebra Apr 21, 2018

547 views

8 answers

2

GATE CSE 2018 | Question: 15
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a ... and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____

commented in Probability Feb 14, 2018

10.9k views

0 answers

3

Testbook Test Series
An array of unknown size is filled with special symbols let's say '#'. Time required to find the size of array is 1) O(1) 2) O(logn) 3) O(n) 4) O((logn)2)

commented in Algorithms Jan 25, 2018

688 views

1 answer

4

Kenneth Rosen Edition 6th Exercise 7.6 Example 21 (Page No. 519 )
How is this a lattice?

commented in Set Theory & Algebra Jan 25, 2018

907 views

0 answers

5

Digital Logic
Solution?

commented in Digital Logic Jan 24, 2018

229 views

2 answers

6

Language identify
consider following language L1= {a^nB^b/n>=0} L2= compliment of L1 choose the correct option regarding the language L1& L2 1. L1 &L2 are context free 2.L1 is context free but L2 is regular 3.L1 is context free & L2 is contxt sensitive 4. none

commented in Theory of Computation Jan 24, 2018

3.0k views

1 answer

7

test series
how p4 is equivalent this plz explain

commented in Mathematical Logic Jan 24, 2018

328 views

0 answers

8

Ace Test Series: Theory Of Computation - NFA To Regular Expression

commented in Theory of Computation Jan 23, 2018

682 views

2 answers

9

HASH TABLES
Hash tables can contribute to the following problems except 1) Counting distinct values 2) Dynamiic dictonary 3) Symbol table look up 4) Range search

commented in Compiler Design Jan 22, 2018

2.0k views

1 answer

10

Test by Bikram | Mock GATE | Test 3 | Question: 59
Out of six coins, four coins are tossed simultaneously. The number of possible outcomes where at most three of the coins turn up as heads is ______.

commented in GATE Jan 22, 2018

756 views

1 answer

11

regular or context free ?
(a+b)^* a^n b^n n>=1

commented in Theory of Computation Jan 21, 2018

447 views

0 answers

12

CSL or not ?
L={ (an)m bn | n,m>=1 }

commented in Theory of Computation Jan 20, 2018

569 views

0 answers

13

Time Complexity
which function will grow faster? a) x$\sqrt{x}$ b) x!

commented in Algorithms Jan 20, 2018

520 views

1 answer

14

commented in Algorithms Jan 19, 2018

1.0k views

0 answers

15

MadeEasy Test Series 2018: Programming & DS - Stack
Not able to understand the question. Kindly elaborate along with an explanation. Thank you.

commented in DS Jan 18, 2018

450 views

1 answer

16

No of Super Key
R (A1, A2, ….An) and every (n-2) attributes of R forms a candidate key. How many super keys are there in R? a) $_{n-2}^{n}\textrm{C}$ b) $_{n-2}^{n}\textrm{C}$ * 4 c) $_{n-2}^{n}\textrm{C}$ * n d) $_{n-2}^{n}\textrm{C}$ + n +1

commented in Databases Jan 17, 2018

2.7k views

1 answer

17

virtualgate
Here query is not correct if there are two persons with higher rating?Am I correct?

commented in Databases Jan 16, 2018

574 views

1 answer

18

Digital circuit

commented in Digital Logic Jan 16, 2018

479 views

0 answers

19

Test series
Consider the following Resource Allocation Graph (RAG) and set of sequences. I) <P1,P4,P3,P5,P2> II) <P1,P4,P3,P2,P5> III) <P1,P4,P2,P5,P3> IV) <P1,P4,P5,P2,P3> Which of the above sequences can be safe?

commented in Operating System Jan 15, 2018

504 views

1 answer

20

3NF Fully functional dependent
Consider the following statements: A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on some key of R. State True or False

commented in Databases Jan 15, 2018

1.7k views

1 answer

21

quick sort
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the best case performance is a) O(n2) b) O(nlogn) c) Θ(nlogn) d) O(n3)

commented in Algorithms Jan 14, 2018

2.5k views

1 answer

22

MadeEasy Test Series 2018: Computer Networks - Network Flow
my approach is 1 <= Td(x)/(Td+2Tp), x is size of SW then the answer wil be - ceil(log x) Is my approach is correct, if not then how to solve this?

commented in Computer Networks Jan 14, 2018

338 views

1 answer

23

programming and data structures
A 4-ary i.e., either has 0 children or has 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ________.

commented in DS Jan 14, 2018

338 views

1 answer

24

MadeEasy Subject Test: Programming & DS - Binary Tree

commented in DS Jan 14, 2018

578 views

2 answers

25

Full Outer Join
Why is the minimum number of tuples in full outer join equal to max (m,n) ?

commented in Databases Jan 14, 2018

3.8k views

0 answers

26

MadeEasy Test Series 2018: Computer Networks - Congestion Control

commented in Computer Networks Jan 14, 2018

661 views

0 answers

27

Operating system
Please explain in detail

commented in Operating System Jan 13, 2018

495 views

0 answers

28

Semaphore doubt
wait(S); Critical section wait(S); S is a binary semaphore initialised to 1. Suppose there are n processes competing for the CS. Only one can enter into it. Is this the situation of deadlock or starvation? I think it's deadlock because other ... one process is getting executed so it's not deadlock as in case of deadlock none of the processes can proceed. Please clarify.

commented in Operating System Jan 13, 2018

1.0k views

1 answer

29

Normal Form
Given a relation with five attributes and the following FDs: A -> D A -> E DE -> BC B -> A D -> C What is the highest normal form satisfied by the relation?

commented in Databases Jan 13, 2018

774 views

1 answer

30

LU decomposition
In the LU decomposition of the matrix,$\begin{bmatrix} 1 &2 \\ 3 &8 \end{bmatrix}$ if the diagonal elements of $U$ are both $1$, then the trace of $L$ is$?$

answered in Linear Algebra Jan 13, 2018

2.1k views