Recent questions

0 votes

0 answers

1

Sheldon Ross Chapter-2 Question-15b
If it is assumed that all $\binom{52}{5}$ poker hands are equally likely, what is the probability of being dealt two pairs? (This occurs when the cards have denominations a, a, b, b, c, where a, b, and c are all distinct.) my approach is: selecting a ... I'm getting answer 0.095 but in the book answer is given 0.0475 where am I going wrong?

asked 3 days ago in Probability by aditi19 Active (3.7k points) | 43 views

0 votes

0 answers

2

Proving a problem as NP-complete.
According to this article, A problem X can be proved to be NP-complete if an already existing NP-complete problem (say Y) can be polynomial-time reduced to current problem X. The problem also needs to be NP. Now my question is: Do we also ... have to be only one way to prove a problem is NP-complete? PS: I have already asked this question in cs.stackexchange

asked 3 days ago in Theory of Computation by commenter commenter (169 points) | 30 views

0 votes

1 answer

3

Deadlock os ace

asked 3 days ago in Operating System by Deepalitrapti Junior (751 points) | 40 views

0 votes

0 answers

4

Synchronisation os ace
How 4th statement is true???

asked 3 days ago in Operating System by Deepalitrapti Junior (751 points) | 29 views

0 votes

0 answers

5

Logic Gates and switching circuits
The gates G1 & G2 in the figure have propagation delays of 10ns and 20ns respectively. If the input Vi makes an abrupt change from logic 0 to 1 at time t=t0 , then what's the output waveform V0 is ? Also please explain how to handle such kinds of questions of waveform?

asked 3 days ago in Digital Logic by Gitika Babbar (111 points) | 16 views

0 votes

2 answers

6

Minimization doubt in DIGITAL LOGIC

asked 3 days ago in Digital Logic by Gitika Babbar (111 points) | 19 views

0 votes

0 answers

7

Operator Precedence Parsing.
In operator precedence parsing we have the rule that production cannot have two adjacent non-terminals or an epsilon production, so this production, S--> ab is allowed but not S--> AB, A->a and B->b, though they are giving us the same output. Why so?

asked 3 days ago in Compiler Design by Hirak Active (3k points) | 23 views

–1 vote

0 answers

8

Toc me test me me
Minimum ba how can accept?

asked 4 days ago in Theory of Computation by Deepalitrapti Junior (751 points) | 32 views

0 votes

0 answers

9

Is each and every NP complete problem (polynomially) reduced to each and every another NP complete problem?

asked 4 days ago in Theory of Computation by commenter commenter (169 points) | 26 views

0 votes

1 answer

10

Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?

asked 4 days ago in Operating System by Hirak Active (3k points) | 39 views

+2 votes

0 answers

11

fork() using Tree structure
How many times ‘4’ will be printed ? int main() { if (fork() && (!fork())) { if (fork() || fork()) { fork(); } } printf("4 "); return 0; } How to approach these kind of questions using Tree structure ??

asked 4 days ago in Operating System by Brij gopal Dixit (159 points) | 42 views

0 votes

0 answers

12

Gray Code (Self Doubt)
Was solving the GO 2019 pdf when I encountered this question asked in TIFR 2017. Although I have understood this question, I have one doubt- It is mentioned in the question that for a 3-bit number, the ordering (000, 100, 101, 111, 110, 010, 011, 001) is one of the possible Gray codes. Then, how many such orders are there for an n-bit number?

asked 4 days ago in Digital Logic by Debargha Bhattacharj (349 points) | 38 views

0 votes

1 answer

13

Go-schedule information
As per Gate Overflow Schedule for 2020 for the first week we have to study " Logical Reasoning and Data Interpretation: Verbal reasoning deriving conclusion from passage, conclusions as in puzzles (can be in mathematical logic also) ". So which topics are covered under this and what questions to practice from GO PDF?

asked 5 days ago in Verbal Ability by Rishav_Bhatt (13 points) | 73 views

0 votes

0 answers

14

asked 5 days ago in Theory of Computation by Akash Kumar Roy Junior (517 points) | 19 views

0 votes

0 answers

15

Virtual GATE Test Series fork-join concurrency structure
Consider the code fragment: count = 3; S1; Fork L1; L1: S3; S2; goto L3; S4; Fork L2; L2: S6; goto L3; S5; L3: join count S7 Which one of the following represents correct precedence graph of the above code fragment? the answer is given but I’m getting where am I wrong?

asked 5 days ago in Operating System by aditi19 Active (3.7k points) | 31 views

+1 vote

0 answers

16

How Self-Referential Structure works?
I have learnt that self-referential structure is one which contains a structure of same type in it as an element. But I have a doubt regarding how that line is compiled successfully (i.e, how compiler knows how much space should be allocated and ... not yet finished? struct node { int data; struct node *next; }; correct me If I am wrong in understanding this.

asked 5 days ago in Programming by Sathuri Bharath Junior (501 points) | 29 views

0 votes

0 answers

17

Discrete mathematics 7th ed by Kenneth Rosen,chapter3:Algorithm
Should not there be a second condition stating i = j-1 in While loop's conditional statement,if not then it seems to me while loop will be a infinite loop..

asked 5 days ago in Algorithms by souren (37 points) | 58 views

0 votes

1 answer

18

Master's Theorem: Validity of Format
How to check if a given recurrence relation is in a format that is valid to apply Master’s Theorem? Also, how to distinguish between Master’s Theorem and extended Master’s Theorem?

asked 5 days ago in Algorithms by lolster (223 points) | 44 views

0 votes

0 answers

19

Admission in iiitm kerala
Hello I have not performed well in the gate this year, I am not getting any IIT. Although I applied in IIITMK, Kerala does anyone know how good it is to do masters there.? because it is not possible for me to took gap this year. please help thanks in advance

asked 6 days ago in Other Colleges by JPranavc (343 points) | 36 views

0 votes

2 answers

20

asked 6 days ago in Digital Logic by Gitika Babbar (111 points) | 42 views

0 votes

2 answers

21

Self doubt DIGITAL LOGIC
Is Y' + Z' same as (YZ)' ? Please explain this concept of compliments..!!

asked 6 days ago in Digital Logic by Gitika Babbar (111 points) | 32 views

0 votes

1 answer

22

Sheldon Ross Example-5n
Compute the probability that if 10 married couples are seated at random at a round table, then no wife sits next to her husband 1 wife sits next to her husband. pick one of the 10 couples=$\binom{10}{1}$. These couples can interchange their position such that ... sits together=$\frac{N}{19!}$ so probability that no couple sits together=$1-\frac{N}{19!}$ is this correct?

asked 6 days ago in Probability by aditi19 Active (3.7k points) | 88 views

+4 votes

1 answer

23

Doubt regarding countable and uncountable sets
Hello, I have read that Σ* is countably infinite and power set of Σ* (ie. 2^ Σ*) is uncountably infinite. So by Cantor’s theorem, power set of any countably infinite set is uncountably infinite. Then what can be said about 0^any countably infinite set or 3^any countably infinite set? Do these things have any significance? Thank you.

asked 6 days ago in Theory of Computation by DukeThunders (39 points) | 43 views

+1 vote

0 answers

24

forouzan 5 th edition
A host has the address 581E: 1456:2314:ABCD::1211. If the node identification is 48 bits, find the address of the subnet to which the host is attached.

asked Jun 10 in Computer Networks by chirudeepnamini (15 points) | 35 views

0 votes

0 answers

25

total number of spanning tree
[closed]

asked Jun 10 in Mathematical Logic by Sanjay Sharma Boss (47.1k points) | 41 views

0 votes

0 answers

26

forouzan 4th edition chapter 19
An organization is granted the block 16.0.0.0/8. The administrator wants to create 500 fixed-length subnets.Find the first and last addresses in subnet 500.

asked Jun 10 in Computer Networks by chirudeepnamini (15 points) | 27 views

0 votes

0 answers

27

Er diagram minimum table
Is this a correct way to find the minimum number of tables in a ER DIAGRAM?

asked Jun 10 in Databases by kshitij (79 points) | 24 views

0 votes

0 answers

28

DBMS: SELF DOUBT .
Is basic 2 phase locking always recoverable?

asked Jun 10 in Databases by Hirak Active (3k points) | 21 views

0 votes

2 answers

29

Mamory os me

asked Jun 10 in Operating System by Deepalitrapti Junior (751 points) | 45 views

+1 vote

1 answer

30

Theory of Computation: Context Free Languages
Hi, I am having a doubt understanding the result of CFL - Regular: Here's my approach: CFL - Regular = CFL INTERSECTION Regular' = CFL INTERSECTION Regular = CFL Suppose some CFL L1= {a^n b^n | n>=1} and some Regular R1= (a+b)* ... to say CFL - Regular = Regular or CFL - Regular = CFL ? If both are separate options, which one should I go for? Thanks

asked Jun 9 in Theory of Computation by DukeThunders (39 points) | 29 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