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 A_i_$_h
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by A_i_$_h
0
votes
1
MadeEasy Subject Test: Programming & DS - Trees
answered
in
DS
Nov 17, 2017
292
views
made-easy-test-series
data-structures
avl-tree
time-complexity
2
votes
2
Matrices - LU Decompostion
Is LU Decomposition possible for every matrix ?
answered
in
Linear Algebra
Nov 9, 2017
578
views
matrix
engineering-mathematics
linear-algebra
0
votes
3
A memory leak happens when
A memory leak happens when a) a program allocates memory in heap but forgets to deallocate it b) when an un-assigned pointer is used is freed using free function c) when realloc() is called on a pointer that is not allocated d) A program allocates memory in stack
answered
in
Programming
Nov 9, 2017
4.7k
views
1
vote
4
#testbook testseries
answered
in
Digital Logic
Nov 1, 2017
223
views
0
votes
5
online source
Que. The result of the UNION operation between R1 and R2 is a relation that includes a. all the tuples of R1 b. all the tuples of R2 c. all the tuples of R1 and R2 d. all the tuples of R1 and R2 which have common columns Answer given is d. Shouldn't it be c???
answered
in
Databases
Oct 28, 2017
766
views
databases
1
vote
6
Recursive Enumerable Language Doubt
We know, Recursive Enumerable Language is not closed under complement. a) So, let's say Y is a R.E language and recursive, then what would be Y' (Y complement)? b) Again Y is a R.E language, but this time Y is not recursive then what would be Y' (Y ... ! P.S - I get that answer for b) is Y' (Y complement) is not R.E, but why? and also please explain option a)
answered
in
Theory of Computation
Oct 27, 2017
7.4k
views
theory-of-computation
recursive-and-recursively-enumerable-languages
turing-machine
complement
0
votes
7
MadeEasy Subject Test: Digital Logic - Flip Flop
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the maximum frequency of MOD 256 counter ?(in MHz) a)18.18 b)19.18 c)20. ... makes Frequency = 1/(30 nsec) = 33.33 Mhz? please correct me where I am going wrong. Thanks for your help :)
answered
in
Digital Logic
Oct 10, 2017
392
views
made-easy-test-series
digital-logic
synchronous-asynchronous-circuits
clock-frequency-flop
flip-flop
0
votes
8
deadlock
process maximum demand currently holds p1 70 45 p2 60 40 p3 60 x p4 40 y if a system has total of 150 units of resource then identify which of the following values of X and Y the above system will be in sage state? A x=40,Y=20 B X=30 ,Y =20 C X=50 Y=10 D X=20 Y=30
answered
in
Operating System
Oct 6, 2017
240
views
1
vote
9
Doubt in OS: Disk scheduling
In SCAN disk scheduling algorithm, we know that SCAN chooses the request that requires shortest seek distance in a preferred direction. What direction SCAN chooses at the first place before servicing any request? Does it take any random direction or chooses in SSTF manner in the first place? How do SCAN & C-SCAN suffer from indefinite postponement?
answered
in
Operating System
Oct 5, 2017
545
views
operating-system
disk-scheduling
0
votes
10
Discrete-mathematics
Consider the following statements 1) If f is one-to-one function from an infinite set A to itself then f must be onto. 2) If f is one-to-one function from an finite set A to itself then f must be onto. 3) Power set of countably infinite set is countably infinite. which of the following is true - 1) I only 2) I and II only 3) All are true. 4) II only
answered
in
Set Theory & Algebra
Oct 5, 2017
219
views
0
votes
11
C programming
#include<stdio.h> int main() { int a=10,b=20,c=30; c==a==b; Printf("%d%d%d",a,b,c); return0;}
answered
in
Programming
Oct 5, 2017
717
views
programming-in-c
1
vote
12
what is meant by disk block address
what is meant by disk block address ??
answered
in
Operating System
Sep 23, 2017
1.4k
views
disk-scheduling
0
votes
13
Mathematical Logic question
Which among them are valid? How to approach such questions ?
answered
in
Mathematical Logic
Sep 23, 2017
595
views
mathematical-logic
discrete-mathematics
0
votes
14
Bucket sort
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets? 2. Bucket sort is always NOT inplace.Is this correct?
answered
in
Algorithms
Sep 22, 2017
639
views
sorting
algorithms
0
votes
15
permutation and combination
How many sets of three integers between 1 and 20 are possible if no two consecutive integers are to be in a set?
answered
in
Mathematical Logic
Sep 20, 2017
799
views
5
votes
16
#TOC Identify Class of Language
$L = \{w \mid w ∈ {a,b}, n_a(w) \geq n_b(w)+1\}$ $L = \{a^ib^j \mid i ≠ 2j+1\}$ $L = \{a^mb^n \mid m=2n+1\}$ NOTE: 1 - DCFL, 2 - DCFL, 3 -DCFL, but need a proper reason!
answered
in
Theory of Computation
Sep 19, 2017
380
views
theory-of-computation
identify-class-language
2
votes
17
Problem in sets
more than 1 can be true or false
answered
in
Set Theory & Algebra
Sep 19, 2017
230
views
set-theory&algebra
discrete-mathematics
engineering-mathematics
0
votes
18
Digital Logic - Write out the boolean expression and draw the circuit that implements the function
answered
in
Digital Logic
Sep 19, 2017
633
views
digital-logic
boolean-algebra
digital-circuits
logic
3
votes
19
Bit rate vs Baud rate
Pick the correct statement A. Bit rate can never be less than Baud rate B. Baud rate can never be less than Bit rate C. Bit rate and Baud rate are always samr. D. None of the above
answered
in
Computer Networks
Sep 19, 2017
1.2k
views
0
votes
20
doubt
what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?
answered
in
Algorithms
Sep 18, 2017
221
views
maximum-minimum
normal
numerical-answers
0
votes
21
Practice Question #5
Let language L1 = {0,1}* if another language L2 is CFL. L1 = empty set if another language L2 is not CFL. L2 = a language the is R.E and its complement is R.E. What can we say about L1 and L2? is L1 and L2 are regular, CFL, CSL, R.E or finite or infinite.
answered
in
Theory of Computation
Sep 18, 2017
308
views
theory-of-computation
bad-question
1
vote
22
parsing
S---->AaAb /BbBa A---->epsilon B------->epsilon check whether grammar is LL(1),LR(0) OR SLR(1)
answered
in
Compiler Design
Sep 18, 2017
2.2k
views
parsing
compiler-design
0
votes
23
Interprocess Synchronization
which of the following statements is correct for two processes executing this code? A) Given program provide mutual exclusion. B) Given program does not provide mutual exclusion. C) Given program provide mutual exclusion and solves the problem of starvation. D) Given program provide mutual exclusion but does not prevent of starvation.
answered
in
Operating System
Sep 18, 2017
284
views
0
votes
24
parsing
S---->AaAb /BbBa A---->epsilon B------->epsilon check whether grammar is LL(1),LR(0) OR SLR(1)
answered
in
Compiler Design
Sep 18, 2017
2.2k
views
parsing
compiler-design
1
vote
25
UGC NET CSE | December 2009 | Part 2 | Question: 34
Contex-free Grammar (CFG) can be recognized by (A) Finite state automata (B) 2-way linear bounded automata (C) push down automata (D) both (B) and (C)
answered
in
Theory of Computation
Sep 17, 2017
630
views
ugcnetcse-dec2009-paper2
theory-of-computation
context-free-grammar
3
votes
26
UGC NET CSE | December 2009 | Part 2 | Question: 36
In the process management Round-robin method is essentially the pre-emptive version of _________ (A) FILO (B) FIFO (C) SSF (D) Longest time first
answered
in
Operating System
Sep 17, 2017
1.9k
views
ugcnetcse-dec2009-paper2
operating-system
process-scheduling
0
votes
27
Digital Systems - Logical Mismatch in Input & Output
answered
in
Digital Logic
Sep 13, 2017
340
views
digital-logic
digital-circuits
logic
1
vote
28
Dynamic Programming: How to Approach these type of recurrence problems in DP?
answered
in
Algorithms
Sep 12, 2017
296
views
dynamic-programming
recurrence-relation
ace-test-series
1
vote
29
How Finite automata is considered as Turing machine with a restricted tape length?
How Finite automata is considered as Turing machine with a restricted tape length?
answered
in
Theory of Computation
Sep 12, 2017
251
views
turing-machine
finite-automata
0
votes
30
Page Table is divided into 8K pages and each page contain 2k entries.
Page Table is divided into 8K pages and each page contain 2k entries. Page table entry size is 4 bytes and page size is 1 K words Q find out a)Logical address b)no of pages in LAS c)1st level page table size d)2nd level page table size
answered
in
Operating System
Sep 12, 2017
249
views
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...