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 chetan raghav
1
answer
1
#DOUbt
(please draw small diagram for this question) An N-bit carry lookahead adder, where N is a multiple of 4, employs ICs 74181 (4 bit ALU) and 74182 ( 4 bit carry lookahead generator). The minimum addition time using the best architecture for this adder is .........?
(please draw small diagram for this question)An N-bit carry lookahead adder, where N is a multiple of 4, employs ICs 74181 (4 bit ALU) and 74182 ( 4 bit carry lookahead g...
335
views
answered
Oct 22, 2017
5
answers
2
GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$. The file is ordered on a non-key field, and the...
24.2k
views
comment reshown
Oct 12, 2017
Databases
gatecse-2008
databases
indexing
normal
+
–
3
answers
3
Find address of element in 3d array
A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________.
A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________...
15.7k
views
commented
Sep 13, 2017
DS
data-structures
array
algorithms
+
–
1
answer
4
Divide and Conquer
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algo can be easily modified for sorting this array and what is the obtainable time complexity ?
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer sma...
655
views
asked
Sep 3, 2017
Algorithms
divide-and-conquer
sorting
time-complexity
+
–
1
answer
5
Relational Algebra
Answer and explanation please .
Answer and explanation please .
566
views
asked
Jun 23, 2017
0
answers
6
Tuple relational calculus
can someone give me a explanation of how any divide query in relational algebra be written using tuple calculus(using implication) . thanks in advance
can someone give me a explanation of how any divide query in relational algebra be written using tuple calculus(using implication) .thanks in advance
297
views
asked
Jun 22, 2017
1
answer
7
Rosen #MATHEMATICAL LOGIC
Chapter 1 Exercise1.4 question 9.h Let L(x, y) be the statement "x loves y" where the domain of x and y consist of all people of the world. Use quantifiers to expess the statement : "THERE ARE EXACTLY TWO PEOPLE WHOM LYNN LOVES"
Chapter 1 Exercise1.4 question 9.hLet L(x, y) be the statement "x loves y" where the domain of x and y consist of all people of the world. Use quantifiers to expess the ...
474
views
asked
Jun 16, 2017
Mathematical Logic
mathematical-logic
kenneth-rosen
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register