Recent activity - GATE CSE Doubts

0 votes

0 answers

TCS MockVita 2020 , Lazy Student
There is a test of Algorithms. Teacher provides a question bank consisting of N questions and guarantees all the questions in the test will be from this question bank. Due to lack of time and his laziness, Codu could only practice M questions. There ... problems. Codu can't solve the question he didn't practice. What is the probability that Codu will pass the test?

asked 1 hour ago in Probability by pravincesingh (6 points) | 3 views

0 votes

1 answer

Context Free Language
Is this CFL? L = {wcwr | w, c ϵ {0,1}+ and |c| = 2}

answered 7 hours ago in Theory of Computation by RavGopal (48 points) | 9 views

0 votes

0 answers

Self Doubt:Time Complexity
What is time complexity to find median of medians?

commented 12 hours ago in Algorithms by Shaik Masthan (631 points) | 13 views

0 votes

0 answers

asked in made easy test series
Kindly explained this in detailed way, like why particular steps will come and reason behind it.

commented 12 hours ago in CO & Architecture by Shaik Masthan (631 points) | 12 views

0 votes

0 answers

Self doubt : Pipelining hazards
We are having a five-stage RISC architecture pipeline where the stages are instruction fetch ->decode->execute->memory access->write back, in which we are executing a single instruction ADD R1,R2,R3. As we can see that this ... a memory access stage then the total number of cycles required to execute this single instruction is 4 cycles or 5 cycles?

commented 12 hours ago in CO & Architecture by Shaik Masthan (631 points) | 5 views

0 votes

0 answers

Testbook Question
Consider below code , where integer k initialized to $0.$ while(k!=11){ k++; if(k%5==0) continue; fork(); } What is the total number of process created here?? while will be execute 1 to 10 and fork() will not execute for 5 and 10. So, my ans is $2^{8}=256$ but given ans 512. How?

commented 12 hours ago in Operating System by Shaik Masthan (631 points) | 6 views

0 votes

0 answers

Made Easy Test Series
Consider 2 MBPS I/O device interfaced to 64 bit CPU in a programmed-I/O mode. Data transmission between the CPU and I/O in word-wise. Interrupt overhead is 3 μ/sec. What is the performance gain when the device is operating under interrup-I/O over programmed-I/O mode? A)2 B)2.5 C)1.33 D)2.66

asked 14 hours ago in CO & Architecture by arpit_18 (7 points) | 3 views

0 votes

0 answers

General Aptitude Self doubt
Consider a Circle with 100 points numbered 1,2,3,4, ..,99,100. Now their is a tortoise at point numbered 1 and a hare at point numbered 2 and both can only move in clockwise direction only on numbered points. Tortoise can move one point at time for ... until they meet at some point. Now find the point at which they meet or if they cannot meet at some point tell why??

commented 14 hours ago in Numerical Ability by Shaik Masthan (631 points) | 11 views

0 votes

0 answers

What-is-the-required-general-rank-for-getting-CSE-in-IIT-if-I-am-an-OBC-NCL-student

asked 21 hours ago in Written Exam by ankeshsingh (7 points) | 1 view

0 votes

0 answers

which College can i get Mine Gate Score is 402 OBC NCL

asked 21 hours ago in IISc/IITs by ankeshsingh (7 points) | 3 views

0 votes

0 answers

transactions
a) S with no dirty read then S is cascadeless rollback but may not be strict recoverable b) S with no dirty read then S is recoverable but may not be cascadeless rollback c) S with no dirty read then S is conflict serializable schedule d) S with no dirty read then S is strict recoverable

commented 1 day ago in Databases by srestha (749 points) | 42 views

+1 vote

1 answer

pushdown automata #CFL
Is the following language context-free language(CFL) or not? If yes, then is it Deterministic-CFL (DCFL)? L={ $a^i b^j$ where $i\neq 2*j+1$ and $j \geq 1$ and $i\geq 1$ }

commented 1 day ago in Theory of Computation by RavGopal (48 points) | 29 views

0 votes

0 answers

Entity Relationship Diagram
Knowledge about mapping cardinalities

asked 2 days ago in Databases by arnabdana123 (6 points) | 8 views

0 votes

0 answers

PROBABILTY AND DISTRIBUTIONS
A elevator manufacturing company believes that 'X' is the amount of that can elevator withstand without any damage with is mean 100 and standard deviation 10. This elevator is used to lift the company staff persons with mean 5 and standard deviation 0.5. How many staff person would have to be in the elevator for the probability of No damage exceeds to 0.85.

asked 2 days ago in Mathematical Logic by Stanfordboi (6 points) | 7 views

0 votes

1 answer

EXTERNAL FRAGMENTATION SELF DOUBT
SUPPOSE THERE ARE THREE MEMORY BLOCKS OF SIZES 40 KB,55KB,70KB AND SUPPOSE FIXED PARTITION SCHEME A REQUEST OF PROCESS OF 80 KB WILL NOT BE SATISFIED IT IT CLEAR .MY DOUBT IS WILL THERE BE STILL EXTERNAL FRAGMENTATION ?

commented 2 days ago in Operating System by Shaik Masthan (631 points) | 14 views

0 votes

0 answers

Job Scheduler
As we know Job scheduler works on mainly 2 criteria - To maintain degree of multiprogramming and to maintain proper mixture of CPU bound and I/O bound processes and considering these 2 criteria, it will new process from New/Start to Ready State. So my question is how Job scheduler come to know that the process if CPU bound or I/O bound ???

asked 2 days ago in Operating System by lakshakar (6 points) | 8 views

0 votes

0 answers

OS-William Stallings, 7-edition, Chapter-8, Page-351

commented 3 days ago in Operating System by Shaik Masthan (631 points) | 29 views

0 votes

0 answers

Self Doubt infinte series
What will be the generalized form of the sum of square roots of n natural numbers?

asked 3 days ago in Study Resources by Gupta731 (7 points) | 9 views

0 votes

0 answers

Decidability In TOC
Turing Machine accepts a regurlar language. Is it decidable or not ?

asked 3 days ago in Theory of Computation by ajaybhardwaj1999 (6 points) | 9 views

0 votes

0 answers

compiler construction
Check if the following grammar is SLR(1), CLR(1). S → L = R | R L → * R | id R → L

asked 4 days ago in Compiler Design by SUDIKSHA (8 points) | 6 views

0 votes

1 answer

compiler construction
Construct LL (1) parsing table and verify whether it is LL (1). S→ a AB /ϵ A->1AC/0C B->0S C->1

answered 4 days ago in Operating System by premu (69 points) | 14 views

+1 vote

1 answer

Is LL(1) a subset of LALR(1)?

answered 4 days ago in Compiler Design by premu (69 points) | 23 views

0 votes

0 answers

Deadlock operating sysytem
How to solve this? Plz provide detail solution.

commented 4 days ago in Operating System by premu (69 points) | 11 views

0 votes

1 answer

the gatebook ts
A certain J-K FF has a propagation delay of 12ns. The largest MOD of the counter such that, the counter can be designed from these FFs which will operate up to 10 MHz?

answered 4 days ago in Digital Logic by premu (69 points) | 20 views

+1 vote

1 answer

ISRO CS 2017-MAY
What is the output of the following program? main( ) { int a = 10; if ((fork ( ) == 0)) a++; printf (“%dn”, a ); } a) 10 and 11 b) 10 C) 11 D) 11 and 11

answered 4 days ago in Operating System by premu (69 points) | 18 views

0 votes

0 answers

Please give information about Mtech admission in Maharashtra

asked 4 days ago in Written Exam by kishorbpawar (6 points) | 6 views

0 votes

0 answers

Made Easy timing Diagraam Q .51
I am very Confused in these types plsexplain in some detail.

asked 4 days ago in Digital Logic by sridhar15399 (9 points) | 7 views

0 votes

0 answers

compiler construction ch4
Construct a recursive descent parser to parse the string “w” for the given grammar “G”. w = bdc & grammar is S → Aa | bAc | dc | bda A → d

asked 4 days ago in Compiler Design by SUDIKSHA (8 points) | 3 views

0 votes

0 answers

Algorithms Master Theorem
T(n) = 2T(n/4) + 2^n How to solve these kind of questions?

asked 5 days ago in Algorithms by Vishal_Malo (6 points) | 8 views

0 votes

0 answers

Made easy study material
A three level memory system having cache access time of 15 ns and disk access time of 80 ns has a cache hit ratio of 0.96 and main memory hit ratio of 0.9. What should be the main memory access time to achieve effective access time of 25 ns?

commented 5 days ago in CO & Architecture by premu (69 points) | 8 views

0 votes

1 answer

Made easy Theory book
Is $a ^{n} b^{2n} c^{ 3n}$ such that $n >0$ context free or not ? full explanation please.

answer selected 5 days ago in Theory of Computation by srestha (749 points) | 15 views

0 votes

1 answer

2D Arrays from made easy test series topic test 1
The 2d array is given as A[0...39,0...39].What is the location of A[15][25] if row major order is followed along with lower triangular matrix?base address is 500 and char takes 1byte of memory.

commented 5 days ago in Programming by Barsha Banik (6 points) | 40 views

0 votes

0 answers

Show that the language L = w1cw2 : w1, w2 ∈ {a, b}+ , {w1 ≠ w^R2 } with Σ = {a, b, c}, is context-free.

edited 5 days ago in Theory of Computation by roh (17 points) | 10 views

0 votes

0 answers

What are the relevant chapter in Gravner for Probability ?

asked 5 days ago in Probability by Ram_81 (7 points) | 2 views

0 votes

1 answer

Made easy test series
Consider the type addressable memory unit of a computer has 64 K words of 16 bit each. The computer has an instruction format with 4 fields namely opcode, mode field specify 9-addressing modes, register address field with 50 registers and a memory address field. If an instruction is 32 bits long then the number of different instructions are _____. [closed]

commented 5 days ago in CO & Architecture by arpit_18 (7 points) | 29 views

0 votes

0 answers

Analysis of algorithms and space and time complexity

commented 6 days ago in Algorithms by sameer9949 (6 points) | 14 views

0 votes

0 answers

Admissions into IISc CSA Research
Did anyone receive any notice/email from IISc CSA dept. regarding the video call interview dates or being shortlisted? Thanks in advance.

asked 6 days ago in IISc/IITs by Vinit Gore (7 points) | 3 views

0 votes

1 answer

Made easy pls answer que no.11

answered 6 days ago in Digital Logic by Saheb sarkar (9 points) | 30 views

0 votes

0 answers

deadlock in databases
my question is isn’t wait wound and wait die deadlock prevention algo so how can we say that they are deadlock avoidance and how they can cause more aborts than needed?

asked 6 days ago in Databases by abcd9982 (8 points) | 4 views

0 votes

0 answers

In Compiler Construction course While mapping the conditions for the Shift and Reduce actions in SLR table

asked 6 days ago in Theory of Computation by Arsalan Sheikh (6 points) | 11 views

To see more, click for the full list of questions or popular tags.

Recent activity

7,525 questions

1,776 answers

10,835 comments

90,464 users