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
Webpage
Programming in C.
Recursion.
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Programming and DS
7
votes
3
answers
5141
What is the difference between static scoping and dynamic scoping?
sampad
asked
in
Programming in C
Oct 11, 2015
by
sampad
8.0k
views
programming
variable-binding
23
votes
3
answers
5142
TIFR CSE 2010 | Part B | Question: 37
Consider the program where $a, b$ are integers with $b > 0$. x:=a; y:=b; z:=0; while y > 0 do if odd (x) then z:= z + x; y:= y - 1; else y:= y % 2; x:= 2 * x; fi Invariant of the loop is a condition which is ... terminate for some values of $a, b$ but when it does terminate, the condition $z = a * b$ will hold. The program will terminate with $z=a^{b}$
makhdoom ghaya
asked
in
Programming in C
Oct 10, 2015
by
makhdoom ghaya
3.3k
views
tifr2010
programming
loop-invariants
16
votes
2
answers
5143
TIFR CSE 2010 | Part B | Question: 31
Consider the following computation rules. Parallel-outermost rule: Replace all the outermost occurrences of F (i.e., all occurrences of F which do not occur as arguments of other F's) simultaneously. Parallel - innermost rule: Replace all the innermost ... $0$ and $0$ respectively $w$ and $w$ respectively $w$ and $1$ respectively none of the above
Arjun
asked
in
Programming in C
Oct 10, 2015
by
Arjun
1.6k
views
tifr2010
programming
recursion
0
votes
2
answers
5144
What is the criteria for distinguishing data structure in terms of linear and non-linear ?
What is the criteria for distinguishing data structure in terms of linear and non-linear ? I am bit confused with the criteria for this. I have search and tried to clear this confusion but then i got more ... categorizing on the basis of storage in the memory and some place it is on the basis of traversal.
IgnitorSandeep
asked
in
DS
Oct 10, 2015
by
IgnitorSandeep
860
views
data-structures
16
votes
2
answers
5145
TIFR CSE 2010 | Part B | Question: 30
Consider the following program for summing the entries of the array $b$: array $[0 .. N-1]$ of integers, where $N$ is a positive integer. (The symbol '$<>$' denotes 'not equal to'). var i, s: integer; Program i:= 0; s:= 0; [*] while i <> N ... $s = \sum\limits^{i-1}_{j=0}b[j] \;\&\; 0 \leq i \leq N$
makhdoom ghaya
asked
in
Programming in C
Oct 8, 2015
by
makhdoom ghaya
2.7k
views
tifr2010
programming
loop-invariants
2
votes
1
answer
5146
float
following statment printf("%f",9/5); prints answer is 2.0 can any one explain plzzzzz
admin
asked
in
Programming in C
Oct 8, 2015
by
admin
2.0k
views
1
vote
2
answers
5147
What is the output of the following C code?
int main (){ int a=5,b=3; printf("%d", a+++++b); // 5 +'s } Please Explain.
Umang Raman
asked
in
Programming in C
Oct 7, 2015
by
Umang Raman
1.1k
views
programming-in-c
49
votes
5
answers
5148
TIFR CSE 2010 | Part B | Question: 26
Suppose there is a balanced binary search tree with $n$ nodes, where at each node, in addition to the key, we store the number of elements in the sub tree rooted at that node. Now, given two elements $a$ and $b$, such that $a < b$ ... $O(n)$ comparisons and $O(n)$ additions, using depth-first- search.
makhdoom ghaya
asked
in
DS
Oct 6, 2015
by
makhdoom ghaya
8.7k
views
tifr2010
binary-search-tree
1
vote
1
answer
5149
Scoping and Call by Need evaluation
Find the output of the below program in case of Dynamic Scoping with call by need evaluation method int x=10,y=10; main() { int x=2; int y=3; fun1(x+y,5); printf("x"); } fun1(int z,int k) { k=z+k; }
admin
asked
in
Programming in C
Oct 5, 2015
by
admin
726
views
programming-in-c
2
votes
1
answer
5150
What is the output of the program ?
int main(){ char *ptr = "gateexam"; printf("%c\n", *&*&*ptr); return 0; } (a) Compiler Error (b) Garbage Value (c) Runtime Error (d) g *please explain it.
IgnitorSandeep
asked
in
Programming in C
Oct 5, 2015
by
IgnitorSandeep
479
views
programming-in-c
4
votes
3
answers
5151
Let a, b be two positive integers, which of the following options correctly relates / and %?
Let a, b be two positive integers, which of the following options correctly relates / and %? (a) b= (a/b) * b + a%b (b) b= (a%b) * b + a/b (c) a= (a/b) * b + a%b (d) a= (a%b) * b + a/b * I am getting answer as c but the answer given is b. Please tell me which one is correct.
IgnitorSandeep
asked
in
Programming in C
Oct 5, 2015
by
IgnitorSandeep
6.5k
views
programming
programming-in-c
8
votes
1
answer
5152
ISRO2008-1
Which of the following is an illegal array definition? Type COLONGE : (LIME, PINE, MUSK, MENTHOL); var a : array [COLONGE] of REAL; var a : array [REAL] of REAL; var a : array [‘A’…’Z’] of REAL; var a : array [BOOLEAN] of REAL;
अनुराग पाण्डेय
asked
in
Programming in C
Oct 4, 2015
by
अनुराग पाण्डेय
9.2k
views
isro2008
array
1
vote
1
answer
5153
Why is the output of these two programs different in C?
#include int main(){ float x = 0.1; if (x == 0.1) printf("IF"); else if (x == 0.1f) printf("ELSE IF"); else printf("ELSE"); return 0; } #include int ... 0; } First program Output: ELSE IF Second program Output: IF Both programs are similar.But outputs are different.Why?
admin
asked
in
Programming in C
Oct 3, 2015
by
admin
1.1k
views
0
votes
2
answers
5154
output?
#define int char main(){ int i=66; printf("%d",sizeof(i)); }
sdpshaw
asked
in
Programming in C
Oct 2, 2015
by
sdpshaw
654
views
programming
programming-in-c
2
votes
3
answers
5155
find first repeated element..
given an array of n element, what will be the time complexity to find 1st repeated element when array have more than one repeated elements??
yes
asked
in
Programming in C
Oct 1, 2015
by
yes
1.0k
views
10
votes
3
answers
5156
ISRO2011-11
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $35$
ajit
asked
in
DS
Oct 1, 2015
by
ajit
10.2k
views
isro2011
data-structures
binary-search-tree
combinatory
1
vote
3
answers
5157
what is the output of the following c code?
what is the output of the following c code? #include<stdio.h> void main() { int index; for(index=1;index<=5;index++) { printf("%d",index); if(index==3) continue; } } a)1245 b)12345 c)12245 d)12354
ajit
asked
in
Programming in C
Oct 1, 2015
by
ajit
1.6k
views
programming-in-c
0
votes
5
answers
5158
What is the level number of an element present in an array of n integers interpreted as a complete binary tree?
radha gogia
asked
in
DS
Sep 30, 2015
by
radha gogia
1.6k
views
binary-tree
data-structures
3
votes
2
answers
5159
what is the meaning of probe sequence in hashing ?
I am unable to understand the meaning of probe sequence in context of no of slots , I have seen questions like no of probe sequences possible in quadratic or linear probing is m while in double hashing it is m^2 , so what is the ... sequence , is it that once collision occurs , so now to which index will the key would be next mapped on to ?
radha gogia
asked
in
DS
Sep 30, 2015
by
radha gogia
7.2k
views
0
votes
1
answer
5160
What is the no. of nodes in the tree that has exactly one child?
In a binary tree with n nodes every node has an odd no. of descendants. Every node is considered to be its own descendant. What is the no. of nodes in the tree that has exactly one child? (a) 0 (b) 1 (c) (n-1)/ 2 (d) n-1
IgnitorSandeep
asked
in
Programming in C
Sep 28, 2015
by
IgnitorSandeep
1.3k
views
data-structures
Page:
« prev
1
...
253
254
255
256
257
258
259
260
261
262
263
...
309
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)
Programming
(4.1k)
DS
(2.0k)
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 questions in Programming and DS
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:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow