Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
31
#toc
Çșȇ ʛấẗẻ
75
views
Çșȇ ʛấẗẻ
asked
Feb 24
Theory of Computation
theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language
+
–
0
votes
0
answers
32
#discrete
Çșȇ ʛấẗẻ
60
views
Çșȇ ʛấẗẻ
asked
Feb 24
Mathematical Logic
discrete-mathematics
kenneth-rosen
+
–
0
votes
0
answers
33
#TOC
Çșȇ ʛấẗẻ
50
views
Çșȇ ʛấẗẻ
asked
Feb 24
Databases
theory-of-computation
finite-automata
regular-expression
regular-language
+
–
0
votes
0
answers
34
#dbms
Çșȇ ʛấẗẻ
64
views
Çșȇ ʛấẗẻ
asked
Feb 24
Databases
databases
database-normalization
+
–
0
votes
0
answers
35
#cn
Çșȇ ʛấẗẻ
58
views
Çșȇ ʛấẗẻ
asked
Feb 24
Computer Networks
computer-networks
subnetting
+
–
0
votes
0
answers
36
Consider a regular language R and a context free language C. Let the PDA that recognizes C be called P=(QP,∑,Γ,δP,q0P,FP), and the DFA that reconginzes R be (QR,∑,δR,q0R,FR).
Vedantthakkar
114
views
Vedantthakkar
asked
Feb 24
0
votes
0
answers
37
Question on Quotient set
What will be quotient set for equivalence relation R={(x,y) ∣ x ≡ y mod 5} in set builder form?
What will be quotient set for equivalence relation R={(x,y) ∣ x ≡ y mod 5} in set builder form?
rick55
54
views
rick55
asked
Feb 23
0
votes
0
answers
38
In which order should i study subjects for GATE CSE ?
I'm currently doing Engineering Mathematics, will probably finish it by next week. But i wanted to know which subjects should i prepare next and if there's a particular order to follow for better understanding.
I'm currently doing Engineering Mathematics, will probably finish it by next week. But i wanted to know which subjects should i prepare next and if there's a particular o...
Apex7D0
57
views
Apex7D0
asked
Feb 23
0
votes
0
answers
39
Is throughput and link utilization is same. What are the other ways to ask efficiency?
HarshaVardhan1908
78
views
HarshaVardhan1908
asked
Feb 22
Computer Networks
computer-networks
+
–
0
votes
0
answers
40
NPTEL DBMS (Introduction to Database systems)course Assignment 10: Topic Database Indexing
Use the following information to answer Questions 7 and 8. A sorted file has the following details: Number of records = 13,10,720; record length = 200 bytes; size of the primary key field = 13 bytes; size of ... of blocks in the first level index file is: a)131072 b)1311 c)1310 d)1286 Accepted Answers: 1286
Use the following information to answer Questions 7 and 8.A sorted file has the following details: Number of records = 13,10,720; record length = 200 bytes;size of the pr...
RishabhSahu325
111
views
RishabhSahu325
asked
Feb 22
Databases
databases
+
–
0
votes
0
answers
41
Pumping Lemma
Use the Pumping Lemma to show that the following languages over Σ={�,�}Σ={a,b} are not regular. In each case, carefully describe the string that will be pumped and explain why pumping it leads to a contradiction. {aaabnan∣n≥0} {ww∣w∈Σ∗}
Use the Pumping Lemma to show that the following languages over Σ={�,�}Σ={a,b} are not regular. In each case, carefully describe the string that will be pumped and ...
jg662
67
views
jg662
asked
Feb 22
Theory of Computation
theory-of-computation
pumping-lemma
+
–
0
votes
0
answers
42
In rural Ireland, a century ago, the students had to form a line. The student at the front of the line would be asked to spell a word. If he spelled it correctly, he was allowed to sit down. If not, he received a whack on the hand with a switch and was sent to the end of the line. Suppose that a student could spell correctly 70% of the words in the lesson. What is the probability that the student would be able to sit down before receiving four whacks on the hand? Assume that the master chose the words to be spelled randomly and independently.
tim20
72
views
tim20
asked
Feb 22
Algorithms
algorithms
probability
+
–
0
votes
0
answers
43
Prove that the following languages are not regular. You may use the pumping lemma and the closure of the class of regular languages under union, intersection, and complement. a. {0"1"0"| m, n 2 0} b. (0"1"| m ‡ n) c. (w| w € {0,1)* is not a palindrome) d. (wtw| w,t € (0,1)*)
krishan_rathi
110
views
krishan_rathi
asked
Feb 21
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
44
Hello everyone, I am doing Btech in CSE with specialization in Data science I wanted to ask is it a eligible degree for admission in mtech of IITs (Is it considered the same as CSE Core) while admission
Rahul Sharma0408
66
views
Rahul Sharma0408
asked
Feb 20
Others
query
+
–
0
votes
0
answers
45
Marking Scheme
I have answered a question as .55 and the official key is 0.54-0.56, will I get the marks as I have not typed 0 before the decimal point? Also in another question, the range is 0.8-0.84 and I was asked to answer it in 2 decimal places i did it in 3 as 0.817, will I get marks for this one too?? please answer.
I have answered a question as .55 and the official key is 0.54-0.56, will I get the marks as I have not typed 0 before the decimal point?Also in another question, the ran...
doubtmaster86
84
views
doubtmaster86
asked
Feb 20
GATE
query
+
–
1
votes
0
answers
46
Gate 2024 CSC set 1
TCP client P successfully establishes a connection to TCP server Q. Let Np denote the sequence number in the SYN sent from P to Q. Let No denote the acknowledgement number in the SYN ACK from Q to P. Which of the following statements is/are CORRECT? A. The ... B,C but if the sequence number of syn packet is 65535 then the ack sequence number should be 0 then how B is correct?
TCP client P successfully establishes a connection to TCP server Q. Let Np denote the sequence number in the SYN sent from P to Q. Let No denote the acknowledgement numbe...
DarkRahul
223
views
DarkRahul
asked
Feb 18
0
votes
0
answers
47
GATE 2024
Does the GO Rank predictor automatically knows which SET my paper belongs to since there are no choice to choose SET number?
Does the GO Rank predictor automatically knows which SET my paper belongs to since there are no choice to choose SET number?
hmg87829
353
views
hmg87829
asked
Feb 18
0
votes
0
answers
48
Will the GATE 2024 rank predictor for DS&AI be released?
If yes, when? If no, why not?
If yes, when?If no, why not?
Infinity
575
views
Infinity
asked
Feb 18
Site Issues
gate-ds-ai
+
–
0
votes
0
answers
49
When will the Gate Overflow answer key get released along with mark distribution?
hacker24
85
views
hacker24
asked
Feb 17
GATE
query
+
–
0
votes
0
answers
50
Where can i find iiit hyderabad pgee mock tests??
Umesh Chandra
172
views
Umesh Chandra
asked
Feb 17
GATE
query
+
–
0
votes
0
answers
51
#Self doubt COA
Çșȇ ʛấẗẻ
312
views
Çșȇ ʛấẗẻ
asked
Feb 16
CO and Architecture
computer
co-and-architecture
+
–
2
votes
0
answers
52
GATE CSE 2024 | Set 2 | Question: 48
A non-pipelined instruction execution unit operating at $2 \mathrm{GHz}$ takes an average of $6$ cycles to execute an instruction of a program $\text{P}$. The unit is then redesigned to operate on a $5$ ... hazards. The speedup (rounded off to one decimal place) obtained by the pipelined design over the non-pipelined design is ____________.
A non-pipelined instruction execution unit operating at $2 \mathrm{GHz}$ takes an average of $6$ cycles to execute an instruction of a program $\text{P}$. The unit is the...
Arjun
1.5k
views
Arjun
asked
Feb 16
CO and Architecture
gatecse2024-set2
numerical-answers
co-and-architecture
pipelining
+
–
0
votes
0
answers
53
Regular expression to finite automata
Çșȇ ʛấẗẻ
199
views
Çșȇ ʛấẗẻ
asked
Feb 15
Mathematical Logic
finite-automata
theory-of-computation
regular-expression
+
–
0
votes
0
answers
54
COA Self doubt
Çșȇ ʛấẗẻ
83
views
Çșȇ ʛấẗẻ
asked
Feb 15
Mathematical Logic
co-and-architecture
self-doubt
+
–
0
votes
0
answers
55
Each of the following languages is the complement of a simpler language. In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the language given. In all parts, Σ = {a, b}.{w| w does not contain the substring ab} {w| w does not contain the substring baba} {w| w contains neither the substrings ab nor ba} {w| w is any string not in a∗ ∪ b∗ } ( ∪ is the union )
Each of the following languages is the complement of a simpler language. In each part, construct a DFA for the simpler language, then use it to give the state diagram of ...
rania
96
views
rania
asked
Feb 14
0
votes
0
answers
56
IIIT-H PGEE
How to prepare for IIIT-H PGEE Mtech Exam and Interview? Does they have any criteria of shorlisting Resume for the Interview?
How to prepare for IIIT-H PGEE Mtech Exam and Interview?Does they have any criteria of shorlisting Resume for the Interview?
debayan1014
190
views
debayan1014
asked
Feb 12
Written Exam
iiith-pgee
mtech
query
+
–
0
votes
0
answers
57
GATE 2024
Consider an n element array which is to be sorted either in ascending or descending order. The given restriction is only one pass will be used for completely sorting the array and an element can compare with only it's adjacent pair. What will be the worst time complexity? Is this related to bubble sort algorithm or not?
Consider an n element array which is to be sorted either in ascending or descending order. The given restriction is only one pass will be used for completely sorting the ...
TusharRana
348
views
TusharRana
asked
Feb 11
Algorithms
algorithms
sorting
+
–
0
votes
0
answers
58
memory management
we have 8 pages (each side 32B) to store in physical memory of 2^32 bits how many bits are required to identify each page , according to me 3 bits are required but that is wrong plz explain why
we have 8 pages (each side 32B) to store in physical memory of 2^32 bits how many bits are required to identify each page , according to me 3 bits are required but that i...
SSR17
187
views
SSR17
asked
Feb 8
Operating System
memory-management
operating-system
paging
virtual-memory
+
–
1
votes
0
answers
59
Gate 2016
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________. I am confused with the question's language. please correct me if I have a wrong assumption. We need to tell the minimum colors required for a planar graph. Suppose I start ... is only fixed to 4. I understand the answer not to be less than 4. What does the word "any" means here?
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.I am confused with the question's language.please correct me if I have a wr...
TusharRana
180
views
TusharRana
asked
Feb 8
0
votes
0
answers
60
Combinatorics & Probability
A rumor is spread randomly among a group of 10 people by successively having one person call someone, who calls someone, and so on. A person can pass the rumor on to anyone except the individual who just called. (a) By how many different paths can a rumor ... in $N$ calls? (c) What is the probability that if $A$ starts the rumor, then $A$ receives the third calls?
A rumor is spread randomly among a group of 10 people by successively having one person call someone, who calls someone, and so on. A person can pass the rumor on to anyo...
Debargha Mitra Roy
137
views
Debargha Mitra Roy
asked
Feb 8
Combinatory
combinatory
counting
+
–
Page:
« prev
1
2
3
4
5
6
7
...
590
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register