Recent activity

+2 votes

1 answer

1

Rosen 7e Exercise-6.5 question 45.b page 433
How many ways can n books be placed on k distinguishable shelves if no two books are the same, and the positions of the books on the shelves matter?

commented 41 minutes ago in Combinatory by Verma Ashish Loyal (6.3k points) | 74 views

+1 vote

1 answer

2

P and NP Question doubt
What will be the answer to this question? L’ is the complement of language L belongs to NP does not always imply that L’ belongs to NP L’ belongs to P both a and b

answer edited 51 minutes ago in Theory of Computation by Pragy Agarwal Boss (21.9k points) | 52 views

+19 votes

3 answers

3

GATE2015-3-38
In the network $200.10.11.144/27$, the $fourth$ octet (in decimal) of the last $IP$ address of the network which can be assigned to a host is _____.

answered 1 hour ago in Computer Networks by Utkarsh Pathak (199 points) | 3.9k views

+13 votes

4 answers

4

ISI2016
A palindrome is a sequence of digits which reads the same backward or forward. For example, $7447$, $1001$ are palindromes, but $7455$, $1201$ are not palindromes. How many $8$ digit prime palindromes are there?

commented 2 hours ago in Combinatory by Arjun Veteran (395k points) | 651 views

+17 votes

9 answers

5

GATE2015-2-10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.

answer selected 2 hours ago in DS by Arjun Veteran (395k points) | 3.9k views

0 votes

1 answer

6

Made Easy Test Series : Algorithm
for(k=1;k<(n+1);k++) { for(m=1;m<(n+1);m+=k){ x=x+1; } } What is the T.C. of the following code? Is it $n^{2}$ or $n\log n$??

commented 2 hours ago in Algorithms by prashant jha 1 Active (5.1k points) | 33 views

+26 votes

2 answers

7

GATE2003-90
Consider the function $f$ defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p ->next -> data) && f(p->next) ... -decreasing order of data value the elements in the list are sorted in non-increasing order of data value not all elements in the list have the same data value

commented 3 hours ago in DS by ankitrazzagmail.com (19 points) | 3k views

0 votes

0 answers

8

Practicing Algorithms and Data Structures for Interview
I have got a good GATE rank in 2019 and most probably I will get into IIT-B TA. I am thinking of working on algorithms and data structures before I join. I have gone through a lot of content regarding ... someone provide some pointers or any resources that help me improve my skills for competitive coding or interview preparation in general?

edited 3 hours ago in Others by gmrishikumar Active (1.8k points) | 6 views

0 votes

0 answers

9

navathe-doubt
previous value of X=9 Sf : w1(X, 5); w2(X, 8); a1; cascadeless schedu;e . what problem will the schedule face??

asked 5 hours ago in Databases by Doraemon (195 points) | 2 views

0 votes

1 answer

10

Self doubt group theory
Is (Z+,>=) a well oerderd set ,plz explain.

commented 6 hours ago in Set Theory & Algebra by sakharam Active (2.5k points) | 34 views

+76 votes

13 answers

11

GATE2016-2-40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.

commented 6 hours ago in DS by air1ankit Active (4.5k points) | 10.9k views

0 votes

0 answers

12

P and np question

commented 7 hours ago in Theory of Computation by srestha Veteran (111k points) | 17 views

0 votes

0 answers

13

Made Easy Test Series: Computer Network-ICMP
Consider a very large network $10000$ routers. Two host $A$ and $B$ connected with this network. Host $A$ sends a data to host $B$. and after some unit of time host $A$ receives $ICMP$ time exceed message for the samedata ... some ICMP message generated? Say if $ICMP$ message generated in $9999th$ router, then where it give error of time exceed message?

asked 9 hours ago in Computer Networks by srestha Veteran (111k points) | 8 views

+62 votes

9 answers

14

GATE2016-1-41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing it from $S$. ... else x:= Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

commented 9 hours ago in DS by itssandeepverma (55 points) | 8.2k views

0 votes

0 answers

15

Peter Linz Edition 4 Exercise 7.1 Question 9 (Page No. 183)
Is it possible to find a dfa that accepts the same language as the pda $M= (${$q_0,q_1$},{$a,b$},{$z$},$\delta,q_0,z,${$q_1$}), with $\delta(q_0,a,z)=${$(q_1,z)$}, $\delta(q_0,b,z)=${$(q_0,z)$}, $\delta(q_1,a,z)=${$(q_1,z)$}, $\delta(q_1,b,z)=${$(q_0,z)$} ?

asked 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 2 views

+3 votes

3 answers

16

GATE1990-3-i
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function Y, implemented by the circuit is, $Y=ABC + DE$ $Y=ABC + DE$ $Y=ABC.DE$ $Y=ABC.DE$

answer selected 10 hours ago in Digital Logic by Rishi yadav Boss (10.9k points) | 994 views

0 votes

0 answers

17

Peter Linz Edition 4 Exercise 7.1 Question 8 (Page No. 183)
Find an npda for the language $L =$ {$ab (ab)^n b (ba)^n : n ≥ 0$}.

asked 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 1 view

0 votes

0 answers

18

Peter Linz Edition 4 Exercise 7.1 Question 7 (Page No. 183)
Find an npda for the concatenation of $L (a^*)$ and the language in Exercise 6.

asked 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 1 view

0 votes

0 answers

19

Peter Linz Edition 4 Exercise 7.1 Question 6 (Page No. 183)
Find an npda on $Σ =$ {$a, b, c$} that accepts the language $L=${$w_1cw_2:w_1,w_2∈$ {$a,b$}$^*,w_1\neq w_2^R$}.

asked 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 1 view

0 votes

0 answers

20

Peter Linz Edition 4 Exercise 7.1 Question 5 (Page No. 183)
Construct an npda that accepts the language $L =$ {$a^nb^m : n ≥ 0, n ≠ m$}.

asked 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 1 view

+3 votes

1 answer

21

Peter Linz Edition 4 Exercise 7.1 Question 4.h(Page No. 183)
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }

edited 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 356 views

+1 vote

1 answer

22

Peter Linz Edition 4 Exercise 7.1 Question 3.c,3.d,4.f,4.j (Page No. 183)
Q3) Given, $L_1 = (aaa^*b)$ $L_2 = (aab^*aba^*)$ Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$. Q4) Find the npda's of the following: f) $L = \{ a^nb^m :n \leq m \leq 3n\}$ j) $L = \{w : 2n_a(w) \leq n_b(w)) \leq 3n_a(w) \}$.

edited 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 205 views

0 votes

0 answers

23

Peter Linz Edition 4 Exercise 7.1 Question 4 (Page No. 183)
Construct npda's that accept the following languages on $Σ =$ {$a, b, c$}. (a) $L =$ {$a^nb^{2n} : n ≥ 0$}. (b) $L =$ {$wcw^R : w ∈$ {$a, b$}$^*$}. (c) $L =$ {$a^nb^mc^{n+m} : n ≥ 0, m ≥ 0$}. (d) $L =$ ... $L =$ {$w : n_a (w) + n_b (w) = n_c (w)$}. (j) here. (k) $L =$ {$w : n_a (w) < n_b (w)$}.

asked 10 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 1 view

+15 votes

3 answers

24

GATE2005-35
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $42$

answer edited 10 hours ago in Graph Theory by Rishi yadav Boss (10.9k points) | 1.9k views

0 votes

0 answers

25

Peter Linz Edition 4 Exercise 7.1 Question 3 (Page No. 183)
Construct npda's that accept the following regular languages. (a) $L_1 = L (aaa^*b)$. (b) $L_1 = L (aab^*aba^*)$. (c & d here)

asked 11 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 3 views

0 votes

0 answers

26

Peter Linz Edition 4 Exercise 7.1 Question 1 (Page No. 183)
Find a pda with fewer than four states that accepts the language $L=${$a^nb^n:n\geq 0$} $\cup$ {$a$}.

edited 11 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 3 views

0 votes

0 answers

27

Peter Linz Edition 4 Exercise 7.1 Question 2 (Page No. 183)
Prove that an npda for accepting the language $L =$ { $ww^R : w ∈$ {$a, b$}$^+$ } does not accept any string not in {$ww^R$}.

asked 11 hours ago in Theory of Computation by Naveen Kumar 3 Loyal (7.1k points) | 1 view

+20 votes

10 answers

28

GATE2014-3-53
The CORRECT formula for the sentence, "not all Rainy days are Cold" is $\forall d (\text{Rainy}(d) \wedge \text{~Cold}(d))$ $\forall d ( \text{~Rainy}(d) \to \text{Cold}(d))$ $\exists d(\text{~Rainy}(d) \to \text{Cold}(d))$ $\exists d(\text{Rainy}(d) \wedge \text{~Cold}(d))$

answer edited 11 hours ago in Mathematical Logic by Rishi yadav Boss (10.9k points) | 1.6k views

+18 votes

4 answers

29

GATE1996-1.3
Suppose $X$ and $Y$ are sets and $|X| \text{ and } |Y|$ are their respective cardinality. It is given that there are exactly $97$ functions from $X$ to $Y$. From this one can conclude that $|X| =1, |Y| =97$ $|X| =97, |Y| =1$ $|X| =97, |Y| =97$ None of the above

answer edited 11 hours ago in Set Theory & Algebra by Rishi yadav Boss (10.9k points) | 1.8k views

+22 votes

2 answers

30

GATE2004-44
Suppose we run Dijkstra’s single source shortest path algorithm on the following edge-weighted directed graph with vertex $P$ as the source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized? $P,Q,R,S,T,U$ $P,Q,R,U,S,T$ $P,Q,R,U,T,S$ $P,Q,T,R,U,S$

edited 11 hours ago in Algorithms by akash.dinkar12 Boss (39.1k points) | 2.3k views

+13 votes

3 answers

31

GATE1998-1.8
The number of functions from an $m$ element set to an $n$ element set is $m + n$ $m^n$ $n^m$ $m*n$

answer edited 12 hours ago in Set Theory & Algebra by Rishi yadav Boss (10.9k points) | 1.4k views

0 votes

2 answers

32

Gateforum Test Series: CO & Architecture - cache memory
Assume a cache of $2K$ blocks ( 1 block size = 4 words= 16 bytes) and $32-bit$ address. Assume this machine is byte addressable. What is the bit length of each field in direct mapped? $(A).\space 19,11,2$ $(B).\space 20,11,2$ $(C).\space 21,9,2$ $(D). \text{none of these}$

edited 12 hours ago in CO & Architecture by Rishi yadav Boss (10.9k points) | 250 views

+18 votes

1 answer

33

GATE2012-21
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$

commented 12 hours ago in Probability by mehul vaidya Active (4.3k points) | 2.8k views

0 votes

2 answers

34

NTA NET DEC 18 Q71

answer edited 12 hours ago in Probability by akash.dinkar12 Boss (39.1k points) | 102 views

+8 votes

2 answers

35

ISRO2017-18
How many $128\times 8$ bit RAMs are required to design $32K\times 32$ bit RAM? 512 1024 128 32

answer edited 13 hours ago in CO & Architecture by Rishi yadav Boss (10.9k points) | 3.5k views

0 votes

0 answers

36

Bounded lattice
Can a countable infinite lattice be bounded?

commented 13 hours ago in Set Theory & Algebra by srestha Veteran (111k points) | 10 views

0 votes

0 answers

37

Probability of error detection
A block of bits with n rows and m columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an expression for the probability that the error will be detected.

commented 13 hours ago in Probability by srestha Veteran (111k points) | 7 views

0 votes

0 answers

38

MadeEasy Subject Test 2019: Digital Logic - Flip Flop
The input to the LED is connected to the output $\overline{Q}$ of the master slave flip-flop. The duration for which the LED will be ON in the time duration of T is _____ sec.

commented 13 hours ago in Digital Logic by srestha Veteran (111k points) | 161 views

+27 votes

5 answers

39

GATE2007-IT-84
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions? $1$ $2$ $3$ $4$

commented 14 hours ago in Databases by Rishi yadav Boss (10.9k points) | 4.1k views

+2 votes

1 answer

40

ME TEST SERIES
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is ________. 100, 108, 114, 1C7, 128, 1B5, 100, 108, 1C7

commented 14 hours ago in CO & Architecture by srestha Veteran (111k points) | 195 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent Posts

Recent Blog Comments