Dark Mode

Recent activity by sourav.

2 answers

1

Made Easy Test Series
What is worst case time complexity to delete middle element from the min heap of n distinct elements? O(logn) O(n) O(nlogn) O($n^{2}$)

commented in Algorithms Dec 2, 2018

2.3k views

0 answers

2

made easy
Consider the following c code int f(int x) { if(x<1) return 1; else return f(x-1)+g(x); } int g(int x) { if (x<2) return 1; else return f(x-1)+g(x/2); } Of the following ,which best describes the growth of f(x) as a function of x? a) logarithmic b) quadratic c) linear d)exponential

closed in Algorithms Nov 21, 2018

470 views

2 answers

3

MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k = 1 ; k <= j ; k++) { x=x+10; } }

commented in Algorithms Oct 3, 2018

737 views

3 answers

4

self doubt RSA Algorithm
How To Solve..? 17 * d = 1 mod 3120. should we need to apply bruteforce?

answer selected in Computer Networks Oct 3, 2018

2.9k views

0 answers

5

Probability
Parcels from sender to receiver pass sequentially through 2 post office.Each post office has a probability 1/5 of loosing an incoming parcel,independently of all other parcels.Given that a parcel is lost, the probabilty that it was lost by the second post office is....??

closed in Probability Aug 15, 2018

265 views

1 answer

6

Made easy workbook
Each I-node in file system has 5-direct pointers to disk blocks, 3 single indirect pointers to disk blocks, 2 double indirect pointers to disk blocks and nothing else. A disk block is 400 bytes . A pointer to a disk block is 10 byte. The entire disk contains ... What is the total size of the entire file system. (A) 1325250 bytes (B) 1325000 bytes (C) 1330000 bytes (D) None.

answer selected in Operating System Aug 10, 2018

708 views

1 answer

7

Ace material
If a graph with 10 vertices having each vertex having degree >=5 find graph connected or disconnected

answered in Graph Theory Aug 8, 2018

365 views

2 answers

8

Permutations with restrictions
$Z =\left \{ {A,B,C,D,E,F,G} \right \}$ How many permutations of all elements of set $Z$ are possible when A cannot appear after D and C cannot appear after F C cannot appear after D

commented in Combinatory Jul 31, 2018

691 views

2 answers

9

#Number System
$(70\,\,\,34\,\,\, 3\,)_{81} = (?)_3$ Any trick to solve this type of questions?

edited in CO and Architecture Jul 31, 2018

700 views

0 answers

10

IP Addressing
An IP router implementing CIDR services a packet with address 131.23.151.76. The routers routing table has the following entries: Prefix Output Interface Identifier 131.16.0.0/12 3 131.28.0.0/14 5 131.19.0.0/16 2 131.22.0.0/15 1 The identifier of the output interface on which this packet will be forwarded is______________

closed in Computer Networks Jul 30, 2018

398 views

1 answer

11

ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.

commented in Graph Theory Jul 25, 2018

1.2k views

2 answers

12

Number of relation
How many relations are there on a set with 10 elements that are reflexive and symmetric??

commented in Mathematical Logic Jul 14, 2018

594 views

1 answer

13

#Regular Language

commented in Theory of Computation Jul 14, 2018

249 views

1 answer

14

logic and predicate

answered in Mathematical Logic Jul 14, 2018

397 views

1 answer

15

definite finite automata
construct DFA which do not contain 11 as sub string but end with 0

commented in Theory of Computation Jul 12, 2018

425 views

1 answer

16

#Self Doubt #programming-in-c What will be time complexity of the program?
What will be time complexity of the program? Explain?? #include<stdio.h> int main(){ int i,count=0; for(i=1 ; i<=n ; i++) { for(i=1 ; i<=$n^4$ ; i++) for(i=1 ; i<=$n^3$ ; i++){ count++; printf("%d\n",count); } } }

commented in Programming in C Jul 10, 2018

446 views

1 answer

17

Pipeline
A computer with a 5 stage pipeline deals with conditional branches by stalling for the next 3 cycle after hitting one. how much does stalling hurt the performance is 20% of all instructions are conditional branches.

answered in CO and Architecture Jul 7, 2018

961 views

0 answers

18

Pipeline
Suppose that a computer prefetches upto $20$ instructions in advance. on the average four of these are conditional branches, each with a probability of $90 \%$ of being predict correctly. what is the probability that the prefetching is on the right track?

edited in CO and Architecture Jul 7, 2018

751 views

4 answers

19

madeeasy work book
Q. State whether the following statements are FALSE. (a). if $e$ is the minimum edge weight in a connected weighted graph,it must be among the edges of at least one minimum spanning tree of the graph. (b). if $e$ is the minimum edge weight ... connected weighted graph,it must be among the edges of each one minimum spanning tree of the graph. which one is correct above two option?

commented in Algorithms May 24, 2018

2.9k views

1 answer

20

Language Regular or not
Is it regular? $\left \{ \left ( 0^{n} \right )^{m}|n<m,n,m\geq 1 \right \}$

commented in Theory of Computation May 24, 2018

784 views

3 answers

21

CMI 2018 (Probability)
Suppose you have two coins $A$ and $B$ the probability of head in $A$ is $\dfrac{1}{4}$ and the probability of head in $B$ is $\dfrac{3}{4}$. Now, suppose you have chosen a coin and tossed it two times. The output was head and head. What is the probability that you chose the coin $B$.

commented in Probability May 16, 2018

722 views

1 answer

22

GATE IT 2004 | Question: 46
If we use internal data forwarding to speed up the performance of a CPU (R1, R2 and R3 are registers and M[100] is a memory reference), then the sequence of operations R1 → M[100] M[100] → R2 M[100] → R3 can be replaced by R1 → R3 R2 → M[100] M[100] → R2 R1 → R2 R1 → R3 R1 → M[100] R2 → R3 R1 → R2 R1 → R3 R1 → M[100]

comment moved in CO and Architecture Apr 19, 2018

6.8k views

10 answers

23

GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock

commented in Operating System Apr 18, 2018

33.9k views

4 answers

24

ISRO2008-79
Repeated execution of simple computation may cause compounding of round-off errors syntax errors run-time errors logic errors

answer selected in Computer Networks Apr 18, 2018

3.2k views

1 answer

25

#techtud What does the following fragment of C- program print?
What does the following fragment of C- program print? char t[] = "PROGRAM1234"; char *r = t; printf ("%s", r + r[6]- r[3]); Explain.

answer selected in Programming in C Apr 17, 2018

464 views

1 answer

26

ISRO-2013-21
What will be the cipher text produced by the following cipher function for the plain text ISRO with key $k=7$. [ Consider $'A'=0, 'B'=1,....'Z'=25$] $C_{k} (M) = (kM + 13) \mod 26$ RJCH QIBG GQPM XPIN

answer selected in Computer Networks Apr 17, 2018

4.2k views

2 answers

27

ISRO-DEC2017-57
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$

answer selected in DS Apr 16, 2018

1.2k views

1 answer

28

ISRO-DEC2017-25
Let $L=\{a^p\mid p \text{ is a prime}\}.$ Then which of the following is true It is not accepted by a Turing Machine It is regular but not context-free It is context-free but not regular It is neither regular nor context-free ,but accepted by a Turing Machine

answer selected in Theory of Computation Apr 16, 2018

1.0k views

2 answers

29

UGC NET CSE | June 2014 | Part 3 | Question: 19
Match the following $:$ ... $\text{a-ii, b-i, c-iv, d-iii}$ $\text{a-iv, b-ii, c-i, d-iii}$

answer selected in IS&Software Engineering Apr 15, 2018

2.9k views

1 answer

30

UGC NET CSE | June 2014 | Part 3 | Question: 16
Software testing is the process of establishing that errors are not present the process of establishing confidence that a program does what it is supposed to do the process of executing a program to show that it is working as per specifications the process of executing a program with the intent of finding errors

answer selected in IS&Software Engineering Apr 15, 2018

7.0k views