Recent questions - GATE CSE Doubts

0 votes

0 answers

Loop joins DBMS
Can anyone explain with some example how to calculate no of seeks in different types of joins like Block level Nested loop Join,Nested loop Join,Merge Join etc ?

asked 3 hours ago in Databases by Shivateja MST (65 points) | 2 views

0 votes

0 answers

madeeasy set theory
What is the meaning of symmetric relations are closed under complementation ..?Please cite an example..

asked 3 hours ago in Set Theory & Algebra by TUSHAR_BHATT (15 points) | 3 views

0 votes

0 answers

doubt in connected graph
How many edges must a graph with N vertices have in order to guarantee that it is connected? here on stack overflow they said (n-1)*(n-2)/2 +1 https://cs.stackexchange.com/questions/7373/how-many-edges-must-a-graph-with-n-vertices-have-in-order-to-guarantee-that- ... here we need just 21 edges for n=10 but according to given formula it is 9*8/2 + 1 = 37. so what is correct?

asked 3 hours ago in Graph Theory by mehul vaidya (8 points) | 4 views

0 votes

0 answers

Self_Doubt_computer_networks
In Fragmentation, is it necessary for the number of data bytes in the last fragment to be multiple of 8?

asked 3 hours ago in Computer Networks by vikas999 (6 points) | 2 views

0 votes

0 answers

GO TEST: Test by Bikram 2017: Database Systems Test 2-17

asked 11 hours ago in Databases by !KARAN (156 points) | 4 views

0 votes

0 answers

GO test: DBMS
https://gateoverflow.in/147564/test-by-bikram-2017-database-systems-test-2-26 Assume that a data file contains 2000 records that are ordered by a key attribute K , and a primary index on attribute K is built. The size of key is 5B and block pointer is 5B ... Last level will contain only 1 record So total number of access = 1(access for record in database file) + 3(accesses in indexes)

asked 12 hours ago in Databases by !KARAN (156 points) | 28 views

0 votes

0 answers

MADE EASY GATE MOCK 2K19 CN
In the given n/w station A needs to send a payload of 1600 Bytes from its network layer to Station B. If fragmentation is done then actual data size to be transmitted is:

asked 16 hours ago in Computer Networks by shankargadri (8 points) | 5 views

0 votes

0 answers

Fork system call doubt
How many total processes will be spawned after executing following program? int main() { fork() || fork() && fork() ; } I am getting 5...please someone verify.. But Here it is given 7 My attempt- Each leaf node corresponds to a process I firstly performed ... A=0 then B will not be evaluated and results in 0 In A||B if A=1 then B will not be evaluated and results 1.

asked 19 hours ago in Operating System by Verma Ashish (386 points) | 6 views

0 votes

0 answers

Image Processing 7th sem
Are both of them thresholding functions? or only the second one is thresholding function?

asked 21 hours ago in Digital Image Processing by Debapaul (308 points) | 3 views

0 votes

0 answers

MADEEASY DLD
OR NAND XOR AND How to approach such questions. Kindly provide the detailed explanation.

asked 1 day ago in Digital Logic by Rudr Pawan (688 points) | 9 views

0 votes

0 answers

MadeEasyTestSeries operating_system
Somebody, please solve this question.

asked 1 day ago in Operating System by Rudr Pawan (688 points) | 10 views

0 votes

0 answers

Self doubt in pumping lemma
a^nb^2n where n > 1 , is regular language or not how to proof using pumping lemma

asked 1 day ago in Theory of Computation by Sandeep Verma (13 points) | 9 views

0 votes

0 answers

Made_Easy_Test_Series Algorithms- Quick sort
Doubt: Is it really possible to write recurrence relation of for quick sort like it is given in the solution? if yes, then Please explain that how can one find the value of k in quick sort’s recurrence relation T(n)= T(n-k)+T(k-1)+cn in order to get the given recurrence relation in solution. [closed]

asked 1 day ago in Algorithms by Rudr Pawan (688 points) | 6 views

0 votes

0 answers

Ravindrababu ravula test series : File system
Consider a file currently consisting of 100 blocks. Assume that the file-control block (and the index block, in the case of indexed allocation) is already in memory. In the contiguous-allocation case, assume that there is no room to grow at the beginning but there ... 1, 1 2. 101, 52, 1 3. 1, 3, 1 4. 198, 1,0 Please give explaination for above question.

asked 1 day ago in Operating System by vishal burnwal (45 points) | 9 views

0 votes

0 answers

#combinotrics
Q.the number of way six distinct balls be distributed into 3 distinct urns.If each urn contain at least one ball are....

asked 1 day ago in Combinatory by amit166 (112 points) | 6 views

0 votes

0 answers

#test series lattice
Q.Let S=(0,1) and defined the partial order relation on R S*S as follows ((a,b)R(c,d) if (a<c)or(a=c and b<=d)) Draw hasse digram

asked 1 day ago in Set Theory & Algebra by amit166 (112 points) | 4 views

0 votes

0 answers

TOC undecidability
If L is Turing-recognizable. Then (a) L and L̅ must be decidable. (b) L must be decidable but L̅ need not be. (c) Either L is decidable or L̅ is not Turing recognizable. (d) None of above. [closed]

asked 1 day ago in Theory of Computation by Shubhm (23 points) | 6 views

0 votes

0 answers

Self doubt in digital logic
https://gateoverflow.in/233283/pi-and-epi-in-case-of-dont-care?show=328136#c328136 In that question answer explains that all x's(don't care terms) can be combined to form a prime implicant. But my doubt is that even if any ... group occurs functions value may not be true. Because by definition implicant is that whose truthness implies truthness of function. Thanks.

asked 1 day ago in Digital Logic by Vimal Patel (341 points) | 3 views

0 votes

1 answer

SELF DOUBT (TRANSACTION)
What is the difference between number of schedules which are conflict equal to S and number of serial schedules which are conflict equal to S? Can anybody show an example of the same ? This is very confusing.

asked 1 day ago in Databases by chandrikabhuyan8 (117 points) | 14 views

0 votes

0 answers

Made easy 2019 gate mock test
Consider the following router with three subnets:- If the above network uses class c address then 192.203.16.0 then DBA for department Y is? 255.255.255.0 255.255.255.254 255.255.254.192 255.255.254.255

asked 1 day ago in Computer Networks by shankargadri (8 points) | 5 views

+1 vote

0 answers

MadeEasy Test Series - Worst case height in Binary tree

asked 2 days ago in Algorithms by luc_Bloodstone (26 points) | 13 views

0 votes

0 answers

doubt in UDP packet dirction
if we are given upd packet 5EFA 00FD 001C 3297 , can we find if it going from server to client or vice versa ? is it possible to determine this?

asked 2 days ago in Computer Networks by mehul vaidya (8 points) | 6 views

0 votes

0 answers

SELF DOUBT(DBMS)
Is multiple granularity lock of dbms in syllabus? If yes,from where should i learn it?

asked 2 days ago in Databases by chandrikabhuyan8 (117 points) | 3 views

0 votes

1 answer

GATE GURU:DSA 596
What is the worst case time complexity to delete random element in a binary heap 1. O(nlogn) 2. O(logn) 3. O(n2) 4. O(n)

asked 2 days ago in DS by Debapaul (308 points) | 13 views

0 votes

0 answers

GATE GURU : DSA 405
in Chiluvuru' village there are many mathematicians and algorithm experts. They are always playing with numbers. In that village there is a young student and his name is Bahubali. He is interested in sorting algorithms. So, he taken a sorted array of n elements which has been circularly ... try to help him to find time complexity. 1. O(nlogn) 2. O(logn) 3. O($n^2$) 4. O(n)

asked 2 days ago in Compiler Design by Debapaul (308 points) | 20 views

0 votes

0 answers

Made Easy Test Series : Combinatory
Doubt: I eliminated half of the possibility from $\binom{24}{2}$ to remove t₁>t₂ and got the answer as 2070. Somebody, please explain why I am wrong and the solution is correct. [closed]

asked 2 days ago in Combinatory by Rudr Pawan (688 points) | 8 views

0 votes

0 answers

Self Doubt : Graph Theory
How to know that a simple graph with given degree sequence {3,3,3,3,3,3,6} is hamiltonian or not.

asked 2 days ago in Graph Theory by vishal burnwal (45 points) | 25 views

0 votes

1 answer

self doubt on time complexity
What is the recurrence equation and how to solve it?

asked 2 days ago in Algorithms by Abhipsa Mishra (13 points) | 11 views

0 votes

0 answers

Applied course test series : Context free grammar
A) I and II only B) II and III only C) I and III only D) I,II and III Please give answer and explaination for above question.

asked 2 days ago in Theory of Computation by vishal burnwal (45 points) | 12 views

0 votes

0 answers

OS ace testseries
What should be the answer C or D?

asked 2 days ago in Operating System by Rajesh Panwar (40 points) | 15 views

0 votes

0 answers

Pearson's book
A Read/Write memory chip has a capacity of 64 k bytes. Assuming separate data and address line and availability of chip enable signal, what is the minimum number of pins required in the IC chip?

asked 2 days ago in CO & Architecture by rohancse25 (6 points) | 1 view

0 votes

0 answers

self doubt regular grammar
Can a regular grammar be ambiguous? If so then plz give some example.

asked 2 days ago in Theory of Computation by Shubhm (23 points) | 14 views

0 votes

0 answers

GeeksForGeeks
Consider a CPU having a clock cycle of 4.5 ns. When an instruction is executed in this CPU it takes 20 cycles for data instructions, 8 cycles for ALU instructions and 12 cycles for branch instructions. Assume that there are 60% data instructions, 20% ALU ... is improved and it starts taking 1 cycle for ALU and branch instruction i.e CPI=1, find speedup achieved in the enhancement ?

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

0 votes

0 answers

Preparation help or Advice
Hello, I Want Some Advice, On Preparation, I Am Yet To Complete Toc, Compiler Design And Csa, And I Also Have To Complete My Revision For The Rest Subjects.So Should I Skip These Subjects Or Should I Prepare Most Important Topics If Yes, Please Let Me Know The Important Topics.

asked 2 days ago in Others by SHREE HARI B (6 points) | 3 views

0 votes

0 answers

self doubt in algorithms time complexity
What is the answer for this?

asked 2 days ago in Algorithms by Abhipsa Mishra (13 points) | 3 views

0 votes

0 answers

Dependency Preserve-DBMS-ACE
Relation R(ABCDE) with FD set $F=\left \{ A\rightarrow BC,C\rightarrow DE,D\rightarrow E \right \}$ and decomposition are $R1\left ( ABCD \right )$ and $R2\left ( DE \right )$ Now my question is $C\rightarrow DE$ dependency preserved? ... $D\rightarrow E$ these two dependencies preserving and that is why $C\rightarrow DE$ also preserving. Is it true?

asked 2 days ago in Databases by srestha (522 points) | 7 views

0 votes

1 answer

MADE EASY: GATE 2020 COMPILERS
Consider the following grammarsG1 and G2 G1: S→ aS | ε G2: S→Sa | ε Select the correct option. 1. G1 and G2 generate different parse tree for all strings. 2. L(G1) ≠ L(G2). 3. G1 is LR(0) while G2 is not LR(0) 4. G2 is LR(0) while G1 is not LR(0)

asked 2 days ago in Compiler Design by Debapaul (308 points) | 17 views

0 votes

1 answer

Made Easy: CD
How many states are there in LR(0) parsing of the following grammar $E→ E+T / T$ $T→ T*F / F$ $F→ (E)/id$

asked 3 days ago in Compiler Design by Debapaul (308 points) | 13 views

0 votes

0 answers

DFA/NFA MINIMUM NUMBER OF STATES
How to decide minimum when will DFA have N+2 or N+1 states? https://gateoverflow.in/39562/gate2016-2-16 https://gateoverflow.in/8256/gate2015-2-53 https://gateoverflow.in/118302/gate2017-1-22 https://gateoverflow.in/118160/gate2017-2-25 above 2 are cases for N+1 and latter are N+2

asked 3 days ago in Theory of Computation by Asim Siddiqui 4 (8 points) | 5 views

0 votes

0 answers

ACE-DBMS(SQL)
EMPLOYEE(Fname,Lname,Ssn,Bdate,Address,Sex,Salary,SuperSsn,Dnum) WORKS_ON(ESsn,Pno,Hours) PROJECT(Pname,Pnumber,Plocation,Dnum) Retrieve Name of each Employee who works on all the Project controlled by department number 5 Which of the following is correct? A) ... Select ESsn from Works_On Bwhere B.Pno=All(Select Pnumber from Project where Dnum=5)); Which option is correct and why?

asked 3 days ago in Databases by srestha (522 points) | 9 views

Page:

1
2
3
4
...
57
next »

Recent questions

2,267 questions

1,281 answers

6,475 comments

89,713 users