GATE CSE Doubts

0 votes

0 answers

Self doubt in instruction execution cycle /(CO) computer organization

asked 2 hours ago in CO & Architecture by Kavya sharma (11 points) | 3 views

0 votes

0 answers

#algoritm#heap
What is the difference between max heap and max heapify..?

asked 3 hours ago in Algorithms by Allica (13 points) | 3 views

0 votes

0 answers

GATE 2001 DBMS
Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a relational algebra expression of constant length? A List of all vertices adjacent to a given vertex B ... of less than three vertices D List all vertices reachable from a given vertex *Please elaborate all the solutions of this question.

asked 6 hours ago in Databases by donniedarko (21 points) | 8 views

+1 vote

1 answer

Made easy Test series-Quicksort
How much time it will take to sort n numbers by quicksort if some arbitrary algorithm takes (n2) time to choose pivot?

answered 6 hours ago in Algorithms by bthebestSelf (5 points) | 272 views

0 votes

0 answers

Directed Acyclic Graph in CD
Can anyone provide me good reference for solving Directed Acyclic Graphs(DAG) problems?

asked 7 hours ago in Compiler Design by nikhil856 (13 points) | 5 views

0 votes

0 answers

Madeeasy Testseries COA Q1
Anyone please clarify..

asked 7 hours ago in CO & Architecture by Shivateja MST (45 points) | 6 views

0 votes

0 answers

#gate2017 #algorithms
In question given below plz explain how we know that which searching algorithms is fit in Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.

asked 10 hours ago in Algorithms by Allica (13 points) | 8 views

0 votes

0 answers

Made Easy Test Series, DBMS, Normalization
Can anyone please explain how B) and D) are true? 2NF requires us to have no partial dependency on key for some non-key attributes. 3NF requires us to have no transitive dependency OR X->Y non trivial dependencies where either X is SK or Y are all prime attributes. Can anyone please explain how this leads to options B and D being true? Thanks.

asked 14 hours ago in Databases by sankalpmittal (41 points) | 7 views

0 votes

0 answers

Made Easy Test Series, DBMS, Functional Dependencies

asked 14 hours ago in Databases by sankalpmittal (41 points) | 12 views

0 votes

0 answers

Made Easy Test Series
How to Differentiate Option A and B?

asked 15 hours ago in Algorithms by Parth27 (9 points) | 14 views

0 votes

0 answers

3D-Projections Question (UGC NET June 2020)
Given below are different properties of 3D projections from A-D. Identify the correct order on the basis of property true of (i) a perspective projection only (ii) an orthographic projection only (iii) both orthographic and projective transformations and (iv) neither ... correct answer from the options given below: D,C,B,A B,C,D,A D,C,A,B C,D,B,A

asked 1 day ago in CBSE/UGC NET by dishendra (6 points) | 9 views

0 votes

1 answer

Made Easy Workbook
What will be the number of components?

answered 1 day ago in Graph Theory by zxy123 (2.9k points) | 27 views

0 votes

0 answers

Applied topic test
" if we assume uniform hashing, what is the probability that a collision will occur in a hash table with 100 buckets and 2 keys?" Doesn't this question means that we have a hash table in which there are already 2 keys, and we have ... probability of collision for the next insertion? Or it is asking the probability of collision in the table for these two keys insertion?

asked 1 day ago in Programming by Ankita87077 (9 points) | 11 views

0 votes

1 answer

Made Easy Workbook- Algorithms Chapter-2 Q-2
Solve the following with Substitution method only. $T(n) = 8T(n/2) + n^{2}logn$) n>0 T(1)=1 Note: The original question doesn’t say to solve with substitution only but i don’t like Master’s method.

answered 1 day ago in Algorithms by zxy123 (2.9k points) | 18 views

0 votes

0 answers

Peter Linz 5e Ex-2.1 Q-7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)-n_{b}(w))mod3>0$ } [closed]

asked 1 day ago in Theory of Computation by aditi19 (41 points) | 9 views

+1 vote

0 answers

Peter Linz 5e Ex-2.1 Q7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)-n_{b}(w))mod3>0$ }

asked 1 day ago in Theory of Computation by aditi19 (41 points) | 17 views

+1 vote

0 answers

Self-doubt sum series and logaritms.
These are what i ended up with while solving a couple of recurrance relation can anyone help to solve further. $(n^2) log(n/2^{k-1}) + 2(n^2) log(n/2^{k-2}) + 3(n^2) log(n/2^{k-3}) + ...+ (n^2) log(n)$ $2. lg n + lg (n / 2) + lg (n / 4) + ... + lg (n / 2^{lg n})$ Note: Assume base 2 for log terms.

asked 1 day ago in Mathematical Logic by donniedarko (21 points) | 17 views

+1 vote

1 answer

#edugorilla#Placement paper#wipro
How many odd numbers of four digits having distinct digits can be formed with the digits 0,1,2,3,5,7 ?

answered 1 day ago in Numerical Ability by kalin (153 points) | 10 views

0 votes

0 answers

Made easy booklet
Bag contains 5 black, 2 red and 3 white marbles. Three marbles are drawn simultaneously. Find probability that they're of different colour

asked 1 day ago in Probability by farazbukhari0 (5 points) | 21 views

0 votes

1 answer

TEST series :TESTBOOK

answered 2 days ago in Programming by zxy123 (2.9k points) | 24 views

0 votes

1 answer

#gate2000#cse#graph
Why b option is incorrect Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following ... u is a leaf in T (D) If {u,v} is not an edge in G then u and v must have the same parent in T

answered 2 days ago in DS by zxy123 (2.9k points) | 22 views

0 votes

0 answers

Self Doubt Disks
when solving questions of disks 10KB is 1024*10B or 1000*10B? different sources are telling different things,even same sources are telling different things at different time.

asked 2 days ago in Operating System by Nitinkumar.097 (13 points) | 13 views

0 votes

0 answers

Made Easy Test series
Answer will 8 or 9? i got 9 (according to me no optimization should be done in Intermediate representation form) [closed]

asked 2 days ago in Compiler Design by Nitinkumar.097 (13 points) | 10 views

0 votes

0 answers

Made easy test series
how? can u plese draw them?

asked 2 days ago in Databases by Salla shivateja (19 points) | 19 views

0 votes

1 answer

Self doubt :Time Complexity -Iterative
Can Someone help me understand the time-complexity of dependent loops? for example, Q1> int i,j; for(i=1;i<n;i=i++) { for(j=1;j<=i;j=j*2) } Q2> int i,j; for(i=1;i<=n/2;i=i++) { for(j=1;j<=i;j++) }

answered 2 days ago in Algorithms by zxy123 (2.9k points) | 14 views

+1 vote

1 answer

Gate Applied Course Test Series
There are 20 intermediate stops on a route of a transport corporation bus. The number of ways in which the bus can stop at 6 of these intermediate stops such that no 2 stops are consecutive is ?

answered 3 days ago in Combinatory by zxy123 (2.9k points) | 25 views

0 votes

1 answer

What is total number of planer graph can be formed with 6 vertices ?

answered 3 days ago in Graph Theory by zxy123 (2.9k points) | 29 views

0 votes

1 answer

Made Easy Test Series
$A. O(n (logn)^2) $ $B. O(n^2 logn) $ $C. O(n^2) $ $D. O(n log(log(n)))$

answered 3 days ago in Algorithms by zxy123 (2.9k points) | 16 views

0 votes

0 answers

self doubt madeeasy test series
https://gateoverflow.in/311536/made-easy-test-series-binary-tree how tree will look like ...please see

asked 3 days ago in DS by eyeamgj (25 points) | 12 views

0 votes

1 answer

# edugorilla #IT placement papers # wipro
A team of 30 men is supposed to do a work in 37 days . After 25 days , 5 more men were employed and the work was finished 1 day earlier . How many days would it have been delayed if 5 more men were not employed?

answered 3 days ago in Numerical Ability by zxy123 (2.9k points) | 9 views

+1 vote

1 answer

Tga test series

answered 3 days ago in Digital Logic by zxy123 (2.9k points) | 12 views

0 votes

0 answers

SELF DOUBT HASHING
https://gateoverflow.in/57653/cormen-2nd-edition-exercise-11-2-1 WHY WE CANT DO LIKE THIS …...NUMBER OF COLLISIONS(X) : 0 1 2 3 4 …………………...N-1 P(X): 0/M 1/M 2/M…………………… … ………….(N-1)/M

asked 3 days ago in DS by eyeamgj (25 points) | 8 views

0 votes

0 answers

ME test series
Which of the following statements are true? S1: Doubling the line size halves the number of tags in the cache. S2 : Doubling the associativity increases the number of tags in the cache. S3 : Doubling the line size usually reduce compulsory misses. How to approach such kind of question?

asked 3 days ago in CO & Architecture by Abhineet Singh (23 points) | 33 views

+1 vote

0 answers

ME test series
Consider a RISC processor with an ideal CPI, where 25% of the total instructions are load and store instruction. Time to accessing main memory is 100 clock cycles and accessing of the cache memory required 2 clock cycles and cache miss rate is 2%. Which of the following are ... misses is 2.9. D CPI for the handling cache hits is 2.45. How to solve this, unable to get any option...

asked 3 days ago in CO & Architecture by Abhineet Singh (23 points) | 37 views

0 votes

0 answers

ME test series
Which of the following are correct?(MSQ) A Compulsory misses can be reduced by increasing the block size. B The search concept used in associative memory is parallel search. C Conflict misses can be reduced by increasing block size. D Reducing block ... spatial locality. I'm having some trouble in approaching these type of questions. Please tell how to solve these type of questions

asked 3 days ago in CO & Architecture by Abhineet Singh (23 points) | 4 views

0 votes

0 answers

Book: Gate Overflow Question no. 4.7.20 in the Programming in C section

asked 3 days ago in Programming by hadarsh (5 points) | 12 views

0 votes

1 answer

ME Test Series
I have a doubt, How many rows will be returned when All values of R2.A will be Null….in this case number of rows Natural Join should give 0 rows ….what will be minimum number of rows???

answered 3 days ago in Databases by ashutoshbsathe (5 points) | 16 views

0 votes

0 answers

Tga mock test
MSQ Type question.

asked 4 days ago in Digital Logic by Enolx.21 (25 points) | 16 views

0 votes

0 answers

Need of cycle checking algorithm in minimum spanning tree algorithms

asked 4 days ago in Algorithms by ashutoshbsathe (5 points) | 12 views

0 votes

0 answers

Elmsari Fundamentals , Normalisation
Consider the universal relation A = {P,Q,R,S,T,U,V,W,X,Y,Z} and the set of functional dependencies FD's = { PQ -> R, R -> ST, Q -> U, U -> VW, S-> XY }. What is the key for A. Decompose A into 2NF and 3 NF relations

asked 4 days ago in Databases by Lucifer2440 (5 points) | 10 views

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

Recent questions and answers

8,953 questions

3,113 answers

14,322 comments

95,780 users