Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

1 votes
0 answers
222
AVL Trees
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
User Avatar
1 votes
1 answer
223
Programming Question
An object whose contents cannot be changed once the object is created is called: (a) Immutable object (b) Mutable object (c) Smart object (d) Rich object
An object whose contents cannot be changed once the object is created is called:(a) Immutable object(b) Mutable object(c) Smart object(d) Rich object
User Avatar
0 votes
1 answer
224
this similar question was discussed in GO classes C programming video lectures by (sachin mittal sir.)
i have typed the following code but when i executed it the solution was not according to my expectation.unsigned short int y= -9; int iy=y; printf(“%d”,iy); solutio...
User Avatar
0 votes
0 answers
225
Data Structure
Not able to understand the last option.
Not able to understand the last option.
User Avatar
0 votes
1 answer
226
Programming
I am getting 5 as output, but the answer is 4, please verify
I am getting 5 as output, but the answer is 4, please verify
User Avatar
0 votes
0 answers
227
postfix expression
I want to know which evaluation is wrong here: a-b-c = ab-c- or a-b-c = abc- – a * b *c = ab*c* a*b*c = abc** 3 . a+b-c = ab+c- a+b-c = abc-+
I want to know which evaluation is wrong here:a-b-c = ab-c- or a-b-c = abc- –a * b *c = ab*c* a*b*c = abc 3 . a+b-c = ab+c- a+b-c = ...
User Avatar
0 votes
2 answers
228
Programming and DS
#include <stdio.h> int main(){ int a[] = {5,3,7,2,4}; int *p = &a[3]; p -= *p; printf("%d ",*p); return 0; } output is 3. Why 2 * sizeof(int) is doene.?
#include <stdio.h int main(){ int a[] = {5,3,7,2,4}; int *p = &a[3]; p -= *p; printf("%d ",*p); return 0; } output is 3.Why 2 * sizeof(int) is doene.?
User Avatar
0 votes
1 answer
229
Data Structure
Can we determine unique tree by Inorder and level order traversal .
Can we determine unique tree by Inorder and level order traversal .
User Avatar
0 votes
0 answers
230
unacademy test series
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the possible string(s) that can be stored. A)STRUCTURE B)UNION C)POINTER D)FUNCTION
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the...
User Avatar
1 votes
1 answer
231
DOUBT
DOUBT: suppose a memory space of 16B is given and it is asked that what is the maximum length of string it can store. then do we have to consider the space taken by the “\0” also? OR just the string length?
DOUBT:suppose a memory space of 16B is given and it is asked that what is the maximum length of string it can store.then do we have to consider the space taken by the �...
User Avatar
0 votes
0 answers
232
Doubt
DOUBT 1: if head = P → link. is performed then what will happen to the nodes containing values a and b? will they get removed as no link is pointing them? and we will left with only three nodes like DOUBT 2: what does head = (*P).link; equals to?
DOUBT 1: if head = P → link.is performed then what will happen to the nodes containing values a and b? will they get removed as no link is pointing them?and we will ...
User Avatar
0 votes
2 answers
234
made easy gate cs question bank
What will be the output printed for find(4)? void find(int x) { static int i = 10, y = 0; y = y + i; for(i; i>0; i = i - 10) { if(x! = 0) find(x – 1); else printf(“%d”, y); } }
What will be the output printed for find(4)? void find(int x) { static int i = 10, y = 0; y = y + i; for(i; i>0; i = i - 10) { if(x! = 0) find(x – 1); else printf(“%d...
User Avatar
0 votes
2 answers
235
data structure using c, by yaswant kanethkar
Explain the method to calculate the address of an element in an array. A 25*4 matrix array DATA is stored in memory in ‘row-major order’. If base address is 200 and 4 words per memory cell. Calculate the address of DATA [12, 3]…??
Explain the method to calculate the address of an element in an array. A 25*4 matrix arrayDATA is stored in memory in ‘row-major order’. If base address is 200 and 4 ...
User Avatar
0 votes
1 answer
238
Algorithms
Given ‘N’ objects, which are coloured as red, white and blue. Sort these objects so that objects of the same colour are adjacent, with the colours in the order red, white and blue. Design an algorithm with a time com- plexity of O(nlog n)
Given ‘N’ objects, which are coloured as red, white and blue. Sort theseobjects so that objects of the same colour are adjacent, with the coloursin the order red, whi...
User Avatar
3 votes
1 answer
239
TIFR CSE 2022 | Part B | Question: 1
Which data structure is commonly used to implement breadth first search in a graph? A queue A stack A heap A hash table A splay tree
Which data structure is commonly used to implement breadth first search in a graph?A queueA stackA heapA hash tableA splay tree
User Avatar
Page: