Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User AbhayPrajapati
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by AbhayPrajapati
0
votes
1
ISI2014-DCG-17
$\underset{x \to 2}{\lim} \dfrac{1}{1+e^{\frac{1}{x-2}}}$ is $0$ $1/2$ $1$ non-existent
answered
in
Calculus
Aug 14, 2020
614
views
isi2014-dcg
calculus
limits
1
vote
2
ISI2016-DCG-45
The value of $\underset{x \to 0}{\lim} \dfrac{\tan^{2}\:x-x\:\tan\:x}{\sin\:x}$ is $\frac{\sqrt{3}}{2}$ $\frac{1}{2}$ $0$ None of these
answered
in
Calculus
Aug 14, 2020
467
views
isi2016-dcg
limits
3
votes
3
GATE IT 2005 | Question: 21
Consider the entities 'hotel room', and 'person' with a many to many relationship 'lodging' as shown below: If we wish to store information about the rent payment to be made by person (s) occupying different hotel rooms, then this information should appear as an attribute of Person Hotel Room Lodging None of these
answered
in
Databases
Aug 12, 2020
10.5k
views
gateit-2005
databases
er-diagram
easy
1
vote
4
GATE CSE 2009 | Question: 54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
answered
in
Algorithms
May 25, 2020
14.3k
views
gatecse-2009
normal
algorithms
dynamic-programming
recursion
0
votes
5
Made Easy Test Series:Algorithm-Recurrence Relation
What is the solution of recurrence relation $T\left ( n \right )=T\left ( n-1 \right )+n$
answered
in
Algorithms
May 4, 2020
876
views
algorithms
time-complexity
recurrence-relation
2
votes
6
GATE CSE 2015 Set 2 | Question: 15
Consider the following function written in the C programming langauge : void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } } The output of the above function on input "$ABCD \ EFGH$" is $ABCD \ EFGH$ $ABCD$ $HGFE \ DCBA$ $DCBA$
answered
in
Programming in C
Apr 1, 2020
14.4k
views
gatecse-2015-set2
programming
programming-in-c
normal
recursion
16
votes
7
GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
answered
in
Operating System
Mar 16, 2020
19.5k
views
gatecse-2003
operating-system
process-scheduling
normal
0
votes
8
GATE CSE 2005 | Question: 39
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
answered
in
Algorithms
Sep 13, 2019
26.2k
views
gatecse-2005
algorithms
sorting
normal
0
votes
9
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
answered
in
DS
Aug 21, 2019
25.6k
views
gatecse-2017-set1
data-structures
linked-list
normal
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...