1 vote
1
Let $x$ and $y$ be two vectors in a $3$ dimensional space and $<x,y>$ denote their dot product. Then the determinant $det\begin{bmatrix}<x,x> & <x,y>\\ <y,x> & <y,y>\end{bmatrix}$ is zero when $x$ and $y$ are linearly independent is positive when $x$ and $y$ are linearly independent is non-zero for all non-zero $x$ and $y$ is zero only when either $x$ or $y$ is zero
2
Consider a 4-way set associative cache that has 8-lines, with perfect LRU cache replacement and supports a block size of 16-bytes. For the following memory access pattern (shown as byte addresses), find the hit ratio? 3, 5, 6, 21, 32, 14, 5, 10, 11, 12
–1 vote
3
The base (or radix) of the number system such that the following equation holds is____________. $\frac{312}{20} = 13.1$
1 vote
4
#include<stdio.h> int main() { fork() && fork (); printf(“Forked”); } Explain the output of code with proper reason.
1 vote
5
Header field need scaling factor, , when it’s size is small, that is ok But why fragment offset field also need scaling factor? https://gateoverflow.in/1548/gate2013-37
1 vote
6
which of the following data structure is efficient to implement priority queue with basic operations such as insertion,deletion and searching? A)linked list B)Heap C)Sorted array D)Unsorted array
7
8
Answer is given as D. Not serializable, agreed. But how is it strict??
1 vote
9
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts 6000, 7000, 8000 ... , Plan 1 executes faster than Plan 2 for all databases For x = 9000, Plan I executes slower than Plan 2 for all databases
10
Student (school-id, sch-roll-no, sname, saddress) School (school-id, sch-name, sch-address, sch-phone) Enrolment(school-id sch-roll-no, erollno, examname) ExamResult(erollno, examname, marks) Consider the following tuple relational calculus query. {t | ∃ E ... or the other schools with a pass percentage above 35% over all exams taken together schools with a pass percentage above 35% over each exam
11
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
12
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... $T$ in this graph such that vertex 0 is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Write a concurrent program using $\text{parbegin-parend}$ and semaphores to represent the precedence constraints of the statements $S_1$ to $S_6$, as shown in figure below.
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] := false; while turn ... turn := j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.