Recent questions without an upvoted answer

0 votes

1 answer

10561

429 views

junaid ahmad asked Jan 5, 2019

0 votes

0 answers

10562

ME OTS : Pipelining
Consider the following statements (I) Execution time for single instruction on six stage pipelined CPU is less than or equal to identical non- pipelined CPU. (ii) In a uniform delay pipeline execution time for a single instruction is equal to the ... if stage delay exist then for single execution, pipeline time will not be equal. Hence 2nd statement wont be true always.

Consider the following statements(I) Execution time for single instruction on six stagepipelined CPU is less than or equal to identical non-pipelined CPU.(ii) In a unifor...

1.2k views

HeadShot asked Jan 5, 2019

1 votes

0 answers

10563

Self-doubt | DBMS | Functional Dependency
Can someone explain the paragraph marked based on relation $r$ given in Figure 7.2? Reference: Database System Concepts by Silberschatz, Korth, Sudarshan 4th Edition.

Can someone explain the paragraph marked based on relation $r$ given in Figure 7.2?Reference: Database System Concepts by Silberschatz, Korth, Sudarshan 4th Edition. �...

433 views

zeeshanmohnavi asked Jan 5, 2019

0 votes

0 answers

10564

Made Easy Test series
Idid’t get the question at all !! Even after seeing the solution , someone please explain it Thank you

Idid’t get the question at all !! Even after seeing the solution , someone please explain it Thank you

259 views

Nandkishor3939 asked Jan 5, 2019

0 votes

0 answers

10565

UPPCL AE 2018:83
Seven friends, Anil, Sunil, Rohit, Puja, Shalini, Pradhi and Gaurav bought seven cars during a week but each one bought their cars on a different day of the week. Each of them also bought a different brand of car. The brands are Maruti, ... Shalini bought a Honda on Tuesday Shalini bought a Renault on Sunday Shalini bought a Toyota on Wednesday Shalini bought a Honda on Saturday

Seven friends, Anil, Sunil, Rohit, Puja, Shalini, Pradhi and Gaurav bought seven cars during a week but each one bought their cars on a different day of the week. Each of...

331 views

admin asked Jan 5, 2019

0 votes

1 answer

10566

UPPCL AE 2018:80
In a high school, a class teacher is scheduling the six subjects into periods $1$ through $6$ for her class. The subjects are: Hindi, English, Mathematics, Science, History and Geography. She has to abide by the following conditions: ... or immediately after Hindi If the Mathematics period is scheduled before Science, then Geography must be which period? second fourth third fifth

In a high school, a class teacher is scheduling the six subjects into periods $1$ through $6$ for her class. The subjects are: Hindi, English, Mathematics, Science, Histo...

331 views

admin asked Jan 5, 2019

2 votes

1 answer

10567

GATE 2015 SET-2 Q 29
Let the random variable X represent the number of times a fair coin needs to be tossed till two consecutive heads appear for the first time. The expectation of X is _______.

Let the random variable X represent the number of times a fair coin needs to be tossed till two consecutive heads appear for the first time. The expectation of X is _____...

3.9k views

cocgame asked Jan 5, 2019

0 votes

1 answer

10568

UPPCL AE 2018:77
Arrange the words given below in a meaningful sequence. Key Door Lock Room Switch On $4, 2, 1, 5, 3 $ $1, 3, 2, 4, 5 $ $1, 2, 3, 5, 4 $ $5, 1, 2, 4, 3 $

Arrange the words given below in a meaningful sequence.Key DoorLockRoomSwitch On$4, 2, 1, 5, 3 $$1, 3, 2, 4, 5 $$1, 2, 3, 5, 4 $$5, 1, 2, 4, 3 $

346 views

admin asked Jan 5, 2019

0 votes

0 answers

10569

UPPCL AE 2018:76
Consider the statements: $\text{A} \Leftrightarrow \text{A} \vee \sim \text{A}$ $\text{A} \Leftrightarrow \text{A} \vee \text{A}$ $\text{A} \vee \text{B} \Rightarrow \text{A}$ $\text{A} \Rightarrow \text{A} \vee \text{B}$ Which of the above refers to tautologies? $\text{III}$ $\text{I}$ and $\text{II}$ $\text{II}$ and $\text{IV}$ $\text{I}$

Consider the statements:$\text{A} \Leftrightarrow \text{A} \vee \sim \text{A}$$\text{A} \Leftrightarrow \text{A} \vee \text{A}$$\text{A} \vee \text{B} \Rightarrow \te...

213 views

admin asked Jan 5, 2019

0 votes

1 answer

10570

UPPCL AE 2018:75
What is the output of the following $\text{C}$ program? #include<stdio.h> int main(void) { struct bitfields { int bits_1 : 2; int bits_2 : 4; int bits_3 : 4; int bits_4 : 3; } bit = {2, 3, 8, 7}; printf(“%d %d %d %d”, bit.bits_1, bit.bits_2, bit.bits_3, bit.bits_4 ); } $\text{-}2 \; 3 \; \text{-}8 \; \text{-}1 $ $2 \; 4 \; 4 \; 3 $ $0 \; 0 \; 0 \; 0 $ $2 \; 3 \; 8 \; 7 $

What is the output of the following $\text{C}$ program?#include<stdio.h int main(void) { struct bitfields { int bits_1 : 2; int bits_2 : 4; int bits_3 : 4; int bits_4 : ...

340 views

admin asked Jan 5, 2019

0 votes

0 answers

10571

UPPCL AE 2018:74
Consider the following statements regarding life time of any normally terminating process in an operating system. The process must be in $\text{RUNNING}$ state at least once during its execution. The process must be in $\text{RUNNING}$ state at least twice during its execution. The process must be ... $\text{III}$ $\text{I}$ and $\text{II}$ $\text{I, III}$ and $\text{IV}$

Consider the following statements regarding life time of any normally terminating process in an operating system.The process must be in $\text{RUNNING}$ state at least on...

295 views

admin asked Jan 5, 2019

0 votes

0 answers

10572

UPPCL AE 2018:71
Consider the following transactions with data items $\text{P}$ and $\text{Q}$ initialized to zero: T1: read (P); read (Q); if P = 0 then Q : = Q + 1; write (Q); T2: read (P); read (P); if Q = ... concurrent execution leads to A serializable schedule A conflict serializable schedule A schedule for which a precedence graph cannot be drawn A schedule that is not conflict serializable

