Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged analysis
1
1 vote
1
1 answer
125
125 views
UGC NET CSE | December 2025 | Part 2 | Question: 40
How many number of comparison are required in worst case to find out second smallest element of $n$ elements list?$n+\lceil\log n\rceil-1$$n+\lceil\log n\rceil$$\lceil\lo...
Shubham Sharma 2
125
views
asked
Apr 19
Algorithms
ugcnetcse-dec2025
data-structures
algorithms
analysis
+
–
1
1 vote
1
1 answer
123
123 views
UGC NET CSE | December 2025 | Part 2 | Question: 57
Match the LIST-I with LIST-IILIST-IInputLIST-IICompiler PhaseA.Syntax TreeI.Code GeneratorB.Character StreamII.Syntax AnalyzerC.Intermediate RepresentationIII.Semantic An...
Shubham Sharma 2
123
views
asked
Apr 19
Compiler Design
ugcnetcse-dec2025
compiler
compiler-design
syntax-tree
lexical-analysis
syntax-analyzer
semantic-analyzer
code-generation
analysis
+
–
0
0 votes
1
1 answer
82
82 views
CMI 2025 | Mathematics | Part B | Question: 12
Consider the $\operatorname{ring} \mathcal{C}(\mathbb{R})$ of continuous real-valued functions on $\mathbb{R}$, with pointwise addition and multiplication. For $A \subset...
Shubham Sharma 2
82
views
asked
Nov 24, 2025
Set Theory & Algebra
cmi2025-math
ring-theory
functions
ideal
compact-support
set-theory
mathematical-logic
analysis
+
–
0
0 votes
1
1 answer
77
77 views
CMI 2025 | Mathematics | Part B | Question: 19
Show that the power series $\sum_{n=1}^{\infty} z^{n!}$ represents an analytic function $f(z)$ in the open unit disk $\Delta$ centred at $0.$ Show that $f(z)$ cannot be e...
Shubham Sharma 2
77
views
asked
Nov 24, 2025
Others
cmi2025-math
complex-analysis
limits
continuity
power-series
analysis
+
–
0
0 votes
1
1 answer
85
85 views
CMI 2025 | Mathematics | Part B | Question: 20
It is known that there exist surjective continuous maps $I \longrightarrow I^{2}$ where $I=[0,1]$ is the unit interval.Using the above result or otherwise, show that ther...
Shubham Sharma 2
85
views
asked
Nov 24, 2025
Others
cmi2025-math
topology
analysis
+
–
1
1 vote
1
1 answer
486
486 views
UGC NET CSE | June 2025 | Part 2 | Question: 27
The tight asymptotic bound for the recurrence $T(n)=2 T(n / 4)+\sqrt{n}$ is$\Theta(\sqrt{n})$$\Theta(n \log n)$$\Theta(\sqrt{n} \log n)$$\Theta(n \log \sqrt{n})$
Shubham Sharma 2
486
views
asked
Sep 10, 2025
Algorithms
ugcnetcse-june2025
recurrence-relation
asymptotic-notations
algorithm-design
analysis
+
–
0
0 votes
1
1 answer
631
631 views
UGC NET CSE | June 2025 | Part 2 | Question: 50
When developing a dynamic programming algorithm, the sequence of steps followed is:Construct an optimal solution from computed information.Recursively define the value of...
Shubham Sharma 2
631
views
asked
Sep 10, 2025
Algorithms
ugcnetcse-june2025
algorithm-design
dynamic-programming
analysis
+
–
1
1 vote
1
1 answer
435
435 views
UGC NET CSE | June 2025 | Part 2 | Question: 91
Consider the following Three Address code sample for solving the questions:$\begin{array}{lll} 100 &: & t 1=y+2 \\ 101 & : & \text {initial }=x / t 1 \\ 102 & : & \text {...
Shubham Sharma 2
435
views
asked
Sep 10, 2025
Compiler Design
ugcnetcse-june2025
three-address-code
compiler-design
intermediate-code
control-flow
analysis
+
–
1
1 vote
1
1 answer
299
299 views
UGC NET CSE | August 2024 | Part 2 | Question: 68
Select the Sorting Algorithms that are stable.Quick SortBubble SortInsertion SortMerge SortShell SortChoose the correct answer from the options given below:(I), (II), (II...
Shubham Sharma 2
299
views
asked
Sep 9, 2025
Algorithms
ugcnetcse-aug2024
sorting
algorithm-design
analysis
+
–
0
0 votes
1
1 answer
400
400 views
UGC NET CSE | August 2024 | Part 2 | Question: 78
Match List - I with List - II.$\begin{array}{llll} & \textbf{List - I} & & \textbf{List-II} \\ & \textbf{(Recurrence Relations)} && \textbf{(Complexity)} \\ \text{(A)}& \...
Shubham Sharma 2
400
views
asked
Sep 9, 2025
Algorithms
ugcnetcse-aug2024
recurrence-relation
time-complexity
algorithm-design
analysis
+
–
0
0 votes
1
1 answer
192
192 views
NIELIT Scientific Assistant June 2025 | Question: 72
Which of the following problems can be solved using a greedy approach?Knapsack problem ($0/1$ version)Job Scheduling with deadlines and profitsFibonacci sequence calculat...
Shubham Sharma 2
192
views
asked
Jul 24, 2025
Algorithms
nielit-sta-2025
greedy-algorithms
algorithm-design
analysis
+
–
0
0 votes
0
0 answers
384
384 views
ISI 2019 | PCB Mathematics | Question: 9
Let $f:[0,1] \rightarrow[0, \infty)$ be a continuous function. Let $$ a=\inf _{0 \leq x \leq 1} f(x) \text { and } b=\sup _{0 \leq x \leq 1} f(x) . $$ For every positive ...
admin
384
views
asked
Aug 8, 2022
Calculus
isi2019-pcb-mathematics
descriptive
functions
limits
analysis
real-analysis
+
–
0
0 votes
0
0 answers
373
373 views
ISI2020-MMA: 28
The series$$\frac{2x}{1+x^{2}}+\frac{4x^{3}}{1+x^{4}}+\frac{8x^{7}}{1+x^{8}}+\dots$$is uniformly convergent for all $x$is convergent for all $x$, but the convergence is n...
admin
373
views
asked
Jul 23, 2022
Calculus
isi2020-mma
test-series
calculus
limits
analysis
+
–
0
0 votes
0
0 answers
361
361 views
TIFR-2018-Maths-A: 4
True/False Question :Let $f$ be a nonnegative continuous function on $\mathbb{R}$ such that $\int_{0}^{\infty }f\left ( t \right )dt$ is finite. Then $\underset{x\rightar...
soujanyareddy13
361
views
asked
Aug 29, 2020
Calculus
tifrmaths2018
true-false
calculus
limits
analysis
+
–
0
0 votes
0
0 answers
336
336 views
TIFR-2019-Maths-A: 8
Consider the following two statements:$(E)$ Continuous function on $[1,2]$ can be approximated uniformly by a sequence of even polynomials (i.e., polynomials $p\left ( x ...
soujanyareddy13
336
views
asked
Aug 29, 2020
Calculus
tifrmaths2019
analysis
calculus
polynomials
approximation-theory
+
–
1
1 vote
1
1 answer
4.4k
4.4k views
UGC NET CSE | September 2013 | Part 3 | Question: 6
Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the d...
go_editor
4.4k
views
asked
Jul 22, 2016
Artificial Intelligence
ugcnetcse-sep2013-paper3
artificial-intelligence
means-end
analysis
+
–
To see more, click for the
full list of questions
or
popular tags
.