Register
Filter

Questions by Overflow04

0 votes
1 answer
1
Algorithm
Answer ????
Answer ????
0 votes
0 answers
2
Databases
Please explain option c.
Please explain option c.
0 votes
0 answers
3
COA
Which of the following is/are true for a CPU which does not have any stack pointer registers? A Interrupts are not possible. B All subroutine calls and interrupts are possible. C It cannot have nested subroutines call. D It cannot have subroutine call instruction.
Which of the following is/are true for a CPU which does not have any stack pointer registers?A Interrupts are not possible. B All subroutine calls and interrupts are po...
0 votes
1 answer
4
Operating System
In Dining philosopher's problem, there are 8 number of diners and X number of chopsticks. What is the minimum value of X which ensures that therewill be no deadlock Note: Even number philosopher takes left fork first and odd number philosopher takes right fork first.
In Dining philosopher's problem, there are 8 number of diners and X number of chopsticks. What is the minimum value of X which ensures that therewill be no deadlock Note:...
0 votes
1 answer
5
Programming
Someone please explain. Function of ‘^’
Someone please explain. Function of ‘^’
0 votes
1 answer
6
Operating System
When a page is referred for the first time, then it will be counted in page fault or not?. E.g page reference 1,2,3,4,2,1. LRU is used with 3 frames(initially empty).
When a page is referred for the first time, then it will be counted in page fault or not?.E.g page reference 1,2,3,4,2,1.LRU is used with 3 frames(initially empty).
0 votes
1 answer
7
Programming
Why nothing is printed for %c.
Why nothing is printed for %c.
0 votes
1 answer
10
Databases
In Query1, how mid is projected from did.?????????/
In Query1, how mid is projected from did.?????????/
0 votes
0 answers
11
Databases
How to identify many to many relationship. Can R2 be one to one.
How to identify many to many relationship.Can R2 be one to one.
0 votes
0 answers
12
Computer Networks
Number of packets readily available in the buffer are 10. 4 bit sequence number is used. The maximum number of outstanding frames are Answer given is: 10
Number of packets readily available in the buffer are 10.4 bit sequence number is used. The maximum number of outstanding frames areAnswer given is: 10
0 votes
1 answer
13
Computer Networks
Since 8 bit delimeter pattern = 01111110. So whenever 0111111( 6’s ones) is matched we will add one extra bit. But in the solution extra bit is added just after 011111(5’s ones).
Since 8 bit delimeter pattern = 01111110. So whenever 0111111( 6’s ones) is matched we will add one extra bit.But in the solution extra bit is added just after 011111...
1 votes
1 answer
14
Computer Networks
I am getting M1 as correct.
I am getting M1 as correct.
0 votes
0 answers
15
Computer Networks
What is the significance of this line(highlighted part): Node D get this flood packet from nodes C, F,B,E in this order. Other things are clear to me.
What is the significance of this line(highlighted part): Node D get this flood packet from nodes C, F,B,E in this order.Other things are clear to me.
0 votes
1 answer
16
Theory of computation
What does right quotient actually mean????
What does right quotient actually mean????
0 votes
0 answers
17
Theory Of Computation
Clarification on the iv)
Clarification on the iv)
0 votes
1 answer
18
Theory of Computaion
Somebody please explain all the 3 points in detail(Seems to be important for exam)
Somebody please explain all the 3 points in detail(Seems to be important for exam)
0 votes
0 answers
19
Theory of computation
Can finite automata do multiplication.
Can finite automata do multiplication.
1 votes
1 answer
20
Theory of Computation
Number of 3 state DFA with designated initial state can be constructed over the alphabet $\sum$ = {0,1,2} with exactly 2 final states is $3^{8}$ B)$3^{9}$ C) $3^{10}$ D) $3^{11}$ Answer is C
Number of 3 state DFA with designated initial state can be constructed over the alphabet $\sum$ = {0,1,2} with exactly 2 final states is$3^{8}$ B)$3^{9}$ C) $3^{10}$ D...
Page: