Register
Filter

Answers by DAWID15

1 votes
2
NIELIT STA 2021
The addressing mode / s, which uses the PC instead of a general-purpose register is: Indexed with offset Relative Direct Both Indexed with offset and direct
The addressing mode / s, which uses the PC instead of a general-purpose register is: Indexed with offset RelativeDirectBoth Indexed with offset and direct
0 votes
3
Graph Coloring
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?There is a condition that adjacent...
1 votes
7
Conflict serialziability
How the option c is correct for the given schedules?
How the option c is correct for the given schedules?
0 votes
8
DBMS Korth Edition 4 Exercise 16 Question 27 (Page No. 635)
Explain the phantom phenomenon. Why may this phenomenon lead to an incorrect concurrent execution despite the use of the two-phase locking protocol ?
Explain the phantom phenomenon. Why may this phenomenon lead to an incorrect concurrent execution despite the use of the two-phase locking protocol ?
0 votes
9
Are all Irrecoverable/Non-Recoverable schedules cascading?
Suppose, T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: Abort Here we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it cascading?
Suppose,T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortHere we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it ...
1 votes
10
ER Model to Relational Model Conversion
What is the minimum number of relations required to represent a one-to-many relationship having total participation on the many side? Can i have just a single table with all attributes and (A1,B1) as a composite primary key?
What is the minimum number of relations required to represent a one-to-many relationship having total participation on the many side?Can i have just a single table with a...
1 votes
12
MadeEasy Subject Test: Programming & DS - Trees
A 4-ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
A 4-ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
0 votes
13
Stack
Every recursive program uses strictly more stack space compared to its iterative equivalent. This statement is false. Please explain with examples
Every recursive program uses strictly more stack space compared to its iterative equivalent.This statement is false. Please explain with examples
0 votes
16
MadeEasy Test Series: Algorithms - Sorting
Consider the following scenario during insertion sort when the array looks like the following: {25,75,95,125,80,5,10} The number of comparisons that it will further take for the array to be completely sorted are______?
Consider the following scenario during insertion sort when the array looks like the following:{25,75,95,125,80,5,10}The number of comparisons that it will further take fo...
0 votes
17
Self doubt on sorting algorithm
What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements . I know that the best sorting algorithm is no better than O(n log n).Please answer in terms of the asymptotic notation.
What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements .I know that the best sorting algorithm is no better than O(n lo...
0 votes
18
made easy test series:algorithms,sorting
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a swap?
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a sw...
0 votes
20
UGC NET CSE | June 2019 | Part 2 | Question: 64
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$? $O(\text{lg } n)$ $O(n)$ $O(n\text { lg }n)$ $O(n^2)$
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$?$O(\text{lg } n)$$O(n)$$O(n\text { lg }n)$$O(n^2)$
0 votes
22
JEST Sample Question 1-d
T (n) = T (n/2) + 2; T (1) = 1 When n is a power of 2, the correct expression for T (n) is: (A) 2(log n + 1) (B) 2 log n (C) log n + 1 (D)2 log n + 1
T (n) = T (n/2) + 2; T (1) = 1When n is a power of 2, the correct expression for T (n) is:(A) 2(log n + 1)(B) 2 log n(C) log n + 1(D)2 log n + 1
0 votes
23
Sorted List
suppose there are 4 sorted lists of n/4 elements each. if we merge these list into a single sorted list of n elements, for the n=400 number of key comparisons in the worst case using an efficient algorithm is
suppose there are 4 sorted lists of n/4 elements each. if we merge these list into a single sorted list of n elements, for the n=400 number of key comparisons in the wors...
3 votes
25
Gate Applied course Test series
What is answer for this question and also please explain the approach
What is answer for this question and also please explain the approach
0 votes
26
fork()
1)Consider the following pseudo code: for(i=1;i<=4;i++) { fork(); printf("X"); } How many times “X” is printed? 2) Consider the following pseudo code: void main() { fork(); fork(); fork(); fork(); printf("X"); } How many times “X” is printed?
1)Consider the following pseudo code:for(i=1;i<=4;i++){fork();printf("X");}How many times “X” is printed?2) Consider the following pseudo code:void main(){fork();fork...
Page: