Recent activity by Ramij - GATE Overflow

0 answers

1

#job query
I got 48 marks and 555 score in gate 2019 . What should i do next? Please suggest if I have a chance to get admission any good NITs / getting job any of PSU or should I drop one year and prepare and score better next year . ( I am a final year student ).

asked Mar 16 in NITs | 125 views

1 answer

2

Gate cse 2019
A certain processor deploy a single level-cache, the cache block size is 8 words, word size is 4 bytes, memory system uses 60mHz clock, to service a cache miss, the memory controller first takes 1 clock cycle to accept starting address of the block, ... bandwidth for the memory system when the program on the processor issues a series of read operation is _____________( yt s s )

commented Feb 5 in CO and Architecture | 962 views

2 answers

3

GATE2019
What is the total number of different Hamiltonian cycles for the complete graph of n vertices?

commented Feb 4 in Graph Theory | 832 views

0 answers

4

#madeeasy test series
What is the good score in full length test series advance in madeeasy ??

commented Jan 16 in Study Resources | 318 views

11 answers

5

GATE2004-82
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program fragment written in a C like language: counter = 0; for (i=1; i<=n; i++) { if a[i] == 1) ... ;} } The complexity of this program fragment is $\Omega(n^2)$ $\Omega (n\log n) \text{ and } O(n^2)$ $\Theta(n)$ $o(n)$

commented Jan 14 in Algorithms | 6.2k views

0 answers

6

#psu_job
What is the minimum marks for gate cse 2019 that i get any of psu job ?

asked Jan 11 in Job Queries | 183 views

0 answers

7

made easy test
How many concurrent schedules are conflict serializable of given transactions T1 and T2:

commented Jan 9 in Databases | 32 views

0 answers

8

Strongly connected components
Consider the following graph: The number of strongly connected components of the graph are ________.

commented Jan 9 in Algorithms | 185 views

0 answers

9

MadeEasy Full Length Test: Combinatory - Recurrence
What’s the trick to do it under 2 min here?

commented Jan 8 in Combinatory | 268 views

6 answers

10

GATE2013-45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... taken during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$

commented Jan 1 in CO and Architecture | 14k views

0 answers

11

MadeEasy Test Series: Programming & DS - Arrays

commented Dec 29, 2018 in Programming | 148 views

3 answers

12

MadeEasy Test Series: Operating System - Memory Management

answer selected Dec 26, 2018 in Operating System | 173 views

1 answer

13

multilevel paging

answered Dec 26, 2018 in Operating System | 160 views

0 answers

14

madeeasy OS 2019- Memory overhead multilevel paging
for memory overhead in Multi level paging, for innermost table only 1 page size shall be counted na? and NOT the complete page table size? please explain the concept, thanks!

commented Dec 26, 2018 in Operating System | 242 views

1 answer

15

MadeEasy Subject Test 2019: Algorithms - Sorting

answer selected Dec 21, 2018 in Algorithms | 107 views

1 answer

16

MadeEasy Subject Test 2019: Algorithms - Time Complexity
O($n^2$) O(n) O(nlogn) O($n(logn)^2$

commented Dec 21, 2018 in Algorithms | 116 views

1 answer

17

MadeEasy Subject Test 2019: Theory Of Computation - Finite Automata

commented Dec 19, 2018 in Theory of Computation | 120 views

4 answers

18

GATE2014-2-16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ is recursive. If $A\: \leq_m B$ ... enumerable then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.

commented Oct 31, 2018 in Theory of Computation | 4.6k views

5 answers

19

GATE2013-30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$

answered Oct 22, 2018 in Algorithms | 8.3k views

6 answers

20

GATE2010-12
Two alternative packages $A$ and $B$ are available for processing a database having $10^k$ records. Package $A$ requires $0.0001 n^2$ time units and package $B$ requires $10n\log_{10} n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$

answered Oct 21, 2018 in Algorithms | 3.6k views

4 answers

21

GATE2014-1-10
Consider the following program in C language: #include <stdio.h> main() { int i; int*pi = &i; scanf("%d",pi); printf("%d\n", i+5); } Which one of the following statements is TRUE? Compilation fails. Execution results in a run- ... is $5$ more than the address of variable $i$. On execution, the value printed is $5$ more than the integer value entered.

commented Sep 22, 2018 in Programming | 3.8k views

5 answers

22

GATE2013-29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having 16384 cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing format is < ... the cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$

commented Sep 19, 2018 in Operating System | 8.2k views

5 answers

23

GATE2014-1-31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. Here, the ... REQ1 can be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.

commented Sep 18, 2018 in Operating System | 4.6k views

6 answers

24

GATE2007-63, ISRO2016-59
The order of a leaf node in a B$^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K$ $bytes$, data record pointer is $7$ $bytes$ long, the value field is $9$ $bytes$ long and a block pointer is $6$ $bytes$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$

commented Sep 8, 2018 in Databases | 9.2k views

9 answers

25

GATE2014-2-33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of the following ... faults as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used

commented Aug 19, 2018 in Operating System | 8.3k views

1 answer

26

GATE2015 EC-3: GA-8
From a circular sheet of paper of radius $30$ cm, a sector of $10\%$ area is removed. If the remaining part is used to make a conical surface, then the ratio of the radius and height of the cone is _____

commented Aug 17, 2018 in Numerical Ability | 2.3k views

5 answers

27

GATE2005-42
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE? $R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence relations $R$ $∪$ $S$ is an equivalence relation $R$ $∩$ $S$ is an equivalence relation Neither $R$ $∪$ $S$ nor $R$ $∩$ $S$ are equivalence relations

commented Jul 9, 2018 in Set Theory & Algebra | 2k views

4 answers

28

GATE2013 AE: GA-1
If $3 \leq X \leq 5$ and $8 \leq Y \leq 11$ then which of the following options is TRUE? $\left(\dfrac{3}{5} \leq \dfrac{X}{Y} \leq \dfrac{8}{5}\right)$ $\left(\dfrac{3}{11} \leq \dfrac{X}{Y} \leq \dfrac{5}{8}\right)$ $\left(\dfrac{3}{11} \leq \dfrac{X}{Y} \leq \dfrac{8}{5}\right)$ $\left(\dfrac{3}{5} \leq \dfrac{X}{Y} \leq \dfrac{8}{11}\right)$

commented Jul 6, 2018 in Numerical Ability | 650 views

1 answer

29

GATE2013-35
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? Find the distinct names of all students ... I, II, III and IV I, II and III only I, II and IV only II, III and IV only

commented Jul 5, 2018 in Databases | 3.9k views

4 answers

30

GATE2008-IT-75
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. { ... other schools with a pass percentage above 35% over all exams taken together schools with a pass percentage above 35% over each exam

commented Jul 5, 2018 in Databases | 4.1k views

6 answers

31

GATE2006-67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank 1. Ties are not broke but ranks are skipped: if ... assigning ranks using ODBC. Which two of the above statements are correct? 2 and 5 1 and 3 1 and 4 3 and 5

commented Jul 5, 2018 in Databases | 6.6k views

3 answers

32

GATE2014-3-10
Let $A$ be the square matrix of size $n \times n$. Consider the following pseudocode. What is the expected output? C=100; for i=1 to n do for j=1 to n do { Temp = A[i][j]+C; A[i][j] = A[j][i]; A[j][i] = Temp -C; } ... matrix $A$ itself Transpose of the matrix $A$ Adding $100$ to the upper diagonal elements and subtracting $100$ from lower diagonal elements of $A$ None of the above

commented Dec 21, 2017 in Algorithms | 2.8k views

6 answers

33

GATE2014-2-34
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 = t3 + t2 ... is declared as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .

commented Oct 13, 2017 in Compiler Design | 6.8k views

50,645 questions

56,616 answers

195,897 comments

102,353 users