Dark Mode

Recent questions in Programming and DS

0 votes

1 answer

1

physics wallah dpp #clanguage #pointer

_Harshit asked in Programming 2 days ago

70 views

0 votes

1 answer

2

Practice question Avl trees
S1 : An insertion in an AVL with n nodes requires O(n) rotations. answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n). tell me if i am wrong and correct me please.

Ujjaval251 asked in Programming 6 days ago

55 views

0 votes

1 answer

3

binary search tree
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing value 4?

someshawasthi asked in DS Feb 27

by someshawasthi

103 views

0 votes

1 answer

4

TOPIC - Infix to postfix and prefix conversion
Convert the following infix expression to postfix and prefix A^B^C^D

akash28 asked in DS Feb 23

107 views

2 votes

2 answers

5

GATE CSE 2023 | Question: 2
Which one of the following sequences when stored in an array at locations $A[1], \ldots, A[10]$ forms a max-heap? $23,17,10,6,13,14,1,5,7,12$ $23,17,14,7,13,10,1,5,6,12$ $23,17,14,6,13,10,1,5,7,15$ $23,14,17,1,10,13,16,12,7,5$

admin asked in DS Feb 15

by admin

1.2k views

2 votes

1 answer

6

GATE CSE 2023 | Question: 3
Let $\textsf{SLLdel}$ be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let $\textsf{DLLdel}$ be another function that deletes a node in a doubly-linked list given a pointer to the node ... $\textsf{DLLdel}$ are $O(1)$ $\textsf{SLLdel}$ is $O(n)$ and $\textsf{DLLdel}$ is $O(1)$

admin asked in DS Feb 15

by admin

1.6k views

1 vote

2 answers

7

GATE CSE 2023 | Question: 25
The integer value printed by the $\textsf{ANSI-C}$ program given below is _______________ #include<stdio.h> int funcp(){ static int x = 1; x++; return x; } int main(){ int x,y; x = funcp(); y = funcp()+x; printf("%d\n", (x+y)); return 0; }

admin asked in Programming Feb 15

by admin

1.2k views

2 votes

1 answer

8

GATE CSE 2023 | Question: 26
Consider the following program: int main() int f1() int f2(int X) int f3() { { { { f1(); return(1); f3(); return(5); f2(2); } if(X==1) } f3(); return f1(); return(0); else } return (X*f2(X-1)); } Which one of the following options represents the activation tree corresponding to the main function?

admin asked in Programming Feb 15

by admin

1.0k views

1 vote

1 answer

9

GATE CSE 2023 | Question: 36
Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX} (A)$ extracts and deletes the maximum element from $A$. The operation $\operatorname{INSERT}(A, key )$ inserts a new ... $O(1)$ whereas $\operatorname{INSERT}(A, k e y)$ runs in $O(\log (n))$.

admin asked in DS Feb 15

by admin

932 views

1 vote

1 answer

10

GATE CSE 2023 | Question: 37
Consider the $\text{C}$ function $\text{foo}$ and the binary tree shown. typedef struct node { int val; struct node *left, *right; } node; int foo(node *p) { int retval; if (p == NULL) return 0; else { retval = p->val + foo(p->left) + foo(p->right); printf("%d ", ... $3 \;5\; 8\; 10\; 11\; 13$ $3 \;8 \;16 \;13\; 24\; 50$ $3\; 16\; 8\; 50\; 24\; 13$

admin asked in DS Feb 15

by admin

844 views

3 votes

3 answers

11

GATE CSE 2023 | Question: 49
Consider a sequence $a$ of elements $a_{0}=1, a_{1}=5, a_{2}=7, a_{3}=8, a_{4}=9$, and $a_{5}=2$. The following operations are performed on a stack $S$ and a queue $Q,$ both of which are initially empty. $\textsf{push}$ the ... $S$. $\textsf{pop}$ an element from $S$. The top element of $S$ after executing the above operations is ______________.

admin asked in DS Feb 15

by admin

871 views

0 votes

1 answer

12

GATE CSE 2023 | Memory Based Question: 41
Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap? $23\; 17\; 10\; 6\; 13\; 14\; 1\; 5 \;9 \;12$ $23 \;14 \;19 \;1 \;10 \;13 \;16 \;12 \;7 \;5$ $23 \;17\; 14\; 6\; 13\; 10\; 1\; 5\; 7\; 15$ $23 \;17\; 14\; 7\; 13\; 10\; 1\; 5\; 6\; 12$ closed

GO Classes asked in DS Feb 6

448 views

0 votes

1 answer

13

ISRO CS 2018
#include <stdio.h> int main() { int i,j,x; scanf("%d ",x); i=1; j=1; while(i<10){ j=j*i; i=i+1; if(i==x) break; } return 0; }

Rakshita Jadoun asked in Programming Feb 4

by Rakshita Jadoun

163 views

0 votes

1 answer

14

#madeeasy
is it ok to mark both and at least option in the case of MSQ, on my view in this question first option will always be true so marking the second is correct?

Dknights asked in Programming Feb 1

104 views

0 votes

1 answer

15

Made Easy test series
answer given is 33

TusharKumar asked in Programming Jan 31

174 views

0 votes

1 answer

16

#selfdoubt
how many topological sort possible for above graph?like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11

Dknights asked in Programming Jan 30

74 views

0 votes

1 answer

17

Programming and Data Structure | Static int | Made Easy Test series (Modified)
Consider the following C code snippets, labeled as P1, P2 and P3, the output of P1 is X , of P2 is Y and of P3 as Z . What is the value of X+Y+Z P1 #include <stdio.h> int f(int n) { static int r=40; if (n==0 | ... 1,r)-r; } else return f(n-1,r)+(2*r); } int main() { printf("%d",f(6,40)); return 0; }

Souvik33 asked in Programming Jan 29

144 views

0 votes

0 answers

18

TestBook testSeries board game question
Consider a board game in consist of m n grid. A coin is located at the top-left corner of an m n grid. The coin can only move either down or right at any point in time. The ultimate goal of the game places the coin at the bottom-right corner of the grid. ... path(m-1, n) + path(m, n-1); } Find the number of unique paths if grid order is 5 4. 38 25 35 28

Sahil_Lather asked in Programming Jan 28

by Sahil_Lather

84 views

0 votes

0 answers

19

TestBook TestSeries BFS Question to find 4th enqueue element
Consider the following graph. If BFS is implemented on the following graph where the root node is 1 then which of the following set of the nodes are present in the queue after performing 4th enqueue operation? 3, 4, 5 4, 6, 5 3, 4 4, 5, 6

Sahil_Lather asked in Programming Jan 28

by Sahil_Lather

79 views

0 votes

0 answers

20

TestBook testseries TLB and C programming combined question
Consider the following C function executed in an OS with paging where the page size is 4 kilobytes. Further, assume that the system employs a 32-entry direct mapped TLB. int *alloc_and_init() { int counter, value=0, size=2048; int ... of the program, what is the number of TLB misses during the execution of the for loop? 0 1 2048 2

Sahil_Lather asked in Programming Jan 28

by Sahil_Lather

36 views

Page:

1
2
3
4
5
6
...
294
next »

Recent questions in Programming and DS