Register
Filter

Answers by Bikram

2 votes
121
doubt
a)why base address of array can not be change but string constant base address can be change??? b)why content of array can be change but string constant content can not be change???? need proper explanation with example,,,,
a)why base address of array can not be change but string constant base address can be change???b)why content of array can be change but string constant content can not be...
8 votes
123
DData Link Layer
If the probability of frame being lost is P. Then, calculate the mean no. of transmission for the frame to make it success.
If the probability of frame being lost is P. Then, calculate the mean no. of transmission for the frame to make it success.
2 votes
124
BASIC
I am very much confused in between 1MBps and 1MB when we talk in 1MBps then we are taking 1MBps=10^6 byte and some time in MB we take 2^20byte so please can anyone help me out from this when to select which one I am very much confused!!!
I am very much confused in between 1MBps and 1MB when we talk in 1MBps then we are taking 1MBps=10^6 byteand some timein MB we take 2^20byte so please can anyone help me...
1 votes
125
dependency preserving
if given depedencies are A->B C->B then how can we prove that these dependency will logically imply AC->B ?
if given depedencies are A->BC->Bthen how can we prove that these dependency will logically imply AC->B ?
4 votes
126
Cache Memory
Should we have to include tag directory size in cache size or not ?
Should we have to include tag directory size in cache size or not ?
1 votes
127
computer network
Assume that there are k stations transmitting in an ethernet network using CSMA/CD. Probability that station requires the ethernet in the contention slot with probability P is : A = KP(1-P)^k-1 what is the maximum value of A A) 1/e B) 1/ 2e C) 1/4e D) 0.125e
Assume that there are k stations transmitting in an ethernet network using CSMA/CD. Probability that station requires the ethernet in the contention slot with probability...
0 votes
128
channel utilization
0 votes
130
#MemoryManagement
suppose we have a memory system with 32 bit virtual addresses and 4KB pages.If the 20 level paging is used and the memory required to store all the page tables if page table entry size is 4bytes is 2^a(2^b-1)bytes then a*b is
suppose we have a memory system with 32 bit virtual addresses and 4KB pages.If the 20 level paging is used and the memory required to store all the page tables if page ta...
0 votes
132
Aptitude:- Blood Relations
Q: Pointing to a photograph, Vipul said, "She is the daughter of my grandfather's only son." How is Vipul related to the girl in the photograph ? A) Father B) Brother C) Cousin D) Data inadequate
Q: Pointing to a photograph, Vipul said, "She is the daughter of my grandfather's only son." How is Vipul related to the girl in the photograph ?A) FatherB) BrotherC) Cou...
2 votes
133
Digital electronics : Essential prime implicant
Is it Right . This is Tha case PI and EPI with don't care
Is it Right .This is Tha case PI and EPI with don't care
2 votes
137
Encoding manchester and differential manchester
Please provide manchester and differential manchester encoding of the following signal
Please provide manchester and differential manchester encoding of the following signal
0 votes
138
Confusion in Differential Manchester Encoding
As I understand from references :- start with positive site but 1 means high to low and 0 means low to high low is 0 and high is 1 and when there is found of 0 inverse the next bits. is it right?
As I understand from references :-start with positive sitebut 1 means high to lowand 0 means low to high low is 0 and high is 1and when there is found of 0 inverse the ...
3 votes
139
Relations: Doubt About Composites (Conceptual)
If R is any relation: is Rno R (composite of Rn and R) the same as R o Rn?
If R is any relation:is Rno R (composite of Rn and R) the same as R o Rn?
1 votes
140
question
in 2 variable function how many minterms are there ???
in 2 variable function how many minterms are there ???
1 votes
141
is D36 distributive ?
In one text I read that , if n is square free it is DISTRIBUTIVE in other text I read that if n is square free it is BOOLEAN ALGEBRA . Which is most correct ? Here D36 is not square free then... what conclusion can I make ?
In one text I read that , if n is square free it is DISTRIBUTIVEin other text I read that if n is square free it is BOOLEAN ALGEBRA .Which is most correct ?Here D36 is n...
5 votes
143
deadlocks
is it possibe to have a deadlock involving only a single process?? explain??
is it possibe to have a deadlock involving only a single process?? explain??
4 votes
145
Operating Systems concepts(Galvin)
Hello I am reading chapters from Galvin and attempting its back exercises. However, there is nothing to compare my answers to, I mean there are no answers given anywhere. Do you guys have any idea of any answer key thank you
HelloI am reading chapters from Galvin and attempting its back exercises.However, there is nothing to compare my answers to, I mean there are no answers given anywhere.Do...
2 votes
146
Test by Bikram | Data Structures | Test 2 | Question: 27
Which one of the following is the tightest upper bound that represents the time complexity of inserting an element into a binary search tree of n nodes? O(1) O(n log n) O(n) O(log n)
Which one of the following is the tightest upper bound that represents the time complexity of inserting an element into a binary search tree of n nodes?O(1)O(n log n)O(n)...
58 votes
147
GATE CSE 1995 | Question: 1.15
Which scheduling policy is most suitable for a time shared operating system? Shortest Job First Round Robin First Come First Serve Elevator
Which scheduling policy is most suitable for a time shared operating system?Shortest Job FirstRound RobinFirst Come First ServeElevator
Page: