Recent questions tagged gate1999

+7 votes

1 answer

1

GATE1999_11b
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.

asked Dec 17, 2016 in DS by Arjun Veteran (319k points) | 187 views

+2 votes

3 answers

2

GATE 1999 - Time Complexity
Match the following 1.T(n) = T(n-1) +n a. O(n) 2. T(n) = T(n/2) +n b.O(nlogn) 3.T(n) = T(n/2) +nlogn c.O(n^2) 4.T(n) = T(n-1) + logn d.O(log^2 n) The first one I did by substitution ... solve no 4,i tried it by substitution i got log(n!) by using stirling approx which is nlogn also,as it is a gate qs,pls someone give me detailed solution.

asked Dec 20, 2015 in Algorithms by resuscitate Boss (6.8k points) | 451 views

+3 votes

3 answers

3

GATE1999_3
Mr. X claims the following: If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof: “From xRy, using symmetry we get yRx. Now because R is transitive xRy and ... xRx. Therefore, R is reflexive”. Give an example of a relation R which is symmetric and transitive but not reflexive.

asked Sep 24, 2014 in Set Theory & Algebra by Kathleen Veteran (66.2k points) | 378 views

+7 votes

3 answers

4

GATE1999_22
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Find all employees names who work in departments located at ‘Calcutta’ and whose ... Rs.50,000. Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000

asked Sep 24, 2014 in Databases by Kathleen Veteran (66.2k points) | 438 views

+8 votes

2 answers

5

GATE1999_21
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal note (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1$. (Assume that the root of a tree is at height 0).

asked Sep 24, 2014 in Databases by Kathleen Veteran (66.2k points) | 1.4k views

+6 votes

3 answers

6

GATE1999_20
(a) A certain processor provides a 'test and set' instruction that is used as follows: TSET register, flag This instruction atomically copies flag to register and sets flag to 1. Give pseudo-code for implementing the entry and exit code ... item; Forever; Show that in this solution it is possible that both the processes are sleeping at the same time.

asked Sep 24, 2014 in Operating System by Kathleen Veteran (66.2k points) | 545 views

+9 votes

1 answer

7

GATE1999_19
A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain $2^{16}$ bytes each. The virtual address space is divided into 8 non-overlapping ... in page table entry for storing the aging information for the page? Assume that the page size is 512 bytes.

asked Sep 24, 2014 in Operating System by Kathleen Veteran (66.2k points) | 1.5k views

0 votes

0 answers

8

GATE1999_18
Design a 2K $\times$ 8 (2048 locations, each 8 bit wide) memory system mapped at addresses (1000)$_{16}$ to (17FF)$_{16}$ for the 8085 processor using four 1K $\times$ 4 memory chips. Each of these chips has the following signal ... address lines. $A_0$ is the lest significant) $D_0, D_1, D_2, D_3$ (bi-directional data lines. $D_0$ is the least significant)

asked Sep 24, 2014 in CO & Architecture by Kathleen Veteran (66.2k points) | 115 views

+4 votes

1 answer

9

GATE1999_17
Consider the following program fragment in the assembly language of a certain hypothetical processor. The processor has three general purpose registers R1, R2 and R3. The meanings of the instructions are shown by comments (starting with ;) after the ... contain the values n, 0, and 0 respectively. What is the final value of R3 when control reaches Z?

asked Sep 24, 2014 in CO & Architecture by Kathleen Veteran (66.2k points) | 557 views

0 votes

0 answers

10

GATE1999_16

asked Sep 24, 2014 in Non GATE by Kathleen Veteran (66.2k points) | 94 views

+1 vote

1 answer

11

GATE1999_15
What will be the output of the following program assuming that parameter passing is call by value call by reference call by copy restore procedure P{x, y, z}; begin y:y+1; z: x+x end; begin a:= b:= 3; P(a+b, a, a); Print(a) end.

asked Sep 24, 2014 in Programming by Kathleen Veteran (66.2k points) | 444 views

+2 votes

2 answers

12

GATE1999_14
Show that the formula $\left[(\sim p \vee q) \Rightarrow (q \Rightarrow p)\right]$ is not a tautology. Let $A$ be a tautology and $B$ any other formula. Prove that $(A \vee B)$ is a tautology.

asked Sep 24, 2014 in Mathematical Logic by Kathleen Veteran (66.2k points) | 199 views

+5 votes

2 answers

13

GATE1999_13
An instruction pipeline consists of 4 stages – Fetch (F), Decode field (D), Execute (E) and Result Write (W). The 5 instructions in a certain instruction sequence need these stages for the different number of clock cycles as shown by the table below ... 1 3 2 4 1 3 2 1 5 1 2 1 2 Find the number of clock cycles needed to perform the 5 instructions.

asked Sep 24, 2014 in CO & Architecture by Kathleen Veteran (66.2k points) | 576 views

+5 votes

2 answers

14

GATE1999_12
In binary tree, a full node is defined to be a node with 2 children. Use induction on the height of the binary tree to prove that the number of full nodes plus one is equal to the number of leaves. Draw the min-heap that results from insertion of the ... empty min-heap: 7, 6, 5, 4, 3, 2, 1. Show the result after the deletion of the root of this heap.

asked Sep 24, 2014 in DS by Kathleen Veteran (66.2k points) | 382 views

+9 votes

1 answer

15

GATE1999_11a
Consider the following algorithms. Assume, procedure $A$ and procedure $B$ take $O (1)$ and $O(1/n)$ unit of time respectively. Derive the time complexity of the algorithm in $O$-notation. algorithm what (n) begin if n = 1 then call A else begin what (n-1); call B(n) end end.

