Recent questions - GATE CSE Doubts

0 votes

0 answers

Need Explanation
Somebody explain this question.

asked 5 minutes ago in Digital Logic by kashyap02 (14 points) | 1 view

0 votes

0 answers

SELF DOUBT: WELL ORDERED POSET
Can someone explain me in naive term what is a $well$ $ordered$ $poset$ and how it differs from $toset$?

asked 1 hour ago in Mathematical Logic by Debapaul (647 points) | 7 views

0 votes

0 answers

Multi-level feedback queue
Consider there are five processes arriving in a system that implements the Multi-Level Feedback Queue (MLFQ) scheduler at 4, 7, 24, 26, 28 respectively. Their burst times are 14, 2, 5, 2, 2 respectively. There are 3 ready queues: queue 1 ... the third queue implements FCFS. Which process has the highest completion time? Note: Context Switching time is 1 unit. P2 P3 P4 P5

asked 2 hours ago in Operating System by Akash Papnai (17 points) | 4 views

0 votes

1 answer

Made easy test series, DLD-Counters
How is it mod-5 counter?please explain

asked 13 hours ago in Digital Logic by Dheeraj Varma (18 points) | 27 views

0 votes

0 answers

Made Easy Test series Algorithms
How to solve this question?

asked 13 hours ago in Algorithms by Dheeraj Varma (18 points) | 12 views

+2 votes

0 answers

why there are no mantissa overflow in floating point multiplication?

asked 13 hours ago in CO & Architecture by namekrakhnu (12 points) | 6 views

0 votes

0 answers

madeeasy cbt 2 2020

asked 13 hours ago in Algorithms by Akshay Nair (10 points) | 6 views

0 votes

0 answers

Need Good Resource
Can someone suggest a good source to study WiFi and IPv6.

asked 13 hours ago in Computer Networks by kashyap02 (14 points) | 4 views

0 votes

0 answers

Number of conflict and capacity miss
The answer should be 11, as there are 1 conflict and 1 capacity miss First conflict miss when 4 replaces 8 (even though there is an empty set 1 but it doesn't map to it so its a conflict miss), First capacity miss when at the end 3 replaces 5 as to if we had extra capacity then it wouldn't have been a miss. Am I right?

asked 13 hours ago in CO & Architecture by Rishav_Bhatt (14 points) | 40 views

0 votes

0 answers

Self Doubt in MSB and LSB.
How to take MSB and LSB? I mean answer changes or the pattern changes when MSB and LSB is changed. Can you please tell the important points regardng this.

asked 13 hours ago in Digital Logic by CSHuB (16 points) | 6 views

0 votes

0 answers

Self Doubt: Normalization
“If a relation is in 3NF but not in BCNF then it must have atleast 2 compound candidate keys.” Is it true or false? I remember reading somewhere on GO that a relation is in 3NF but not in BCNF only when there are overlapping candidate keys. Above statement is from ME CBT 2 where they’ve given it false.

asked 17 hours ago in Databases by Sambhrant Maurya (343 points) | 16 views

0 votes

0 answers

Self Doubt: Previous GO Discrete Maths
Consider a binary function $g:P P→\{true,false\},$ where $P$ is a non-empty subset of the natural numbers that contains an even number of distinct elements. Which of the following statements can be true about $g$ ? $g$ is ... two equivalence classes $g$ defines a total order but not a partial order $g$ is reflexive and antisymmetric but not a surjection

asked 18 hours ago in Set Theory & Algebra by Debapaul (647 points) | 16 views

0 votes

0 answers

SELF DOUBT: PREVIOUS GO COMPILERS
How to solve these types of questions quickly? is there any algorithm?

asked 19 hours ago in Theory of Computation by Debapaul (647 points) | 19 views

0 votes

1 answer

Made Easy Mock:2
Consider the following grammar: $S\rightarrow (L) /a$ $L\rightarrow L, S / S$ The maximum size of stack during LL(1) parsing of the input string $w = (a,a)$ is?

asked 20 hours ago in Compiler Design by Sambhrant Maurya (343 points) | 32 views

0 votes

0 answers

Made easy test series : Pipelining stages
Two processors, M-5 and M-7, implement the same instruction set. Processor M-5 uses a 5-stage pipeline and a clock cycle of 10 nanoseconds. Processor M-7 uses a 7-stage pipeline and a clock cycle of 7.5 nanoseconds. Consider the following ... on M-5. The number of the true statements(s) is/are ________. What will be the correct answer for above question?

asked 21 hours ago in CO & Architecture by vishal burnwal (125 points) | 16 views

0 votes

0 answers

Made easy test series : C programming
Consider the following program: Which of the following statement is true? I. It results 9 II. Runtime error III. Compilation error Assume all the header files and function definition correctly done. How to identify which error will be generated?

asked 22 hours ago in Programming by vishal burnwal (125 points) | 19 views

0 votes

0 answers

SELF DOUBT: VARIANCE
When $n$ and $p$ is available can we apply $Binomial$ $theorem$ in ALL THE CASES to find the $variance$ by using the formula $npq?$

asked 1 day ago in Probability by Debapaul (647 points) | 9 views

0 votes

1 answer

made easy test series- CN
is the ans 13 or 14?

asked 1 day ago in Computer Networks by Dheeraj Varma (18 points) | 23 views

0 votes

0 answers

testbook advance 3 counter
above circuit is: MOD 7 UP COUNTER MOD 13 UP COUNTER MOD 1 UP COUNTER MOD 1 DOWN COUNTER

asked 1 day ago in Digital Logic by abhinav649 (65 points) | 8 views

0 votes

0 answers

asked 1 day ago in Algorithms by Akshay Nair (10 points) | 22 views

0 votes

0 answers

ace academy test series mock test
38.

asked 1 day ago in Combinatory by Rahul Burman (21 points) | 14 views

0 votes

0 answers

Geeksforgeeks mock test 2 gate2020
Let functions f and g such that f(n) is O(g(n)) and following statements: I. log f(n) is O(log g(n)) II. 2f(n) is O(2g(n)) III. f(n)2 is O(g(n)2) Which options are false ?

asked 1 day ago in Algorithms by Ruchi Pandey (6 points) | 12 views

0 votes

0 answers

made easy test series DPDA doubt

asked 1 day ago in Theory of Computation by Dheeraj Varma (18 points) | 9 views

0 votes

0 answers

made easy test series DPDA doubt
Why II. is invalid??

asked 1 day ago in Theory of Computation by Dheeraj Varma (18 points) | 8 views

0 votes

0 answers

declare an integrity constraint
The text belo is from C J date's database book . Why it would be unreasonable to declare an integrity constraint to that effect ? Correctness: By definition, the database is always at least in a consistent state where, following ... assume that transactions are correct, in the sense that they faithfully reflect just those real-world operations they are supposed to.

asked 1 day ago in Databases by Tara22 (6 points) | 5 views

0 votes

0 answers

Dbms self doubt
Given the statement- View Serializable testing conditions are both necessary and sufficient conditions for serializability testing", whether it is correct or not? please explain.

asked 1 day ago in Databases by SuvasishDutta (166 points) | 18 views

0 votes

0 answers

GATE GURU: PARSER

asked 1 day ago in Compiler Design by Debapaul (647 points) | 27 views

0 votes

0 answers

Toc : Undecidability Ace test series

asked 1 day ago in Theory of Computation by Chirag Shilwant (167 points) | 20 views

0 votes

1 answer

Algorithms time-complexity

asked 1 day ago in Algorithms by Chirag Shilwant (167 points) | 25 views

0 votes

0 answers

Applied course test series : Linear algebra
Can someone explain statement II ?

asked 1 day ago in Linear Algebra by vishal burnwal (125 points) | 31 views

0 votes

0 answers

GATE GURU: TURING MACHINES

asked 1 day ago in Theory of Computation by Debapaul (647 points) | 31 views

0 votes

0 answers

other source
There is a group of 100 Bibliophiles who gather together every weekend to discuss their learnings from the books they have read. They discuss in a group of two people. In order to start a discussion between two people, each individual should have read at ... (across all people) that are needed to achieve the condition for any two random members of the group to start a discussion?

asked 1 day ago in Numerical Ability by Naveen Nallanti (6 points) | 7 views

0 votes

1 answer

Kenneth Rosen Chapter 1 Exercise 1.1 Question No.11 e) part Solution

asked 1 day ago in Mathematical Logic by Ishan Arora (6 points) | 15 views

+1 vote

1 answer

GATE GURU: SPANNING TREE
How to solve this question quickly? Is there any algorithm? I am able to solve it by trying out all the combinations and it has taken me nearly $5+$ $mins$ Any way to solve this quickly. A complete graph can have $n^{n-2}$ spanning trees, and since this graph is nearly complete except one edge can we derive some $shortcut$ from this fact?

asked 1 day ago in Programming by Debapaul (647 points) | 24 views

0 votes

1 answer

Made easy full length

asked 2 days ago in Operating System by Jyoti Kumari97 (23 points) | 54 views

0 votes

0 answers

can i do m tech in cse twice ? if yes what are the criteria?

asked 2 days ago in Written Exam by ck (12 points) | 11 views

0 votes

0 answers

regarding mtech course
if I have an MTech in CSE degree in one of the local colleges am I allowed to do MTech in one of the iits/iisc?

asked 2 days ago in GATE by ck (12 points) | 16 views

0 votes

0 answers

Self doubt : Applied Test DBMS
Question. Given: serach key = 9 bytes, Record pointer = 6bytes Block pointer = 5 bytes, Block size = 512 bytes Every block is 69% full . My Approach: 5n + (9+6)(n-1) <= 69% *(512) 5n + 15n - 15 <= 353.28 20n <= 368.28 n <= 18.41 n = 18. n is order if B tree. keys per node = n-1= 17.

asked 2 days ago in Databases by tp21 (267 points) | 20 views

0 votes

0 answers

testbook :: advance test probability
A gambler has 4 coins in his pocket. two are double-headed ,one is double tailed and one is fair.gambler took a coin at random , opens her eyes and sees the upper face of coin is head. what is the probability of lower face being head?

asked 2 days ago in Probability by abhinav649 (65 points) | 38 views

0 votes

0 answers

Made Easy test series coa cache memory ft6
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bit words. For the following sequence of addresses (in hexadecimal). The miss ratio if 4-way set associative LRU cache is used is ________. (Upto 1 decimal places) 100, 104, 108, 104, 107, 108, 105, 102, 108, 103

asked 2 days ago in CO & Architecture by Ram Swaroop (164 points) | 9 views

Page:

1
2
3
4
...
78
next »

Recent questions

3,105 questions

1,543 answers

9,304 comments

89,830 users