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 aehkn
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by aehkn
0
votes
1
#CareerGuidance
Hey friends, please help me in deciding which line i should go for now. Go for gate 2019 self preparation look for a job first and prepare simultaneously I am a 2015 CSE pass-out, while working I joined Ravindra Babu Ravula classes in Nov, 2016 and gave ... gate 2019 completely is correct or not. Please advice me the best option to go for. Need of immediate help. Thanks in advance!
answered
in
Others
Mar 15, 2018
308
views
0
votes
2
Regarding Admission
I Got 45.67 marks and current GATE Score according to PRAGY App is 594.67 . Which NITs I could expext and how to prepare for Inteview . Please Suggest . Thanking you...
answered
in
NITs
Mar 5, 2018
714
views
admissions
career-advice
0
votes
3
IISC/IIT admissions.
#admissions If anyone receives any update regarding opening of admission process in any IIT please comment. If there is any existing post then let us know. IISc has started it. IITB not yet. IITD/IITM not sure.
answered
in
IISc/IITs
Mar 2, 2018
626
views
admission
iit
0
votes
4
test series
A student can take one or more courses and courses can be offered to any number of students. Which of the following represents given scenario in ER-model which is correct?
answered
in
Databases
Sep 27, 2017
854
views
1
vote
5
Ace Test Series: Graph Theory - Graph Connectivity
answered
in
Graph Theory
Sep 27, 2017
681
views
ace-test-series
graph-theory
graph-connectivity
2
votes
6
minimal DFA
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
answered
in
Theory of Computation
Sep 26, 2017
847
views
finite-automata
theory-of-computation
minimal-state-automata
4
votes
7
Operating system -paging
Consider a system using paging with TLB.What hit ratio is required to reduce the effective memory access time from 200 ns to 140 ns , by assuming TLB access time of 20 ns. a)85% b)80% c)90% d)95%
answered
in
Operating System
Sep 16, 2017
1.6k
views
1
vote
8
4-way -tree
A full quaternary tree is a tree with every node having 0 or 4 children and all leafs are at same level. If there are n leaf nodes in a full quaternary tree at height h then how many node are present in the tree (root node a height 0)?(consider root as internal node) A.(n-1)/2 B. (n-1)/3 C. (n-1)/4 D. (n-1)/5
answered
in
DS
Sep 16, 2017
425
views
0
votes
9
doubt regarding parsing
What does it mean for grammar or a language if it has a shift-reduce conflict or reduce-reduce conflict? Is the language/grammar ambiguous? (always/maybe)? I want to know the nature of the language.
answered
in
Theory of Computation
Aug 29, 2017
208
views
theory-of-computation
parsing
0
votes
10
MADE EASY
A minimum state deterministic finite automaton accepting the language L={w∣w∈{0,1}} where fifth symbol from the right is 0 has how many states?
answered
in
Theory of Computation
Aug 29, 2017
1.6k
views
theory-of-computation
finite-automata
3
votes
11
Theory Of Computation
What is the regular expression for this E-NFA:-
answered
in
Theory of Computation
Aug 29, 2017
522
views
theory-of-computation
finite-automata
regular-expression
0
votes
12
self doubt OS fork()
find total no of processes i am getting 29 as answer as all will be child process except one parent process plz explain how answer is 24 here i am very confused in such question by drawing diagram #include<stdio.h> #include<stdlib.h> int main(void) { pid_t pid = fork(); pid = fork(); pid = fork(); if(pid == 0) { fork(); } fork(); return 0; }
answered
in
Operating System
Aug 20, 2017
1.3k
views
fork-system-call
operating-system
0
votes
13
find complexity
for(i=0;i<=n;i++) for(j=i;j<=n;j++) for(k=j;k<=n;k++) S++;
answered
in
Algorithms
Aug 12, 2017
224
views
algorithms
time-complexity
2
votes
14
Algorithm doubt
Q. An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is either maximum or minimum is A O(nlogn) B O(n) C O(logn) D O(1)
answered
in
Algorithms
Aug 12, 2017
260
views
time-complexity
0
votes
15
Computer networks DNS
answered
in
Computer Networks
Jul 9, 2017
856
views
2
votes
16
MadeEasy Subject Test: Operating System - Process Synchronization
Consider the following C' code Assume P1 and P2 are two concurrent processes and sharing the global variables x, y and z. Assignments and tests are atomic. Consider the following statements : S1 : P1 and P2 terminates S2 : ... terminates but P1 does not S4 : Neither P1 nor P2 terminates my answer S1 and S4 but solution is different
answered
in
Operating System
Jun 19, 2017
1.5k
views
made-easy-test-series
operating-system
process-synchronization
concurrency
1
vote
17
Programming in C
#include <stdio.h> int main(void) { int b; b='100'; printf("%c",b); return 0; } this shows output as 0. i didnt understand it?
answered
in
Programming in C
Jun 8, 2017
304
views
0
votes
18
turing machine
Construct TM for L ={a^nb^nc^n|n>=1}.
answered
in
Theory of Computation
Jun 8, 2017
3.0k
views
theory-of-computation
2
votes
19
IISC-CSA-Research-Test-10
A proper vertex colouring of a graph $G$ is a colouring of the vertices in $G$ in such a way that two vertices get different colours if they are adjacent. The minimum number of colours required for proper vertex colouring of $G$ is called the chromatic number of $G$. Then what is the chromatic number of the cycle graph on 149 vertices?
answered
in
Graph Theory
Jun 7, 2017
767
views
iisccsaresearch2016
descriptive
graph-theory
graph-coloring
iisc-interview
1
vote
20
michael sipser chp 1, 3rd edition, Q 12 , dfa
let D= {w | w contains an even no. of a's and an odd no. of b's and does not contain the substring ab } give a DFA with Five states that recognizes D and a regular expression that generates D.
answered
in
Theory of Computation
Jun 7, 2017
3.5k
views
theory-of-computation
finite-automata
6
votes
21
[Discrete Maths] Graph theory
What is the vertex connectivity and edge connectivity of complete graph? Is it n or n-1?
answered
in
Graph Theory
Jun 7, 2017
1.3k
views
discrete-mathematics
graph-theory
graph-connectivity
1
vote
22
Pointer and Array
What is the output of the above program? Explanation: (*(*(*p)[1]-2)) = E (*(*(*p)[0]+1)) = A E - A = 4
answered
in
Programming in C
Jun 2, 2017
605
views
array-of-pointers
0
votes
23
[COA] Counting dependencies
Consider the following program to be executed on this processor: I1: Load R1, A /R1 ← Memory (A)/ I2: Add R2, R1 /R2 ← (R2) + R(1)/ I3: Add R3, R4 /R3 ← (R3) + R(4)/ I4: Mul R4, R5 /R4 ← (R4) + R(5)/ I5: Comp R6 /R6 ← (R6)/ I6: Mul R6, R7 /R3 ← (R3) + R(4)/ a. What dependencies exist in the program?
answered
in
CO and Architecture
Jun 1, 2017
464
views
co-and-architecture
4
votes
24
Time complexity
answered
in
Algorithms
Apr 30, 2017
460
views
time-complexity
test-series
2
votes
25
GATE CSE 2007 | Question: 65
There are $n$ stations in slotted LAN. Each station attempts to transmit with a probability $p$ in each time slot. What is the probability that ONLY one station transmits in a given time slot? $np(1-p)^{n-1}$ $(1-p)^{n-1}$ $p(1-p)^{n-1}$ $1-(1-p)^{n-1}$
answered
in
Computer Networks
Apr 25, 2017
13.8k
views
gatecse-2007
computer-networks
lan-technologies
probability
normal
1
vote
26
ISI Sample Paper Question
Let A be a square matrix such that $A^{3}$ = 0, but $A^{2} \neq 0$. Then which of the following statements is not necessarily true? (A) $A \neq A^{2}$ (B) Eigenvalues of $A^{2}$ are all zero (C) rank(A) > rank($A^{2}$ ) (D) rank(A) > trace(A)
answered
in
Linear Algebra
Apr 23, 2017
1.5k
views
isisamplepapers
matrix
0
votes
27
How to find preorder predecessor,preorder successor, post-order predecessor and post-order successor
answered
in
DS
Apr 15, 2017
1.6k
views
data-structures
tree-traversal
descriptive
5
votes
28
C programming
void main() { unsigned char var=0; for(var=0;var<=255;var++) { printf("%d ",var); } } What is output of this code?
answered
in
Programming in C
Apr 15, 2017
3.2k
views
programming-in-c
1
vote
29
c macro
#include <stdio.h> #define foo(a,b) #b int main(void) { int a=10,b=15,ab=20; // your code goes here printf("%d",ab+foo(a,b)); return 0; } What is the output?
answered
in
DS
Apr 14, 2017
726
views
programming-in-c
2
votes
30
confused somebody please tell this Dijkstra
answered
in
Computer Networks
Apr 11, 2017
408
views
computer-networks
dijkstras-algorithm
Page:
1
2
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:...