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 akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by akash.dinkar12
5
votes
31
Test by Bikram | Mock GATE | Test 4 | Question: 17
Let the set of all natural numbers be $N$. Which of the following are countable sets? The set of all functions from $N$ to $\{0, 1\}$ The set of all functions from $\{0, 1\}$ to $N$ The largest subset of $N$ I, II, and III I and II only II and III only I and III only
answered
in
Set Theory & Algebra
Aug 2, 2017
438
views
tbb-mockgate-4
discrete-mathematics
set-theory&algebra
set-theory
countable-uncountable-set
2
votes
32
Test by Bikram | Mock GATE | Test 4 | Question: 11
The number $0.085$ represented in $IEEE-754$ single-precision format will be: $0 01111011 01111100001010001111011$ $0 01111011 01011100001010001111011$ $0 01111011 01010100001010000111011$ $0 01111011 01111100001010001111011$
answered
in
GATE
Aug 2, 2017
579
views
tbb-mockgate-4
digital-logic
number-system
ieee-representation
2
votes
33
Test by Bikram | Mock GATE | Test 4 | Question: 9
If $L$ is the set of all strings over $\{ x,y\}$ containing at least one $x$, then which of the following regular expressions does not generate $L$? $(x+y)^* x(y+y)^*$ $y^*x ( x+y)^*$ $( x+y)^* x$ $( x+y)^* xy^*$
answered
in
Theory of Computation
Aug 1, 2017
390
views
tbb-mockgate-4
theory-of-computation
regular-expression
3
votes
34
Test by Bikram | Mock GATE | Test 4 | Question: 7
Consider the following statements: $S_1$: If a STACK is implemented through a LINKED LIST, $\text{PUSH}$ operation will take $O\left ( 1 \right )$ time and $\text{POP}$ operation will take $O\left ( n \right )$ time. $S_2$: If a QUEUE ... $S_1$ is correct. Only $S_2$ is correct. Neither $S_1$ nor $S_2$ is correct. Both $S_1$ and $S_2$ are correct.
answered
in
DS
Aug 1, 2017
759
views
tbb-mockgate-4
data-structures
stack
queue
8
votes
35
Test by Bikram | Mock GATE | Test 4 | Question: 8
Consider an unweighted undirected graph connected with $n$' vertices and $m$' edges. What is the worst case time complexity to check if two particular vertices $x$' and $y$' are present in graph; and, if present, how is the minimum distance between them calculated? ... $O\left ( n \right )$ $O\left ( n\log n \right )$ $O\left ( n+m \right )$
answered
in
Algorithms
Aug 1, 2017
1.1k
views
tbb-mockgate-4
algorithms
time-complexity
graph-algorithms
2
votes
36
Test by Bikram | Mock GATE | Test 4 | Question: 5
The time complexity of the best known algorithm to find $p^{th}$ ${\left ( p<n \right )}$ smallest element from a $minheap$ of $n$ elements is _______. $\Theta\left ( p\log p \right )$ $\Theta\left ( p\log n \right )$ $\Theta\left ( pn \right )$ $\Theta\left ( n\log p \right )$
answered
in
DS
Aug 1, 2017
879
views
tbb-mockgate-4
time-complexity
binary-heap
10
votes
37
Test by Bikram | Mock GATE | Test 4 | Question: 4
Consider a sorted array of $p$ numbers. What would be the time complexity of the best known algorithm to find a pair $x$ and $y$ such that $\left | x-y \right |$ $=$ $m$ (where $m$ is a positive integer) ? $O$\left ( \log p \right )$ $ ... \right )$ $O$\left ( p^{2} \right )$ $O$\left ( p\log p \right )$but not in $O$\left ( p \right )$
answered
in
Algorithms
Aug 1, 2017
486
views
tbb-mockgate-4
algorithms
greedy-algorithm
4
votes
38
Test by Bikram | Mock GATE | Test 4 | Question: 29
The value of $ f + g $ in the above circuit is: $x{}'y + x{}'z + yz + yz{}'$ $x{}'y + x{}'z + y{}'z'+ y{}'z$ $x{}'y + y{}'z{}' + yz + x{}'z$ $xy + y{}'z{}'+ x{}'z + yz$
answered
in
Digital Logic
Aug 1, 2017
424
views
tbb-mockgate-4
digital-logic
multiplexer
circuit-output
2
votes
39
Test by Bikram | Mock GATE | Test 4 | Question: 38
In a height balanced binary search tree, the heights of the left and right descendants of any node differ at most by $1.$ Which of the following statements are TRUE for such kind of tree? Worst case search time is logarithmic in the number of nodes. ... is logarithmic in the number of nodes. II and IV only I, II and IV I and III only I, III and IV
answered
in
DS
Aug 1, 2017
415
views
tbb-mockgate-4
data-structures
avl-tree
binary-search-tree
5
votes
40
Test by Bikram | Mock GATE | Test 4 | Question: 22
What is the technique that allows one to execute a program which is not entirely in memory called? Demand Paging Auxiliary Memory Secondary Memory Virtual Memory
answered
in
Operating System
Aug 1, 2017
419
views
tbb-mockgate-4
operating-system
memory-management
virtual-memory
demand-paging
4
votes
41
Test by Bikram | Mock GATE | Test 4 | Question: 12
A machine has $24$ $bit$ instruction format. It has $32$ registers and each of which is $32$ $bits$ long. It needs to support $49$ instructions. Each instruction has two register operands and one immediate operand. If ... operand is signed integer represented in $2${}'$s$ complement form, the minimum value of immediate operand is _________.
answered
in
CO and Architecture
Aug 1, 2017
394
views
tbb-mockgate-4
numerical-answers
co-and-architecture
instruction-format
4
votes
42
Test by Bikram | Mock GATE | Test 4 | Question: 13
Consider an initially empty hash table of length $10$. Following set of keys are inserted using open addressing with hash function $h\left ( k \right )=k\mod 10$ and linear probing. $2$, $13$, $24$, $12$, $62$, $73$, $82$, $91$ The number of probes done while searching for element $82$ is __________.
answered
in
DS
Aug 1, 2017
377
views
tbb-mockgate-4
numerical-answers
data-structures
algorithms
hashing
4
votes
43
Test by Bikram | Mock GATE | Test 4 | Question: 6
Consider the below $C$ code: #include<stdio.h> int main() { char a[] = "gateoverflow"; char *p = a; printf("%s", p+p[3]-p[1]); } The output will be : gate eoverflow overflow Garbage error
answered
in
Programming in C
Aug 1, 2017
258
views
tbb-mockgate-4
programming
programming-in-c
2
votes
44
Test by Bikram | Mock GATE | Test 4 | Question: 36
Which of the following statements is/are CORRECT? $S_1$: Max term is a sum term which contains all the variables in either direct or complementary form. $S_2$: Min term is a product term which contains all the variables in either direct or ... $S_3$ is correct only $S_2$ is correct All $S_1$, $S_2$ and $S_3$ are correct
answered
in
Digital Logic
Aug 1, 2017
449
views
tbb-mockgate-4
digital-logic
simplification
min-sum-of-products-form
13
votes
45
Test by Bikram | Mock GATE | Test 4 | Question: 40
Consider the below program : #include <stdio.h> void fun (int[0][3]); int main(void) { int k[3][3]= {{1,2,3}, {4,5,6},{7,8,9}}; fun(k); printf("%d\n", k[2][1]); return 0; } void fun(int p[][3]) { ++p; p[1][1] = 9; } The output of the above program is : ______.
answered
in
Programming in C
Aug 1, 2017
385
views
tbb-mockgate-4
numerical-answers
programming-in-c
array
1
vote
46
Test by Bikram | Mock GATE | Test 4 | Question: 48
Which kind of connection between the client and server is opened by $\text{TCP?}$ One-way Symmetric Connection One-way Asymmetric Connection Two-way Symmetric Connection Two-way Asymmetric Connection
answered
in
Computer Networks
Aug 1, 2017
376
views
tbb-mockgate-4
computer-networks
transport-layer
tcp
2
votes
47
Test by Bikram | Mock GATE | Test 4 | Question: 49
Consider a disk with these parameters: Number of surfaces $= 32$ Number of tracks / surface $= 64$ Number of sectors / track $= 1024$ Number of bytes stored in a bit serial manner in a sectors $= 256$ Let the capacity of the ... required to specify a particular sector in that disk be $`M'$ bits. The value of $L+5M$, therefore, is __________.
answered
in
Operating System
Aug 1, 2017
334
views
tbb-mockgate-4
numerical-answers
operating-system
disk
3
votes
48
Test by Bikram | Mock GATE | Test 4 | Question: 44
Which of the following regular expressions describes the same set of strings as $\left ( a^*+b \right )^*$ $\left ( c+d \right )$? $a^{\ast }\left ( c+d \right )^{\ast } + b$ $\left ( a^{\ast }+b \right )c + \left ( a+b \right )d$ ... $a^{\ast }\left ( c+d \right )+ b^{\ast }\left ( c+d \right )$
answered
in
Theory of Computation
Aug 1, 2017
203
views
tbb-mockgate-4
theory-of-computation
regular-expression
1
vote
49
Test by Bikram | Mock GATE | Test 4 | Question: 37
A relation $R = \left \{ \left ( x,y \right ) \mid x,y\in N, x=7-y \right \}$ Here, $R$ is: Symmetric and Reflexive, but not Transitive. Symmetric, Reflexive and Transitive. Only Symmetric, but neither Reflexive nor Transitive. Neither Symmetric, Reflexive nor Transitive.
answered
in
Set Theory & Algebra
Aug 1, 2017
273
views
tbb-mockgate-4
set-theory&algebra
relations
1
vote
50
Test by Bikram | Mock GATE | Test 4 | Question: 33
A router receives an $IP$ packet containing $400$ data bytes and forwards that packet in a network where maximum transmission unit is $100$ bytes. If the $\text{IP}$ header is $15$ bytes long, then the number of fragments required is ______.
answered
in
Computer Networks
Aug 1, 2017
441
views
tbb-mockgate-4
numerical-answers
computer-networks
network-layer
fragmentation
1
vote
51
Test by Bikram | Mock GATE | Test 4 | Question: 19
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$ circuit ? A complete graph with $12$ vertices A complete graph with $13$ vertices A tree with $13$ vertices I and II II only III only I and III
answered
in
GATE
Aug 1, 2017
441
views
tbb-mockgate-4
discrete-mathematics
graph-theory
graph-connectivity
euler-graph
3
votes
52
Test by Bikram | Mock GATE | Test 4 | Question: 3
With the help of which of the following relations operation set can a division operation on relations be performed? $\left \{ selection, \times,- \right \}$ $\left \{ \times,- \right \}$ $\left \{ \times \right \}$ $\left \{ projection, \times, -\right \}$
answered
in
Databases
Aug 1, 2017
350
views
tbb-mockgate-4
databases
relational-algebra
4
votes
53
Test by Bikram | Mock GATE | Test 4 | Question: 2
Consider the following statements : $S1$: Automatic garbage collection is not essential to implement recursion. $S2$: Operator precedence parser falls under the category of top down parsers. $S3$: To evaluate a postfix expression, an operator stack is required. Which of the ... true ? $S1$ & $S3$ $S1$ & $S2$ $S2$ & $S3$ $S1$ & $S4$
answered
in
GATE
Aug 1, 2017
432
views
tbb-mockgate-4
compiler-design
parsing
intermediate-code
runtime-environment
4
votes
54
Test by Bikram | Mock GATE | Test 4 | Question: 64
Three friends are excitedly conversing with ______. other each other one another themselves
answered
in
Verbal Aptitude
Aug 1, 2017
373
views
tbb-mockgate-4
verbal-aptitude
english-grammar
most-appropriate-word
1
vote
55
Test by Bikram | Mock GATE | Test 4 | Question: 62
A student reaches school 15 minutes early by running at a speed of 5 km/h from his house. By walking at 3 km/h, he is late by 9 minutes. The distance between the school and his house is ______ km.
answered
in
GATE
Aug 1, 2017
474
views
tbb-mockgate-4
numerical-answers
quantitative-aptitude
speed-time-distance
2
votes
56
Test by Bikram | Mock GATE | Test 4 | Question: 61
There are three baskets of apples. The first basket has twice the number of apples in the second basket. The third basket has 3/4th the number of the apples in the first. The average number of apples in all the baskets is $30$. The number of apples in the first basket, therefore, is _______.
answered
in
GATE
Aug 1, 2017
266
views
tbb-mockgate-4
numerical-answers
quantitative-aptitude
1
vote
57
Test by Bikram | Mock GATE | Test 4 | Question: 56
The number of perfect squares between $120$ and $300$ is ___________.
answered
in
GATE
Aug 1, 2017
259
views
tbb-mockgate-4
numerical-answers
quantitative-aptitude
counting
44
votes
58
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
answered
in
Set Theory & Algebra
Jul 29, 2017
19.3k
views
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
2
votes
59
Test by Bikram | Mathematics | Test 2 | Question: 14
Given $f : Z^*Z \rightarrow Z$ And: $f(m,n) = \mid m \mid – \mid n \mid$ $f(m,n) = m2 + n2$ $f(m,n) = m2 – 4$ $f(m,n) = 2m – n$ Which one of the following options is correct? only IV is onto. only IV and I are onto. III is not onto. II is onto.
answered
in
Mathematical Logic
Jul 24, 2017
361
views
tbb-mathematics-2
3
votes
60
algorithm
worst case time complexity of job sequencing with deadline using greedy algorithm
answered
in
Algorithms
Jul 24, 2017
965
views
time-complexity
greedy-algorithm
Page:
« prev
1
2
3
4
5
6
7
...
10
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...