Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by haralk10
5
answers
1
GATE CSE 1999 | Question: 1.3
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is $^{n-1}C_k$ $^nC_k$ $^nC_{k+1}$ None of the above
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
9.0k
views
commented
Mar 12, 2021
Combinatory
gate1999
combinatory
normal
+
–
2
answers
2
GATE ECE 2020 | GA Question: 10
The following figure shows the data of students enrolled in $5$ years $(2014\;\text{to}\; 2018)$ for two schools $P$ and $Q$. During this period, the ratio of the average number of the students enrolled in school $P$ to the average of the difference of the number of students enrolled in schools $P$ and $Q$ is _______. $8 : 23$ $23 : 8$ $23 : 31$ $31 : 23$
The following figure shows the data of students enrolled in $5$ years $(2014\;\text{to}\; 2018)$ for two schools $P$ and $Q$. During this period, the ratio of the average...
1.4k
views
answered
Aug 11, 2020
Quantitative Aptitude
gate2020-ec
quantitative-aptitude
data-interpretation
bar-graph
+
–
2
answers
3
GATE ECE 2020 | GA Question: 9
$a, b, c$ are real numbers. The quadratic equation $ax^{2}-bx+c=0$ has equal roots, which is $\beta$, then $\beta =b/a$ $\beta^{2} =ac$ $\beta^{3} =bc/\left ( 2a^{2} \right )$ $\beta^{2} \neq 4ac$
$a, b, c$ are real numbers. The quadratic equation $ax^{2}-bx+c=0$ has equal roots, which is $\beta$, then$\beta =b/a$$\beta^{2} =ac$$\beta^{3} =bc/\left ( 2a^{2} \right ...
1.1k
views
answered
Aug 11, 2020
Quantitative Aptitude
gate2020-ec
quantitative-aptitude
quadratic-equations
+
–
2
answers
4
GATE ECE 2020 | GA Question: 8
A circle with centre $\text{O}$ is shown in the figure. A rectangle $\text{PQRS}$ of maximum possible area is inscribed in the circle. If the radius of the circle is $a$, then the area of the shaded portion is _______. $\pi a^{2}-a^{2}$ $\pi a^{2}-\sqrt{2}a^{2}$ $\pi a^{2}-2a^{2}$ $\pi a^{2}-3a^{2}$
A circle with centre $\text{O}$ is shown in the figure. A rectangle $\text{PQRS}$ of maximum possible area is inscribed in the circle. If the radius of the circle is $a$,...
2.2k
views
answered
Aug 11, 2020
Quantitative Aptitude
gate2020-ec
quantitative-aptitude
geometry
circle
area
+
–
1
answer
5
ISI2016-DCG-48
The piecewise linear function for the following graph is $f(x)=\begin{cases} = x,x\leq-2 \\ =4,-2<x<3 \\ = x+1,x\geq 3\end{cases}$ $f(x)=\begin{cases} = x-2,x\leq-2 \\ =4,-2<x<3 \\ = x-1,x\geq 3\end{cases}$ $f(x)=\begin{cases} = 2x,x\leq-2 \\ =x,-2<x<3 \\ = x+1,x\geq 3\end{cases}$ $f(x)=\begin{cases} = 2-x,x\leq-2 \\ =4,-2<x<3 \\ = x+1,x\geq 3\end{cases}$
The piecewise linear function for the following graph is$f(x)=\begin{cases} = x,x\leq-2 \\ =4,-2<x<3 \\ = x+1,x\geq 3\end{cases}$$f(x)=\begin{cases} = x-2,x\leq-2 \\ =4,...
434
views
answered
Jul 19, 2020
Calculus
isi2016-dcg
calculus
functions
curves
non-gate
+
–
1
answer
6
ISI2017-MMA-9
A function $y(x)$ that satisfies $\dfrac{dy}{dx}+4xy=x$ with the boundary condition $y(0)=0$ is $y(x)=(1-e^x)$ $y(x)=\frac{1}{4}(1-e^{-2x^2})$ $y(x)=\frac{1}{4}(1-e^{2x^2})$ $y(x)=\frac{1}{4}(1-\cos x)$
A function $y(x)$ that satisfies $\dfrac{dy}{dx}+4xy=x$ with the boundary condition $y(0)=0$ is$y(x)=(1-e^x)$$y(x)=\frac{1}{4}(1-e^{-2x^2})$$y(x)=\frac{1}{4}(1-e^{2x^2})$...
551
views
answered
Jul 19, 2020
Calculus
isi2017-mmamma
calculus
differential-equation
non-gate
+
–
1
answer
7
ISI2015-MMA-59
In the Taylor expansion of the function $f(x)=e^{x/2}$ about $x=3$, the coefficient of $(x-3)^5$ is $e^{3/2} \frac{1}{5!}$ $e^{3/2} \frac{1}{2^5 5!}$ $e^{-3/2} \frac{1}{2^5 5!}$ none of the above
In the Taylor expansion of the function $f(x)=e^{x/2}$ about $x=3$, the coefficient of $(x-3)^5$ is$e^{3/2} \frac{1}{5!}$$e^{3/2} \frac{1}{2^5 5!}$$e^{-3/2} \frac{1}{2^5 ...
577
views
answered
Jul 13, 2020
Calculus
isi2015-mma
calculus
taylor-series
non-gate
+
–
1
answer
8
ISI2016-DCG-47
The Taylor series expansion of $f(x)=\ln(1+x^{2})$ about $x=0$ is $\sum_{n=1}^{\infty}(-1)^{n}\frac{x^{n}}{n}$ $\sum_{n=1}^{\infty}(-1)^{n+1}\frac{x^{2n}}{n}$ $\sum_{n=1}^{\infty}(-1)^{n+1}\frac{x^{2n+1}}{n+1}$ $\sum_{n=1}^{\infty}(-1)^{n+1}\frac{x^{n+1}}{n+1}$
The Taylor series expansion of $f(x)=\ln(1+x^{2})$ about $x=0$ is$\sum_{n=1}^{\infty}(-1)^{n}\frac{x^{n}}{n}$$\sum_{n=1}^{\infty}(-1)^{n+1}\frac{x^{2n}}{n}$$\sum_{n=1}^{\...
409
views
answered
Jul 13, 2020
Calculus
isi2016-dcg
calculus
taylor-series
non-gate
+
–
2
answers
9
ISI2015-DCG-47
The Taylor series expansion of $f(x)= \text{ln}(1+x^2)$ about $x=0$ is $\sum _{n=1}^{\infty} (-1)^n \frac{x^n}{n}$ $\sum _{n=1}^{\infty} (-1)^{n+1} \frac{x^{2n}}{n}$ $\sum _{n=1}^{\infty} (-1)^{n+1} \frac{x^{2n+1}}{n+1}$ $\sum _{n=0}^{\infty} (-1)^{n+1} \frac{x^{n+1}}{n+1}$
The Taylor series expansion of $f(x)= \text{ln}(1+x^2)$ about $x=0$ is$\sum _{n=1}^{\infty} (-1)^n \frac{x^n}{n}$$\sum _{n=1}^{\infty} (-1)^{n+1} \frac{x^{2n}}{n}$$\sum _...
860
views
answered
Jul 13, 2020
Calculus
isi2015-dcg
calculus
taylor-series
non-gate
+
–
2
answers
10
ISI 2015 PCB C2 B
You are given a array $A$ of size $n$. Your are told that $A$ comprises three consecutive runs - first a run of $a$'s, then a run of $b$'s and finally a run of $c$'s. Moreover, you are provided an index of $i$ such that $A[i] = b$. Design an $O(\log n)$ time algorithm to determine the number of $b$'s (i.e., length of the second run) in $A$.
You are given a array $A$ of size $n$. Your are told that $A$ comprises three consecutive runs - first a run of $a$'s, then a run of $b$'s and finally a run of $c$'s. Mor...
1.4k
views
commented
Jun 30, 2020
DS
data-structures
array
isi2015
+
–
2
answers
11
NIELIT 2016 MAR Scientist C - Section B: 13
$\displaystyle \lim_{x \rightarrow 0}\frac{1}{x^{6}} \displaystyle \int_{0}^{x^{2}}\frac{t^{2}dt}{t^{6}+1}=$? $1/4$ $1/3$ $1/2$ $1$
$\displaystyle \lim_{x \rightarrow 0}\frac{1}{x^{6}} \displaystyle \int_{0}^{x^{2}}\frac{t^{2}dt}{t^{6}+1}=$?$1/4$$1/3$$1/2$$1$
426
views
answered
May 24, 2020
Calculus
nielit2016mar-scientistc
calculus
+
–
1
answer
12
ISI2016-DCG-67
The general solution of the differential equation $2y{y}'-x=0$ is (assuming $C$ as an arbitrary constant of integration) $x^{2}-y^{2}=C$ $2x^{2}-y^{2}=C$ $2y^{2}-x^{2}=C$ $x^{2}+y^{2}=C$
The general solution of the differential equation $2y{y}'-x=0$ is (assuming $C$ as an arbitrary constant of integration)$x^{2}-y^{2}=C$$2x^{2}-y^{2}=C$$2y^{2}-x^{2}=C$$x^...
270
views
commented
Apr 12, 2020
Calculus
isi2016-dcg
calculus
differential-equation
non-gate
+
–
1
answer
13
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 34
The solution of the recurrence relation $a_{r} = a_{r-1} + 2a_{r-2}$ with $a_{0} = 2,a_{1} = 7$ is $a_{r} = (3)^{r} + (1)^{r}$ $2a_{r} = (2)^{r}/3 – (1)^{r}$ $a_{r} = 3^{r+1} – (-1)^{r}$ $a_{r} = 3(2)^{r} – (-1)^{r}$
The solution of the recurrence relation$a_{r} = a_{r-1} + 2a_{r-2}$ with $a_{0} = 2,a_{1} = 7$ is$a_{r} = (3)^{r} + (1)^{r}$$2a_{r} = (2)^{r}/3 – (1)^{r}$$a_{r} = 3^{r+...
698
views
answered
Apr 11, 2020
Combinatory
nielit2017oct-assistanta-it
combinatory
recurrence-relation
+
–
1
answer
14
NIELIT 2017 July Scientist B (CS) - Section B: 48
What is the complement of the language accepted by the NFA shown below? $\not{O}$ $\{\epsilon\}$ $a^*$ $\{a,\epsilon\}$ $1$ $2$ $3$ $4$
What is the complement of the language accepted by the NFA shown below?$\not{O}$$\{\epsilon\}$$a^*$$\{a,\epsilon\}$$1$$2$$3$$4$
877
views
commented
Apr 8, 2020
Theory of Computation
nielit2017july-scientistb-cs
theory-of-computation
finite-automata
+
–
4
answers
15
UGC NET CSE | January 2017 | Part 2 | Question: 19
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left (PQ \right )$ ... but not lossless join Dependency preserving and lossless join Lossless join but not dependency preserving Neither dependency preserving nor lossless join.
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left...
2.3k
views
answered
Apr 5, 2020
Databases
ugcnetjan2017ii
databases
dependency-preserving
+
–
1
answer
16
UGC NET CSE | June 2005 | Part 2 | Question: 30
What is the correct subnet mask to use for a class-$B$ address to support $30$ Networks and also have the most hosts possible ? $255.255.255.0$ $255.255.192.0$ $255.255.240.0$ $255.255.248.0$
What is the correct subnet mask to use for a class-$B$ address to support $30$ Networks and also have the most hosts possible ?$255.255.255.0$$255.255.192.0$$255.255.240....
445
views
answered
Apr 5, 2020
Computer Networks
ugcnetcse-june2005-paper2
computer-networks
ip-addressing
subnetting
+
–
2
answers
17
UGC NET CSE | June 2005 | Part 2 | Question: 7
The logic expression $\overline{x}y\overline{z}+\overline{x}yz+xy\overline{z}+xyz$ reduces to : $\overline{x}z$ $xyz$ $y$ $yz$
The logic expression $\overline{x}y\overline{z}+\overline{x}yz+xy\overline{z}+xyz$ reduces to :$\overline{x}z$$xyz$$y$$yz$
436
views
commented
Apr 5, 2020
Digital Logic
ugcnetcse-june2005-paper2
digital-logic
boolean-algebra
+
–
1
answer
18
UGC NET CSE | December 2005 | Part 2 | Question: 23
Consider the graph, which of the following is a valid topological sorting? $\text{ABCD}$ $\text{BACD}$ $\text{BADC}$ $\text{ABDC}$
Consider the graph, which of the following is a valid topological sorting?$\text{ABCD}$$\text{BACD}$$\text{BADC}$$\text{ABDC}$
2.3k
views
answered
Apr 5, 2020
Algorithms
ugcnetcse-dec2005-paper2
algorithms
topological-sort
+
–
1
answer
19
UGC NET CSE | June 2006 | Part 2 | Question: 9
In a weighted code with weight $6,4,2,-3$ the decimal $5$ is represented by: $0101$ $0111$ $1011$ $1000$
In a weighted code with weight $6,4,2,-3$ the decimal $5$ is represented by:$0101$$0111$$1011$$1000$
968
views
answered
Apr 5, 2020
Others
ugcnetcse-june2006-paper2
+
–
1
answer
20
NIELIT 2016 MAR Scientist C - Section C: 36
Odd parity of word can be conveniently tested by OR gate AND gate NOR gate XOR gate
Odd parity of word can be conveniently tested by OR gateAND gateNOR gateXOR gate
1.8k
views
commented
Apr 4, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
+
–
0
answers
21
ISI2017-DCG-24
The differential equation $x \frac{dy}{dx} -y=x^3$ with $y(0)=2$ has unique solution no solution infinite number of solutions none of these
The differential equation $x \frac{dy}{dx} -y=x^3$ with $y(0)=2$ hasunique solutionno solutioninfinite number of solutionsnone of these
320
views
commented
Apr 3, 2020
Others
isi2017-dcg
engineering-mathematics
calculus
non-gate
differential-equation
+
–
2
answers
22
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 35
In a $10$-bit computer instruction format, the size of address field is $3$-bits. The computer uses expanding OP code technique and has $4$ two-address instructions and $16$ one-address instructions. The number of zero address instructions it can support is $256$ $356$ $640$ $756$
In a $10$-bit computer instruction format, the size of address field is $3$-bits. The computer uses expanding OP code technique and has $4$ two-address instructions and $...
2.0k
views
answered
Apr 3, 2020
CO and Architecture
nielit2017oct-assistanta-it
co-and-architecture
machine-instruction
instruction-format
+
–
1
answer
23
NIELIT 2017 July Scientist B (CS) - Section B: 21
The combinational circuit given below is implemented with two NAND gates. To which of the following individual gates is its equivalent? NOT OR AND XOR
The combinational circuit given below is implemented with two NAND gates. To which of the following individual gates is its equivalent?NOTORANDXOR
2.4k
views
commented
Apr 2, 2020
Digital Logic
nielit2017july-scientistb-cs
digital-logic
combinational-circuit
+
–
3
answers
24
NIELIT 2017 July Scientist B (CS) - Section B: 10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT($n$ ... operations will be $\Omega(n)$. Worst case time complexity for both operations will be $\Omega(\log n)$.
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT($n$ refers to t...
1.2k
views
commented
Apr 2, 2020
DS
nielit2017july-scientistb-cs
data-structures
queue
+
–
1
answer
25
NIELIT 2017 July Scientist B (CS) - Section B: 9
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are $\Theta(n \log n),\Theta(n \log n) \text{ and } \Theta(n^2)$ $\Theta(n^2),\Theta(n^2)\text{ and } \Theta(n \log n)$ $\Theta(n^2), \Theta(n \log n)\text{ and } \Theta(n \log n)$ $\Theta(n^2),\Theta(n\log n) \text{ and } \Theta(n^2)$
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are$\Theta(n \log n),\Theta(n \log n) \text{ and } \Theta(n^2)$$\Theta(n^2),\Thet...
843
views
commented
Apr 2, 2020
Algorithms
nielit2017july-scientistb-cs
algorithms
time-complexity
+
–
2
answers
26
NIELIT 2017 July Scientist B (CS) - Section B: 8
A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10,8,5,3,2$. Two new elements $1$ and $7$ are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is $10,8,7,3,2,1,5$ $10,8,7,2,3,1,5$ $10,8,7,1,2,3,5$ $10,8,7,5,3,2,1$
A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10,8,5,3,2$. Two new elements $1$ and $7$ are in...
1.1k
views
commented
Apr 2, 2020
DS
nielit2017july-scientistb-cs
data-structures
priority-queue
binary-heap
+
–
0
answers
27
NIELIT 2017 July Scientist B (CS) - Section B: 2
Which of the following statements is/are TRUE for an undirected graph? Number of odd degree vertices is even Sum of degrees of all vertices is even P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...
1.2k
views
commented
Apr 2, 2020
Graph Theory
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
degree-of-graph
+
–
0
answers
28
NIELIT 2017 July Scientist B (CS) - Section B: 1
What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head==NULL) return; fun1(head->next); printf("%d",head->data); } Prints all ... lists Prints all nodes of linked list in reverse order Prints alternate nodes of Linked List Prints alternate nodes in reverse order
What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head==NULL) return; fun1(head->next); printf("%d",h...
2.0k
views
commented
Apr 2, 2020
DS
nielit2017july-scientistb-cs
data-structures
linked-list
+
–
1
answer
29
NIELIT 2017 July Scientist B (IT) - Section B: 16
A partial ordered relation is transitive, reflexive and antisymmetric bisymmetric antireflexive asymmetric
A partial ordered relation is transitive, reflexive andantisymmetricbisymmetricantireflexiveasymmetric
544
views
commented
Apr 2, 2020
Set Theory & Algebra
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
partial-order
+
–
1
answer
30
NIELIT 2017 July Scientist B (IT) - Section B: 12
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is $6$ $8$ $9$ $13$
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is$6$$8$$9$$13$
740
views
commented
Apr 2, 2020
Graph Theory
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
graph-planarity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register