Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Ramij
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ramij
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
in
NITs
Mar 16, 2019
421
views
job
psu
iit
11
answers
2
GATE CSE 2019 | Question: 45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec.
commented
in
CO and Architecture
Feb 5, 2019
15.9k
views
gatecse-2019
numerical-answers
co-and-architecture
cache-memory
2-marks
2
answers
3
GATE2019
What is the total number of different Hamiltonian cycles for the complete graph of n vertices?
commented
in
Graph Theory
Feb 4, 2019
1.3k
views
0
answers
4
#madeeasy test series
What is the good score in full length test series advance in madeeasy ??
commented
in
Study Resources
Jan 16, 2019
1.8k
views
13
answers
5
GATE CSE 2004 | Question: 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 ( ... The complexity of this program fragment is $\Omega(n^2)$ $\Omega (n\log n) \text{ and } O(n^2)$ $\Theta(n)$ $o(n)$
commented
in
Algorithms
Jan 14, 2019
16.1k
views
gatecse-2004
algorithms
time-complexity
normal
0
answers
6
#psu_job
What is the minimum marks for gate cse 2019 that i get any of psu job ?
asked
in
Job Queries
Jan 11, 2019
433
views
psu
job
0
answers
7
made easy test
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
commented
in
Databases
Jan 9, 2019
125
views
0
answers
8
Strongly connected components
Consider the following graph: The number of strongly connected components of the graph are ________.
commented
in
Algorithms
Jan 9, 2019
2.0k
views
algorithms
graph-algorithms
0
answers
9
MadeEasy Full Length Test: Combinatory - Recurrence
What’s the trick to do it under 2 min here?
commented
in
Combinatory
Jan 8, 2019
863
views
made-easy-test-series
recurrence-relation
9
answers
10
GATE CSE 2013 | Question: 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 ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
commented
in
CO and Architecture
Jan 1, 2019
39.8k
views
gatecse-2013
normal
co-and-architecture
pipelining
1
answer
11
MadeEasy Test Series: Programming & DS - Arrays
In a lower triangular matrices (size 15 x 15) representation of compact single dimensional array, non-zero elements (i.e. elements of the lower triangle) of each row are stored one after another, starting from the first row. Assume each ... a[10] [6] is______ B. [Note: Only lower triangular elements of the matrix are stored in contiguous array]
commented
in
Programming
Dec 29, 2018
2.0k
views
made-easy-test-series
data-structures
array
3
answers
12
MadeEasy Test Series: Operating System - Memory Management
answer selected
in
Operating System
Dec 26, 2018
643
views
made-easy-test-series
operating-system
memory-management
paging
1
answer
13
multilevel paging
answered
in
Operating System
Dec 26, 2018
559
views
paging
multilevel-paging
memory-management
operating-system
1
answer
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
in
Operating System
Dec 26, 2018
1.1k
views
multilevel-paging
paging
operating-system
memory-management
4
answers
15
MadeEasy Subject Test 2019: Algorithms - Sorting
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst case using an efficient algorithm are
answer selected
in
Algorithms
Dec 21, 2018
1.4k
views
made-easy-test-series
algorithms
sorting
merge-sort
1
answer
16
MadeEasy Subject Test 2019: Algorithms - Time Complexity
O($n^2$) O(n) O(nlogn) O($n(logn)^2$
commented
in
Algorithms
Dec 21, 2018
801
views
made-easy-test-series
algorithms
time-complexity
4
answers
17
ME test series DFA states
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right?
commented
in
Theory of Computation
Dec 19, 2018
814
views
theory-of-computation
number-of-states
minimal-state-automata
4
answers
18
GATE CSE 2014 Set 2 | Question: 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$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.
commented
in
Theory of Computation
Oct 31, 2018
14.6k
views
gatecse-2014-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
normal
8
answers
19
GATE CSE 2013 | Question: 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
in
Algorithms
Oct 22, 2018
23.3k
views
gatecse-2013
algorithms
sorting
normal
heap-sort
6
answers
20
GATE CSE 2010 | Question: 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
in
Algorithms
Oct 21, 2018
9.4k
views
gatecse-2010
algorithms
time-complexity
easy
5
answers
21
GATE CSE 2014 Set 1 | Question: 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 ... $5$ more than the address of variable $i$. On execution, the value printed is $5$ more than the integer value entered.
commented
in
Programming
Sep 22, 2018
13.7k
views
gatecse-2014-set1
programming
programming-in-c
easy
pointers
10
answers
22
GATE CSE 2013 | Question: 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 ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
commented
in
Operating System
Sep 19, 2018
23.0k
views
gatecse-2013
operating-system
disk
normal
5
answers
23
GATE CSE 2014 Set 1 | Question: 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 ... be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.
commented
in
Operating System
Sep 18, 2018
17.2k
views
gatecse-2014-set1
operating-system
resource-allocation
normal
6
answers
24
GATE CSE 2007 | Question: 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\;\text{bytes}$, data record pointer is $7\;\text{bytes}$ long, the value field is $9\;\text{bytes}$ long and a block pointer is $6 \;\text{bytes}$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$
commented
in
Databases
Sep 8, 2018
19.4k
views
gatecse-2007
databases
b-tree
normal
isro2016
10
answers
25
GATE CSE 2014 Set 2 | Question: 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 ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used
commented
in
Operating System
Aug 19, 2018
22.3k
views
gatecse-2014-set2
operating-system
page-replacement
ambiguous
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
in
Quantitative Aptitude
Aug 17, 2018
5.4k
views
gate2015-ec-3
geometry
quantitative-aptitude
normal
4
answers
27
GATE CSE 2005 | Question: 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
in
Set Theory & Algebra
Jul 9, 2018
7.4k
views
gatecse-2005
set-theory&algebra
normal
relations
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
in
Quantitative Aptitude
Jul 6, 2018
3.0k
views
gate2013-ae
quantitative-aptitude
ratio-proportion
normal
2
answers
29
GATE CSE 2013 | Question: 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 ... I, II, III and IV I, II and III only I, II and IV only II, III and IV only
commented
in
Databases
Jul 5, 2018
12.3k
views
gatecse-2013
databases
sql
relational-calculus
normal
5
answers
30
GATE IT 2008 | Question: 75
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... schools with a pass percentage above $35\%$ over all exams taken together schools with a pass percentage above $35\%$ over each exam
commented
in
Databases
Jul 5, 2018
10.9k
views
gateit-2008
databases
relational-calculus
normal
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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 Posts
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Sorry to break the news, but: I see a few flaws...
bhai mujhe bhi bula lo australia......mai bhi...
I see no inspiration here. Not everyone is...
Yaa toa intentionally bohot jyada sahi time kiya...
Man, I feel you! I left my job to do gate this...