Recent questions without answers - GATE CSE Doubts

0 votes

0 answers

Probability Uniform Distribution
Buses arrive at a specified stop at 15-minute intervals starting at 7 A.M.That is, they arrive at 7, 7:15, 7:30, 7:45, and so on.If a passenger arrives at the stop at a time that is uniformly distributed between 7 and 7:30, find the probability that ... than 5 minutes for a bus. (2) More than 10 minutes for a bus. (3) atleast 12 min for a bus. Anyone please clarify.

asked 16 minutes ago in Probability by Shivateja MST (68 points) | 2 views

0 votes

0 answers

Applied course test series : ER Diagram
Consider the following ER Diagram The minimum no of relations required to represent this ER Diagram in relational model _____ Plz some give answer for above question

asked 16 minutes ago in Databases by vishal burnwal (58 points) | 1 view

0 votes

0 answers

Self Doubt: K maps
$f_{1}(A,B,C,D) = \sum(0,1,8,9) + d(2,10,5)$ $f_{2}(A,B,C,D) = \sum(0,2,9,14) + d(1,8,15)$ Then what is f1 + f2 and f1 . f2 respectively? How to deal with the don’t cares?

asked 39 minutes ago in Digital Logic by Sambhrant Maurya (290 points) | 2 views

0 votes

0 answers

Testbook Compiler Design test doubt
Will it give a lexical error or a syntactic error?

asked 1 hour ago in Compiler Design by Abhipsa Mishra (15 points) | 9 views

0 votes

0 answers

what specific "The One" study resource to follow for gate?

asked 1 hour ago in GATE by debasree88 (9 points) | 5 views

0 votes

0 answers

Applied course test series : DRAM chips
Consider a main memory constructed with Synchronous DRAM chips that have the following timing requirements : 1 bus cycle to transfer the address , 10 bus cycles access latency , and 1 bus cycle to transfer a word . Assume that 32 bits of data ... take to access and transfer 32 bytes of data? (in nanosecond) What will be the correct answer for above question?

asked 2 hours ago in CO & Architecture by vishal burnwal (58 points) | 4 views

0 votes

0 answers

Applied course test series : Topological sorting
Which of the following is not the topological sorting of the below graph. A) 1,2,3,4,5,6,7,8,9,10,11 B) 1,3,2,5,4,6,7,8,9,10,11 C) 1,3,2,4,5,6,8,7,10,9,11 D) 1,3,2,4,5,6,8,7,9,10,11 My doubt is that according to me all the four orders given are correct ,but they provided (D) as the answer. Are they right?

asked 2 hours ago in DS by vishal burnwal (58 points) | 11 views

0 votes

0 answers

Applied course test series : Sets and Relations
What is the correct answer for above question?

asked 2 hours ago in Set Theory & Algebra by vishal burnwal (58 points) | 5 views

0 votes

0 answers

Self doubt in number of tokens
Should we consider ternary operator as a single token or two tokens?

asked 3 hours ago in Compiler Design by Abhipsa Mishra (15 points) | 4 views

+1 vote

0 answers

Self doubt-transaction-dirty read
Initial value of A=6. T1 T2 R(A) A=A-2 W(A) R(A) A=A-3 W(A) commit; abort; for the above two transaction what will be the final value of A, after the above 2 are executed.

asked 7 hours ago in Databases by Doraemon (89 points) | 7 views

0 votes

0 answers

self doubt-expressive power of languages
Suppose we have safe expession and aggregate function. Is the expressive power of tuple relational calculus,domain relation calculus and relational algebra same if the above 2 conditions are there? I know that the expressive power of TRC,DRC AND ... and aggregate function. But in korth it is written that TRC can be extended to support aggregation.(pg-244)

asked 7 hours ago in Databases by Doraemon (89 points) | 2 views

0 votes

0 answers

self doubt on uniqueness of binary search tree
given only postorder of some tree then creating binary search tree by traversing from right to left then this bst will be unique. and given only post order of some tree not mentioned then we cant create unique tree but can create unique bst. these statements are true?

asked 9 hours ago in Programming by eyeamgj (17 points) | 4 views

0 votes

0 answers

Madeeasy Test Series 2020 DBMS
Consider the following schedule which involves three transaction: T1 T2 T3 R(X) R(Y) R(Y) W(X) W(X) R(Z) W(X) Assume the time stamp of transactions are (5,2,4) respectively. Which of the above statement is true about the ... schedule is allowed under Thomas write rule but not basic time stamp. The schedule is not allowed under basic time stamp and Thomas write rule.

asked 13 hours ago in Databases by scholaraniket (6 points) | 6 views

0 votes

0 answers

Ace Practice questions Linear Algebra
If ‘A’ is a non singular matrix and $(I-A+A^{2}-.....+(-1)^{n}A^{n})=0$ then $A^{-1}$ = _______________

asked 23 hours ago in Linear Algebra by Pratyush Priyam Kuan (394 points) | 4 views

0 votes

0 answers

Explain the statement of Data offset or TCP header length ,Source : Wikipedia

asked 1 day ago in Computer Networks by shaktisingh (87 points) | 2 views

0 votes

0 answers

Sliding window protocol : explain the Statement on related to window size source : cse.iitk

asked 1 day ago in Computer Networks by shaktisingh (87 points) | 4 views

0 votes

0 answers

Self Doubt-Arrays
$3-d\ array:$ $A[5….11,3…7,6….16]$ Using column major order and row major order find: $location\left ( A[9][5][14] \right )=?$ take BA: 1000 and int size: 10 bytes

asked 1 day ago in DS by Kushagra गुप्ता (155 points) | 14 views

0 votes

0 answers

Made Easy: Digital Logic
In the logic circuit above, input at line $I_{13}$ in 16 X 1 MUX corresponds to output at line $I'_{n}$ of 1 X 16 DeMUX. What is the value of n?

asked 1 day ago in Digital Logic by Sambhrant Maurya (290 points) | 12 views

0 votes

0 answers

RBR Test Series

asked 1 day ago in Operating System by Priyansh Singh (122 points) | 10 views

0 votes

0 answers

How many 4 digits even number have all digits distinct

asked 1 day ago in Mathematical Logic by Pkhjhgfc (6 points) | 11 views

0 votes

0 answers

self doubt databases
what is a compound candidate key ?is it the same as composite key ? please cite an example ..

asked 1 day ago in Databases by TUSHAR_BHATT (17 points) | 5 views

0 votes

0 answers

#Self_doubt#Decidability
L1={<M>| M is TM and M doesnt accept all even nos} L2={<M>| M is TM and M rejects all even nos} I think we need to check for infinite no of steps so both not RE?Dont knw the answer plz confirm

asked 2 days ago in Theory of Computation by nandani17 (13 points) | 7 views

0 votes

0 answers

made easy single subject DBMS
can anyone tell how the answer is 3 thank you

asked 2 days ago in Databases by Pratyush Priyam Kuan (394 points) | 12 views

+1 vote

0 answers

Made easy test series : Dijkstra's algorithm
For the below graph Dijkstra's algorithm does not provide correct shortest path tree. Suppose a new graph that is different only in the weight between D-H is created. Find the number of values of edge (D-H) that ensures that dijkstra's ... ∈ [-20, 20] and A is the source vertex ________. Can some plz provide explaination and answer for above question.

asked 2 days ago in Algorithms by vishal burnwal (58 points) | 10 views

0 votes

0 answers

Made easy test series : Routers
Which of the following statement is false to deploy a router? A) All the interface of the router must belong to same network. B) Routers are by default broadcast domain separator. C) The ethernet interface and the LAN must belong to the same network. D) Router is not a multi protocol device. Can someone explain point (D).

asked 2 days ago in Computer Networks by vishal burnwal (58 points) | 4 views

0 votes

0 answers

Made easy test series : Process scheduling
Consider the following set of processes that need to be scheduled on a single CPU. Operating system uses preemptive shortest remaining time first algorithm. (Ties are broken by using FCFS) What is the average waiting time (ms) and ... have their own devices, consider only CPU times as burst time). Can someone plz provide answer for above question.

asked 2 days ago in Operating System by vishal burnwal (58 points) | 13 views

0 votes

0 answers

Made Easy: Algorithms
Consider a recursive merge sort implementation that calls insertion sort on sublists which are smaller than some threshold. If there are n function calls in merge sort, how many calls will be there in insertion sort? n+1 log n log n + n $\left \lceil \frac{n}{2} \right \rceil$

asked 2 days ago in Algorithms by Sambhrant Maurya (290 points) | 4 views

0 votes

0 answers

