GATE 2001 CSE & IT
49 questions across 1 session
How many 4 digit even numbers have all 4 digits distinct?
Suppose a processor does not have any stack pointer register. Which of the following statements is true?
Which is the most appropriate match for the items in the first column with the items in the second column? $$X.$$ Indirect Addressing $$Y.$$ Indexed Addressing $$Z.$$ Base Register...
Let $$f:\,A\, \to B$$ be a function, and let E and F be subsets of A. Consider the following statements about images. $$S1:\,f\,\left( {E\, \cup \,F} \right)\, = \,f\left( E \right...
More than one word are put in one cache block to
Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will...
A $$CPU$$ has $$32$$-bit memory address and a $$256$$ $$KB$$ cache memory. The cache is organized as a $$4$$-way set associative cache with cache block size of $$16$$ bytes. (a)$$\...
Which of the following relational calculus expressions is not safe?
Where does the swap space reside?
Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the approximate size of the page table?
Consider a disk with the $$100$$ tracks numbered from $$0$$ to $$99$$ rotating at $$3000$$ $$rpm.$$ The number of sectors per track is $$100.$$ the time to move the head between tw...
Which of the following requires a device driver?
Which of the following statements is false?
Consider a disk with following specifications: $$20$$ surface, $$1000$$ tracks/surface, $$16$$ sectors/track, data density $$1$$ $$KB/sector,$$ rotation speed $$3000$$ $$rpm.$$ The...
Consider two well-formed formulas in propositional logic $$F1:P \Rightarrow \neg P$$ $$F2:\left( {P \Rightarrow \neg P} \right) \vee \left( {\neg P \Rightarrow } \right)$$ Which of...
Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r, u) and d(r, v) be the lengths of the shortest paths from r to...
A processor needs software interrupt to
Consider the following C program: void abc(char *s) { if(s[0]=='\0') return; abc(s+1); abc(s+1); printf("%c",s[0]); } main() { abc("123"); } (a) What will be the output of the prog...
The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the assigned addresses is called
$$R(A,B,C,D)$$ is a relation. Which of the following does not have a lossless-join, dependency preserving $$BCNF$$ decomposition?
Consider the following relations: $${R_1}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,\left( {a + b} \right)$$ is even over the set of integers $${R_2}\,\,\left( {a,\,\,b} \right)\,\,\...
What is printed by the print statements in the program P1 assuming call by reference parameter passing? Program P1() { x=10; y=3; func1(y,x,x); print x; print y; } func1(x,y,z) { y...
how many undirected graphs (not necessarily connected) can be constructed out of a given $$\,\,\,\,V = \left\{ {{v_1},\,\,{v_2},\,....,\,\,{v_n}} \right\}$$ of $$n$$ vertices?
How many undirected graphs (not necessarily connected) can be constructed out of a given set V = { v 1 ,v 2 ,........,v n } of n vertices?
Which of the following statements is false?
The $$2's$$ complement representation of $${\left( { - 539} \right)_{10}}$$ in hexadecimal is
A processor needs software interrupt to
Consider a virtual memory system with $$FIFO$$ page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will
Consider any array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array $$\...
Let f(n) = n 2 log n and g(n) = n(log n) 10 be two positive functions of n. Which of the following statements is correct?
Consider the following three C functions: [P1] int*g(void) { int x=10; return(&x); } [P2] int*g(void) { int *px; *px = 10; return px; } [P3] int*g(void) { int *px px =(int*)malloc...
Consider a schema $$R(A,B,C,D)$$ and functional dependencies $$A \to B\,\,$$ and $$C \to D\,\,$$. Then the decomposition of $$R$$ into $${R_1}\left( {AB} \right)$$ and $${R_2}\left...
Consider the following program Program P2 var n:int; procedure W(var x:int) begin x=x+1; print x; end procedure D begin var n:int; n=3; W(n); end begin \\begin P2 n = 10; D; end If...
The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the assigned addresses is called
Which of the following does not interrupt a running process?
Consider the following statements: S1: The sum of two singular n x n matrices may be non-singular S2: The sum of two n x n non-singular matrices may be singular Which of the follow...
Arrange the following configuration for CPU in decreasing order of operating speeds: Hardwired control, vertical micro- programming, horizontal micro-programming
The value of the integral is $${\rm I} = \int\limits_0^{{\raise0.5ex\hbox{$\scriptstyle \pi $} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 4$}}} {{{\cos }^2}x\,dx} $$
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day ?
Consider the following statements: S1: There exist infinite sets A, B, C such that $$A\, \cap \left( {B\, \cup \,C} \right)$$ is finite. S2: There exist two irrational numbers x an...
Consider Peterson’s algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. Repeat flag[i]=true; turn=j; while (P)...
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged
Consider a $$DFA$$ over $$\sum { = \left\{ {a,\,\,b} \right\}} $$ accepting all strings which have number of $$a'$$s divisible by $$6$$ and number of $$b'$$s divisible by $$8$$. Wh...
Consider the following problem $$X.$$ Given a Turing machine $$M$$ over the input alphabet $$\sum , $$ any state $$q$$ of $$M$$ And a word $$w\,\,\varepsilon \,\,\sum {^ * ,} $$ do...
Which of the following statement is true?
Consider the following two statements; $${S_1}\,\,:\,\,\left\{ {{0^{2n}}\left| {n \ge 1} \right.} \right\}$$ is a regular language $${S_2}\,\,:\,\,\left\{ {{0^m}{1^n}{0^{m + n}}\le...
Consider the following languages: $${L_1} = \left\{ {w\,w\left| {w \in {{\left\{ {a,\,b} \right\}}^ * }} \right.} \right\}$$ $${L_2} = \left\{ {w\,{w^R}\left| {w \in {{\left\{ {a,\...
Given an arbitrary non-deterministic finite automaton $$(NFA)$$ with $$N$$ states, the maximum number of states in an equivalent minimized $$DFA$$ is at least
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?