Recent questions - GATE CSE Doubts

0 votes

0 answers

Linked list self doubt

asked 21 hours ago in Programming by Rajeevkr (12 points) | 8 views

0 votes

0 answers

GATE 2021 # compiler design
Is dominance tree there in gate syllabus of 2021?

asked 1 day ago in Compiler Design by sushmitagoswami (6 points) | 9 views

0 votes

0 answers

NIELIT Scientist B CSE
The number of unused pointers in a complete binary tree of depth 5 is : (A) 4 (B) 8 (C) 16 (D) 32 According to me answer should be option (D), as there are 16 leaf nodes and therefore 32 pointers are unused at depth 5.

asked 1 day ago in DS by Ollie (7 points) | 4 views

0 votes

0 answers

Made easy database management system objective practice sets

asked 1 day ago in Databases by Setika Mehra (12 points) | 7 views

0 votes

0 answers

Anyone facing problems with IIT Kanpur admission portal

asked 1 day ago in IISc/IITs by Joels (6 points) | 10 views

0 votes

0 answers

SELF DOUBT PREVIOUS YEAR ALGORITHM
https://gateoverflow.in/8501/gate2015-3-42 CAN WE say f(n)=Θ(g(n))…..becz for n=0 both are equal.

asked 1 day ago in Algorithms by eyeamgj (41 points) | 6 views

0 votes

0 answers

Made easy postal package, database management system, objective practice sets, pg-9 ques-34

asked 1 day ago in Databases by Setika Mehra (12 points) | 4 views

0 votes

0 answers

Self doubt-DBMS(ER DIAGRAMS)
For the given ER diagram I have drawn 2 Relational Models please tell me which one of it is correct? ER DIAGRAM: RELATIONAL MODELS:

asked 2 days ago in Databases by Doraemon (101 points) | 3 views

0 votes

0 answers

MADE EASY POSTAL PACKAGE DATABASE MANAGEMENT SYSTEM PG-13 QUES-07

asked 2 days ago in Databases by Setika Mehra (12 points) | 18 views

0 votes

0 answers

NIELIT Scientist B 2016
Which of the following is wrong: A. Turing machine is a simple mathematical model of general purpose computer B. Turing machine is more powerful than finite automata C. Turing machine can be simulated by a general purpose computer D. All of the above ... are wrong. Turing machine is more powerful than finite automata is true, similarly option C and A also seems to be true.

asked 3 days ago in Theory of Computation by Ollie (7 points) | 12 views

0 votes

0 answers

Self doubt(DBMS-ER DIAGRAMS)
Can one-many recursive relation exist in which the one side is having partial participation and the many side is having total participation?

asked 3 days ago in Databases by Doraemon (101 points) | 7 views

0 votes

0 answers

Matrices Eigen Values
The value of ‘x’ for which all the eigen values of the matrix given below are real is 10 5+j 4 x 20 2 4 2 -10 5+j b. 5-j c.1-5j d.1+5j

asked 3 days ago in Mathematical Logic by Shivateja MST (113 points) | 12 views

0 votes

0 answers

Question on vector calculus
Which one of the following descries the relationship among the three vectors, i+j+k ,2i+3j+k ,5i+6j+4k ? The vectors are mutually perpendicular The vectors are linearly dependent The vectors are linearly independent The vectors are unit vectors Anyone please clarify.

asked 3 days ago in Mathematical Logic by Shivateja MST (113 points) | 7 views

0 votes

0 answers

Fork () in for Loop
As it runs for i=0 to 10 except I=5 as continue is used. Therefore 10 times. Therefore 2^10-1 children. But I couldn't get the concept as I am using formulae. Please make a diagram just for overview to some iterations that his fork exactly calls.

asked 3 days ago in Operating System by lokeshsharma123456 (11 points) | 12 views

0 votes

0 answers

ISI 2019 PCB
Let R be a relation with functional dependencies F. For any subset of attributes $X ⊆ R$, the closure of $X$ is defined as the set $X^+$ = {$A ∈ R$ | $X → A$ holds with respect to $F$ }. For two non-empty attribute sets $Y$ and $Z$ in $R$, prove or disprove each of the following statements: (a) $(Y^+Z)^+ = (Y Z)^+$ (b) $(YZ)^+ = Y^+Z^+$

asked 3 days ago in Databases by thebiggercypher (6 points) | 1 view

0 votes

0 answers

#discrete mathematics #exponential generating function

asked 3 days ago in Combinatory by souren (28 points) | 4 views

0 votes

0 answers

Fork () in for Loop
As it runs for i=0 to 10 except I=5 as continue is used. Therefore 10 times. Therefore 2^10-1 children. But I couldn't get the concept as I am using formulae. Please make a diagram just for overview to some iterations that how fork exactly calls.

asked 4 days ago in Operating System by lokeshsharma123456 (11 points) | 4 views

0 votes

0 answers

Anyone applied for BIS ? Please share your rank .

asked 4 days ago in Job Queries by askeshavas (8 points) | 4 views

0 votes

0 answers

what is the Meaning of following in peter linz algortihm for Chapter 3 , Nfa to Rex?

asked 4 days ago in Theory of Computation by lokopi (6 points) | 10 views

0 votes

0 answers

Self Doubt 5:Peter Linz(exercise 1.2)
$L1={a^{n} b^{m};n>=0,m<n}$ $L2={a^{n} b^{(n-2)};n>=3}$ $L3=complement$ $of$ $L2.$ $L1-L3$ is? According to me $L1-L3$ is same as $L2$. Please verify.

asked 5 days ago in Theory of Computation by Doraemon (101 points) | 15 views

0 votes

0 answers

TOC-Which of the following is true?
L1={a^n b^m:n>=0,m<n} L2={a^3n b^2n : n>2} L3={a^n b^m: m<=n-3 or m=n-1} i>L1 U L2 IS A DCFL ii>L1 L2 IS A DCFL iii>L3 is a DCFL. Please verify which of the following is true?

asked 5 days ago in Theory of Computation by Doraemon (101 points) | 5 views

0 votes

0 answers

STATISTICS - Probability
The Indian cricket team is visiting New Zealand to play a test series comprising five matches. In each match, assume that the Indian team has a 70% chance of winning. Further, assuming that the matches are independent of each other, what is the probability that: The Indian team will win the series? b. The team will win all five matches, and that the team will lose all?

asked 5 days ago in Mathematical Logic by SHIVANI AGARWAL (6 points) | 13 views

0 votes

0 answers

GATE CSE 2014 PREVIOUS YEAR QUESTIONS
Consider a join (relation algebra) between relations r(R)r(R) and s(S)s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R))<size(s(S)) , ... s(S)s(S) is more than 0.5. join selection factor between r(R)r(R) and s(S)s(S) is less than 0.5 [closed]

asked 5 days ago in Databases by Setika Mehra (12 points) | 7 views

0 votes

1 answer

Quantitative Aptitude-Arun Sharma ( Time and Work)

asked 5 days ago in Numerical Ability by gateustad (16 points) | 11 views

0 votes

1 answer

Quantitative Aptitude-Arun Sharma (Time & Work)
There are three taps A,B,C in a tank. They can fill the tank in 10,20,25 hours respectively. At first all of them are opened simultaneously. Then after 2 hours, tap C is closed and A and B are kept running. After 4th hour tap B is also closed. ... tap A alone. Find the percentage of work done by tap A by itself. A) 32% B) 52% C) 75% D) none of these

asked 5 days ago in Numerical Ability by gateustad (16 points) | 4 views

0 votes

1 answer

Programming Doubt on C
#include<stdio.h> int x=14; int fun(){ return x--; } int main(){ int sum=0; for(fun();--x;fun()) sum=sum+fun(); printf("%d",sum); return 0; } What will be the output? See , inside for loop , at the time of initialization ... get some sequence point. right? Where will ${\color{Green} {fun()}}$ it get sequence point? Will in this iteration value of sum be 9?

asked 5 days ago in Programming by srestha (683 points) | 22 views

+1 vote

1 answer

Consider the following grammar G.
Q.27 Consider the following grammar G. S→AB/d A→aA/b B→bB/c The grammar G is (a) LL (1) grammar and not LR (0) (b) LL (1) and LR (0) (c) Not LL (1) but LR (0) (d) Neither LL (1) nor LR (0)

asked 5 days ago in Compiler Design by Debanil (10 points) | 22 views

0 votes

1 answer

self doubt 4 -Peter Linz-chapter 7.
It has been told in Peter Linz that if L1 is deterministic context-free and L2 is regular, then a) the language L1 ∪ L2 is deterministic context-free b) the language L1 ∩ L2 is deterministic context-free. But DCFL is not closed under ... regular language is a DCFL then automatically , therefore L1UL2 and L1 ∩ L2 might not be closed. Can anyone please verify?

asked 6 days ago in Theory of Computation by Doraemon (101 points) | 12 views

0 votes

0 answers

InterviewBit
In the following C function, let $n >= m$. int gcd(int n, int m) { if (n%m ==0) return m; if (n < m) swap(n, m); while (m > 0) { n = n%m; swap(n, m); } return n; } What is the time complexity of the above function assuming n > m?

asked 6 days ago in Algorithms by Sambhrant Maurya (401 points) | 8 views

0 votes

0 answers

BITS HD 2020 - Apply for multiple programmes
I plan to apply for BITS via both mediums (GATE + BITS HD) for the following programmes – Computer Science Software Systems Embedded Systems So will I end up giving 3 different BITS HD test for each subject? What subject test will be applicable for Embedded systems in the BITS HD exam? Or am I misunderstanding the process?

asked 6 days ago in Other Colleges by crg2020 (6 points) | 7 views

0 votes

1 answer

self doubt 2-PDA
If suppose we have an NPDA for a language,Does that mean that the language is always NCFL?

asked 6 days ago in Theory of Computation by Doraemon (101 points) | 12 views

0 votes

0 answers

SELF DOUBT-3(PDA)
Can someone give me the PDA for this language? L={W BELONGS TO {a+b+c}*; (no. of a+no. of b) not equal to the number of c} Actuallly I am getting a NPDA for this .does this language have a DPDA?

asked 6 days ago in Theory of Computation by Doraemon (101 points) | 5 views

0 votes

0 answers

synchronization problems
#include <sys/types.h> #include <stdio.h> #include <unistd.h> int value = 10; int main() { pid_t pid; pid = fork(); if (pid == 0) { value = value + 100; } else if (pid > 0) { value = value -100; printf("PARENT: value= %d \n", value); //Line A wait (NULL); } } is there any synchronization problem in updating values

asked Mar 30 in Operating System by navo123 (7 points) | 4 views

0 votes

0 answers

synchronization
The Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5, 8, .... Formally, it can be expressed as: f ib0 = 0 f ib1 = 1 f ibn = f ibn−1 + f ibn−2 i. Write a C program using the fork() system call that that generates ... . How do y ou identify the zombie process? vii. Modify the above program to create an orphan process. viii. Compare and contrast the process and threads.

asked Mar 30 in Operating System by navo123 (7 points) | 9 views

0 votes

0 answers

techtud.com c & data structure quiz 2020
G is a graph on n vertices and 2n−2 edges. The edges of G can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for G? (A)For every subset of k vertices, the induced subgraph has at most ... edge-disjoint paths between every pair of vertices. (D)There are at least 2 vertex-disjoint paths between every pair of vertices.

asked Mar 30 in Programming by Sapan Jain 1 (6 points) | 5 views

0 votes

0 answers

#microprogrammed control unit
In case of micro programmed control unit, why we have field reserved for control memory address as the micro program counter will automatically be incremented by clock and will point to the next micro instruction in sequence?

asked Mar 30 in CO & Architecture by Lovejeet Singh (7 points) | 4 views

0 votes

0 answers

REQUEST FOR SOLTION MANUAL FOR PETER LINZ
Can anyone provide me with the solution manual for 6TH EDITION OF PETERLINZ.(or if not available any edition you have)

asked Mar 30 in Theory of Computation by Doraemon (101 points) | 5 views

0 votes

1 answer

Caluculate Gate 2020 Percentile
While filling IIT kanpur ms research form it asks for gate percentile . How to calculate it . Thanks in advance.

asked Mar 29 in IISc/IITs by Gourish (9 points) | 20 views

0 votes

0 answers

#general aptitude
The probabilities that a student passes in Mathematics,physics and chemistry are m,p,and c respectively.Of these 3 subjects ,the student has a 75% chance in passing in at least onc,50% chance in passing at least two and a 40% chance of passing exactly two. calculate p+m+C=?

asked Mar 29 in Numerical Ability by DEBANJAN GHOSH (6 points) | 9 views

0 votes

0 answers

gate 2006 -IT-56
For each of the four processes P1,P2,P3,P1,P2,P3, and P4P4. The total size in kilobytes (KB)(KB) and the number of segments are given below. ProcessP1P2P3P4Total size (in KB)19525445364Number of segments4538ProcessTotal size (in KB)Number of ... ; P Answer to this question is B or C ? and if possible can anyone provide the solution with explanation ; Thanks

asked Mar 29 in Operating System by Harpuneet Kalsi (6 points) | 7 views

Page:

1
2
3
4
...
89
next »

Recent questions

3,522 questions

1,658 answers

10,465 comments

90,046 users