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
Answers by Sahin
0
votes
1
File System - Unix Inode
836
views
answered
Jan 6, 2020
Operating System
operating-system
inode
unix
file-system
+
–
0
votes
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
answered
Jan 4, 2020
Linear Algebra
group-theory
+
–
0
votes
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
+
–
2
votes
4
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.2k
views
answered
Oct 2, 2019
Databases
databases
indexing
+
–
1
votes
5
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
+
–
1
votes
6
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