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 dd
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by dd
0
votes
31
MIT assignment Doubt
How the worst case of merge sort is O(n^2) according to the given MIT assignment pdf:- explain ?
answered
in
Algorithms
May 9, 2017
644
views
algorithms
time-complexity
mit-quiz
15
votes
32
ISRO2017-63
What does the following program do when the input is unsigned 16 bit integer? #include<stdio.h> main(){ unsigned int num; int i; scanf("%u", &num); for(i=0;i<16;i++){ printf("%d", (num<<i&1<<15)?1:0); } } It prints all even bits from num It prints all odd bits from num It prints binary equivalent of num None of above
answered
in
Programming in C
May 7, 2017
8.4k
views
isro2017
programming-in-c
loop
17
votes
33
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
answered
in
Algorithms
May 7, 2017
4.2k
views
isro2017
relations
algorithms
time-complexity
0
votes
34
Placing rooks in nXn chess board
Write a recursive backtracking solution for placing $3$ rooks in $6^*6$ chess board. Naive backtracking. Try using bitmask to speed it up.
answered
in
Algorithms
May 6, 2017
1.1k
views
non-gate
recursion
combinatory
0
votes
35
linked list
I think option should be a) but given is c.here head pointer point the first node whereas tail pointer point the last node And if want to delete the first element then element will be deleted but head pointer will be free.then how to head pointer point the first node/element.Pls tell what is correct??
answered
in
DS
May 1, 2017
809
views
1
vote
36
PGEE 2017
$\int_{-3}^{3} \left | X+1 \right |dx$
answered
in
Calculus
Apr 30, 2017
522
views
iiith-pgee
calculus
3
votes
37
ISI 2014
Read the C code given below. What would be the output of the following program? Justify your answer. #include <stdio.h> int myrecurse(int a, int b){ return (b == 1 ? a: myrecurse(a, b-1) + a); } main() { int a[]= {2,3,4,5,6}; ... an $O(n log n)$ algorithm to determine whether the given sequence $S$ has a subsequence whose sum is zero, and justify the correctness of the algorithm.
answered
in
Written Exam
Apr 26, 2017
399
views
isi2014
programming-in-c
algorithms
4
votes
38
what is difference between "int * const ptr=&i" and const int *ptr;;
what is difference between "int * const ptr=&i" and const int *ptr;;
answered
in
Programming in C
Apr 20, 2017
1.5k
views
programming-in-c
1
vote
39
Generate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
answered
in
Algorithms
Apr 20, 2017
2.7k
views
backtracking
algorithms
descriptive
5
votes
40
theory of computation
How many of them below are equivalent to (a+b)* ? A) (a*b)*a* B) (b*a)*b* C) a*(ba*)* D) b*(ab*)*
answered
in
Theory of Computation
Apr 15, 2017
401
views
theory-of-computation
regular-expression
3
votes
41
Timothy Williams Question
The machine pictured in fig a)complements a given bit pattern b)finds 2's complement c)increments a given bit pattern by 1 d)changes the sign bit
answered
in
Theory of Computation
Apr 15, 2017
681
views
1
vote
42
c pointers
main() { char *p1="name"; char *p2; p2=(char*)malloc(20); memset(p2,0,20); while(*p2++=*p1++); printf("%s\n",p2); }
answered
in
Programming in C
Apr 14, 2017
1.5k
views
1
vote
43
Kenneth Rosen Edition 6th Exercise 5.5 Question 15 (Page No. 380)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
answered
in
Combinatory
Apr 14, 2017
9.8k
views
discrete-mathematics
kenneth-rosen
combinatory
2
votes
44
Probability Exercise
The chess club of two school consists of 8 and 9 players.4 member from each club are randomly chosen to participate in a competition of two school.chosen player from one team are then randomly paired against chosen players of another team.suppose Rebecca and ... and Elise will be paired 2.Rebecca and Elise will be chosen to play but they will NOT be paired against Each Other
answered
in
Probability
Apr 11, 2017
667
views
probability
3
votes
45
GATEBOOK TEST
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ? getting 2 please check
answered
in
Quantitative Aptitude
Apr 10, 2017
419
views
3
votes
46
C programming
answered
in
Programming in C
Apr 8, 2017
924
views
programming-in-c
18
votes
47
ISI2004-MIII: 23
If $\textit{f}(x)=x^{2}$ and $g(x)=x \sin x +\cos x$ then $f$ and $g$ agree at no point $f$ and $g$ agree at exactly one point $f$ and $g$ agree at exactly two point $f$ and $g$ agree at more then two point
answered
in
Calculus
Apr 6, 2017
1.5k
views
isi2004
engineering-mathematics
functions
0
votes
48
logic
can somebody explain the intution behind this ...? i am not able to get ....and i dont want to by-heart ....
answered
in
Mathematical Logic
Apr 6, 2017
382
views
discrete-mathematics
propositional-logic
engineering-mathematics
mathematical-logic
3
votes
49
Gate math book
Find the sum of n terms of the series $log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
answered
in
Mathematical Logic
Apr 5, 2017
732
views
engineering-mathematics
2
votes
50
Dynamic declaration of 2D array
Dynamic declaration of 2D array int **arr=(int**) malloc(r* sizeof(int*)); for(i=0; i<r; i++) arr[i]=(int*) malloc(c* sizeof(int)); can anyone explain these lines?
answered
in
Programming in C
Apr 5, 2017
1.3k
views
programming-in-c
3
votes
51
theory of computation
Is the language given below regular or not ? I feel it is regular. The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 } - { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1b2a2 , a1b3a1 and few more strings (but finite number of ... language is regular ... QUESTION TAKEN FROM PETER LINZ TEXTBOOK AND ANSWER WAS NOT GIVEN. So please verify whether i am correct ...???
answered
in
Theory of Computation
Apr 4, 2017
567
views
theory-of-computation
finite-automata
0
votes
52
ISI 2004 MIII
The inequality $\frac{2-gx+x^{2}}{1-x+x^{2}}\leq 3$ is true for all the value of $x$ if and only if $1\leq g\leq 7$ $-1\leq g\leq 1$ $-6\leq g\leq 7$ $-1\leq g\leq 7$
answered
in
Set Theory & Algebra
Apr 4, 2017
913
views
isi2004
inequality
3
votes
53
CIL 2017
Which of the following operators can be used if a portion of a given bit patterns needs to be copied to a new word,while the remainder of the new word is filled with 0s? 1. Bitwise AND 2. Bitwise OR 3. Bitwise XOR 4. Bitwise AND
answered
in
Digital Logic
Apr 2, 2017
640
views
cil-2017
370
votes
54
GATE IT 2006 | Question: 49
Which one of the choices given below would be printed when the following program is executed ? #include <stdio.h> struct test { int i; char *c; }st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, " ... $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$
answered
in
Programming in C
Mar 31, 2017
27.0k
views
gateit-2006
programming
programming-in-c
normal
structure
2
votes
55
Ravi asked his neighbor to water a delicate plant while he is away.
Ravi asked his neighbor to water a delicate plant while he is away. Without water, the plant would die with probability $4/5$ and with water, it would die with probability $3/20$ ... forgot to water the plant? (A) $4/5$ (B) $27/43$ (C) $16/43$ (D) $2/25$
answered
in
Probability
Mar 27, 2017
685
views
probability
1
vote
56
A bit string is called legitimate if it contains no consecutive zeros, e.g., 0101110 is legitimate,
A bit string is called legitimate if it contains no consecutive zeros, e.g., 0101110 is legitimate, whereas 10100111 is not. Let an denote the number of legitimate bit strings of length n. Dene a0 = 1. Derive a recurrence relation for an (i.e., express an in terms of the preceding ai's).
answered
in
Combinatory
Mar 27, 2017
686
views
combinatory
1
vote
57
complexity
Let there are n elements in array and number of sorted subarray is log n of size n/ log n each then what is the time complexity to sort given array
answered
in
Algorithms
Mar 26, 2017
434
views
sorting
time-complexity
3
votes
58
context free grammar
Construct context-free grammars to accept the following languages. $\begin{align*} \large L = \left \{ 0^i1^j2^k \;\; | \;\; i \neq j \;\; or \;\; j \neq k \right \} \end{align*}$
answered
in
Theory of Computation
Mar 25, 2017
696
views
context-free-grammar
context-free-language
theory-of-computation
2
votes
59
error in the code
why is it showing error?? #include <stdio.h> int main() { extern int i; i=20; printf("%d",i); }
answered
in
Programming in C
Mar 24, 2017
868
views
programming-in-c
1
vote
60
C programming doubt
I am getting segmentation fault for the following code.Please help to rectify. #include <stdio.h> #include <stdlib.h> struct person { int age; float weight; char *name; }; int main() { struct person *ptr; int i, num; printf("Enter number of persons: "); ... printf("%s\t%d\t%.2f\n", ptr->name[i], (ptr+i)->age, (ptr+i)->weight); return 0; }
answered
in
Programming in C
Mar 24, 2017
1.3k
views
Page:
« prev
1
2
3
4
5
6
7
...
13
next »
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:...