Register
Filter

Recent questions without a selected answer

305
views
1 answers
0 votes
Number series
Find the next number in the series4 8 12 20 ___
User Avatar
853
views
1 answers
1 votes
MadeEasy Test Series: Theory Of Computation - Finite Automata
Consider a Game played be between two players (Player-1, Player-2) repeatedly flip a coin.On output as a head, Player-1 get a pointOn output as a tail, ... ? Can anyone explain how this diagram is working between two players,,,,please?????
User Avatar
243
views
1 answers
0 votes
Generak question on Heap
Which method is correct for building max- heap ...why other one is wrong ??
User Avatar
1.9k
views
1 answers
0 votes
Data Link Layer
The IEEE 802 project provides the data link layer into two sublayers. Which sublayer of the data link layer communicates directly with the NIC? ... Access Control Sublayerc) Medium Access Control Sublayerd) Data Access Control Sublayer
User Avatar
679
views
1 answers
1 votes
digital logic
i have a doubt on finding the dont care of f2 and f3????
User Avatar
490
views
2 answers
0 votes
Digital-ME Workbook #3
I am getting 8 gates as an answer to this. Can it be less than this?
User Avatar
946
views
1 answers
0 votes
Digital-Made Easy Workbook
To this, I am getting answer as (A). Let me know if its correct.
User Avatar
272
views
0 answers
1 votes
Cormen chapter 11
Are this time complexities right..len=alpha
User Avatar
1.2k
views
2 answers
5 votes
Vertical Microprograming
Consider a CPU where all the instruction require 10 clock cycles to complete execution. There are 258 instructions in instruction set. It is found that 129 ... for branch control logic. The size of control memory in byte is ________.
User Avatar
310
views
0 answers
0 votes
Access Time Doubt
#OSAfter going through some previous year questions on.. I found that in gate we have to use simultaneous access of memory instead of hierarchical access But i have ... 64ns as option is not matching so we have taken as 65nsIs it correct??
User Avatar
1.0k
views
1 answers
1 votes
Instruction or Operand Fetch
Consider the following μ-program? Which of the following operation is performed by above μ-program?A. Instruction fetchB. Direct operand fetchC. Interrupt sub program ... reason.My Doubt is in option B and D why D isnt the answer ?
User Avatar
335
views
1 answers
1 votes
Transaction
Find the number of concurrent schedule that are conflict serializable
User Avatar
2.4k
views
6 answers
1 votes
#DBMS ER Model - Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
User Avatar
831
views
0 answers
1 votes
shortest path algo
TRUE / FALSE Explain Please..An undirected graph is said to be Hamiltonian if it has a cycle containing all the vertices. Any DFS tree on a Hamiltonian graph must have depth V − 1.
User Avatar
430
views
1 answers
0 votes
logic question
what is the missing no in following series500,1800,100, _ , 20,50,4 explain with logic
User Avatar
269
views
1 answers
1 votes
Pointers
int A[]={0,1,2}int *ptr1 = &A // 1int (*ptr2)[] = &A // 2what is the difference bw 1 and 2 in terms of accessing elements of array
User Avatar
251
views
0 answers
0 votes
general
#EXPERT SUGGESTION NEEDEDSIR What is the meaning of course completion?1-Read everything and prepared notes.2- 1+ solved all previous year questions.3 1+2+ ... completed their course in the month of August or any month before oct "
User Avatar
588
views
1 answers
0 votes
ip addressing
One of the address of the block is 201.99.88.119/22 then find the range of the assignable ip address and also first host address and last host address. Explain briefly.
User Avatar
284
views
2 answers
0 votes
RS Aggrawal
Sam leaves home between 7 am and 8 am and returns between 1 pm and 2 pm to find that the minute and hour hands have interchanged their positions. How long was Sam out of the house?Plz include the explanation for ur answer.
User Avatar
226
views
0 answers
0 votes
Sample Paper
Not sure about option c, can anyone please explain the relation between bounded waiting and busy waiting? 1. Bounded waiting does not allow: (a) Starvation of a process ... to wait for Critical Section (c) Busy waiting (d) All of the above
User Avatar
158
views
0 answers
0 votes
Computer Orgranization (Conceptual Question)
When the WRITE THROUGH protocol is implemented in a simultaneous Access memory Organization then hit ratio of write operation becomes 1. Then why not the read hit also become 1 as now the data is available in all level ?
User Avatar
1.8k
views
1 answers
4 votes
MadeEasy Test Series (Number of tables required)
Answer given is 3 tables which are $R_1(A, B, C, H)$ , $R_2(G, H)$ , $R_3(D, F, A)$My doubt is if we join $E_1$ and $E_2$ making a new ... participating hence no loss of any data and relation $R_2$ with having AD as key can identify $E_2$.
User Avatar
2.1k
views
1 answers
3 votes
DFS Algo
Is following statement true/false? A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considered for DFS. Answer is FALSE please explain
User Avatar
877
views
2 answers
1 votes
#Test series
Consider the minimal Finite automata that accepts all the strings of a’s & b’s where each string contains(i) exactly 5 a’s(ii) atmost 5 a’sThe No. of states in each case respectively are:
User Avatar
442
views
1 answers
0 votes
#Number System
How many IEEE single precision floating point number are in the range [1,2]?
User Avatar
1.2k
views
1 answers
0 votes
#OS Reader Writer User Gate 2000 Doubt
Original Question - https://gateoverflow.in/691/gate2000-20 a. Fill in the boxes below to get a solution for the reader-writer problem, using a single binary ... Section, right//// signal (mutex);}Also, how starvation is happening?
User Avatar
205
views
0 answers
0 votes
regarding previous years gate question
how many years of previous year gate question i have to solve for gate??like 10 years ,20 years.........?
User Avatar
315
views
1 answers
1 votes
made easy test series
Consider the following Problems:P1:{<M,x,k> | M is a TM and M does not halt on x within k steps.}P2:{<M> | M is a TM and M accepts atleast two ... is less than 100,on which M halts}The number of problems which is RE but not REC is _______
User Avatar
566
views
1 answers
1 votes
geeks for geeks
In a bunch of 13 T-shirts only one is of Medium size, which is correct fit for the searching person. Each time wrong size is picked, the person throws it ... is the probability that the correct size T-shirt can be searched in 8th attempt ?
User Avatar
996
views
0 answers
1 votes
Number of tables needed to represent ER-diagram are _____ .
Consider the following ER diagram,the minimum number of tables needed to represent ER-diagram are-:I think the answer should be $4$.I knw that it is ... -test-series?show=74563#q74563 but the solution is not clear to me .Please help.
User Avatar
Page: