Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent activity by Sambhrant Maurya
User Sambhrant Maurya
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sambhrant Maurya
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
GATE CS 2014 exam, Geeks for Geeks
Consider the following program in C language: #include <stdio.h> main() { int i; int *pi = &i; scanf("%d", pi); printf("%d\n", i+5); } Which one of the following statements is TRUE? (A) Compilation fails. ... is 5 more than the address of variable i. (D) On execution, the value printed is 5 more than the integer value entered.
commented
May 7
in
Programming

12
views
#gate
2014
#programming
0
answers
Self Doubt Time and Work, Pipes and Cisterns
A tank has a leak at bottom which empties it at 6 litres/minutes. It also has a filling tap which can fill the tank in 6 hours. The tank takes 18 hours to become full. Find the capacity of tank.
commented
Apr 19
in
Numerical Ability

34
views
timeandwork
generalaptitude
pipesandcisterns
numericalability
0
answers
GATE 2021 # compiler design
Is dominance tree there in gate syllabus of 2021?
commented
Apr 5
in
Compiler Design

32
views
#help
#gatepreparation
#compilerdesign
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. 5j c.15j d.1+5j
commented
Apr 2
in
Mathematical Logic

21
views
linearalgebra
engineeringmaths
engineeringmathematics
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.
commented
Apr 2
in
Mathematical Logic

18
views
engineeringmathematics
vectors
0
answers
Self Doubt 5:Peter Linz(exercise 1.2)
$L1={a^{n} b^{m};n>=0,m<n}$ $L2={a^{n} b^{(n2)};n>=3}$ $L3=complement$ $of$ $L2.$ $L1L3$ is? According to me $L1L3$ is same as $L2$. Please verify.
commented
Apr 1
in
Theory of Computation

20
views
theoryofcomputation
peterlinz
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
Apr 1
in
Databases

20
views
database
databases
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
Mar 31
in
Algorithms

13
views
timecomplexity
0
answers
IIT Bombay admission
Last year general rank cut off for IIT Bombay was 90 but in the website it is showing last gate score admitted is 812...I have gate score 849 in Gate 2020 with AIR 106(General category).DO I have any chance this year getting seat at IIT BOmbay(TA)?
commented
Mar 28
in
IISc/IITs

24
views
1
answer
self doubt on toc finit automata
What will be the number of states in minimal DFA, if every string contains aa and bb as substring ?
answer edited
Mar 26
in
Theory of Computation

25
views
#dfa
finiteautomata
theoryofcomputation
0
answers
GATE 2020 IIT Bombay Application form
In IIT Bombay m.tech TA application form there is a place details of academic record of qualifying exam (Secondary /hsc onwards)... Do we need to mention our 10th and 12th results along with B.tech results? Please help...Not getting any clarifications from anywhere
commented
Mar 25
in
IISc/IITs

43
views
0
answers
IIT kanpur admission doubt
While uploading document for IIT Kanpur M.tech program They asked to upload Degree/ mark sheet. I just uploaded my degree and not mark sheet. Later i realized my mistake and dropped mail to them. It has been 4 four days , but they haven’t replied to my mail. what should i do? Do I just fill another form and pay fee separately.
comment moved
Mar 25
in
IISc/IITs

42
views
#admission
arjun
admission
mtech
1
answer
Mtech placements and admission suggestions
Is this NIRF data reliable? It shows that the median salary of NIT Trichy as around 8LPA and its similar for IIT Bombay. https://nirfcdn.azureedge.net/2019/pdf/ENGINEERING/IREU0467.pdf https://nirfcdn.azureedge.net/2019/pdf/ ... 'm mostly looking at the colleges based on placement. Which college would be better and why? Also, any other suggestions?
answer selected
Mar 25
in
NITs

48
views
#iiitb
#nit
#iit
#nirf
#iiita
0
answers
#process Synchronization #binary semaphore
Please provide book name for pseudocode of Binary semaphore. Thankyou in advance.
commented
Mar 24
in
Operating System

20
views
processsynchronization
binarysemaphore
#operatingsystem
0
answers
Admission help for joining MTech/MS programmes
I secured a rank of 591 and score of 725 in gate 2020 CS. I belong to OBCNCL. Could I get some suggestions for IITs/IISc MTech/MS programmes I have a good chance of getting into ?
commented
Mar 24
in
IISc/IITs

28
views
#admission
mtech
#iit
#iisc
0
answers
Gate 2020 general aptitude questions
If P=3, R=27, T=243, then Q+S= ________ 40 80 90 110
closed
Mar 24
in
Numerical Ability

66
views
0
answers
Possible IITs with GATE Score 531 OBCNCL.
commented
Mar 22
in
IISc/IITs

32
views
0
answers
IITK admissions
is it compulsory to write SOP for IITK Mtech TA?
commented
Mar 21
in
IISc/IITs

57
views
iitk
0
answers
Recommendation on how to prepare
Should i read all standard books from scratch or it would be more beneficial to watch nptel video lectures to prepare for gate 2021 if i am from noncs background(mechanical) and so far not have much core CS knowledge other than some basics programming, algorithm and data structure.
commented
Mar 11
in
Others

56
views
#help
#preperation
#gatepreparation
0
answers
Data communication and networking by forouzan
11. We have a pure ALOHA network with 100 stations. If Tfr=1μsTfr=1μs, what is the number of frames each station can send to achieve the maximum efficiency. 12. Repeat Exercise 11 for slotted ALOHA. The question is also present in the following link : https://gateoverflow.in/325673/datacommunicationandnetworkingbyforouzan12exercise
commented
Feb 15
in
Computer Networks

28
views
aloha
computernetworks
0
answers
General Query
Hi Sir, I am looking for some advise. Is it worth doing M.Tech in CSE from old IITs or IISc after 1012 years of work experience at age of 35?
commented
Feb 14
in
Others

66
views
0
answers
madeeasy test seies mock 2
consider two nodes a and b round trip delay between these is 80ms and bottleneck bandwidth is 512kBps the optimal window size …….. if packet size is 64 B and channel is full duplex….what will be the answer i am getting 641 but they said 640….which is correct ? and what will be the answer if half duplex..?
commented
Feb 4
in
Computer Networks

30
views
0
answers
compiler#viableprefix
Consider the following grammar productions: S → BB B → aB  b LR(1) item [B→ a.B, a] is valid for which of the following prefix: a) a b) aa c) aaa d) Baa
commented
Feb 4
in
Compiler Design

67
views
#cd
0
answers
Made Easy :Mock
Three processes P1,P2.P3 use the following synchronization mechanism with S1=3,S2=2,S3=1. 1. P(S1) 2. P(S2) 3. P(S3) 4. <CS> 5. V(S3) 6. V(S2) 7. V(S1) Is bounded waiting satisfied here? Suppose P1,P2,P3 all execute line 1. P1 and ... So processes P1 and P2 can keep on running one after the other without giving the chance to P3 to get a lock on S2. Am I thinking this straight?
commented
Feb 3
in
Operating System

53
views
operatingsystem
0
answers
Made Easy:Mock
$L$:{$a^{n} b^{n+k} / n>=0,k>=1$} $\cup$ {$a^{n+k} b^{n} /n>=0,k>=3 $} Is it a DCFL?
commented
Feb 3
in
Theory of Computation

51
views
theoryofcomputation
0
answers
Made Easy Test Series Discrete Mathematics
Let a graph G has 5 vertices and here are 3 vertices of degree 2 , one vertex of degree 1 and remaining vertex of degree 3. The complement of G is: Connected Disconnected Either (a) or (b) None of the above
commented
Feb 3
in
Mathematical Logic

54
views
madeeasytestseries
0
answers
#algorithms#doubt
In a competition, four different functions are observed. All the functions use a single for loop and within the for loop, same set of statements are executed. Consider the following for loops: A) for(i = 0; i < n; i++) B) for(i = 0; i < n; i += 2 ... 1; i /= 2) If n is the size of input(positive), which function is most efficient(if the task to be performed is not an issue)?
commented
Feb 3
in
Algorithms