Consider the following transactions with data items $\text{P}$ and $\text{Q}$ initialized to zero:T1: read (P); read (Q); if P = 0 then Q : = Q + 1; write (Q); T2: read (...

303 views

admin asked Jan 5, 2019

0 votes

0 answers

10573

UPPCL AE 2018:67
Consider a fully-associative data cache with $32$ blocks of $64$ bytes each. The cache uses $\text{LRU}$ (Least Recently Used) replacement. Consider the following $\text{C}$ code to sum together all of the elements of a $64$ by $64$ two-dimensional array ... all blocks in the cache are initially invalid. How many cache misses will result from the code? $256$ $128$ $1024$ $512$

Consider a fully-associative data cache with $32$ blocks of $64$ bytes each. The cache uses $\text{LRU}$ (Least Recently Used) replacement. Consider the following $\text{...

333 views

admin asked Jan 5, 2019

0 votes

1 answer

10574

UPPCL AE 2018:66
In a course, a professor gives five grades $\{\text{A, B, C, D, F}\}.$ What is the minimum number of students required so that four of them are guaranteed to get the same grade? None of the above $14$ $18$ $16$

In a course, a professor gives five grades $\{\text{A, B, C, D, F}\}.$ What is the minimum number of students required so that four of them are guaranteed to get the same...

394 views

admin asked Jan 5, 2019

0 votes

1 answer

10575

UPPCL AE 2018:65
Consider that $\text{N}$ distinct elements $(\text{N}>3)$ are inserted into an initially empty binary search tree $\text{(BST)}.$ Which of the following statements are true? None of the above The worst case height of the resulting $\text{BST}$ is ... $\text{BST}.$ Swapping the order of insertion of any two elements can always half the height of the resulting $\text{BST}.$

Consider that $\text{N}$ distinct elements $(\text{N}>3)$ are inserted into an initially empty binary search tree $\text{(BST)}.$ Which of the following statements are tr...

307 views

admin asked Jan 5, 2019

0 votes

1 answer

10576

UPPCL AE 2018:64
The following grammar $\text{G}$ is left recursive. $\text{E} \rightarrow \text{E + T}\; \mid \; \text{T} $ $\text{T} \rightarrow \text{T * F} \; \mid \; \text{F} $ $\text{F} \rightarrow \text{(E)} \mid \textbf{id} $ Which of the following is a ...

The following grammar $\text{G}$ is left recursive.$\text{E} \rightarrow \text{E + T}\; \mid \; \text{T} $$\text{T} \rightarrow \text{T * F} \; \mid \; \text{F} $$\text{F...

365 views

admin asked Jan 5, 2019

0 votes

1 answer

10577

UPPCL AE 2018:63
We have a database table with relational schema $\text{R(XYZPQ)}:$ ... dependency. $\text{Y} \rightarrow \text{X}$ is a functional dependency. None of the above $\text{YZ} \rightarrow \text{P}$ is a functional dependency.

We have a database table with relational schema $\text{R(XYZPQ)}:$$$\begin{array}{|c|c|c|c|c|} \hline \text{X} & \text{Y} & \text{Z} & \text{P} & \text{Q} \\\hline \text{...

473 views

admin asked Jan 5, 2019

0 votes

0 answers

10578

UPPCL AE 2018:62
Let $\text{MXI}$ be an inverting $2:1$ multiplexer whose output is $a’,$ when $s=0$ and output is $b’$ when $s=1.$ That is, $\text{MXI}(s,a,b) = s’a’ + sb’.$ What function is the following circuit equivalent to? Exclusive $\text{OR}$ Exclusive $\text{NOR}$ Inclusive $\text{OR}$ Half adder sum

Let $\text{MXI}$ be an inverting $2:1$ multiplexer whose output is $a’,$ when $s=0$ and output is $b’$ when $s=1.$ That is, $\text{MXI}(s,a,b) = s’a’ + sb’.$ Wh...

281 views

admin asked Jan 5, 2019

0 votes

0 answers

10579

UPPCL AE 2018:61
Consider a computer system with $32-$ bit virtual addressing and page size of sixty-four kilobytes. The computer system has one-level page table per process with each page table entry of $6$ bytes. If the maximum physical memory size supported by this paging system is ... how many bits can be used for flags and permissions within a page table entry? $6$ None of the above $7$ $5$

Consider a computer system with $32-$ bit virtual addressing and page size of sixty-four kilobytes. The computer system has one-level page table per process with each pag...

298 views

admin asked Jan 5, 2019

0 votes

3 answers

10580

UPPCL AE 2018:60
The following function attempts to merge two sorted linked lists. ListNode is the custom structure representing a node in the linked list. ListNode* Merge(ListNode* pHead1, ListNode* pHead2) { ListNode* pMergedHead = NULL; if (pHead1->m_nValue < pHead2->m_nValue) { pMergedHead = pHead1; ... $\text{II} $ and $\text{III}$ $\text{I} $ and $\text{III}$ $\text{I}$ only

The following function attempts to merge two sorted linked lists. ListNode is the custom structure representing a node in the linked list.ListNode* Merge(ListNode* pHead1...

434 views

admin asked Jan 5, 2019

0 votes

0 answers

10581

UPPCL AE 2018:59
Consider the following $\text{C}$ program. #include<stdio.h> #define XOR(a, b) (a) ^ (b) void func (int *a, int *b) { *a = XOR (*b, *a); *b = XOR (*a, *b); *a = XOR (*b, *a); } main() { int a = 10, b = 20; func (&a , &b); printf(“%d %d \n”,a,b); } What will be the output of the program? $20 \; 10$ $20 \; 20$ $10 \; 10$ $10 \; 20$

Consider the following $\text{C}$ program.#include<stdio.h #define XOR(a, b) (a) ^ (b) void func (int *a, int *b) { *a = XOR (*b, *a); *b = XOR (*a, *b); *a = XOR (*b, *a...

251 views

admin asked Jan 5, 2019

0 votes

0 answers

10582

UPPCL AE 2018:58
Let $\text{A}$ be a $2 \times 2$ matrix with integer entries. Which of the following could be its eigenvalue? $\sqrt[3]{2}$ $\pi$ $\frac{1}{\sqrt{2}}$ $\sqrt{2}$

Let $\text{A}$ be a $2 \times 2$ matrix with integer entries. Which of the following could be its eigenvalue?$\sqrt[3]{2}$$\pi$$\frac{1}{\sqrt{2}}$$\sqrt{2}$

261 views

admin asked Jan 5, 2019

0 votes

0 answers

10583

UPPCL AE 2018:57
Consider the following $\text{C}$ function executed in an $\text{OS}$ with paging where the page size is $4$ kilobytes. Further, assume that the system employs a $32-$ entry direct mapped $\text{TLB}$ int *alloc_and_init() { int counter, value = 0, size = 2048; int ... of the program, what is the number of $\text{TLB}$ misses during the execution of the for loop? $2048$ $2$ $0$ $1$

Consider the following $\text{C}$ function executed in an $\text{OS}$ with paging where the page size is $4$ kilobytes. Further, assume that the system employs a $32-$ en...

269 views

admin asked Jan 5, 2019

0 votes

0 answers

10584

UPPCL AE 2018:56
The Adjacency matrix of a directed graph $\text{G}$ ... $(h, c, a, e, f, d, i, g, b)$ $(c, a, d, e, f, g, h, i, b)$

The Adjacency matrix of a directed graph $\text{G}$ is given below.$\begin{array} {} & a & b & c & d & e & f & g & h & i \\ a & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\ b & ...

218 views

admin asked Jan 5, 2019

0 votes

0 answers

10585

UPPCL AE 2018:54
Assume that a file is written using write $\text{(fd, buf, K)}$ system call, where $\text{fd}$ is the file descriptor and $\text{K}$ is the number of bytes to be written to the current file offset which is a multiple of the disk block size $\text{D}$. The total number ... system call returns None of the above is at least $\text{K/D}$ is equal to $\text{K/D}$ is at most $\text{K/D}$

Assume that a file is written using write $\text{(fd, buf, K)}$ system call, where $\text{fd}$ is the file descriptor and $\text{K}$ is the number of bytes to be written ...

219 views

admin asked Jan 5, 2019

0 votes

1 answer

10586

UPPCL AE 2018:53
Consider a hash table of size $7$ implemented using an array $A[0 \dots 6].$ A modulo hash function $\text{(MOD 7)}$ is used to map the keys, and open addressing is used to handle collisions. If $53, 32, 43, 51, 99$ ... $\text{EMPTY}, 43, 51, 99, 53, 32, \text{EMPTY}$ $\text{EMPTY}, 43, 99, 51, 32, 53, \text{EMPTY}$

Consider a hash table of size $7$ implemented using an array $A[0 \dots 6].$ A modulo hash function $\text{(MOD 7)}$ is used to map the keys, and open addressing is used ...

323 views

admin asked Jan 5, 2019

0 votes

0 answers

10587

UPPCL AE 2018:52
Consider the following implementation as a solution to the critical section problem for two processes $\text{P}_{0}$ and $\text{P}_{1}$ with id $0$ and $1,$ respectively. int flag[2] = {0,0}; int turn = 0; void lock (int id) /* ... exclusion is guaranteed Mutual exclusion is guaranteed if $\text{S1}$ and $\text{S2}$ are interchanged Solution leads to a deadlock None of the above

Consider the following implementation as a solution to the critical section problem for two processes $\text{P}_{0}$ and $\text{P}_{1}$ with id $0$ and $1,$ respectively....

211 views

admin asked Jan 5, 2019

0 votes

0 answers

10588

UPPCL AE 2018:51
Consider the following code. int count = 0; void *thfunc () { int ctr = 0; for(ctr=0; ctr<100; ctr++) count++; } If thfunc is executed by two threads concurrently in a uniprocessor system, what will be the $\textbf{MINIMUM}$ value of count when both threads complete ... increament $\text{R},$ and (iii) store the value of $\text{R}$ in memory. $200$ $100$ $2$ None of the above

Consider the following code.int count = 0; void *thfunc () { int ctr = 0; for(ctr=0; ctr<100; ctr++) count++; }If thfunc is executed by two threads concurrently in a unip...

240 views

admin asked Jan 5, 2019

0 votes

0 answers

10589

Language accepted by this Turing Machine
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.

As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.

538 views

sripo asked Jan 5, 2019

0 votes

0 answers

10590

138 views

garimanand asked Jan 5, 2019

Page:

« prev
1
...
348
349
350
351
352
353
354
355
356
357
358
...
1006
next »