Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Tesla!
1
votes
161
Morris Mano exercise
Convert into ASCII code. a)8723
Convert into ASCII code.a)8723
755
views
answered
Aug 4, 2017
1
votes
162
self doubt
the least no that must be subtracted from 1294 so that the remainder when divided by 9 ,11, 13 will leave in each case the same remainder
the least no that must be subtracted from 1294 so that the remainder when divided by 9 ,11, 13 will leave in each case the same remainder
364
views
answered
Aug 3, 2017
3
votes
163
eigen value
505
views
answered
Aug 3, 2017
Mathematical Logic
eigen-value
linear-algebra
engineering-mathematics
+
–
2
votes
164
malloc
why we use malloc to create link list ?
why we use malloc to create link list ?
347
views
answered
Aug 2, 2017
3
votes
165
How to find this coefficient in this question?
Find coeff of x^83 in [x^83].(x^5+x^8+x^11+x^14+x^17)
Find coeff of x^83 in [x^83].(x^5+x^8+x^11+x^14+x^17)
657
views
answered
Aug 1, 2017
Combinatory
combinatory
generating-functions
+
–
1
votes
166
Operating System
371
views
answered
Jul 29, 2017
Operating System
cache-memory
paging
operating-system
+
–
0
votes
167
Process Scheduling
Consider the following table: l Using the shortest remaining time first, find the completion time of a process P2 , if the context switching overhead is 1 unit ?
Consider the following table:lUsing the shortest remaining time first, find the completion time of a process P2 , if the context switching overhead is 1 unit ?
650
views
answered
Jul 29, 2017
1
votes
168
TESTBOOK CO
216
views
answered
Jul 29, 2017
1
votes
169
#Relations
No of relation over set of 4 elements such that (x,y) belongs to S implies (x=y)? Is it asking for reflexive relation?
No of relation over set of 4 elements such that (x,y) belongs to S implies (x=y)?Is it asking for reflexive relation?
199
views
answered
Jul 27, 2017
1
votes
170
#random_question
Set A contains n elements. A largest relation on A which is both Symmetric and Antisymmetric?
Set A contains n elements.A largest relation on A which is both Symmetric and Antisymmetric?
270
views
answered
Jul 27, 2017
6
votes
171
Secondary memory
1.3k
views
answered
Jul 27, 2017
CO and Architecture
disk
co-and-architecture
+
–
0
votes
172
combinatory
let S be the set of natural numbers whose digits are chosen from {1,3,5,7} such that no digits are repeated find 1) |S| 2) $\sum (n)$ where n belongs to s first part i know 64 numbers would be there how to approach 2nd part
let S be the set of natural numbers whose digits are chosen from {1,3,5,7} such that no digits are repeated find1) |S|2) $\sum (n)$ where n belongs to sfirst part i know ...
323
views
answered
Jul 27, 2017
3
votes
173
Secondary memory
Please give proper explanation.
Please give proper explanation.
214
views
answered
Jul 27, 2017
1
votes
174
question
how we will find 1's complement of -4 is it possible to find it
how we will find 1's complement of -4 is it possible to find it
263
views
answered
Jul 26, 2017
1
votes
175
test series question...
Consider a computer having L1- data cache and main memory. The latencies of different kind accesses are as follows; cache hit 1-cycle; cache miss, 105 cycles; main memory access with cache disabled, 100 cycles. When you run a program with an overall miss rate of 5%, what will be the average memory access time(in CPU cycles)
Consider a computer having L1- data cache and main memory. The latencies of different kind accesses are as follows; cache hit 1-cycle; cache miss, 105 cycles; main memory...
485
views
answered
Jul 26, 2017
1
votes
176
Cache memory and array
Find hit and miss ratio for both the questions?
Find hit and miss ratio for both the questions?
813
views
answered
Jul 26, 2017
2
votes
177
algorithm
Consider bottom- up merge sort working on 'n' elements . Assume n is a power of 2. The minimum number of comparisons in order to get sorted list is a) n log n/2 b)n log n-n+1 c)n logn d)n logn +n
Consider bottom- up merge sort working on 'n' elements . Assume n is a power of 2. The minimum number of comparisons in order to get sorted list isa) n log n/2b)n log n-n...
1.7k
views
answered
Jul 25, 2017
Algorithms
algorithms
merge-sort
+
–
2
votes
178
How to calculate turnaround time? (Process Scheduling - Operating System)
A and B are the only two processes in the system. Both are in the ready state. A arrives before B but the difference in arrival time is negligible. A is a CPU bound process while B is a I/O bound process. The ... ; Compute the turnaround time for A and B. Link: http://www.comp.nus.edu.sg/~ooiwt/cs2106/1112s1/tut05.pdf
A and B are the only two processes in the system. Both are in the ready state. A arrives before B but the difference in arrival time is negligible. A is a CPU bound proce...
3.1k
views
answered
Jul 25, 2017
Operating System
operating-system
process-scheduling
+
–
0
votes
179
Numerical ability:- Area of Room
A room is half as long again as it is broad. The cost of carpeting the room at Rs.5 per sq m is Rs.270 and the cost of papering the four walls at Rs.10 per sq m is Rs.1720. If a door and 2 windows occupy 8 sq cm. Find the dimensions of the room?
A room is half as long again as it is broad. The cost of carpeting the room at Rs.5 per sq m is Rs.270 and the cost of papering the four walls at Rs.10 per sq m is Rs.172...
412
views
answered
Jul 23, 2017
Verbal Aptitude
quantitative-aptitude
+
–
4
votes
180
Self-doubt
Can there ever be a TLB hit and a page fault?
Can there ever be a TLB hit and a page fault?
1.4k
views
answered
Jul 23, 2017
Operating System
operating-system
translation-lookaside-buffer
+
–
3
votes
181
GATE Overflow | Digital Logic | Test 1 | Question: 15
The addition of 4 bits two complement binary numbers $1101$ and $0100$ results in 0001 and an overflow 1001 and no overflow 0001 and no overflow 1001 and an overflow
The addition of 4 bits two complement binary numbers $1101$ and $0100$ results in0001 and an overflow1001 and no overflow0001 and no overflow1001 and an overflow
408
views
answered
Jul 22, 2017
Digital Logic
digital-logic
go-digital-logic-1
number-representation
+
–
1
votes
182
GATE Overflow | Digital Logic | Test 1 | Question: 23
Determine the Radix $r$ $(BEE)_r = (2699)_{10}$
Determine the Radix $r$$$(BEE)_r = (2699)_{10}$$
480
views
answered
Jul 22, 2017
Digital Logic
digital-logic
go-digital-logic-1
number-representation
numerical-answers
+
–
1
votes
183
Test Series
339
views
answered
Jul 21, 2017
Digital Logic
decoder
+
–
0
votes
184
C_program_call_by_value
#include<stdio.h> void main() { int a=5; int b=f(a); printf("%d",b); } int f(int x) { x=+5; return x; } Give output with explanation
#include<stdio.h>void main(){ int a=5; int b=f(a); printf("%d",b);}int f(int x){ x=+5; return x;}Give output with explanation
277
views
answered
Jul 21, 2017
3
votes
185
OS PAGING William stallings
Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one page. How many levels of page tables required? Also find the size memory ... solution. I am weak in understanding these concepts. Answer for the first one is 3 and for the second one is 8208 bytes.
Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one ...
9.2k
views
answered
Jul 19, 2017
Operating System
test-series
virtual-memory
operating-system
paging
+
–
124
votes
186
GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $...
13.7k
views
answered
Jul 19, 2017
Operating System
gateit-2005
operating-system
disk
normal
+
–
0
votes
187
Boolean Algebra
can anyone explain why answer is different using a different sequence of steps? Although there no violation of priority order. I think the answer should be same? If any mistake please let me know.
can anyone explain why answer is different using a different sequence of steps? Although there no violation of priority order.I think the answer should be same?If any mis...
281
views
answered
Jul 18, 2017
Digital Logic
digital-logic
+
–
0
votes
188
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...
62.9k
views
answered
Jul 18, 2017
CO and Architecture
gatecse-2004
co-and-architecture
virtual-memory
normal
+
–
0
votes
189
Number system
The sign magnitude representation of decimal number -637 is (a) 0687 (b)9687 (c) 1687 (d) 1312 Please explain also...how to find it...
The sign magnitude representation of decimal number -637 is(a) 0687 (b)9687 (c) 1687 (d) 1312Please explain also...how to find it...
1.5k
views
answered
Jul 18, 2017
1
votes
190
Kenneth Rosen Edition 6th Exercise 1.2 Question 29 (Page No. 29)
Show that each of the conditional statement is a tautology not using truth table [(p → q) ∧ (q → r)] → (p → r)
Show that each of the conditional statement is a tautologynot using truth table [(p → q) ∧ (q → r)] → (p → r)
752
views
answered
Jul 16, 2017
Mathematical Logic
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register