Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
akankshadewangan24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by akankshadewangan24
0
votes
1
Algorithms:Asymptotic Notations
plz help me . how to solve that type of question
plz help me . how to solve that type of question
368
views
answered
Jan 26, 2018
Algorithms
algorithms
asymptotic-notation
test-series
+
–
0
votes
2
Ace Test Series: General Aptitude - Permutation And Combinations
460
views
answered
Dec 11, 2017
Quantitative Aptitude
ace-test-series
quantitative-aptitude
general-aptitude
+
–
0
votes
3
Context Free language
If L1 is context free and L2 is not context free, then L1 ∩ L2 is context free. Is this true or not?
If L1 is context free and L2 is not context free, then L1 ∩ L2 is context free.Is this true or not?
544
views
answered
Jun 30, 2017
1
votes
4
Pointers
What is the difference between null pointer and void pointer ?? which one is used when ?
What is the difference between null pointer and void pointer ?? which one is used when ?
776
views
answered
Jun 29, 2017
0
votes
5
Ace Test Series: Algorithms - Graph Algorithms
Argument: As it a complete tree, maximum BFS level possible are log(n). And as BFS time is O(n+E) , taking E as path cost , it will give O(n+logn) which is O(n). So, I ticked B. Answer is given as C. But, if we take a vertex just in the first level , so the time cost will be Omega(1). So, C must not be true. Where am I going wrong??
Argument: As it a complete tree, maximum BFS level possible are log(n). And as BFS time is O(n+E) , taking E as path cost , it will give O(n+logn) which is O(n). So, I ti...
738
views
answered
Jun 28, 2017
Algorithms
ace-test-series
algorithms
graph-algorithms
breadth-first-search
+
–
0
votes
6
Ace Test Series: Algorithms - Graph Algorithms
I don't find any option to be correct: Argument (a check for option B): For a straight merge sort, it is not possible to sort directly 2 halves. In a two way merge sort. say if items are greater than 8, then in just two calls, it is not possible to sort two halves. Answer is given as B. Any suggestions?
I don't find any option to be correct: Argument (a check for option B): For a straight merge sort, it is not possible to sort directly 2 halves. In a two way merge sort. ...
574
views
answered
Jun 28, 2017
Algorithms
ace-test-series
algorithms
sorting
merge-sort
+
–
0
votes
7
Output of Code
#include <stdio.h> int main() { int a; char *x; x= (char *) &a; a=512; x[0]=1; x[1]=2; printf("%d\n",a); return 0; }
#include <stdio.h int main() { int a; char *x; x= (char *) &a; a=512; x[0]=1; x =2; printf("%d\n",a); return 0; }
1.0k
views
answered
Jun 28, 2017
Programming in C
programming-in-c
non-gate
+
–
0
votes
8
Finite accepter(machine Design)
What is product automata and what is the difference between grid machine and mod machine?
What is product automata and what is the difference between grid machine and mod machine?
790
views
answered
Jun 26, 2017
Theory of Computation
finite-automata
theory-of-computation
+
–
0
votes
9
Inorder traversal of BST if it contain two identical elements.
if two identical elements are present in BST then how inorder can give sorted array as output ? for ex. if 50,30,45,35,56,58,74,50,15 are inserted to make BST.
if two identical elements are present in BST then how inorder can give sorted array as output ?for ex. if 50,30,45,35,56,58,74,50,15 are inserted to make BST.
762
views
answered
Jun 26, 2017
DS
binary-tree
+
–
1
votes
10
Difference between finding Inorder Successor vs finding next using Inorder Traversal in BST
How is it possible that the time complexity of inorder traversal is O(n), because the time complexity of Inorder Successor in Binary Search Tree is O(log n), So the inorder traversal in BST for printing the numbers take O(n*logn) time for 'n' nodes???
How is it possible that the time complexity of inorder traversal is O(n), because the time complexity of Inorder Successor in Binary Search Tree is O(log n), So the inord...
797
views
answered
Jun 26, 2017
DS
data-structures
binary-search-tree
time-complexity
+
–
6
votes
11
Finite automata
Which of the following statement(s) are true about NFA & DFA? (i) NFA is more powerful than DFA but DFA is more efficient than NFA. (ii) NFA will respond for only valid inputs and no need to respond for invalid inputs. (iii) There is no concept of dead states and complement in NFA. (iv) NFA is a parallel computing system where we can run multiple threads concurrently.
Which of the following statement(s) are true about NFA & DFA?(i) NFA is more powerful than DFA but DFA is more efficient than NFA.(ii) NFA will respond for on...
12.1k
views
answered
Jun 25, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
1
votes
12
GATE CSE 2003 | Question: 47
Consider the following circuit composed of XOR gates and non-inverting buffers. The non-inverting buffers have delays $\delta_1 = 2 ns$ and $\delta_2 = 4 ns$ as shown in the figure. Both XOR gates and all wires have zero delays. Assume that all gate inputs, outputs, and wires ... of logic levels) occur(s) at $B$ during the interval from $0$ to $10$ ns? $1$ $2$ $3$ $4$
Consider the following circuit composed of XOR gates and non-inverting buffers.The non-inverting buffers have delays $\delta_1 = 2 ns$ and $\delta_2 = 4 ns$ as shown in t...
16.1k
views
answered
Jun 24, 2017
Digital Logic
gatecse-2003
digital-logic
digital-circuits
+
–
0
votes
13
GATE IT 2007 | Question: 24
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which t...
13.5k
views
answered
Jun 20, 2017
Algorithms
gateit-2007
algorithms
graph-algorithm
normal
graph-search
depth-first-search
+
–
3
votes
14
GATE CSE 2008 | Question: 79
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s. The value of $x_5$ is $5$ $7$ $8$ $16$
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s.The value of $x_5$ is $5$$7$$8$$16$
5.2k
views
answered
Jun 19, 2017
Algorithms
gatecse-2008
algorithms
recurrence-relation
normal
+
–
0
votes
15
GATE CSE 2017 Set 2 | Question: 03
Match the algorithms with their time complexities: ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
Match the algorithms with their time complexities:$$\begin{array}{|l|l|}\hline \textbf{Algorithms} & \textbf{Time Complexity} \\\hline \text{P. Tower of Hanoi with $n$...
6.8k
views
answered
Jun 19, 2017
Algorithms
gatecse-2017-set2
algorithms
time-complexity
match-the-following
easy
+
–
0
votes
16
GATE CSE 2017 Set 1 | Question: 04
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
Consider the following functions from positive integers to real numbers:$10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$.The CORRECT arrangement of the above functions...
17.6k
views
answered
Jun 19, 2017
Algorithms
gatecse-2017-set1
algorithms
asymptotic-notation
normal
+
–
4
votes
17
GATE2016 ME-2: GA-9
The binary operation $\square$ is defined as $a\square b = ab+(a+b),$ where $a$ and $b$ are any two real numbers. The value of the identity element of this operation, defined as the number $x$ such that $a\square x = a,$ for any $a$, is $0$ $1$ $2$ $10$
The binary operation $\square$ is defined as $a\square b = ab+(a+b),$ where $a$ and $b$ are any two real numbers. The value of the identity element of this operation, def...
2.0k
views
answered
May 9, 2017
Quantitative Aptitude
gate2016-me-2
quantitative-aptitude
number-theory
easy
+
–
0
votes
18
speed , time and distance
Point X and Y are 90 km apart from each other at highway. A car starts from X and another from Y at the same time . If they go in the same direction they meet in 9 hrs and if they go in opposite direction they meet in 9/7 hrs. The max speed of the car among the 2 cars is a)20 km/hr b)30 km/hr c)40 km/hr d)50 km/hr
Point X and Y are 90 km apart from each other at highway. A car starts from X and another from Y at the same time . If they go in the same direction they meet in 9 hrs ...
1.1k
views
answered
May 9, 2017
0
votes
19
ARUN SHARMA
THE MINIMUM VALUE OF EXPRESSION (P+1/P)=??
THE MINIMUM VALUE OF EXPRESSION (P+1/P)=??
592
views
answered
May 9, 2017
0
votes
20
Arun Sharma-Time Speed Distance
Two trains, Calcutta Mail and Bombay Mail, start at the same time from stations Kolkata and Mumbai respectively towards each other.After passing each other, they take 12 hours and 3 hours to reach Mumbai and Kolkata respectively. If the Calcutta mail is moving with the speed of 48 km/h , the speed of the Bombay mail is (a)24 km/h (b)22 km/h (c)21 km/h (d)96 km/h
Two trains, Calcutta Mail and Bombay Mail, start at the same time from stations Kolkata and Mumbai respectively towards each other.After passing each other, they take 12 ...
5.7k
views
answered
May 9, 2017
Verbal Aptitude
speed-time-distance
+
–
–2
votes
21
GATE CSE 2012 | Question: 4
Assuming $P \neq NP$, which of the following is TRUE? $NP- \ complete = NP$ $NP-complete \cap P = \phi$ $NP-hard = NP$ $P = NP-complete$
Assuming $P \neq NP$, which of the following is TRUE?$NP- \ complete = NP$$NP-complete \cap P = \phi$$NP-hard = NP$$P = NP-complete$
8.9k
views
answered
May 9, 2017
Theory of Computation
gatecse-2012
theory-of-computation
p-np-npc-nph
+
–
2
votes
22
GATE CSE 2017 Set 2 | Question: GA-3
There are five buildings called $V$, $W$, $X$, $Y$ and $Z$ in a row (not necessarily in that order). $V$ is to the West of $W$. $Z$ is to the East of $X$ and the West of $V$. $W$ is to the West of $Y$. Which is the building in the middle? $V$ $W$ $X$ $Y$
There are five buildings called $V$, $W$, $X$, $Y$ and $Z$ in a row (not necessarily in that order). $V$ is to the West of $W$. $Z$ is to the East of $X$ and the West of ...
4.6k
views
answered
May 9, 2017
Analytical Aptitude
gatecse-2017-set2
analytical-aptitude
direction-sense
normal
+
–
0
votes
23
GATE CSE 2017 Set 2 | Question: GA-4
A test has twenty questions worth $100$ marks in total. There are two types of questions. Multiple choice questions are worth $3$ marks each and essay questions are worth $11$ marks each. How many multiple choice questions does the exam have? $12$ $15$ $18$ $19$
A test has twenty questions worth $100$ marks in total. There are two types of questions. Multiple choice questions are worth $3$ marks each and essay questions are worth...
5.3k
views
answered
May 9, 2017
Quantitative Aptitude
gatecse-2017-set2
quantitative-aptitude
numerical-computation
+
–
2
votes
24
GATE CSE 2017 Set 2 | Question: GA-5
There are $3$ red socks, $4$ green socks and $3$ blue socks.You choose $2$ socks. The probability that they are of the same colour is $\dfrac{1}{5}$ $\dfrac{7}{30}$ $\dfrac{1}{4}$ $\dfrac{4}{15}$
There are $3$ red socks, $4$ green socks and $3$ blue socks.You choose $2$ socks. The probability that they are of the same colour is$\dfrac{1}{5}$ $\dfrac{7}{30}$ $\dfra...
8.9k
views
answered
May 9, 2017
Quantitative Aptitude
gatecse-2017-set2
quantitative-aptitude
probability
+
–
1
votes
25
GATE CSE 2017 Set 2 | Question: GA-7
There are three boxes. One contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labeled. If you are permitted to open just one box and then pull out and inspect ... three boxes? The box labeled Apples' The box labeled Apples and Oranges' The box labeled Oranges' Cannot be determined
There are three boxes. One contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labeled. If ...
10.7k
views
answered
May 9, 2017
Analytical Aptitude
gatecse-2017-set2
analytical-aptitude
normal
tricky
logical-reasoning
+
–
0
votes
26
probability
ANSWER I AM GETTING : (0.5) / [1-(0.5n)] ANSWER GIVEN : (0.5) / [ 1-(0.5n-1) ]
ANSWER I AM GETTING : (0.5) / [1-(0.5n)]ANSWER GIVEN : (0.5) / [ 1-(0.5n-1) ]
410
views
answered
May 4, 2017
Quantitative Aptitude
probability
engineering-mathematics
discrete-mathematics
+
–
0
votes
27
permutations and combinations
A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?
A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?...
1.0k
views
answered
May 4, 2017
Verbal Aptitude
combinatory
+
–
0
votes
28
cil-2017 AQ17
285
views
answered
May 4, 2017
Verbal Aptitude
cil-2017
+
–
0
votes
29
Progression
If second term of an AP is equal to the 9th term of another AP. What will be the sum of 17 terms of second AP, as the sum of first 3 terms of first AP is given as 9. A – 85; B – 102; C – 204; D – 51; E – Can’t be determined.
If second term of an AP is equal to the 9th term of another AP. What will be the sum of 17 terms of second AP, as the sum of first 3 terms of first AP is given as 9.A –...
544
views
answered
May 4, 2017
Quantitative Aptitude
general
aptitude-progression
+
–
0
votes
30
calender
If 6th March, 2005 is Monday, what was the day of the week on 6th March, 2004? what is the output????? i think saturday....Am i right??
If 6th March, 2005 is Monday, what was the day of the week on 6th March, 2004?what is the output?????i think saturday....Am i right??
511
views
answered
May 4, 2017
Page:
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register