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 Vikas123
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Vikas123
1
answer
1
ME mock1
Consider a binary tree, where for every node P – Q ≤ 2, where P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such a binary tree of height h =4 will be 6 8 9 None of these
answered
in
DS
Jan 19, 2019
396
views
data-structures
binary-tree
numerical-answers
made-easy-test-series
1
answer
2
Gateforum Test Series: Algorithms - Minimum Spanning Trees
commented
in
Algorithms
Jan 14, 2019
853
views
gateforum-test-series
algorithms
minimum-spanning-tree
2
answers
3
UPPCL AE 2018:70
Consider the following grammar $\text{G:}$ $\text{P} \rightarrow \text{Q + R} \mid \text{Q - R} \mid \text{Q} \mid \text{R}$ $\text{Q} \rightarrow q \mid r$ $\text{R} \rightarrow r \mid s$ where $\text{P, Q,}$ and $\text{R}$ ... grammar $\text{G}$ Neither $\text{S1}$ nor $\text{S2}$ Only $\text{S1}$ Only $\text{S2}$ Both $\text{S1}$ and $\text{S2}$
answered
in
Compiler Design
Jan 13, 2019
801
views
uppcl2018
compiler-design
parsing
ll-parser
1
answer
4
MadeEasy Subject Test 2019: Compiler Design - Syntax Directed Translation
Consider the following Translation rules for the Grammar G : What will be the output for input string abebebe for bottom up parser ? CBBPBPBP CBBBPPBB CBPBPBPB CBPBBPPB
commented
in
Compiler Design
Jan 13, 2019
1.3k
views
compiler-design
syntax-directed-translation
made-easy-test-series
1
answer
5
made easy cbt1
FIFO replacement policy ignores locality of reference. true/false
answered
in
Operating System
Jan 13, 2019
1.2k
views
operating-system
1
answer
6
ME Test
answered
in
Databases
Jan 13, 2019
260
views
2
answers
7
mad easy cbt 1
Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are
answered
in
Programming in C
Jan 13, 2019
666
views
0
answers
8
MadeEasy Test Series: Operating System - Disks
Consider a unix inode which maintains $5$ direct disk blocks, $1$ single indirect, $1$ double indirect and $1$ triple indirect DBA. Disk block size is $4 \text{ KB }$ and disk block address is $32 \text{ bits }$. Which of the following is maximum possible file ... $256 \text{ GB }$ $512 \text{ GB }$ $2 \text{ TB }$ Answer by ME: Option $(A)$
commented
in
Operating System
Jan 13, 2019
724
views
made-easy-test-series
operating-system
inode
disk
2
answers
9
permutation and combination
1 2 10 16
answered
in
Mathematical Logic
Jan 13, 2019
385
views
1
answer
10
MadeEasy Full Length Test 2019: Operating System - Semaphore
Let S be a binary semaphore variable, S=0 What will be the value of S when following operations are performed:- 2P, 4V, 5P, 2P, 8V, 3P, 2V ?
commented
in
Operating System
Jan 13, 2019
1.5k
views
operating-system
semaphore
made-easy-test-series
1
answer
11
TLB hit ration and memory lookup time
Consider a system where TLB lookup time is $25$ ns and memory access time is $200$ ns, respectively. Assuming a virtual address space of $2$ KB, page size of $32$ bytes, and a PTE size of $2$ bytes, what is the minimum TLB hit ratio that results in an average v2p (virtual to physical) translation latency of $185$ ns?
answered
in
Operating System
Jan 13, 2019
753
views
translation-lookaside-buffer
hit-ratio
0
answers
12
Self doubt
11^23 mod 187= 149 by using virtual gate calculator... plz tell me where i am wrong...??
asked
in
Computer Networks
Jan 12, 2019
1.3k
views
see-later
0
answers
13
Self doubt
Here last step i didn't understand… 11^23 mod 187=88....HOW..?? m getting 11^23 mod 187 = 149 by using Gate virtual calculator...???
asked
in
Computer Networks
Jan 12, 2019
151
views
0
answers
14
Made easy 2019
RSA crytptosystem the public key of given user is e=31 and n=3599. The private key of user will be.… Plz fully solution post
asked
in
Computer Networks
Jan 12, 2019
210
views
made-easy-test-series
1
answer
15
me test series
A computer system implements a 38 bit virtual address, page size of 16 KB, and 256 entries translation look aside buffer (TLB) organized into 32 sets each having 8 ways. If TLB tag does not store any process id. The minimum length of TLB tag in bits is____
answered
in
Operating System
Jan 11, 2019
499
views
translation-lookaside-buffer
operating-system
2
answers
16
MadeEasy Test Series 2019: General Aptitude - Speed Time Distance
A ball thrown upward satisfy the equation s=160 t - 20 t^2, where S is in m (meter) and t is in sec. what is the maximum height achieved by the ball ? (a) 80 (b) 160 (c) 240 (d) 320 According to me.. Here s=height ... have a velocity of zero (since it will stop at the highest point). So, v=0 than can anyone tell me where I am wrong ?
commented
in
Quantitative Aptitude
Jan 10, 2019
775
views
general-aptitude
speed-time-distance
made-easy-test-series
2
answers
17
Madeeasy[CN-Flow control]
Consider two computers A and B are connected through a network of 30 Mbps.Assume the distance between them is 3000km and the signal propagation speed is same as the speed of light and the packet size is 12 KB. What is minimum number of bits required for window to achieve 100% utilization during GBN and SR protocol ?
answered
in
Computer Networks
Jan 10, 2019
1.2k
views
computer-networks
go-back-n
1
answer
18
CUT VERTEX
plz solve this problem..
commented
in
Mathematical Logic
Jan 9, 2019
1.3k
views
discrete-mathematics
graph-theory
1
answer
19
Profit and Loss
A merchant marks his good such that the profit on sale of 500 article is equal to the 300 article. the profit % is..?? (a) 50% (b) 75% © 100% (d) 150%
asked
in
Verbal Aptitude
Jan 9, 2019
507
views
quantitative-aptitude
profit-loss
general-aptitude
1
answer
20
MadeEasy Test Series: Programming & DS - Binary Search Tree
AVL tree is created by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order (Assume the tree is initially empty). Then the level order traversals of the tree would be. 2, 1, 3, 5, 4, 6, 7 3, 2, 5, 1 ... . After 2 or 3 rotations I get stuck trying to figure out which way to rotate. Please help me with the proper steps in this question.
commented
in
DS
Jan 8, 2019
1.4k
views
made-easy-test-series
data-structures
binary-search-tree
0
answers
21
Merge Sort
Can anyone help me to understand this problem….??
commented
in
Algorithms
Jan 8, 2019
1.0k
views
merge-sort
algorithms
sorting
merging
0
answers
22
PRE-ORDER, POST-ORDER IN-ORDER
Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong….
commented
in
Algorithms
Jan 8, 2019
714
views
tree-traversal
data-structures
1
answer
23
Made easy test series
answered
in
Computer Networks
Jan 8, 2019
260
views
2
answers
24
DBMS transaction
Which of the following is used to get back all the transactions back after rollback? a)Rollback b)Commit c)undo d)Redo
answered
in
Databases
Jan 8, 2019
609
views
databases
transaction-and-concurrency
2
answers
25
MadeEasy Test Series 2019: Computer Networls - Congestion Control
Please help, I am getting total number of transmission to get BACK TO 38 as 14 and NOT 15. after 14th, it would have became 38, so no need to consider 15th segment right?
answered
in
Computer Networks
Jan 8, 2019
981
views
computer-networks
congestion-control
made-easy-test-series
tcp
transport-layer
1
answer
26
Reflexive Relation
Can anyone help …. where I am wrong…??
commented
in
Set Theory & Algebra
Jan 7, 2019
702
views
discrete-mathematics
relations
made-easy-test-series
0
answers
27
GATE 2019 2-way set associative
plz explain …..??
commented
in
Operating System
Jan 7, 2019
352
views
cache-memory
co-and-architecture
0
answers
28
Made Easy DS doubt
IS IT CORRECT…??
commented
in
DS
Dec 28, 2018
417
views
1
answer
29
Made Easy2019
The minimum size of stack required to evaluate given post fix expression is _____________ postfix :- 2 5 x 6 + 4 2 x - MY ANSWER IS 8.. CAN ANYONE TELL ME WHERE I AM WRONG…??
asked
in
DS
Dec 27, 2018
4.2k
views
data-structures
programming-in-c
gate-2019
preparation
2
answers
30
MadeEasy Test Series 2018: Compiler Design - Intermediate Code
The following program uses six temporary variables p, q, r, s, t and u. The code is : Assuming that all operations take their operands from registers. The minimum number of registers needed to execute this program without spilling are ... three lines and the last line are dead code. So the answer should be 2. Please correct me if wrong.
answered
in
Compiler Design
Dec 24, 2018
1.4k
views
compiler-design
intermediate-code
made-easy-test-series
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:...