Register
Filter

Recent questions without an upvoted answer

0 votes
0 answers
10441
ME Test Series
A 255.255.255.0 B 255.255.255.254 C 255.255.254.255 D 255.255.254.192
A 255.255.255.0B 255.255.255.254C 255.255.254.255D 255.255.254.192
User Avatar
0 votes
1 answer
10443
made easy
Please some one help me in this question
Please some one help me in this question
User Avatar
0 votes
0 answers
10444
#ambigous
if grammar have two different RMDT(right most derivation tree) for a string then grammar is ambigous or not ?
if grammar have two different RMDT(right most derivation tree) for a string then grammar is ambigous or not ?
User Avatar
0 votes
0 answers
10445
IEEE802.3 size
Which of the following are not true in IEEE 802.3? S1 : The maximum frame size that is supported by IEEE 802.3 is 1500 bytes S2 : The maximum payload that is supported by IEEE 802.3 is 1518 bytes S3 : Minimum frame size and payload size are 46 and 64 bytes respectively.
Which of the following are not true in IEEE 802.3?S1 : The maximum frame size that is supported by IEEE 802.3 is 1500 bytesS2 : The maximum payload that is supported by I...
User Avatar
0 votes
0 answers
10446
toc - self doubt
Is subset of regular language is always recursively enumerable language?
Is subset of regular language is always recursively enumerable language?
User Avatar
0 votes
0 answers
10447
B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
User Avatar
0 votes
0 answers
10448
Os scheduling
In scheduling algorithms if context switching time is given, do we also have to take into account context switching prior to the first process. In some questions i have seen it is considered, in some it's not. What should be our approach if the question comes in numerical answer type??
In scheduling algorithms if context switching time is given, do we also have to take into account context switching prior to the first process. In some questions i have s...
User Avatar
1 votes
0 answers
10450
Computer networks GBN
Consider 2 hosts are linked by 4Mbps channel with prob time 0.02sec.If size of each packet is 2000bits what is min window size of Gbn and Sr in order to allow sender to continuously send packet without any waiting Im getting 81.In answer only 80 is there.The window size is 1+2a right?
Consider 2 hosts are linked by 4Mbps channel with prob time 0.02sec.If size of each packet is 2000bits what is min window size of Gbn and Sr in order to allow sender to ...
User Avatar
0 votes
0 answers
10451
MadeEasy Test Series: Databases - Sql
I got why query 2 is wrong. How do I approach to understand Query 1, is there a generic approach for solving questions like these which have no tables given?
I got why query 2 is wrong. How do I approach to understand Query 1, is there a generic approach for solving questions like these which have no tables given?
User Avatar
0 votes
1 answer
10452
Integration
How to solve it?
How to solve it?
User Avatar
0 votes
0 answers
10453
self doubt
The number of possible ordered Tree with 3 nodes A, B , C 16 b) 6 c) 12 d) 10
The number of possible ordered Tree with 3 nodes A, B , C 16 b) 6 c) 12 d) 10
User Avatar
0 votes
1 answer
10456
Natural Join
Suppose we have 2 tables R1(ABCD), R2(DE) . R1 has 500 entries whereas R2 has 1500 entries. Here D is a candidate key. If we join them using natural join. How many entires would be there in the resultant table and why ? Examples would be appreciated..
Suppose we have 2 tables R1(ABCD), R2(DE) . R1 has 500 entries whereas R2 has 1500 entries. Here D is a candidate key. If we join them using natural join. How many entire...
User Avatar
0 votes
0 answers
10457
SELF DOUBT
CONSIDER A WOSET (WELL ORDERED SET) (Z+ * Z+ ,<=) WHICH IS DEFINED AS POSET + COMPARABILITY + LEAST ELEMENT WHAT IS THE LEAST ELEMENT?
CONSIDER A WOSET (WELL ORDERED SET) (Z+ * Z+ ,<=) WHICH IS DEFINED AS POSET + COMPARABILITY + LEAST ELEMENTWHAT IS THE LEAST ELEMENT?
User Avatar
0 votes
1 answer
10458
Context free languages
{x w c w1, where x,w belong to {a,b}* and w1 is reverse of w} The language given is deterministic context-free language or non-deterministic context-free language?
{x w c w1, where x,w belong to {a,b}* and w1 is reverse of w} The language given is deterministic context-free language or non-deterministic context-free language?
User Avatar
0 votes
0 answers
10459
PRE-ORDER, POST-ORDER IN-ORDER
Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong….
Acc. to (question) my solution is...uniquely constructed binary tree PRE+POST and IN+POST…where i am wrong….
User Avatar
0 votes
0 answers
10461
Merge Sort
Can anyone help me to understand this problem….??
Can anyone help me to understand this problem….??
User Avatar
0 votes
0 answers
10462
TOC(Undecidability)
L1 = { <M> | M halts on $\epsilon$ } L2 = { <M> | $\epsilon$ $\in$ L(M) } Which one is RE or not RE
L1 = { <M | M halts on $\epsilon$ }L2 = { <M | $\epsilon$ $\in$ L(M) }Which one is RE or not RE
User Avatar
0 votes
0 answers
10463
Self Doubt
Is ExOr is Self dual? Self dual 1. No of minterns = No of maxterm 2 The function does not contain two mutually exclusive terms. ExOr full fill these two conditions So is it self dual or not
Is ExOr is Self dual?Self dual1. No of minterns = No of maxterm2 The function does not contain two mutually exclusive terms.ExOr full fill these two conditionsSo is it se...
User Avatar
0 votes
0 answers
10464
ME Testseries
User Avatar
0 votes
0 answers
10465
No of subsequence
I understand that number of subsequences for a string of length n is 2^n when we don’t have any repetition. What is the number of “unique” subsequence when we have repetitions. As in the string : aabbbccddd
I understand that number of subsequences for a string of length n is 2^n when we don’t have any repetition.What is the number of “unique” subsequence when we have r...
User Avatar
0 votes
0 answers
10466
Self Doubt
Which of the following parser resolves the shift over reduce conflict ??
Which of the following parser resolves the shift over reduce conflict ??
User Avatar
0 votes
0 answers
10467
General
What is the difference between wheel and cycle in GRAPH THEORY
What is the difference between wheel and cycle in GRAPH THEORY
User Avatar
0 votes
0 answers
10468
Processes and threads
User Avatar
0 votes
0 answers
10470
Graph_Self Doubt
Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28
Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28
User Avatar
Page: