Register
Filter

Questions by DAWID15

2 votes
0 answers
1
MADEEASY
Why B is wrong?
Why B is wrong?
0 votes
1 answer
2
OS
By default the memory address starts with 0. But they have considered from 1. What should I consider when nothing is mentioned?
By default the memory address starts with 0. But they have considered from 1.What should I consider when nothing is mentioned?
0 votes
1 answer
3
ZEAL TEST
Isn’t the “No of independent rows”= RAnk of matrix?
Isn’t the “No of independent rows”= RAnk of matrix?
0 votes
0 answers
4
Gate 2015
For problems where the options are not given, like this kinda questions should I consider hierarchical access or simultaneous access. I know that hierarchical access is commonly used so it should be preferred but the solution for this is described using simultaneous access.
For problems where the options are not given, like this kinda questions should I consider hierarchical access or simultaneous access. I know that hierarchical access is c...
0 votes
1 answer
6
ZEAL SERIES
What should be the answer?
What should be the answer?
0 votes
1 answer
7
ZEAL TESTSERIES
Options: 10, 12,14, 16, 18, 20 20, 18, 16, 14, 12, 10 12, 10, 16, 14, 20, 18 NONE
Options:10, 12,14, 16, 18, 2020, 18, 16, 14, 12, 1012, 10, 16, 14, 20, 18NONE
0 votes
2 answers
8
Zeal Testseries
I’m getting 2 as the answer, but the correct one given by them is 5. Somebody please confirm.
I’m getting 2 as the answer, but the correct one given by them is 5.Somebody please confirm.
0 votes
1 answer
9
MADEEASY TESTSERIES
To justify the OPTION B they gave an example of 2*2 matrix. However we can see that row 2 is linearly dependent on row1. Even though the 2nd row looks non-zero it can be made into zero. SO am I wrong or the explanation is wrong?
To justify the OPTION B they gave an example of 2*2 matrix. However we can see that row 2 is linearly dependent on row1. Even though the 2nd row looks non-zero it can be ...
0 votes
1 answer
10
###Doubt
Is there any shortcut method to find the optimal solution of 0/1 knapsack problem?
Is there any shortcut method to find the optimal solution of 0/1 knapsack problem?