asked Sep 23, 2014 in Algorithms by Kathleen Veteran (66.2k points) | 572 views

+3 votes

0 answers

16

GATE1999_10
Suppose we have a function HALTS which when applied to any arbitrary function $f$ and its arguments will say TRUE if function $f$ terminates for those arguments and FALSE otherwise. Example: Given the following function definition. FACTORIAL ... function like HALTS which for arbitrary functions and inputs says whether it will terminate on that input or not.

asked Sep 23, 2014 in Theory of Computation by Kathleen Veteran (66.2k points) | 175 views

+1 vote

0 answers

17

GATE1999_9
Let synthesized attribute val give the value of the binary number generated by S in the following grammar. For example, on input 101.101, S.val = 5.625. $S \rightarrow L.L \mid L$ $L \rightarrow LB \mid B$ $B \rightarrow 0 \mid 1$ Write S-attributed values corresponding to each of the productions to find S.val.

asked Sep 23, 2014 in Compiler Design by Kathleen Veteran (66.2k points) | 299 views

+7 votes

2 answers

18

GATE1999-8
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds 1st, 2nd and 3rd smallest elements in minimum number of comparisons.

asked Sep 23, 2014 in Algorithms by Kathleen Veteran (66.2k points) | 367 views

+8 votes

1 answer

19

GATE1999_7
Show that the language $$L = \left\{ xcx \mid x \in \left\{0,1\right\}^* \text{ and }c\text{ is a terminal symbol}\right\}$$ is not context free. $c$ is not $0$ or $1$.

asked Sep 23, 2014 in Theory of Computation by Kathleen Veteran (66.2k points) | 320 views

+8 votes

3 answers

20

GATE1999_6
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer. Given two finite automata $M1, M2$, outline an algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)

asked Sep 23, 2014 in Theory of Computation by Kathleen Veteran (66.2k points) | 328 views

+5 votes

5 answers

21

GATE1999_5
Let $G$ be a connected, undirected graph. A cut in $G$ is a set of edges whose removal results in $G$ being broken into two or more components, which are not connected with each other. The size of a cut is called its cardinality. A min- ... connected undirected graph $G$ with $n$ vertices has a min-cut of cardinality $k$, then $G$ has at least $(nk/2)$ edges

asked Sep 23, 2014 in Graph Theory by Kathleen Veteran (66.2k points) | 463 views

+1 vote

0 answers

22

GATE1999_4
Let $G$ be a finite group and $H$ be a subgroup of $G$. For $a \in G$, define $aH=\left\{ah \mid h \in H\right\}$. Show that $|aH| = |H|$ Show that for every pair of elements $a, b \in G$, either $aH = bH$ or $aH$ and $bH$ are disjoint Use the above to argue that the order of $H$ must divide the order of $G$

asked Sep 23, 2014 in Set Theory & Algebra by Kathleen Veteran (66.2k points) | 181 views

+11 votes

2 answers

23

GATE1999_2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above

asked Sep 23, 2014 in Databases by Kathleen Veteran (66.2k points) | 995 views

+7 votes

2 answers

24

GATE1999_2.24
Consider the following C function definition int Trial (int a, int b, int c) { if ((a>=b) && (c<b) return b; else if (a>=b) return Trial(a, c, b); else return Trial(b, a, c); } The functional Trial: Finds the maximum of a, b, and c Finds the minimum of a, b, and c Finds the middle number of a, b, c None of the above

asked Sep 23, 2014 in Algorithms by Kathleen Veteran (66.2k points) | 1.1k views

+9 votes

2 answers

25

GATE1999_2.23
A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor? Pointers Arrays Records Recursive procedures with local variable

asked Sep 23, 2014 in CO & Architecture by Kathleen Veteran (66.2k points) | 1.6k views

+4 votes

2 answers

26

GATE1999-2.22
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typically (a) has fewer instructions (b) has fewer addressing modes (c) has more registers (d) is easier to implement using hard-wired logic

asked Sep 23, 2014 in CO & Architecture by Kathleen Veteran (66.2k points) | 656 views

+11 votes

3 answers

27

GATE1999-2.21
If $T_1 = O(1)$, give the correct matching for the following pairs: (M) $T_n = T_{n-1} + n$ (U) $T_n = O(n)$ (N) $T_n = T_{n/2} + n$ (V) $T_n = O(n \log n)$ (O) $T_n = T_{n/2} + n \log n$ (W) $T = O(n^2)$ (P) $T_n = T_{n-1} + \log n$ (X) $T_n = O(\log^2 n)$ M-W N-V O-U P-X M-W N-U O-X P-V M-V N-W O-X P-U M-W N-U O-V P-X

asked Sep 23, 2014 in Algorithms by Kathleen Veteran (66.2k points) | 898 views

+1 vote

2 answers

28

GATE1999_2.19
Arrange the following configuration for CPU in decreasing order of operating speeds: Hard wired control, Vertical microprogramming, Horizontal microprogramming. Hard wired control, Vertical microprogramming, Horizontal ... Vertical microprogramming, Hard wired control. Vertical microprogramming, Horizontal microprogramming, Hard wired control.

asked Sep 23, 2014 in CO & Architecture by Kathleen Veteran (66.2k points) | 567 views

+8 votes

4 answers

29

GATE1999_2.18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density A & B

asked Sep 23, 2014 in Operating System by Kathleen Veteran (66.2k points) | 1.5k views

+7 votes

3 answers

30

GATE1999_2.17
Zero has two representations in Sign magnitude 2's complement 1's complement None of the above

asked Sep 23, 2014 in Digital Logic by Kathleen Veteran (66.2k points) | 924 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged gate1999

Recent Posts

Recent Blog Comments

Recent Badges