Made Easy Test: Algorithms
What is the TC of the following? int i,j,k,m=0; for(i=1;i<n;i++){ for(j=1;j<i*i;j++){ if (j%i==0) for(k=1;k<j;k++) m=m+1; } }

asked 2 days ago in Algorithms by Sambhrant Maurya (290 points) | 10 views

0 votes

0 answers

made easy 2019 test series
T or F? Dijkstra shortest path algorithm on unweighte graphs runs in linear time when data structure is queue. i believe its true,as if its unweighted we need no sorting..its kind of bfs and we can put all vertices in queue as we discover them … correct if i am wrong...ASAP THANK YOU.

asked 2 days ago in CO & Architecture by blackcloud (8 points) | 2 views

0 votes

0 answers

Ace Test series DBMS Grand Test
Can anyone tell how the answer is 10 thank you

asked 2 days ago in Databases by Pratyush Priyam Kuan (394 points) | 5 views

0 votes

0 answers

Made easy test series : Transport layer
Consider the following statements: I. GBN support both individual and cumulative ACK’s. II. Recovering lost packets between two direct connected nodes is done by transport layer. III. Packet switching uses more resources as compared to circuit switching. Which of the above statement(s) is/are correct? Please someone can explain about point no. (II).

asked 2 days ago in Computer Networks by vishal burnwal (58 points) | 8 views

0 votes

0 answers

Made easy test series: Flow control
Calculate the total time (in sec) required to transfer a 1000 Kbits file assuming an RTT of 100 ms, packet size of 1 KB and initial delay of twice of RTT for “handshaking” before data is sent. Bandwidth is 1.5 Mbps and time gap between any two consecutive packets is RTT ________. [Upto 2 decimal places] Please provide solution for above question.

asked 2 days ago in Computer Networks by vishal burnwal (58 points) | 6 views

0 votes

0 answers

GRAPH THEORY-self doubt
In GATE If suppose nothing is mentioned about the type of vertices then do we consider them to be labelled/unlabelled by default?

asked 2 days ago in Mathematical Logic by Doraemon (89 points) | 9 views

0 votes

0 answers

Made easy test series : Transactions
Please give answer for above Question.

asked 2 days ago in Databases by vishal burnwal (58 points) | 8 views

0 votes

0 answers

ACE FULL TEST 3 Q63

asked 2 days ago in Computer Networks by Shawn Frost (29 points) | 3 views

0 votes

0 answers

Maths Group theory
Let G= {a,b,c}.The incomplete composition table of the group (G,*) is given below. * a b c a __ __ __ b __ b __ c __ __ __ The last row of the composition table is ____ a c b b a c b c a c a b Anyone please explain how to solve such question since no conditions are given.

asked 3 days ago in Set Theory & Algebra by Shivateja MST (68 points) | 3 views

0 votes

0 answers

Maths Group Theory
Let P(S) denote the power set of a non empty setS.A binary operation * is defined by A*B=(A-B) U (B-A). The set P(S) with respect to the binary operation * is______ a semigroup but not monoid a monoid but nota group a group not a semigroup Anyone please clarify I am getting d as the answer.

asked 3 days ago in Set Theory & Algebra by Shivateja MST (68 points) | 5 views

0 votes

0 answers

Self doubt: Stressen's matrix multiplication
What is the largest k such that if you can multiply two (3 x 3) matrices using k multiplications, then you can multiply two (n x n) matrices in $O(n^{log 7})$ ?

asked 3 days ago in Algorithms by Sambhrant Maurya (290 points) | 12 views

0 votes

0 answers

Made Easy Test Series: Algorithms
Consider the following recurrence relation: What is the time complexity? I know the $n$ = $2^{m}$, T($2^{m}$) = S(m) method, but I think it’s not working here. Please solve it.

asked 3 days ago in Algorithms by Sambhrant Maurya (290 points) | 15 views

0 votes

0 answers

madeeasy databases
Consider a relation with following functional dependencies R(a, b, c, d) F = (ab -> cd ,ac->bd) Number of following relation schemas might be the result of BCNF normalization preserving both functional dependency and lossless join is 1)R(a, b, c) and R(a,b,d) 2)R (a, b). R(a,c) and R(c,b). 3) R(a, b, c, d) please explain if 1) is dependency preserving decomposition ?

asked 3 days ago in Databases by TUSHAR_BHATT (17 points) | 11 views

Page:

1
2
3
4
...
31
next »

Recent questions without answers

2,317 questions

1,294 answers

6,600 comments

89,719 users