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
Recent activity by Sahin
1
answer
1
File System - Unix Inode
839
views
answer edited
Jan 6, 2020
Operating System
operating-system
inode
unix
file-system
+
–
2
answers
2
matrix groups
Which of the following is true? Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers. Every diagonal matrix is group under multiplication operation, where all elements of diagonal are non zero numbers. Every ... addition operation where all elements are real numbers. Both (a) and b) isn't a b c all are correct?
Which of the following is true?Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers.Every diagonal ma...
1.2k
views
answer edited
Jan 4, 2020
Linear Algebra
group-theory
+
–
1
answer
3
AVL tree
Consider following statements: S1: Rotation operation in AVL always preserves the Inorder ordering. S2: The median of all elements in AVL tree is always at root or one of its two children. S3: If every node in BST has either 0 or 2 children,then searching is O(logn) S4: In a 3 array tree. If number of internal node is 20 then number of Leaves are 41. True Statements ? Ans: Only S1 and S4
Consider following statements: S1: Rotation operation in AVL always preserves the Inorder ordering.S2: The median of all elements in AVL tree is always at root or one of ...
3.1k
views
answered
Jan 2, 2020
DS
avl-tree
data-structures
tree
binary-search-tree
+
–
1
answer
4
Test by Bikram | Theory of Computation | Test 2 | Question: 25
Which of the following are regular? $\{aba^R \mid a,b \in \{0,1\}^+ \}$ $\{aba \mid a,b \in \{0,1\}^* \}$ $\{aba^R \mid b,a \in \{0,1\}^* \text{ and } \mid b \mid = 10 \}$ (i) and (iii) only (i) and (ii) only (i) only (ii) and (iii) only
Which of the following are regular?$\{aba^R \mid a,b \in \{0,1\}^+ \}$ $\{aba \mid a,b \in \{0,1\}^* \}$$\{aba^R \mid b,a \in \{0,1\}^* \text{ and } \mid b \mid = 10 \...
461
views
commented
Oct 5, 2019
Theory of Computation
tbb-toc-2
theory-of-computation
regular-language
+
–
3
answers
5
GATE Overflow | Operating Systems | Test 1 | Question: 13
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is 100 ns 68.0 ns 68.5 ns 78.5 ns
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 1...
855
views
commented
Oct 3, 2019
Operating System
go-os-1
virtual-memory
paging
+
–
6
answers
6
Databases
A Clustered index A) is a dense index always. B) is a sparse index always. C) can be either dense index or a sparse index,but not both. D) can be both dense index and sparse index.
A Clustered indexA) is a dense index always.B) is a sparse index always.C) can be either dense index or a sparse index,but not both.D) can be both dense index and sparse ...
6.3k
views
answered
Oct 2, 2019
Databases
databases
indexing
+
–
5
answers
7
MadeEasy Test Series: CO & Architecture - Io Handling
Consider a system employing interrupt driven I/O for a particular device that transfer data at an average of 8 KB/sec on a continuous basis. Consider interrupt processing takes about 100 μsec i.e. time to jump to ISR, execute it and return ... if interrupts occur for every byte is ________. [Assume 1 K = 1024] (Upto 2 decimal places) Ans. 0.81
Consider a system employing interrupt driven I/O for a particular device that transfer data at an average of 8 KB/sec on a continuous basis. Consider interrupt processing...
2.4k
views
answered
Oct 2, 2019
CO and Architecture
co-and-architecture
interrupts
made-easy-test-series
io-handling
+
–
4
answers
8
GATE CSE 2004 | Question: 63
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... after executing the HALT instruction, the return address (in decimal) saved in the stack will be $1007$ $1020$ $1024$ $1028$
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ $$\begin{array}{|l|l|c|} \hline \text {Instruction} & \t...
29.2k
views
commented
Oct 1, 2019
CO and Architecture
gatecse-2004
co-and-architecture
machine-instruction
normal
+
–
1
answer
9
Memory access time
Suppose the time taken to write in cache is tc and time to write in main memory is tm. If write back policy is used, only the main memory is written and time taken is tm. But if write through is used, are the main memory and cache updated simultaneously (time taken would be tm) or serially (time taken would be tc + tm)?
Suppose the time taken to write in cache is tc and time to write in main memory is tm. If write back policy is used, only the main memory is written and time taken is tm....
715
views
commented
Sep 29, 2019
CO and Architecture
co-and-architecture
effective-memory-access
cache-memory
+
–
2
answers
10
Q26 ch-5 M_E workbook
suppose that in 1000 memory reference there are 40 misses in the first level cache and 20 misses in the second level cache. Assume miss penalty from the L2 cache to memory is 100 cycles the hit time of the L2 cache is 10 clock cycles.the hit time of ... reference per instruction) x (miss rate) x (miss penalty) right?? so which miss rate and miss penalty should i put here?
suppose that in 1000 memory reference there are 40 misses in the first level cache and 20 misses in the second level cache. Assume miss penalty from the L2 cache to memor...
12.3k
views
commented
Sep 29, 2019
CO and Architecture
co-and-architecture
cache-memory
clock-frequency
clock-cycles
+
–
5
answers
11
UGC NET CSE | November 2017 | Part 3 | Question: 12
Consider a schema $R(A, B, C, D)$ and following functional dependencies. $A \rightarrow B$ $B \rightarrow C$ $C \rightarrow D$ $D \rightarrow B$ Then decomposition of $R$ ... preserving and lossless join Lossless join but dependency preserving Dependency preserving but not lossless join Not dependency preserving and not lossless join
Consider a schema $R(A, B, C, D)$ and following functional dependencies.$A \rightarrow B$$B \rightarrow C$$C \rightarrow D$$D \rightarrow B$Then decomposition of $R$ into...
3.5k
views
commented
Sep 22, 2019
Databases
ugcnetcse-nov2017-paper3
databases
relational-schema
rdbms
+
–
2
answers
12
made easy test series
Consider Amit lives in Delhi, connected to the internet via a 100 Mbps connection retrieve a 250 KB webpage from server in Bangalore, where page contain 3 images of 500 KB each. Assume one way propagation delay is 75 ms and Amit's access link is the ... Amit's screen using nonpersistent HTTP and T2 is time using persistent connection, then T = T1 - T2 will be ________ msec.
Consider Amit lives in Delhi, connected to the internet via a 100 Mbps connection retrieve a 250 KB webpage from server in Bangalore, where page contain 3 images of 500 ...
3.6k
views
commented
Sep 15, 2019
2
answers
13
write down a minimal cover
Consider the attribute set R = ABCDEGH (where Functional Dependencies are F= {AB·--> C,AC --> B: AD ---> E, B -----> D, BE --> A, B -> G}.
Consider the attribute set R = ABCDEGH (where Functional Dependencies areF= {AB· C,AC B: AD - E, B - D, BE A, B - G}.
1.3k
views
answered
Aug 11, 2019
Databases
database-normalization
minimal-cover
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register