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 abhishekmehta4u
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by abhishekmehta4u
7
answers
1
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
answered
in
Algorithms
Mar 26, 2020
7.5k
views
ugcnetcse-jan2017-paper3
algorithms
tree
4
answers
2
UGC NET CSE | January 2017 | Part 3 | Question: 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case. $O(1)$ $O( \lg n)$ $O(n)$ $O(n \lg n)$
answered
in
Algorithms
Mar 26, 2020
2.3k
views
ugcnetcse-jan2017-paper3
algorithms
red-black-tree
4
answers
3
UGC NET CSE | January 2017 | Part 3 | Question: 35
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
answered
in
Algorithms
Mar 26, 2020
2.0k
views
ugcnetcse-jan2017-paper3
algorithms
dijkstras-algorithm
5
answers
4
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
answered
in
Algorithms
Mar 26, 2020
3.4k
views
ugcnetcse-jan2017-paper3
algorithms
matrix-chain-ordering
6
answers
5
UGC NET CSE | January 2017 | Part 3 | Question: 39
Consider the following JAVA program: public class First { public static int CBSE (int x) { if (x < 100)x = CBSE (x+10); return (x-1); } public static void main(String[]args){ System.out.print(First.CBSE(60)); } } What does this program print? $59$ $95$ $69$ $99$
answered
in
Object Oriented Programming
Mar 26, 2020
1.9k
views
ugcnetcse-jan2017-paper3
object-oriented-programming
java
6
answers
6
UGC NET CSE | January 2017 | Part 3 | Question: 36
Match the following with respect to algorithm paradigms : ... $\text{a-ii, b-i, c-iii, d-iv}$ $\text{a-iii, b-ii, c-i, d-iv}$
answered
in
Algorithms
Mar 26, 2020
1.5k
views
ugcnetcse-jan2017-paper3
algorithms
easy
match-the-following
2
answers
7
UGC NET CSE | June 2019 | Part 2 | Question: 35
Which of the following key constraints is required for functioning of foreign key in the context relational databases? Unique key Primary key Candidate key Check key
commented
in
Databases
Jul 20, 2019
3.5k
views
ugcnetcse-june2019-paper2
candidate-key
1
answer
8
Self Doubt : Ambiguity
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?
commented
in
Theory of Computation
Jul 18, 2019
1.1k
views
theory-of-computation
finite-automata
ambiguous
regular-language
context-free-language
context
2
answers
9
UGC NET CSE | June 2019 | Part 2 | Question: 66
Consider double hashing of the form $h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}$ where $h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})$ where $n=m-1$ and $m=701$. For $k=123456$, what is the difference between first and second probes in terms of slots? $255$ $256$ $257$ $258$
answered
in
Algorithms
Jul 17, 2019
3.9k
views
ugcnetcse-june2019-paper2
double-hashing
5
answers
10
UGC NET CSE | June 2019 | Part 2 | Question: 45
Consider three CPU intensive processes, which require $10$, $20$ and $30$ units of time and arrive at times $0$, $2$ and $6$ respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $4$ $2$ $3$ $1$
answered
in
Operating System
Jul 17, 2019
3.7k
views
ugcnetcse-june2019-paper2
process-scheduling
3
answers
11
UGC NET CSE | June 2019 | Part 2 | Question: 78
Consider the following grammar: $S \rightarrow XY$ $X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$ Which of the following statements is/are true about the above grammar? Strings produced by the grammar can have consecutive three $a$ ... by the grammar have $b$'s in multiple of $2$. i only ii and iii only iv only iii and iv only
answered
in
Theory of Computation
Jul 17, 2019
2.0k
views
ugcnetcse-june2019-paper2
grammar
strings
4
answers
12
UGC NET CSE | June 2019 | Part 2 | Question: 84
You need $500$ subnets, each with about $100$ usable host address per subnet. What network mask will you assign using a class B network address? $255.255.255.252$ $255.255.255.128$ $255.255.255.0$ $255.255.254.0$
answered
in
Computer Networks
Jul 17, 2019
8.9k
views
ugcnetcse-june2019-paper2
subnetting
2
answers
13
Process Synchronization
If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the code do{ wait(S); <c.s> signal(s); <r.s>}while(1); the code for the n-th process i.e Pn is given by do{ signal(S); <c.s> wait(S); <r. ... ; a) What is the max no. of processes that can be there in the critical section simultaneosly ? A. 2 B . 3 C. n-1 D. n
commented
in
Operating System
Jun 15, 2019
687
views
process-synchronization
operating-system
critical-section
3
answers
14
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
commented
in
Operating System
Jun 13, 2019
1.6k
views
memory-management
paging
operating-system
multilevel-paging
self-doubt
5
answers
15
Static Single Assignment form
Consider the following code generation: a=b+c; c=a+x; d=b+c; b=a+x; The minimum no. of total variables required to convert the above code to static single assignment form is______
commented
in
Compiler Design
Jun 8, 2019
2.8k
views
compiler-design
static-single-assignment
intermediate-code
1
answer
16
Follow Set Self Doubt
X->aABe B->c | d A->a What will be the follow of A here? {c, d, $} or {c, d, e, dollar}
commented
in
Compiler Design
Jun 8, 2019
447
views
compiler-design
first-and-follow
2
answers
17
Conversion of regular grammar to FA
A->aB/bA/b B->aC/bB C->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there? According to me there should be 2 final states: A and C But the resource from where I am reading it says only one final state will be there which will be A. Kindly explain.
commented
in
Theory of Computation
Jun 7, 2019
4.4k
views
theory-of-computation
finite-automata
regular-grammar
4
answers
18
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
answered
in
Compiler Design
Jun 4, 2019
921
views
compiler-design
ll-parser
syntax-directed-translation
3
answers
19
Ace academy booklet #graph theory
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Euler circuit exists ... Euler circuit exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Euler circuit exits $\Leftrightarrow$ $n$ is even.
answered
in
Graph Theory
Jun 4, 2019
1.8k
views
graph-theory
ace-booklet
1
answer
20
ISI-PCB-2015-C1-b
A $64000$-byte message is to be transmitted over a $2$-hop path in a store-and-forward packet-switching network. The network limits packets toa maximum size of $2032$ bytes including a $32$-byte header. The trans-mission lines in the network are error free and have a speed of $50$ ... answer as $1*3*(T_t+T_p) + \;31*T_t$ where $T_t=0.325\; ms$ and $T_p=3.333\; ms$. Please Confirm.
answered
in
Computer Networks
Jun 4, 2019
1.0k
views
userisi2015
usermod
computer-networks
ip-packet
network-layer
3
answers
21
Made Easy Test Series:Data Structure-Stack
There is given a infix expression: ${\color{Red} {1}}$ $A+B\times C/\left ( \left ( D+E \right )+F\times G \right )$ While converting infix expression to postfix expression number of symbols in the stack at indicated ... $5$, but is it correct? Can anyone give some explanation??
answered
in
DS
May 31, 2019
1.0k
views
made-easy-test-series
data-structures
stack
5
answers
22
GATE2017 CE-2: GA-4
What is the value of $x$ when $81\times\left (\frac{16}{25} \right )^{x+2}\div\left (\frac{3}{5} \right )^{2x+4}=144?$ $1$ $-1$ $-2$ $\text{Can not be determined}$
answered
in
Quantitative Aptitude
May 31, 2019
2.5k
views
gate2017-ce-2
ratio-proportions
quantitative-aptitude
2
answers
23
Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain-
answered
in
Operating System
May 31, 2019
1.4k
views
made-easy-test-series
operating-system
process-synchronization
3
answers
24
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
answered
in
Theory of Computation
May 27, 2019
1.7k
views
made-easy-test-series
theory-of-computation
regular-language
2
answers
25
Engineering Maths
If A = $\begin{bmatrix} -1 & 1 & 0 \\ 0 & 2 &-2 \\ 0& 0 & 3 \end{bmatrix}$ then trace of the matrix 3A2 + adj A is ____
answered
in
Linear Algebra
May 26, 2019
800
views
engineering-mathematics
linear-algebra
3
answers
26
Made easy Workbook 2020
Question: $T(1)=1$ $T(n) = 2 T(n - 1) + n$ evaluates to? Can anyone solve it by substitution method? Given answer $T(n) = 2^{n+1} - (n+2)$ How?
commented
in
Algorithms
May 25, 2019
6.0k
views
time-complexity
algorithms
recurrence-relation
made-easy-booklet
2
answers
27
machine instructions and addressing modes
A digital computer has memory unit with $24$ bits word.The instruction set consists of $150$ different operations. All instructions have an operation code part and an address part. Each instruction is stored in one word of memory. $Q1$ How many bits are needed for the OP-CODE and ... $2^{16}, 2^{24}$ $2^{16},2^{24}-1$ $\textrm{None of these}$
answered
in
CO and Architecture
May 25, 2019
1.6k
views
co-and-architecture
addressing-modes
2
answers
28
made easy mock
minimum number of nodes (both leaf and non leaf) of B+ tree index required for storing 5500 keys and order of B+ tree is 8 _________ (order is maximum pointers a node can have) am getting 4681
commented
in
Databases
May 25, 2019
2.5k
views
2
answers
29
B+ tree
Database file consists 1250 records.Block can hold either 3 record or (10 key,11 pointer ) The max number of level of index required for dense B+ tree index for daatabase file are _____________________
commented
in
Databases
May 25, 2019
2.9k
views
databases
2
answers
30
TIFR CSE 2019 | Part B | Question: 8
Consider the following program fragment: var a,b : integer; procedure G(c,d: integer); begin c:=c-d; d:=c+d; c:=d-c end; a:=2; b:=3; G(a,b); If both parameters to $G$ are passed by reference, what are the values of $a$ and $b$ at the end of the above program fragment ? $a=0$ and $b=2$ $a=3$ and $b=2$ $a=2$ and $b=3$ $a=1$ and $b=5$ None of the above
answered
in
Programming in C
May 24, 2019
1.9k
views
tifr2019
programming
parameter-passing
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
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation