search
Log In

Recent questions tagged zeal2019

0 votes
0 answers
2
A sorted array of n elements which has been circularly shifted. For example, {18,25,1,5,11,16} is a sorted array that has been circularly shifted by 2 positions. suppose a person has to find the largest element in a circularly shifted array. Here, there is a small constraint that the ... through which it has been shifted is unknown. find time complexity. 1. O(nlogn) 2. O(n) 3. O(n^2) 4. O(logn)
asked Jan 2, 2019 in Algorithms Prince Sindhiya 121 views
0 votes
1 answer
3
Match the following: (a) Create (i) The E-R Model (b) Select (ii) Relationship Model (c) Rectangle (iii) DDL (d) Record (iv) DML in answer a is matched with dml but what i know ---select is for data retrival and insert update delete are for DML
asked Jan 2, 2019 in Databases Prince Sindhiya 90 views
0 votes
1 answer
4
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
asked Jan 2, 2019 in DS Prince Sindhiya 155 views
0 votes
0 answers
5
If the DFS finishing time f[u] < f[v] for two vertices u and v in a directed graph G, and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v in the depth first tree ? True /False can anyone explain it ?
asked Jan 2, 2019 in Algorithms Prince Sindhiya 131 views
0 votes
0 answers
6
Consider the following statements. S1: An unambiguous left recursive grammar must be CLR(1). S2: A DCFG may or may not be LL(1). Select the correct option: 1.Both S1 and S2 are true. 2.Both S1 and S2 are false. 3. S1 is false and S2 is true. 4.S1 is true and S2 is false. According to me S1 false and S2 true but answer given 1
asked Jan 2, 2019 in Theory of Computation Prince Sindhiya 166 views
0 votes
2 answers
7
0 votes
0 answers
17
How many of following are correct statements ? (i) A graph where all edge weights are distinct can have more than one shortest path between two vertices u and v (ii)adding a number w on weight of every edge of graph might change the graph's minimum spanning ... by a positive number might change the shortest path between two vertices u and v (Assume that all edge weights of graph are distinct)
asked Dec 21, 2018 in Algorithms Prince Sindhiya 163 views
0 votes
0 answers
18
0 votes
0 answers
23
ANSWER GIVEN IS A) IN THESE QUESTION I GOT THAT IT WILL NOT SATISFIED ME AND BOUNDED WAIT BUT HOW PROGRESS IS SATISFIED I AM NOT GETTING WHAT I UNDERSTOOD THAT IF BOUNDED WAIT IS NOT SATISFIED MEANS ONE PROCESS IS ENTERING IN CS WITHOUT GIVING THE CHANCE TO OTHER PROCESS TO ENTER BUT IF (BW) NOT SATISFIED THEN HOW PROGRESS CAN BE SATISFIED PLEASE CLEAR THIS POINT AND TELL ME HOW TO APPROACH HERE
asked Dec 16, 2018 in Operating System Prince Sindhiya 125 views
0 votes
0 answers
24
IN THESE QUESTION WHAT I DID IN 2) there is Multi valued atrribute so we will create one table for it with ab as key NAMED it AS(BETA) table and 3) is same where b1 is partial key and depending on first tables primary key so both are equivalent please tell me that i am right or not answer is C)
asked Dec 16, 2018 in Databases Prince Sindhiya 86 views
1 vote
1 answer
26
The value of z after the execution of the following program is void f(int x) { staticint z; z=z+x; } int main() { int y=10; fork(); fork(); f(y); return 0; } 1.30 2.20 3.40 4. 10
asked Dec 16, 2018 in Programming Prince Sindhiya 162 views
0 votes
1 answer
27
Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; thisinvolves 1 switching context 2.jumping to the proper location in the user program to restart that program 3 switching to user mode 4. All the above ANSWER IS D I AM NOT GETTING 2 AND 3
asked Dec 16, 2018 in Operating System Prince Sindhiya 206 views
0 votes
1 answer
28
CPU bound jobs will hold CPU until exit or I/O. Long periods where no I/O requests issued, and theCPU is held resulting in poor I/O device utilization. This degradation in performance can be seen inwhich of the following? (A)SJF ( B) RR (C)FCFS (D)SRTF
asked Dec 16, 2018 in Operating System Prince Sindhiya 259 views
2 votes
0 answers
29
which one of the following is true. 1. round-robin scheduling minimizes average completion time. 2. during periods when the processor spends all of its cycles handling interrupts, the processscheduler is irrelevant to the machine’s performance. 3. priority scheduling minimizes average waiting time 4. srtf could maximize the cpu utilization
asked Dec 16, 2018 in Operating System Prince Sindhiya 214 views
0 votes
0 answers
30
The primary difference between process and thread? The number of I/O requests mode. The amount of overhead associated with creation and context switching The amount of memory allocation The average number of instructions executed
asked Dec 12, 2018 in Operating System Prince Sindhiya 107 views
...