41
views
#gate#algorithm
0
answers
doubt in RAW hazard
does RAW hazard only occurs only for subsequent statements? I1 : R1+R2 – > R3 I2 : R3+ R1 –> R4 I3 : R3 + R4 → R4 isn’t I1 and I3 has RAW dependency.
commented
Feb 2
in
CO & Architecture

44
views
0
answers
pipelining DEPENDENCIES DOUBT
https://gateoverflow.in/192093/computerorganizationpipelining TRUE TRUE TRUE TRUE FALSE ARE THEY CORRECT? PLEASE VERIFY
commented
Feb 2
in
CO & Architecture

29
views
0
answers
DBMS Twophase locking selfdoubt.
I've made this table out of my own understanding. Please help me fill in the question marks, and also verify other entries if possible. Simple 2PL Conservative 2PL Strict 2PL Rigorous 2PL Deadlock possible? $✓$ $\times$ $✓$ $✓$ ... does it produce recoverable/cascadeless schedules? If yes, why; if no, why? Sources to your answers would be much appreciated.
commented
Jan 31
in
Databases

77
views
databases
2phaselocking
2pl
serializablity
2
answers
Schedules DBMS
Consider the following statements: 1.Conflict serializability testing condiions are both necessary and sufficient for serializability testing. 2.View serializability testing condiions are both necessary and sufficient for serializability testing. 3.If a Schedule(S) is not conflict serializable ... the following are incorrect? 1 and 3 2 and 3 1 and 2 1,2 and 3 Anyone please clarify.
answered
Jan 31
in
Databases

59
views
database
viewserializablity
databases
0
answers
Testbook FLT
I’m getting 41. Can someone please confirm?
commented
Jan 30
in
Combinatory

50
views
testbooktestseries
combinatory
graphtheory
0
answers
Testbook: Mock
In a BST, the key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9, not necessarily in that order. What is the probability that the 3rd element on the search path beginning from the root is either 3 or 8?
commented
Jan 30
in
DS

100
views
probability
binary_search_tree
1
answer
discrete math relation nd function
{(x,y);y=x^i ,Ǝi belong to Z is this relation reflexive ,irreflexive,symmetric,antisym,asym,transitive? Q2: x is brother of y …...is this relation is transitive? answer given as no but not getting why?
commented
Jan 30
in
Set Theory & Algebra

51
views
0
answers
Made Easy: FLT Basic 3
Consider a degree sequence for n vertices. What is the worst case T.C to determine is a simple graph is possible with this degree sequence? In other words what is the TC of HavelHakimi procedure? $O(n^{2}$) $O(n^{2} log n$) $O(n$) $O(n log n$)
asked
Jan 26
in
Graph Theory

31
views
algorithms
graphtheory
0
answers
Made Easy FLT Basic 3
$\binom{n+m2}{m1}$ $\binom{n+m+1}{m2}$ $\binom{n+m+2}{m}$ $\binom{n+m}{m1}$
asked
Jan 26
in
Algorithms

34
views
dynamicprogramming
algorithms
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
Jan 24
in
Databases

30
views
databases
normalization
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?
comment edited
Jan 23
in
Compiler Design

90
views
parsing
compilerdesign
1
answer
Made EasyCBT2
Which of the following is incorrect a. f(n) + Ω(f(n)) = Ω(f(n)). b. f(n) + Ο(f(n)) = Θ(f(n)). c. f(n) + Ο(f(n)) = Ο(f(n)). d. f(n) + Ω(f(n)) = Θ(f(n)).
comment edited
Jan 21
in
Algorithms

128
views
#madeeasycbt2
#algorithms
2
answers
Gatebook;DBMS
Consider the relation employee(name,sex,manager) with name as the key, manager gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? A. Names of employees who have a female subordinate B. ... manager How to interpret this TRC expression? The y.name = e.manager =>x.sex=female part is troublesome.
answer selected
Jan 21
in
Databases

48
views
databases
gatebook
trc
7,536
questions
1,781
answers
10,866
comments
90,472
users