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
Recent questions tagged applied-course-2019-mock1
2
votes
2
answers
31
Applied Course | Mock GATE | Test 1 | Question: 30
Consider the following program code, where pow() is the exponentiation function. f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if (n <= 1) return 1; return 1 + g(n/2); } What is the worst-case time complexity of $f(n)$? $O(2^n)$ $O(n^2)$ $O(2^n \log (n))$ $O( \log ^n (n))$
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
680
views
applied-course-2019-mock1
algorithms
time-complexity
1
vote
1
answer
32
Applied Course | Mock GATE | Test 1 | Question: 31
Which of the following statement is/are correct? A Router has a physical and logical(IP) address for each of its interfaces. A router acts only on those packets in which the link-layer destination address matches the address of ... changes the link-layer address of the packet (both source and destination) when it forwards the packet. All the above
Applied Course
asked
in
Computer Networks
Jan 16, 2019
by
Applied Course
709
views
applied-course-2019-mock1
routing
computer-networks
1
vote
1
answer
33
Applied Course | Mock GATE | Test 1 | Question: 32
Alice and Bob are staying in Guntur and Amaravathi, and the distance between them is $30$ kms. Suppose Alice want to send an image of size $4KB$ to Bob and connected using a LAN and link works at a speed of light in fiber. Then what data rate ... $16384 \times 10^4 \text{bits/sec}$ $8192 \times 10^4 \text{bits/sec}$ None of these
Applied Course
asked
in
Computer Networks
Jan 16, 2019
by
Applied Course
630
views
applied-course-2019-mock1
lan
computer-networks
1
vote
1
answer
34
Applied Course | Mock GATE | Test 1 | Question: 33
Person "A" says the truth $60 \%$ of the time, and person "B" does so $90 \%$ of the time. In what percentage of cases are they likely to contradict each other in stating the same fact? $6 \%$ $36 \%$ $42 \%$ $54 \%$
Applied Course
asked
in
Probability
Jan 16, 2019
by
Applied Course
441
views
applied-course-2019-mock1
probability
4
votes
1
answer
35
Applied Course | Mock GATE | Test 1 | Question: 34
Which of the following statements is/are TRUE? Suppose there are $n$ nodes are present in a binary search tree. The height of any binary search tree is $\theta (\log n)$ $\theta (\log n)$ rotations are required to insert into AVL tree with n nodes. Only I Only II Both I and II Neither I nor II
Applied Course
asked
in
DS
Jan 16, 2019
by
Applied Course
636
views
applied-course-2019-mock1
data-structures
binary-search-tree
1
vote
1
answer
36
Applied Course | Mock GATE | Test 1 | Question: 35
If $S=a+b+c$, then the value of $\Delta=\begin{vmatrix} s+c & a & b \\ c & s+a & b \\ c & a & s+b \end{vmatrix}$ $2s^2$ $2s^3$ $s^3$ $3s^3$
Applied Course
asked
in
Linear Algebra
Jan 16, 2019
by
Applied Course
537
views
applied-course-2019-mock1
linear-algebra
determinant
3
votes
2
answers
37
Applied Course | Mock GATE | Test 1 | Question: 36
Naveen invited seven of his friends to a party. At the party, several pairs of people shook hands, although no one shook hands with themselves or shook hands with the same person more than once. After the party, Naveen asked each of his ... positive integers. Given that his friends were truthful, how many hands did Naveen shake? $4$ $5$ $6$ $7$
Applied Course
asked
in
Graph Theory
Jan 16, 2019
by
Applied Course
809
views
applied-course-2019-mock1
graph-theory
graph-connectivity
1
vote
1
answer
38
Applied Course | Mock GATE | Test 1 | Question: 37
The project of building $20$ roads connecting $9$ cities is under way, as outlined above. So far, only some of the $20$ roads are constructed, and the digit on each city indicates the number of constructed roads to other cities. How many complete roads are there among these cities ________
Applied Course
asked
in
Graph Theory
Jan 16, 2019
by
Applied Course
810
views
applied-course-2019-mock1
graph-theory
graph-connectivity
numerical-answers
1
vote
1
answer
39
Applied Course | Mock GATE | Test 1 | Question: 38
Five cities P, Q, R, S, T are connected by different modes of transport as follows: P and Q connected by boat as well as rail. S and R connected by bus and boat. Q and T connected by air only. P and R connected by boat only. ... visits each of the places starting from P and gets back to P which of the following places must he visit twice? P Q R T
Applied Course
asked
in
Graph Theory
Jan 16, 2019
by
Applied Course
785
views
applied-course-2019-mock1
graph-theory
graph-connectivity
2
votes
1
answer
40
Applied Course | Mock GATE | Test 1 | Question: 39
A palindrome reads the same forwards and backwards. (For example, $10101$ and $1001$ are palindromes). Suppose you want a machine that takes a number with the four binary digits and outputs a $1$ only if the number is a palindrome. You can build this with two XOR gates, one NOT gate, and which other extra kind of gate? AND OR XOR NOT
Applied Course
asked
in
Digital Logic
Jan 16, 2019
by
Applied Course
653
views
applied-course-2019-mock1
digital-logic
combinational-circuit
digital-circuits
1
vote
1
answer
41
Applied Course | Mock GATE | Test 1 | Question: 40
$\begin{array}{l} A = 2000 \\ B = A - 999 \\ C = A + B - 998 \\ D = A + B + C - 997 \\ \vdots \\ \vdots \\ Z = A + B + C + \dots + Y - 975 \end{array}$ How much $\frac{Z+1}{2^{25}}$? ____
Applied Course
asked
in
Digital Logic
Jan 16, 2019
by
Applied Course
705
views
applied-course-2019-mock1
numerical-answers
digital-logic
number-representation
1
vote
1
answer
42
Applied Course | Mock GATE | Test 1 | Question: 41
All bookstores sell stationary items. All convenience stores sell stationary items. Which of the following conclusions might be TRUE? All bookstores are convenience stores. All convenience stores are bookstores. I II Both I and II Neither I nor II
Applied Course
asked
in
Mathematical Logic
Jan 16, 2019
by
Applied Course
721
views
applied-course-2019-mock1
mathematical-logic
propositional-logic
1
vote
0
answers
43
Applied Course | Mock GATE | Test 1 | Question: 42
What is the maximum number of activation records inserted into stack while converting following infix expression to postfix expression is Infix expression: $\text{7+5*3^2/(9-2^2)+6*4}$
Applied Course
asked
in
DS
Jan 16, 2019
by
Applied Course
973
views
applied-course-2019-mock1
numerical-answers
data-structures
stack
infix-prefix
1
vote
1
answer
44
Applied Course | Mock GATE | Test 1 | Question: 43
The postorder traversal of a binary search tree is $25, 33, 30, 35, 42, 48, 40, 60, 58, 50$. The inorder traversal of the same tree is $25, 30, 33, 35, 40, 42, 48, 50, 58, 60$. What is the length of the longest path from one leaf to another leaf. (Note: Length of longest path means total number of nodes present in that path).
Applied Course
asked
in
DS
Jan 16, 2019
by
Applied Course
727
views
applied-course-2019-mock1
numerical-answers
data-structures
binary-search-tree
1
vote
1
answer
45
Applied Course | Mock GATE | Test 1 | Question: 44
Minimum number of states in a deterministic Finite automata that accepts the given language is ______ $L = \{ w \mid w \text{ is any string not in } a^*b^* \}$
Applied Course
asked
in
Theory of Computation
Jan 16, 2019
by
Applied Course
652
views
applied-course-2019-mock1
numerical-answers
theory-of-computation
finite-automata
minimal-state-automata
1
vote
1
answer
46
Applied Course | Mock GATE | Test 1 | Question: 45
Which of the following are True? $baa \in a^* b^* a^* b^*$ $b^* a^* \cap a^* b^* = a^* \cup b^*$ $a^* b^* \cap b^* c^* = \Phi$ $abcd \: \in (a(cd)^*b)^*$ i and ii only ii and iii only iii and iv only i and iii only
Applied Course
asked
in
Theory of Computation
Jan 16, 2019
by
Applied Course
420
views
applied-course-2019-mock1
theory-of-computation
regular-expression
1
vote
1
answer
47
Applied Course | Mock GATE | Test 1 | Question: 46
Consider the relation Parts $\text{(Partno, SupplierID, Partname, Model)}$, with $\text{{Partno, SupplierID}}$ ... $3NF$ Relation Parts is in $3NF$ but not in $BCNF$ Relation Parts is in $BCNF$ but not in $4NF$
Applied Course
asked
in
Databases
Jan 16, 2019
by
Applied Course
492
views
applied-course-2019-mock1
databases
database-normalization
1
vote
1
answer
48
Applied Course | Mock GATE | Test 1 | Question: 47
In a sorted file structure, let the cost of reading a page be $D=10$ milliseconds, the number of data pages be $B=1024$. Let the average time to process a record is $C=5$ milliseconds. Let the number of records ... the time taken to perform a search with equality selection? $10$ milliseconds $120$ milliseconds $5$ milliseconds $50$ milliseconds
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
590
views
applied-course-2019-mock1
algorithms
searching
1
vote
2
answers
49
Applied Course | Mock GATE | Test 1 | Question: 48
Assume the following program is compiled and run on a modern Linux machine: main() { int x = 0; int a = fork(); x++; if (a == 0) { a = fork(); x++; } else { x++; } printf("GATE!\n"); printf("x is %d ... $"x"$ may have different values on different runs of the program. $2$ $3$ $5$
Applied Course
asked
in
Operating System
Jan 16, 2019
by
Applied Course
861
views
applied-course-2019-mock1
numerical-answers
operating-system
fork-system-call
1
vote
2
answers
50
Applied Course | Mock GATE | Test 1 | Question: 49
How much memory is used for page tables, when there are $10$ process running in the system with the below details? Virtual Address space: $1GB$ Page size: $1KB$ Each page table entry contains a valid bit, dirty bit and the resulting frame number. And the system has a maximum of $2^{14}$ physical pages. $10$ MB $20$ MB $30$ MB None of these
Applied Course
asked
in
Operating System
Jan 16, 2019
by
Applied Course
721
views
applied-course-2019-mock1
operating-system
memory-management
paging
1
vote
1
answer
51
Applied Course | Mock GATE | Test 1 | Question: 50
To implement D Flip-Flop using JK-Flip flop we need NOT gate $2 \times 1$ mux XOR gate Any of the above
Applied Course
asked
in
Digital Logic
Jan 16, 2019
by
Applied Course
479
views
applied-course-2019-mock1
digital-logic
sequential-circuit
flip-flop
1
vote
1
answer
52
Applied Course | Mock GATE | Test 1 | Question: 51
Which of the following statements is/are True? File allocation Table (FAT) suffers from external fragmentation. An inode structure can contain pointers to directory data. Only I Only II Both I and II Neither I nor II
Applied Course
asked
in
Operating System
Jan 16, 2019
by
Applied Course
780
views
applied-course-2019-mock1
operating-system
file-organization
2
votes
1
answer
53
Applied Course | Mock GATE | Test 1 | Question: 52
Which of the following languages are not CFLs $L=\{ 0^n 1^n0^n 1^n \mid n \geq 0\}$ $L=\{0 \# 0^{2n} \# 0^{3n} \mid n \geq 0\}$ $L=\{a^n b^m c^m d^n \mid m,n \geq 0\}$ $L=\{ x \# y \mid x,y \in \{0, 1\}^* \text{ and } x \neq y\}$ II and III only III and IV only I and II only I, II and IV only
Applied Course
asked
in
Theory of Computation
Jan 16, 2019
by
Applied Course
692
views
applied-course-2019-mock1
theory-of-computation
context-free-language
1
vote
1
answer
54
Applied Course | Mock GATE | Test 1 | Question: 53
Which of the following languages are Decidable? $\text{INFINITE}_{\text{DFA}} = \{ \langle A \rangle \mid \text{ A is DFA and L(A) is an Infinite Language} \}$ ... I and II only II and III only III and IV only II and IV only
Applied Course
asked
in
Theory of Computation
Jan 16, 2019
by
Applied Course
453
views
applied-course-2019-mock1
theory-of-computation
decidability
1
vote
1
answer
55
Applied Course | Mock GATE | Test 1 | Question: 54
The common pattern in code for using cache systems looks like the following. In this example get_from_cache() returns zero when the data was not in the cache. int lookup(int key) { int data; data = get_from_cache(key); if (data == 0) { data = get_from_backing_store( ... $1 \: ms$ $6 \: ms$ $30 \: ms$ $95 \: ms$
Applied Course
asked
in
CO and Architecture
Jan 16, 2019
by
Applied Course
428
views
applied-course-2019-mock1
co-and-architecture
cache-memory
1
vote
1
answer
56
Applied Course | Mock GATE | Test 1 | Question: 55
Suppose a radix sort was done on the following set of numbers, in binary i.e,$[11, 10, 3, 14, 12, 2, 8, 15, 2]$. How many passes of counting sort would be performed ____________
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
507
views
applied-course-2019-mock1
numerical-answers
algorithms
radix-sort
1
vote
1
answer
57
Applied Course | Mock GATE | Test 1 | Question: 56
$\text{O}, \Omega,$ and $\Theta$ denote Big-Oh, Big-Omega and Big-Theta notations respectively. Which of the following statement is not correct? $n \: \log a = \Omega (\log ^2 (n)), \text{ where a is a constant >1}$ ... $4(n+k)^m = \text{O} (n^m), \text{ where m is a constant >1}$ $n+\log (n) = \Theta (n)$
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
570
views
applied-course-2019-mock1
algorithms
asymptotic-notation
1
vote
1
answer
58
Applied Course | Mock GATE | Test 1 | Question: 57
Insert the following keys in an array of size $17$ using the modulo division method. Use double hashing to resolve collisions. Take $h'(k) = (\text{key%}7)+1$ as the second hash function: $94, 37, 29, 40, 84, 88, 102, 63, 67, 120, 122$. What is the value present at location $7$ ____
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
1.3k
views
applied-course-2019-mock1
numerical-answers
algorithms
hashing
1
vote
1
answer
59
Applied Course | Mock GATE | Test 1 | Question: 58
Consider the Knapsack Problem: Given a set of n items, each with a weight $w_i$ and the value $v_i$ determine a subset of items to include in a collection so that the total weight is $\leq W$ which is a given limit and the total ... subproblems is $O(nW)$. Which of the above statements is/are correct? I only II only Both I and II None of these
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
574
views
applied-course-2019-mock1
algorithms
dynamic-programming
1
vote
1
answer
60
Applied Course | Mock GATE | Test 1 | Question: 59
Consider the following interleaved schedule with two transactions T1 and T2. The Two-Phase Locking Protocol is followed for achieving concurrency control. Which of the following statements is true with respect to the given schedule? The ... ; T2 The schedule results in a deadlock The schedule is not permitted as per Two Phase Locking Protocol
Applied Course
asked
in
Databases
Jan 16, 2019
by
Applied Course
964
views
applied-course-2019-mock1
databases
transaction-and-concurrency
two-phase-locking-protocol
Page:
« prev
1
2
3
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 questions tagged applied-course-2019-mock1
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:...