Dark Mode

Most viewed questions

9 votes

1 answer

1

How to find number of swappings in bubble sort in least possible time ( any shortcut available )
1. The number of swappings needed to sort the numbers: 8, 22, 7, 9, 31, 19, 5, 13 in ascending order using bubble sort is- (a) 11 (b) 12 (c) 13 (d) 14 I know how to solve it using ... I did was to write every pass and check the swappings. But , it takes too much time. Is there any shortcut possible ?

worst_engineer asked in Algorithms Aug 2, 2015

by worst_engineer

143k views

1 vote

7 answers

2

The maximum number of nodes on level i of a binary tree
Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is In the following answers, the operator '^' indicates power a) 2^i-1 b)2^i c)2^i+1 d)2^(i+1/2)

Akanksha Kesarwani asked in DS Jan 16, 2016

by Akanksha Kesarwani

91.1k views

18 votes

1 answer

3

GATE CSE 1995 | Question: 20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms ... Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.

Kathleen asked in Operating System Oct 8, 2014

86.6k views

4 votes

2 answers

4

Pankaj and Mythili were both asked to write the code to evaluate the following expression
Pankaj and Mythili were both asked to write the code to evaluate the following expression: $a - b + c/(a-b) + (a-b)^2 $ Pankaj writes the following code statements (Code A): print (a-b) + c/(a-b) ... Code B Code A uses more memory and is faster than Code B Code A uses more memory and is slower than Code B

Arjun asked in Compiler Design Aug 31, 2014

by Arjun

79.7k views

67 votes

4 answers

5

Minimum NAND/NOR Gates - Realization for ExOR,ExNor,Adder,Subtractor
Minimum No of Gates NAND/NOR Ex-OR Ex-Nor Half Adder Half Subtractor Full Adder Full Subtractor NAND ? ? ? ? ? ? NOR ? ? ? ? ? ?

bahirNaik asked in Digital Logic Dec 18, 2015

77.7k views

17 votes

2 answers

6

How to construct an automata with even number of a's and odd number of b's?
The alphabets are a and b. Construct a DFA

Gourab_Classic asked in Theory of Computation Mar 14, 2016

by Gourab_Classic

76.5k views

3 votes

4 answers

7

NIELIT 2016 DEC Scientist B (CS) - Section B: 16
Two main measures for the efficiency of an algorithm are: Processor and Memory Complexity and Capacity Time and Space Data and Space

Lakshman Patel RJIT asked in Algorithms Mar 31, 2020

by Lakshman Patel RJIT

74.6k views

14 votes

6 answers

8

Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC A . AB B . B'C C . AB+(A'+AB')C D . AB'+BC+B'C'

shekhar chauhan asked in Digital Logic Jun 30, 2016

by shekhar chauhan

65.4k views

229 votes

13 answers

9

GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$

Kathleen asked in Operating System Sep 12, 2014

62.1k views

126 votes

18 answers

10

GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______

Madhav asked in Databases Feb 14, 2017

by Madhav

56.2k views

42 votes

4 answers

11

GATE CSE 2001 | Question: 2.21
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table? $\text{16 MB}$ $\text{8 MB}$ $\text{2 MB}$ $\text{24 MB}$

Kathleen asked in Operating System Sep 15, 2014

51.2k views

43 votes

4 answers

12

GATE CSE 2006 | Question: 52
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$

Rucha Shelke asked in Algorithms Sep 26, 2014

by Rucha Shelke

50.6k views

124 votes

18 answers

13

GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$

gatecse asked in CO and Architecture Sep 5, 2014

50.5k views

76 votes

14 answers

14

GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

go_editor asked in Algorithms Sep 28, 2014

45.5k views

106 votes

19 answers

15

GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.

Sandeep Singh asked in Digital Logic Feb 12, 2016

by Sandeep Singh

44.4k views

11 votes

3 answers

16

relation
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$

Lakshman Patel RJIT asked in Set Theory & Algebra Dec 27, 2017

by Lakshman Patel RJIT

44.0k views

8 votes

2 answers

17

please tell the multiplication of (+15 X -13) Through the Booth Multiplication Algo.
..

LavTheRawkstar asked in CO and Architecture Jun 19, 2016

by LavTheRawkstar

43.8k views

114 votes

6 answers

18

GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$

Kathleen asked in Databases Sep 15, 2014

43.3k views

22 votes

1 answer

19

gate rank prediction
Hi i just want to ask if i am scoring 40 to 45% marks in made easy FLT s and my rank is near about 200 -250 where 1000 students have appeared what could be my gate rank as per previous year student experiences? a silly q though but i wnt to know!

Aboveallplayer asked in Others Jan 17, 2016

by Aboveallplayer

42.4k views

31 votes

6 answers

20

GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$

Kathleen asked in Algorithms Oct 8, 2014

41.8k views

Page:

1
2
3
4
5
6
...
2941
next »