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 Chris Jason
1
answer
1
Made Easy Test Series:Algorithm-Time Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any o...
2.1k
views
commented
Nov 26, 2019
Algorithms
algorithms
made-easy-test-series
time-complexity
+
–
2
answers
2
ISRO2007-36
Consider a computer system that stores a floating-point numbers with $16$-bit mantissa and an $8$-bit exponent, each in two's complement. The smallest and largest positive values which can be stored are : $1 \times 10^{-128} \text{ and } 2^{15} \times 10^{128}$ ... $1 \times 10^{-128} \text{ and } 2^{15}-1 \times 10^{127}$
Consider a computer system that stores a floating-point numbers with $16$-bit mantissa and an $8$-bit exponent, each in two’s complement. The smallest and largest posit...
10.0k
views
commented
Oct 9, 2019
Digital Logic
isro2007
digital-logic
number-representation
floating-point-representation
+
–
2
answers
3
GATE CSE 1996 | Question: 1.25
Consider the following floating-point number representation.$\begin{array}{c|c} \begin{array}{cc}31\;\;\hspace{15pt}&\hspace{15pt}24\end{array} & \begin{array}{cc}23\hspace{15pt}&\hspace{15pt}0\end{array} \\\hline \text{Exponent}&\text{Mantissa}\\ \hline \end{array}$The ... to $1$ $0.5$ to $1$ $2^{-23}$ to $0.5$ $0.5$ to $\left(1-2^{-23}\right)$
Consider the following floating-point number representation.$$\begin{array}{c|c}\begin{array}{cc}31\;\;\hspace{15pt}&\hspace{15pt}24\end{array} & \begin{array}{cc}23\hspa...
21.0k
views
commented
Oct 9, 2019
Digital Logic
gate1996
digital-logic
number-representation
normal
+
–
5
answers
4
UGC NET CSE | Junet 2015 | Part 2 | Question: 35
Which phase of compiler generates stream of atoms? Syntax Analysis Lexical Analysis Code Generation Code Optimization
Which phase of compiler generates stream of atoms?Syntax AnalysisLexical AnalysisCode GenerationCode Optimization
4.5k
views
answered
Oct 1, 2019
Compiler Design
ugcnetcse-june2015-paper2
compiler-design
+
–
2
answers
5
UGC NET CSE | December 2015 | Part 3 | Question: 19
The solution of the reccurence relation $T(n) \leq \begin{cases} \theta(1) & \text{ if } n \leq 80 \\ T\bigg(\dfrac{n}{s} \bigg)+T \bigg(\dfrac{7n}{10}+6\bigg)+O(n) & \text{ if } n> 80 \end{cases}$ is $O(\lg n)$ $O(n)$ $O(n \lg n)$ None of the above
The solution of the reccurence relation$T(n) \leq \begin{cases} \theta(1) & \text{ if } n \leq 80 \\ T\bigg(\dfrac{n}{s} \bigg)+T \bigg(\dfrac{7n}{10}+6\bigg)+O(n) & \tex...
2.0k
views
answered
Sep 7, 2019
Algorithms
ugcnetcse-dec2015-paper3
algorithms
recurrence-relation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register