Register
Filter

Recent questions without an upvoted answer

0 votes
1 answer
19801
more than n/2
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is Θ(n) Θ(logn) Θ(log∗n) Θ(1) isnt O(1) enough for this.....the answer give in this site is log N can i get a counter on why O(1) wont work ?
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers isΘ(n)Θ(logn)Θ(log∗n)Θ(1)isnt O(1)...
User Avatar
0 votes
0 answers
19802
dlda Q
Number of 3*8 Decoders required to construct a 9×29 Decoder having 3 levels.
Number of 3*8 Decoders required to construct a 9×29 Decoder having 3 levels.
User Avatar
0 votes
1 answer
19803
Connection in TCP
TCP send an SYN=1 and an ACK=1 for data transfer . After data has transferred TCP client want to close the connection sending FIN. So, for closing the connection, what TCP server will send? 1)ACK 2)FIN-1 3)FIN-2 4)None of these
TCP send an SYN=1 and an ACK=1 for data transfer . After data has transferred TCP client want to close the connection sending FIN. So, for closing the connection, what TC...
User Avatar
0 votes
1 answer
19807
Memory Access
In Numerical answer type questions, when we have to consider simultaneous memory access and when we have to use hierarchical memory access model? How to know it?
In Numerical answer type questions, when we have to consider simultaneous memory access and when we have to use hierarchical memory access model? How to know it?
User Avatar
0 votes
0 answers
19813
Tuple relational calculus
What does the following tuple relational calculus query produce? • Student (Student_name, street, city) • Score (Student_name, Branch_name, marks) • Branch (Branch_name, HOD) • Manages (Student_name, Faculty_name)
What does the following tuple relational calculus query produce?• Student (Student_name, street, city)• Score (Student_name, Branch_name, marks)• Branch (Branch_nam...
User Avatar
0 votes
0 answers
19814
Tuple relational calculus
Student (Student_name, street, city) • Score (Student_name, Branch_name, marks) • Branch (Branch_name, HOD) • Manages (Student_name, Faculty_name) What does the following tuple relational calculus query produce?
Student (Student_name, street, city)• Score (Student_name, Branch_name, marks)• Branch (Branch_name, HOD)• Manages (Student_name, Faculty_name)What does the followi...
User Avatar
0 votes
0 answers
19815
Coefficient of variation . Is it included in syllabus?
User Avatar
0 votes
0 answers
19816
gate question
Consider a carry look ahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
Consider a carry look ahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
User Avatar
3 votes
1 answer
19817
Buffer sizes of error and flow control protocol
Is it true? The correct order of buffer sizes in stop and wait, GBN and SR is: (STOP and Wait) < GBN < (selective repeat)
Is it true?The correct order of buffer sizes in stop and wait, GBN and SR is: (STOP and Wait) < GBN < (selective repeat)
User Avatar
0 votes
1 answer
19818
Nielit
Deadlock does not occurs with single resource why? Is Single resource can't be in shareable mode?
Deadlock does not occurs with single resource why?Is Single resource can't be in shareable mode?
User Avatar
0 votes
1 answer
19819
equivalence class
Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is __________.
Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is __________.
User Avatar
1 votes
1 answer
19820
graph Theory
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j):1<=i<=12,1<=j<=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 and |b-d|<=1. The number of edges in this graph is __________.
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j):1<=i<=12,1<=j<=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 ...
User Avatar
0 votes
1 answer
19821
Which of the following is true?
1)S1 is regular but not S2 2)S2 is regular but not S1 3)S1 and S2 are not regular 4)S1 and S2 are regular
1)S1 is regular but not S22)S2 is regular but not S13)S1 and S2 are not regular4)S1 and S2 are regular
User Avatar
1 votes
2 answers
19823
Interrupts
In case of Vectored interrupts,the I/o device send the vector address along with the I/o request or does it sends after it receives ack/INTA from CPU?
In case of Vectored interrupts,the I/o device send the vector address along with the I/o request or does it sends after it receives ack/INTA from CPU?
User Avatar
0 votes
2 answers
19825
Discreet maths set
Set of Natural number contain 0 or no ?
Set of Natural number contain 0 or no ?
User Avatar
0 votes
1 answer
19828
Lalr1 parsing
Consider the below given grammar: S→(A S→B] S→C) A→B) A→C] B→D C→D D→ϵ The number of states in LALR(1) canonical item set are _______ and number of inadequate states (if any) in LALR(1) canonical item set is/are ____________respectively.
Consider the below given grammar: S→(A S→B] S→C) A→B) A→C] B→D C→D D→ϵ The number of states in LALR(1) canonical item set are _______ and number of inade...
User Avatar
0 votes
0 answers
19829
slotted aloha
6000 stations are competing for use of single slotted aloha channel. The average station makes 30 requests/hr ,where each request is for 500 us(micro sec) duration. calculate normalized total traffic on channel
6000 stations are competing for use of single slotted aloha channel. The average station makes 30 requests/hr ,where each request is for 500 us(micro sec) duration. calcu...
User Avatar
0 votes
0 answers
19830
internet
consider the packet size 1400 B is passed through a network having mtu 620B(including header) header size is 20B.what will be the packet size in last fragment (in Byte) a)1440 b)1444 c)1436 d)1428
consider the packet size 1400 B is passed through a network having mtu 620B(including header) header size is 20B.what will be the packet size in last fragment (in Byte)...
User Avatar
Page: