Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
ramakrushna
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ramakrushna
2
answers
1
ACE Test Series
A ) B ) C ) D )
A ) B ) C ) D )
757
views
commented
Jan 27, 2022
DS
data-structures
binary-heap
ace-test-series
+
–
1
answer
2
Applied Test Series: CN
Which of the following options is/are false? If the maximum value sequence number in the GBN is n, then the maximum sender window is n-1. The size of fragments in IPv4 packet fragmentation payload is always divisible by 8 except the last fragment. DF bit is ... IPV4 packet is different. They have provided the ans as 1, 3 and 4. Can someone explain me how option 3 is false?
Which of the following options is/are false?If the maximum value sequence number in the GBN is n, then the maximum sender window is n-1.The size of fragments in IPv4 pack...
353
views
commented
Jan 26, 2022
Computer Networks
test-series
computer-networks
+
–
1
answer
3
GeeksForGeeks AIM 2 - computer networks
Consider a message with 60000 bits long, that is to be sent from a source to a destination, there are two routers between source to destination. Each of link in the path has bandwidth 1 Mbps, each packet is 1000 bit long, total time taken (in msec) to reach the last bit to the destination, propagation delay is 10 msec ________.
Consider a message with 60000 bits long, that is to be sent from a source to a destination, there are two routers between source to destination. Each of link in the path ...
814
views
answered
Jan 15, 2022
Computer Networks
computer-networks
+
–
2
answers
4
program output - C
Consider the following program int find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; return a; } The value returned by find (9) is ______ .
Consider the following programint find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; ...
662
views
answered
Jan 15, 2022
Programming in C
programming-in-c
output
programming
+
–
0
answers
5
made easy test series - linear algebra
If 2 and -4 are the eigenvalues of a non-singular matrix A and |A| = -8, then the eigenvalues of adj(A) are x and -y. What is the value of x+y?
If 2 and -4 are the eigenvalues of a non-singular matrix A and |A| = -8, then the eigenvalues of adj(A) are x and -y. What is the value of x+y?
397
views
commented
Jan 13, 2022
Linear Algebra
linear-algebra
engineering-mathematics
made-easy-test-series
eigen-value
+
–
3
answers
6
Applied Test Series:
Need help Anyone?
Need help Anyone?
661
views
commented
Jan 13, 2022
CO and Architecture
test-series
operating-system
multilevel-paging
+
–
1
answer
7
Applied Test Series: Live Mock
A 30*30 upper triangular matrix of integers is stored optimally in a 1-D array with starting address of 3000 assume the matrix indexing starts at (1,1) and array indexing starts at 0 what would be the address of element with index (25,25)), ... integer takes up two bytes of memory.___ Need help in this one. Didn't get the solution properly provided by them. Anyone!
A 30*30 upper triangular matrix of integers is stored optimally in a 1-D array with starting address of 3000 assume the matrix indexing starts at (1,1) and array indexin...
717
views
commented
Jan 10, 2022
DS
test-series
data-structures
array
+
–
2
answers
8
#Gate CS Applied Course Mock Test
Is this Language a CFL? If yes, Can you please explain the implementation.
Is this Language a CFL?If yes, Can you please explain the implementation.
580
views
answer edited
Jan 10, 2022
Theory of Computation
theory-of-computation
context-free-language
context-free-grammar
+
–
1
answer
9
Applied Test series: DS
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BST How to tackle this kind of problem. Anyone!
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BSTHow to tackle this kind of problem. Anyone!
1.3k
views
commented
Jan 8, 2022
Programming in C
test-series
data-structures
binary-search-tree
+
–
1
answer
10
Applied Test Series
Consider the following statements S1 and S2 : S1 : The minimal elements of a poset always form an antichain. S2 : The maximal elements of a poset always form an antichain Which of the following is correct? Can someone explain these two with examples? Thank you!
Consider the following statements S1 and S2 : S1 :The minimal elements of a poset always form an antichain. S2 : The maximal elements of a poset always form an antichainW...
600
views
commented
Jan 8, 2022
Set Theory & Algebra
test-series
discrete-mathematics
set-theory
+
–
1
answer
11
Applied Mock Test
Among individuals who have sustained head injuries, x-rays reveal that only about 6% have skull fractures. Nausea is a standard symptom of a skull fracture and occurs in 98% of all skull fracture cases with other types of head injuries, nausea is present ... an individual who has just suffered a head injury is not nauseous. Find the probability that he has a skull fracture _____
Among individuals who have sustained head injuries, x-rays reveal that only about 6% have skull fractures. Nausea is a standard symptom of a skull fracture and occurs in ...
378
views
commented
Jan 4, 2022
Probability
test-series
probability
engineering-mathematics
+
–
1
answer
12
Applied Live Test
Given a byte addressable system which implements demand paging, a TLB has 64 entries and the frame size is 4KB. The LAS is 4MB. TLB has a hit ratio of 90% and has an access time of 2 ns. If the main memory access time is 100 ns and page fault is 5%. The page fault service time is given to be 100 ms. The TLB reach for this system given above is _____ B Anyone can help this.
Given a byte addressable system which implements demand paging, a TLB has 64 entries and the frame size is 4KB. The LAS is 4MB. TLB has a hit ratio of 90% and has an acce...
497
views
asked
Jan 3, 2022
Operating System
test-series
operating-system
demand-paging
translation-lookaside-buffer
+
–
1
answer
13
Test Series: Applied
What is the output of the following c-code? 320 1 64 Compiler Error What should be ans for this one. This program will compiler error right?(invalid operands to binary ) Even i checked in Compiler by running this code. How the ans given by them is 64. Can anyone help me out. Am i missing something.
What is the output of the following c-code?320164Compiler ErrorWhat should be ans for this one. This program will compiler error right?(invalid operands to binary ) Even ...
455
views
commented
Dec 30, 2021
Programming in C
test-series
programming-in-c
output
+
–
1
answer
14
Test Series: ACE (Networking)
Never done any problem in concept called purging in networking. can anyone tell me how to approach this. is this in syllabus?
Never done any problem in concept called purging in networking. can anyone tell me how to approach this. is this in syllabus?
459
views
asked
Dec 28, 2021
Computer Networks
ace-test-series
computer-networks
csma-cd
+
–
0
answers
15
Test Series: COA
I need help in this one.
I need help in this one.
476
views
asked
Dec 28, 2021
CO and Architecture
test-series
ace-test-series
co-and-architecture
+
–
2
answers
16
Applied Test series: C-programming
I know the answer but need a good explanation for this question. Can anyone help. Thanks!
I know the answer but need a good explanation for this question. Can anyone help. Thanks!
501
views
commented
Dec 26, 2021
Programming in C
test-series
programming-in-c
operators
+
–
0
answers
17
Testbook Test Series
316
views
commented
Dec 26, 2021
Programming in C
testbook-test-series
+
–
0
answers
18
Test series question(Aceacademy)
Can someone explain it to me as to why in selective repeat it's not possible for an acknowledgment to come for a packet that falls outside the current window? Because it may be possible that there is some delayed acknowledgment. It's ... I feel is not possible because here we are talking about cumulative ack not independent. So how is this reason valid?
Can someone explain it to me as to why in selective repeat it's not possible for an acknowledgment to come for a packet that falls outside the current window? Because it ...
467
views
comment edited
Dec 26, 2021
Computer Networks
computer-networks
flow-control-methods
selective-repeat
+
–
2
answers
19
Applied Test Series: Mock
Consider the following schedule S: S: R3(A), W2(A), R1(A), W3(A), W1(A); The possible number of view serializable schedules of the schedule S (other than S) are _____ Can someone help me in this.
Consider the following schedule S:S: R3(A), W2(A), R1(A), W3(A), W1(A);The possible number of view serializable schedules of the schedule S (other than S) are _____Can so...
449
views
commented
Dec 25, 2021
Databases
databases
view-serializable
virtual-gate-test-series
+
–
3
answers
20
ACE Test Series:C-program
What should be the ans. Isn’t the Function initialization should be outside main function? They are given inside main. If declaration would be outside main then ans should be C else i don’t think options are correct here. Anyone ?
What should be the ans. Isn’t the Function initialization should be outside main function? They are given inside main. If declaration would be outside main then ans sho...
695
views
commented
Dec 25, 2021
Programming in C
programming-in-c
ace-test-series
output
programming
+
–
1
answer
21
Live Test Series Live: Applied
We are given a hard disk of 500 GB. The performance details are : 5000 RPM rotation rate 200 cylinders, numbered from 1 to 200 Takes 1 + (n/20) milliseconds to move heads across n cylinders (e.g., from i to i + n). A ... the head travels half the cylinders and half a revolution. The average time taken to read a 1MB block from the hard disk is__? Need help.
We are given a hard disk of 500 GB. The performance details are :• 5000 RPM rotation rate• 200 cylinders, numbered from 1 to 200• Takes 1 + (n/20) milliseconds to m...
774
views
commented
Dec 25, 2021
CO and Architecture
test-series
operating-system
disk-scheduling
disk
+
–
1
answer
22
Applied Test Series: Knapsack Problem
The following table givens the frequency of 4 letters in a database of text If Huffman encoding is used to encode the word “aaabca” the number of bits required for it is given by ______. Need help!
The following table givens the frequency of 4 letters in a database of textIf Huffman encoding is used to encode the word “aaabca” the number of bits required for it ...
521
views
answer selected
Dec 25, 2021
Operating System
test-series
knapsack-problem
algorithms
+
–
1
answer
23
Test Series: ACE
How to approach this one?
How to approach this one?
410
views
commented
Dec 23, 2021
CO and Architecture
ace-test-series
co-and-architecture
test-series
pipelining
+
–
1
answer
24
ACE Test series
Need help!
Need help!
242
views
asked
Dec 23, 2021
Computer Networks
ace-test-series
computer-networks
osi-protocol
+
–
1
answer
25
Made Easy test series
int a = 50, b = 50; a = a+++++b; b = b+++++a; Value of b after executing these . I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify it please.
int a = 50, b = 50;a = a+++++b;b = b+++++a; Value of b after executing these .I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify ...
565
views
commented
Dec 23, 2021
Programming in C
made-easy-test-series
programming-in-c
bad-question
+
–
1
answer
26
Applied Test Series
Suppose a router receives an IP packet containing 600 data bytes and has to forward the packet to a network with a maximum transmission unit of 200 bytes. Assume that the IP header is 20 bytes long. What will be the fragment offset of the third fragment ?
Suppose a router receives an IP packet containing 600 data bytes and has to forward the packet to a network with a maximum transmission unit of 200 bytes. Assume that the...
650
views
commented
Dec 22, 2021
Computer Networks
computer-networks
network-layer
test-series
fragmentation
+
–
2
answers
27
Geeksforgeeks mock - 2022
Consider the following C program: #include <stdio.h> #include <stdlib.h> #include <unistd.h> int main (void) { pid_t pid; int x = 2; pid = fork ( ); if (pid = = 0); x = 8; fork( ); printf("%d", x); return 0; } Fork ( ) is a system call creates new ... the program is executed on the unix OS?[MSQ] (a) 8 2 2 8 (b) 8 8 2 2 (c) 2 8 8 2 (d) 2 2 8 8
Consider the following C program:#include <stdio.h #include <stdlib.h #include <unistd.h int main (void) { pid_t pid; int x = 2; pid = fork ( ); if (pid = = 0); ...
1.3k
views
commented
Dec 21, 2021
Operating System
operating-system
multiple-selects
fork-system-call
+
–
1
answer
28
Test Series- Applied:
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ I answered it as 3. Because it asked for maximum which is not correct. Can someone help me in this.
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a ...
386
views
asked
Dec 20, 2021
Operating System
operating-system
test-series
deadlock-prevention-avoidance-detection
+
–
2
answers
29
Operation system Applied test series 2022
If the P() and V() semaphore operations are not executed atomically, then which of the following are always correct? Mutual exclusion satisfied Progress is not satisfied Bounded waiting is not satisfied None of the above Can anyone help me in this A should not be the ans as there is no restriction on atomicity. What about b and c.
If the P() and V() semaphore operations are not executed atomically, then which of the following are always correct?Mutual exclusion satisfied Progress is not satisfiedBo...
723
views
commented
Dec 19, 2021
Operating System
test-series
operating-system
semaphore
mutual-exclusion
+
–
1
answer
30
Testbook test Series
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 consecutive b’s, overlapping permitted}
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 co...
2.2k
views
commented
Dec 18, 2021
Theory of Computation
testbook-test-series
number-of-dfa
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register