Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by viral8702
0
votes
1
answer
1
self doubt
In fragmentation, if any fragment gets lost then in which case whole packet will be sent again? and in which case only that fragment will be sent again?
In fragmentation, if any fragment gets lostthen in which case whole packet will be sent again?and in which case only that fragment will be sent again?
227
views
asked
Dec 2, 2023
Computer Networks
self-doubt
computer-networks
ip-packet
fragmentation
+
–
0
votes
2
answers
2
Self Doubt
The Total Combinations Possible of Min heap with 8 Distinct elements are ?
The Total Combinations Possible of Min heap with 8 Distinct elements are ?
287
views
asked
Sep 21, 2023
Programming in C
binary-heap
combinatory
data
data-structures
+
–
1
votes
2
answers
3
test series
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } } What will be the time complexity of the above code?
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } }What will be the time complexity of the above code?
474
views
asked
Sep 1, 2023
Algorithms
zeal
algorithms
time-complexity
asymptotic-notation
+
–
0
votes
1
answer
4
Self Doubt
I have a doubt on simple Queue Implementation by an array Assume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last element If we dequeue the element then front's element will get deleted, Now do we have to ... space is empty) I am not talking about circular queue concept,I am just talking about simple queue implementation using array(Not circular).
I have a doubt on simple Queue Implementation by an arrayAssume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last elementIf we dequ...
324
views
asked
Jul 22, 2023
DS
queue
self-doubt
data-structures
+
–
0
votes
1
answer
5
made easy test series
When a process create a child, which of the following is/are correct possibility/situation? A) Parent process can execute parallely with children. B) Parent process can wait until some or all of its children have terminated. C)Child process can only be the duplicate of parent process. D) Child process can only loaded with program other than parent program.
When a process create a child, which of the following is/are correct possibility/situation?A) Parent process can execute parallely with children.B) Parent process can wai...
966
views
asked
Oct 12, 2022
Operating System
made-easy-test-series
fork-system-call
+
–
3
votes
1
answer
6
Made easy test series
Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are possible for a process P with more than one user-level threads in above system? A)P is in running ... than one threads of P are in running state. D)P is in ready state and a thread of P is in running state. .
Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are po...
585
views
asked
Oct 12, 2022
Operating System
made-easy-test-series
operating-system
process-and-threads
+
–
3
votes
3
answers
7
unacademy combat
what will be time complexity of this program? void function(int n) { int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } } } }
what will be time complexity of this program?void function(int n){ int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { ...
1.4k
views
asked
Sep 26, 2022
Algorithms
algorithms
time-complexity
unacademy-combat
+
–
1
votes
0
answers
8
unacademy test series
In a car race, Car X beats Car Y by $45$ km, Car Y beats Car Z by $50$ km, and Car X beats Car Z by $90$ km. The distance (in m) over which the race has been conducted is: 550000 475000 500000 450000
In a car race, Car X beats Car Y by $45$ km, Car Y beats Car Z by $50$ km, and Car X beats Car Z by $90$ km. The distance (in m) over which the race has been conducted is...
854
views
asked
Aug 17, 2022
Quantitative Aptitude
quantitative-aptitude
speed-time-distance
test-series
+
–
1
votes
2
answers
9
unacademy test series
A shopkeeper claims to sell rice at cost price. He uses a false weight with the intention of selling rice at 20% profit. After selling rice to the customer, he realises that the customer has paid 15% less than what he should have paid. What is the actual profit percentage made by the shopkeeper? a)2%gain b)12%gain c)4% gain d)5% gain
A shopkeeper claims to sell rice at cost price. He uses a false weight with the intention of selling rice at 20% profit. After selling rice to the customer, he realises t...
1.0k
views
asked
Aug 17, 2022
Quantitative Aptitude
general-aptitude
quantitative-aptitude
profit-loss
test-series
+
–
0
votes
1
answer
10
A frame buffer array is addressed in row major order for a monitor with pixel locations starting from (0,0) and ending with (100,100). What is address of the pixel(6,10)? Assume one bit storage per pixel and starting pixel location is at 0. 1) 1016 2)1006 3) 610 4)616
A frame buffer array is addressed in row major order for a monitor with pixel locations starting from (0,0) and ending with (100,100). What is address of the pixel(6,10)?...
492
views
asked
Apr 29, 2022
Programming in C
data-structures
array
+
–
0
votes
2
answers
11
oswal general aptitude
find the last digit of (100008)^12500?
find the last digit of (100008)^12500?
984
views
asked
Jan 2, 2022
Quantitative Aptitude
quantitative-aptitude
general-aptitude
discrete-mathematics
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register