Register
Filter

Recent activity by pranjalgennext

0 answers
1
Placement Query
Which companies visited IIT Kanpur for placements this academic year?
Which companies visited IIT Kanpur for placements this academic year?
0 answers
5
Made Easy Test Series
6 answers
8
column major in 3d array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B].
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________...
1 answer
9
madeeasy_Mock2
.....
.....
0 answers
10
Made Easy Test Series
The number of view equal serial schedules possible for the given schedule are: S: w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A)
The number of view equal serial schedules possible for the given schedule are:S: w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A)
1 answer
12
MADE EASY TEST SERIES
Consider the following C program segment: struct node What is the output of above C program when it runs on a root node of a binary tree? prints nodes at K distance from root node. print nodes of Kth level of binary tree. Both (a) and (b) None of these
Consider the following C program segment:struct nodeWhat is the output of above C program when it runs on a root node of a binary tree?prints nodes at K distance from roo...
0 answers
14
MadeEasy Subject Test: Programming & DS - Stack
A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operations, the keys chosen are in Strictly decreasing order. How?
A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operati...
0 answers
16
Testbook
# plz check???
# plz check???
0 answers
17
General Question
GATE exam is online, so people are not allowed to take their question papers. So how do people calculate their marks? Does a copy of exam paper is mailed to the candidates after the exam?
GATE exam is online, so people are not allowed to take their question papers. So how do people calculate their marks? Does a copy of exam paper is mailed to the candidate...
0 answers
18
test series
1 answer
20
Made Easy Test Series
Assume a B-plus tree as: Size of search key=15B Size of block=512B Size of record pointer=9B Size of block pointer=8B What is the maximum number of nodes that can be accomodated in each leaf and non-leaf node of the tree?
Assume a B-plus tree as:Size of search key=15BSize of block=512BSize of record pointer=9BSize of block pointer=8BWhat is the maximum number of nodes that can be accomodat...
1 answer
23
C programming
#include <stdio.h> void A() { printf("A");}; void B() { printf("B");}; void C() { printf("C");}; void D() { printf("D");}; int main() { void (*P[4])() = {A,B,C,D}; for(int i=0;i<4;i++) (*(i+P))(); }
#include <stdio.h void A() { printf("A");}; void B() { printf("B");}; void C() { printf("C");}; void D() { printf("D");}; int main() { void (*P[4])() = {A,B,C,D}; for(int...
2 answers
24
MADE EASY TEST SERIES
What is the maximum number of records that can be indexed for a B+ tree of 4 levels with order 10 and root at level 1?
What is the maximum number of records that can be indexed for a B+ tree of 4 levels with order 10 and root at level 1?
1 answer
25
MADE EASY TEST SERIES
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?
1 answer
26
Indexing
What is the difference between different types of indices: 1. Clustered Index 2. Unclustered Index 3. Dense Index 4. Sparse Index
What is the difference between different types of indices:1. Clustered Index2. Unclustered Index3. Dense Index4. Sparse Index