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 Vikrant Singh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Vikrant Singh
12
votes
1
GATE CSE 2013 | Question: 51
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are supplied in array $oldc$, while their respective replacement characters are supplied in array $newc$. ... will be successful in exposing the flaw in this procedure? None $2$ only $3$ and $4$ only $4$ only
answered
in
DS
Jul 5, 2019
4.2k
views
gatecse-2013
data-structures
array
normal
119
votes
2
GATE CSE 2004 | Question: 64
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$
answered
in
CO and Architecture
Apr 29, 2016
16.0k
views
gatecse-2004
co-and-architecture
machine-instructions
normal
72
votes
3
GATE CSE 2006 | Question: 72
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in $G$ is: $\binom{\frac{n}{2}}{2}.2^{\frac{n}{2}}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$
answered
in
Graph Theory
Apr 29, 2016
14.8k
views
gatecse-2006
graph-theory
normal
degree-of-graph
54
votes
4
GATE CSE 2006 | Question: 73
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in $G$ is: $n$ $n + 2$ $2^{\frac{n}{2}}$ $\frac{2^{n}}{n}$
answered
in
Graph Theory
Apr 29, 2016
6.6k
views
gatecse-2006
graph-theory
normal
graph-connectivity
10
votes
5
GATE CSE 2015 Set 2 | Question: 7
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.
answered
in
Digital Logic
Feb 26, 2015
30.8k
views
gatecse-2015-set2
digital-logic
digital-counter
normal
numerical-answers
8
votes
6
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
answered
in
Algorithms
Feb 13, 2015
13.0k
views
gatecse-2015-set2
algorithms
normal
sorting
18
votes
7
GATE CSE 2015 Set 2 | Question: 47
A computer system implements $8\;\text{kilobyte}$ pages and a $32\text{-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is $24\;\text{megabytes}$, the length of the virtual address supported by the system is _______ bits.
answered
in
Operating System
Feb 13, 2015
14.7k
views
gatecse-2015-set2
operating-system
virtual-memory
normal
numerical-answers
40
votes
8
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
answered
in
Digital Logic
Feb 13, 2015
36.1k
views
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
2
votes
9
GATE CSE 2015 Set 2 | Question: 49
Consider a typical disk that rotates at $15000$ rotations per minute (RPM) and has a transfer rate of $50 \times 10^6$ ... the disk transfer time, the average time (in milliseconds) to read or write a $512$-byte sector of the disk is _____
answered
in
Operating System
Feb 13, 2015
14.2k
views
gatecse-2015-set2
operating-system
disk
normal
numerical-answers
38
votes
10
GATE CSE 2015 Set 2 | Question: 50
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true? A tree has no bridges A bridge cannot be part of a simple cycle Every edge of a clique with size $\geq 3$ is a bridge (A clique is any complete subgraph of a graph) A graph with bridges cannot have cycle
answered
in
Graph Theory
Feb 13, 2015
11.9k
views
gatecse-2015-set2
graph-theory
graph-connectivity
easy
50
votes
11
GATE CSE 2015 Set 2 | Question: 51
Which of the following is/are regular languages? $L_1: \left\{ wxw^R \mid w, x \in \{a, b\} ^* \text{ and } |w|, |x| > 0\right\}, w^R \text{ is the reverse of string } w$ $L_2: \left\{ a^nb^m \mid m \neq n \text { and } m, n \geq 0 \right\}$ $L_3: \left\{ a^pb^qc^r \mid p, q, r \geq 0 \right\}$ $L_1$ and $L_3$ only $L_2$ only $L_2$ and $L_3$ only $L_3$ only
answered
in
Theory of Computation
Feb 13, 2015
9.1k
views
gatecse-2015-set2
theory-of-computation
normal
regular-language
121
votes
12
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
answered
in
Computer Networks
Feb 13, 2015
18.6k
views
gatecse-2015-set2
computer-networks
ip-packet
normal
53
votes
13
GATE CSE 2015 Set 2 | Question: 54
Let $X$ and $Y$ denote the sets containing $2$ and $20$ distinct objects respectively and $F$ denote the set of all possible functions defined from $X$ to $Y$. Let $f$ be randomly chosen from $F$. The probability of $f$ being one-to-one is ______.
answered
in
Set Theory & Algebra
Feb 13, 2015
6.4k
views
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
45
votes
14
GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
answered
in
Mathematical Logic
Feb 13, 2015
14.9k
views
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
10
votes
15
GATE CSE 2015 Set 2 | Question: 33
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$? $h(i) = i^2 \text{mod } 10$ $h(i) = i^3 \text{mod } 10$ $h(i) = (11 \ast i^2) \text{mod } 10$ $h(i) = (12 \ast i^2) \text{mod } 10$
answered
in
DS
Feb 12, 2015
13.7k
views
gatecse-2015-set2
data-structures
hashing
normal
5
votes
16
GATE CSE 2015 Set 2 | Question: 32
Consider two relations $R_1(A,B)$ with the tuples $(1,5), (3,7)$ and $R_2(A,C) = (1,7),(4,9)$. Assume that $R(A,B,C)$ is the full natural outer join of $R_1$ and $R_2$. Consider the following tuples of the form $(A,B,C):$ ... contains all $a, b, c, d, e, f, g$. $R$ contains $e, f, g$ but not $a, b$. $R$ contains $e$ but not $f, g$.
answered
in
Databases
Feb 12, 2015
6.8k
views
gatecse-2015-set2
databases
normal
natural-join
2
votes
17
GATE CSE 2015 Set 2 | Question: 31
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be any entry to the right of, or below a $\infty$. The following Young tableau ... The minimum number of entries (other than $1$) to be shifted, to remove $1$ from the given Young tableau is _____.
answered
in
DS
Feb 12, 2015
9.6k
views
gatecse-2015-set2
databases
array
normal
numerical-answers
9
votes
18
GATE CSE 2015 Set 2 | Question: 30
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{KB}$refers to $\text{kilobyte}$. These partitions need to be allotted to four processes of ... and $250$ $\text{KB}$ $250$ $\text{KB}$ and $300$ $\text{KB}$ $300$ $\text{KB}$ and $400$ $\text{KB}$
answered
in
Operating System
Feb 12, 2015
5.8k
views
gatecse-2015-set2
operating-system
memory-management
easy
113
votes
19
GATE CSE 2015 Set 2 | Question: 22
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
answered
in
Algorithms
Feb 12, 2015
13.7k
views
gatecse-2015-set2
algorithms
time-complexity
easy
54
votes
20
GATE CSE 2015 Set 2 | Question: 24
Assume that for a certain processor, a read request takes $50\:\text{nanoseconds}$ on a cache miss and $5\:\text{nanoseconds}$ on a cache hit. Suppose while running a program, it was observed that $80\%$ of the processor's read requests result in a cache hit. The average read access time in nanoseconds is ______.
answered
in
CO and Architecture
Feb 12, 2015
11.3k
views
gatecse-2015-set2
co-and-architecture
cache-memory
easy
numerical-answers
71
votes
21
GATE CSE 2015 Set 2 | Question: 25
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}$ organized into $32$ sets each having $4$ ways. Assume that the $\text{TLB}$ tag does not store any process id. The minimum length of the $\text{TLB}$ tag in bits is ______.
answered
in
Operating System
Feb 12, 2015
17.4k
views
gatecse-2015-set2
operating-system
virtual-memory
easy
numerical-answers
12
votes
22
GATE CSE 2015 Set 2 | Question: 26
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[-1, 1]$ $f$ is not bounded in $[-1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
answered
in
Calculus
Feb 12, 2015
13.5k
views
gatecse-2015-set2
continuity
functions
normal
26
votes
23
GATE CSE 2015 Set 2 | Question: 27
Perform the following operations on the matrix $\begin{bmatrix} 3 & 4 & 45 \\ 7 & 9 & 105 \\ 13 & 2 & 195 \end{bmatrix}$ Add the third row to the second row Subtract the third column from the first column. The determinant of the resultant matrix is _____.
answered
in
Linear Algebra
Feb 12, 2015
5.4k
views
gatecse-2015-set2
linear-algebra
matrix
easy
numerical-answers
58
votes
24
GATE CSE 2015 Set 2 | Question: 28
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.
answered
in
Graph Theory
Feb 12, 2015
7.2k
views
gatecse-2015-set2
graph-theory
graph-isomorphism
out-of-syllabus-now
54
votes
25
GATE CSE 2015 Set 2 | Question: 15
Consider the following function written in the C programming langauge : void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } } The output of the above function on input "$ABCD \ EFGH$" is $ABCD \ EFGH$ $ABCD$ $HGFE \ DCBA$ $DCBA$
answered
in
Programming
Feb 12, 2015
11.5k
views
gatecse-2015-set2
programming
programming-in-c
normal
59
votes
26
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
answered
in
DS
Feb 12, 2015
12.0k
views
gatecse-2015-set2
data-structures
heap
normal
6
votes
27
GATE CSE 2015 Set 2 | Question: 4
A software requirements specification (SRS) document should avoid discussing which one of the following? User interface issues Non-functional requirements Design specification Interfaces with third party software
answered
in
IS&Software Engineering
Feb 12, 2015
6.2k
views
gatecse-2015-set2
is&software-engineering
normal
non-gate
4
votes
28
GATE CSE 2015 Set 2 | Question: GA-5
Based on the given statements, select the most appropriate option to solve the given question. What will be the total weight of $10$ poles each of same weight? Statements: One fourth of the weight of the pole is $5\;\text{Kg}$. The ... Statement II alone is not sufficient. Either I or II alone is sufficient. Both statements I and II together are not sufficient.
answered
in
Verbal Aptitude
Feb 12, 2015
2.5k
views
gatecse-2015-set2
normal
logical-reasoning
statement-sufficiency
1
vote
29
GATE FEB7 EVN
1) A 2) B 3) C 4) D
answered
in
Programming
Feb 11, 2015
319
views
hashing
2
votes
30
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
answered
in
Algorithms
Feb 7, 2015
16.4k
views
gatecse-2015-set2
algorithms
identify-function
recurrence-relation
normal
numerical-answers
Page:
1
2
3
next »
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
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
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...