Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Adiaspirant
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Adiaspirant
0
answers
1
image processing
Could anyone help me with me image processing topic as I have done my Btech project in noise reduction in images but I have tried only those filters which are already existing but haven't done anything new in it. I need to prepare it for IIIT H interview.
Could anyone help me with me image processing topic as I have done my Btech project in noise reduction in images but I have tried only those filters which are already exi...
503
views
asked
May 24, 2017
0
answers
2
General
How is ISM dhanbad for mtech Computer Science? How come its cut off for 2016 was only 573?
How is ISM dhanbad for mtech Computer Science?How come its cut off for 2016 was only 573?
428
views
asked
Apr 16, 2017
2
answers
3
How to take inputs for a string ?
How to take inputs for a string ? Example:- #include<stdio.h> #include<stdlib.h> #include<conio.h> #include<string.h> #define MAX 10000 int main() { char*str; int i,test,l; scanf("%d",&test); for(i=0;i<t;i++) { ... ); l=strlen(str); printf("%s",str); printf(" %d\n",l); free(str); } } this won't work
How to take inputs for a string ?Example:- #include<stdio.h #include<stdlib.h #include<conio.h #include<string.h #define MAX 10000 int main() { char*str; int i,te...
308
views
asked
Apr 8, 2017
Programming in C
programming-in-c
+
–
2
answers
4
GATE CSE 1994 | Question: 1.20
In which of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods? Passing a constant value as a parameter Passing the address of an array as a parameter Passing an array element as a parameter Passing an array
In which of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods?Passing a constant value as a ...
10.0k
views
commented
Apr 1, 2017
Programming in C
gate1994
programming
parameter-passing
easy
+
–
1
answer
5
C++ oops
Can someone explain the difference between abstraction and encapsulation with programming example?
Can someone explain the difference between abstraction and encapsulation with programming example?
792
views
asked
Mar 18, 2017
1
answer
6
Post gate guidance
I prepared second time for gate and my preparation level was also good. I am expecting 45-50 marks but i could have got atleast 14 marks extra i.e,above 60 in set1. In my first attempt i lacked concept knowledge but this time i have done questions ... keep coming to mind that How could i loose those marks and i never committed those mistakes even in Mock test. Need motivation...
I prepared second time for gate and my preparation level was also good. I am expecting 45-50 marks but i could have got atleast 14 marks extra i.e,above 60 in set1. In my...
1.0k
views
asked
Feb 17, 2017
0
answers
7
gate guidance
Can anybody give guidance related to TUM and NUS admission through gate. If I get 98 or 99 percentile in Gate 2017 and have a 1-year work experience in as service based company but no research papers. What are my chances of getting admission in these universities? What is the procedure?
Can anybody give guidance related to TUM and NUS admission through gate. If I get 98 or 99 percentile in Gate 2017 and have a 1-year work experience in as service based c...
536
views
asked
Feb 14, 2017
10
answers
8
GATE CSE 2013 | Question: 29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in...
29.7k
views
commented
Feb 8, 2017
Operating System
gatecse-2013
operating-system
disk
normal
+
–
0
answers
9
Syllabus
I have not studied P, NP problems in DAA and networking devices(repeater, bridges, spanning tree questions) as they are not part of syllabus...Am I right?
I have not studied P, NP problems in DAA and networking devices(repeater, bridges, spanning tree questions) as they are not part of syllabus...Am I right?
290
views
asked
Feb 7, 2017
6
answers
10
GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion
Two processes $X$ and $Y$ need to access a critical section. Consider the following synchronization construct used by both the processes$$\begin{array}{|l|l|}\hline \text...
20.4k
views
commented
Feb 4, 2017
Operating System
gatecse-2015-set3
operating-system
process-synchronization
normal
+
–
1
answer
11
Probability
What is conditional probability that a family with 2 children has 2 boys, given they have atleast 1 boy? Why do we take total cases as 4 { GB, BB, BG, GG}? Shouldn't we consider GB AND BG same only.
What is conditional probability that a family with 2 children has 2 boys, given they have atleast 1 boy? Why do we take total cases as 4 { GB, BB, BG, GG}? Shouldn't w...
241
views
asked
Feb 2, 2017
4
answers
12
GATE CSE 1990 | Question: 1-iv-b
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$ The range of the exponent is ___________, if the scale factor is represented in excess-$64$ format.
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$The range of the ex...
3.9k
views
commented
Feb 1, 2017
Digital Logic
gate1990
digital-logic
number-representation
floating-point-representation
fill-in-the-blanks
+
–
0
answers
13
gate 2014 set3
onsider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode { ... If a is the root....how is f node ever called using the above program although f is a leaf node.
onsider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling ...
521
views
asked
Jan 30, 2017
0
answers
14
ME test
Q.52 Consider following grammar: With reference to this grammar which of the following option is true? There exist only 1 parse tree for some string ‘w’, and hence grammar is unambiguous. Grammar is ambiguous. Grammar is inherently ambiguous. None of the above HOw to compare between ambigous and inherently ambigous?
Q.52Consider following grammar: With reference to this grammar which of the following option is true?There exist only 1 p...
274
views
asked
Jan 28, 2017
1
answer
15
ME test
In the above given logic circuit A = 1000 and B = 0011 the output DCBA and Cbcd of the circuit is WHat is 9's a?
In the above given logic circuit A = 1000 and B = 0011 the output DCBA and Cbcd of the circuit isWHat is 9's a?
388
views
asked
Jan 28, 2017
1
answer
16
MadeEasy Subject Test: General Aptitude - Statements Follow
The current trend toward specialization in nearly all occupational groups is exactly the opposite of what the educational system needs. World problems now a days are so diverse, complex, and interrelated that only the generalist ... is becoming more highly specialized today. d option is also weakening the conclusion then how is d correct?
The current trend toward specialization in nearly all occupational groups is exactly the opposite of what the educational system needs. World problems now a days are so d...
411
views
asked
Jan 28, 2017
Verbal Aptitude
made-easy-test-series
verbal-aptitude
statements-follow
+
–
8
answers
17
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum ...
15.6k
views
commented
Jan 27, 2017
Set Theory & Algebra
gatecse-2014-set2
set-theory&algebra
normal
set-theory
+
–
0
answers
18
Exam related
Please give some guidance related to Gate...As only 2 weeks are left for the exam but I am constantly getting 40-45 marks in my mock exams which really demotivates me. I am trying every day to solve previous year papers and 1 subject sidewise but still not getting the result.
Please give some guidance related to Gate...As only 2 weeks are left for the exam but I am constantly getting 40-45 marks in my mock exams which really demotivates me. I ...
377
views
asked
Jan 26, 2017
Verbal Aptitude
gate-preparation
motivation
+
–
3
answers
19
GATE CSE 1998 | Question: 1.30
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock
When the result of a computation depends on the speed of the processes involved, there is said to becycle stealingrace conditiona time locka deadlock
10.0k
views
commented
Jan 25, 2017
Operating System
gate1998
operating-system
easy
process-synchronization
+
–
11
answers
20
GATE CSE 2016 Set 1 | Question: 55
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80\...
26.1k
views
commented
Jan 23, 2017
Computer Networks
gatecse-2016-set1
computer-networks
stop-and-wait
normal
numerical-answers
+
–
3
answers
21
GATE CSE 2011 | Question: 62
$P, Q, R$ and $S$ are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the growth of a single microbe surviving human immunity system within $24$ hours of ... against the most dangerous microbe. Which microbe should the company target in its first attempt? $P$ $Q$ $R$ $S$
$P, Q, R$ and $S$ are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the gro...
7.7k
views
answered
Jan 17, 2017
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
data-interpretation
normal
+
–
1
answer
22
Addressing Mode
S1 : Relative mode is the addressing mode which can be used to write code in which reallocation is done at run time. S2 : Indirect addressing through registers can be used to access global variables. Which of the following option is correct?
S1 : Relative mode is the addressing mode which can be used to write code in which reallocation is done at run time.S2 : Indirect addressing through registers can be used...
1.9k
views
commented
Jan 15, 2017
CO and Architecture
co-and-architecture
addressing-modes
+
–
9
answers
23
GATE CSE 2015 Set 1 | Question: 29
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than ... respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is__________________.
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A...
13.3k
views
commented
Jan 14, 2017
Computer Networks
gatecse-2015-set1
computer-networks
normal
numerical-answers
congestion-control
+
–
2
answers
24
Me test
Consider a paging system with 48 bit virtual address space. Each address defers to a byte in memory. Suppose the size of page is 16 kB and the main memory size is 16 GB. The minimum size of page table with each page table entry need 2 protection need is ______ (in GB) Do we take page table entry size as 3Bytes or 22 bits only?
Consider a paging system with 48 bit virtual address space. Each address defers to a byte in memory. Suppose the size of page is 16 kB and the main memory size is 16 GB. ...
697
views
asked
Jan 14, 2017
1
answer
25
REgular and cfl
Why (a+b)*.an bn regular?
Why (a+b)*.an bn regular?
432
views
commented
Jan 12, 2017
0
answers
26
METest
Codes: A B C D (a) 3 2 1 4 (b) 3 4 1 2 (c) 3 4 2 1 (d) 4 3 2 1 a b c d Whats the difference between CFL and DCFL? Is (b) correct option?
Codes: ABCD(a)3214(b)3412(c)3421(d)4321abcdWhats the difference between CFL and DCFL?Is (b) correct option?
233
views
asked
Jan 12, 2017
0
answers
27
TEST SERIES
Why option (c) is non regular as I can write it as [a(a+b)+(a+b)+a]+[b(a+b)+(a+b)+b]
Why option (c) is non regular as I can write it as [a(a+b)+(a+b)+a]+[b(a+b)+(a+b)+b]
276
views
commented
Jan 12, 2017
0
answers
28
Nfa doubt
Tell me any string that is not accepted by option b.
Tell me any string that is not accepted by option b.
395
views
asked
Jan 11, 2017
Theory of Computation
made-easy-test-series
finite-automata
automata
important
+
–
1
answer
29
MadeEasy Subject Test: Theory of Computation - Regular Expressions
Tell me any string that is not accepted by option b.
Tell me any string that is not accepted by option b.
543
views
asked
Jan 11, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
regular-expression
+
–
0
answers
30
MadeEasy Subject Test: Theory of Computation - Finite Automata
Its not accepting (10)=2 in decimal
Its not accepting (10)=2 in decimal
326
views
asked
Jan 11, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register