Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Hemanth_13
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Hemanth_13
1
votes
1
ME Test Series
241
views
answered
Dec 28, 2018
1
votes
2
Automata
https://gateoverflow.in/?qa=blob&qa_blobid=5795855353278664308
https://gateoverflow.in/?qa=blob&qa_blobid=5795855353278664308
515
views
answered
Dec 18, 2018
2
votes
3
AAI JE (IT) 2019 Q-30
Can someone solve this and tell how it’s 160.
Can someone solve this and tell how it’s 160.
275
views
answered
Dec 12, 2018
3
votes
4
MadeEasy Subject Test 2019: Computer Networks - Flow Control Methods
consider a network connecting two nodes A and B having a propagation delay of 6*10^-4 micro sec.bandwidth of network is 150 Mbps if each frame size is 5000 bytes and both uses go back n sliding window protocal, where maximum 100 frames can be sent at a time then the maximum possible data rate is ----- [ mbps]
consider a network connecting two nodes A and B having a propagation delay of 6*10^-4 micro sec.bandwidth of network is 150 Mbps if each frame size is 5000 bytes and both...
1.7k
views
answered
Dec 10, 2018
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
sliding-window
+
–
10
votes
5
TIFR CSE 2019 | Part B | Question: 6
Given the following pseudocode for function $\text{printx()}$ below, how many times is $x$ printed if we execute $\text{printx(5)}?$ void printx(int n) { if(n==0){ printf(“x”); } for(int i=0;i<=n-1;++i){ printx(n-1); } } $625$ $256$ $120$ $24$ $5$
Given the following pseudocode for function $\text{printx()}$ below, how many times is $x$ printed if we execute $\text{printx(5)}?$void printx(int n) { if(n==0){ printf...
2.4k
views
answered
Dec 9, 2018
Programming in C
tifr2019
programming
programming-in-c
+
–
0
votes
6
GATEBOOK_CN_20
Let M be a confidential email that Alice wants to send to Bob, $K_B$ be Bob's encryption public key, and $K_A^{-1}$ be Alice's private key for signing. Which of the following options would be the best choice for protecting confidential ... message, Alice should sign the encrypted message and then should send this signature along with the encrypted message to BOB. Please help.
Let M be a confidential email that Alice wants to send to Bob, $K_B$ be Bob’s encryption public key, and $K_A^{-1}$ be Alice’s private key for signing. Which of the...
1.9k
views
answered
Nov 27, 2018
Computer Networks
network-security
computer-networks
+
–
1
votes
7
Zeal test descrete math
I solved it by taking matrix ,I am confused in commutative
I solved it by taking matrix ,I am confused in commutative
534
views
answered
Nov 17, 2018
Set Theory & Algebra
zeal
test-series
+
–
2
votes
8
Shortest Job First
464
views
answered
Nov 15, 2018
Digital Logic
operating-system
test-series
+
–
–1
votes
9
DS Made easy
659
views
answered
Nov 15, 2018
1
votes
10
ACE: sql Dbms
553
views
answered
Nov 14, 2018
Databases
sql
+
–
1
votes
11
Calculus - Limits
Answer is 1 but where it is going wrong the way I solved in following image.
Answer is 1 but where it is going wrong the way I solved in following image.
907
views
answered
Nov 13, 2018
0
votes
12
Gateforum Test Series: Digital Logic - Adder
573
views
answered
Nov 6, 2018
Digital Logic
gateforum-test-series
digital-logic
adder
+
–
1
votes
13
GeeksforGeeks
If Direct Broadcast Address of subnet is 201.15.16.31. Which of the following will be subnet mask ? (A) 255.255.255.240 (B) 255.255.255.192 (C) 255.255.255.198 (D) None Of the Above
If Direct Broadcast Address of subnet is 201.15.16.31. Which of the following will be subnet mask ?(A) 255.255.255.240(B) 255.255.255.192(C) 255.255.255.198(D) None Of th...
471
views
answered
Nov 2, 2018
0
votes
14
Self Doubt regarding C-SCAN
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk access requests for cylinders 30, 85, 110, 100, 105, 126, 135, 55 and ... the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is ________. Please also mention the method of C-SCAN.
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk acce...
4.1k
views
answered
Oct 26, 2018
Operating System
operating-system
disk-scheduling
+
–
2
votes
15
MadeEasy Test Series: CO & Architecture - Instruction Format
How will this question be solved?
How will this question be solved?
930
views
answered
Oct 24, 2018
CO and Architecture
co-and-architecture
instruction-format
made-easy-test-series
numerical-answers
+
–
1
votes
16
Directions
315
views
answered
Oct 24, 2018
0
votes
17
which one is right. Also pleasse explain in few words.
. Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? Insertion at the front of the linked list Insertion at ... linked list (a) I and II (b) I and III (c) I, II, III and IV (d) None
. Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the followin...
5.8k
views
answered
Oct 22, 2018
0
votes
18
made easy
Assume that we have a demand paged memory.The page table is held in registers.It takes 8 milliseconds to service a page fault if an empty page is available or the replaced page is not modified, and 20 milliseconds if the replaced page is modified.Memory access time is 100ns.Assume that the page to ... time of no more than 200ns ? a) 6.1*10^-6 b)7.3*10^-6 c)3.4*10^-4 d)None of these
Assume that we have a demand paged memory.The page table is held in registers.It takes 8 milliseconds to service a page fault if an empty page is available or the replace...
389
views
answered
Oct 20, 2018
0
votes
19
Programming
Void Test (int arr[], int s, int e) { int temp; if(s >= e) return; temp = arr[s+1]; arr[s+1] = arr[e]; arr[e] = temp; Test(arr, s+1, e - 1) }
Void Test (int arr[], int s, int e) { int temp; if(s >= e) return; temp = arr[s+1]; arr[s+1] = arr[e]; arr[e] = temp; Test(arr, s+1, e - 1) }
530
views
answered
Oct 19, 2018
Programming in C
programming-in-c
+
–
0
votes
20
made easy
Consider a paged virtual memory management system having 32-bit virtual addresses with page size 1KB.Each page table entry requires 32 bits.it is desired to limit the page table size to one page.if Suresh uses smaller page size at the first level of the page table heirarchy,then the number of pages needed are._______
Consider a paged virtual memory management system having 32-bit virtual addresses with page size 1KB.Each page table entry requires 32 bits.it is desired to limit the pag...
474
views
answered
Oct 19, 2018
1
votes
21
Set associative mapping
What is the number of multiplexers required in set associative mapping hardware ? Given set bits are S, tag bits are T and word bits are W.
What is the number of multiplexers required in set associative mapping hardware ? Given set bits are S, tag bits are T and word bits are W.
661
views
answered
Oct 19, 2018
CO and Architecture
co-and-architecture
cache-memory
multiplexer
+
–
0
votes
22
made easy test series
Answer given is 4.
Answer given is 4.
357
views
answered
Oct 19, 2018
Compiler Design
compiler-design
grammar
context-free-grammar
parsing
numerical-answers
made-easy-test-series
+
–
1
votes
23
Theory of Computation
$L1= \left \{ a^m b^n c^n d^m | m \neq n \right \}$ $L2= \left \{a^i b^j c^k | (i<=j)or (j<=i), j=k \right \}$ $L3= \left \{a^i b^j c^k| i=j, j<k \right \}$ The number of the above languages that are context free are ?
$L1= \left \{ a^m b^n c^n d^m | m \neq n \right \}$$L2= \left \{a^i b^j c^k | (i<=j)or (j<=i), j=k \right \}$$L3= \left \{a^i b^j c^k| i=j, j<k \right \}$The number ...
800
views
answered
Oct 18, 2018
Theory of Computation
context-free-language
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register