Dark Mode

Recent questions tagged data-structures

0 votes

1 answer

1

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 2 days ago

54 views

0 votes

0 answers

2

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 4 days ago

by Sahil_Lather

20 views

0 votes

0 answers

3

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 4 days ago

by Sahil_Lather

19 views

0 votes

0 answers

4

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 4 days ago

by Sahil_Lather

17 views

0 votes

1 answer

5

TestBook testseries linkedList question
What does the following routine do on doubly linked list. M is some middle node address and N is a newly inserted node address. N → lptr = M ; N → rtptr = M → rptr ; N → lptr → rptr = N ; N → rptr → lptr = N ; Inserts a node to Right of M Left of M Right Most Left Most

Sahil_Lather asked in DS 4 days ago

by Sahil_Lather

17 views

0 votes

0 answers

6

Header nodes are essential in ................

pascal asked in DS 5 days ago

by pascal

16 views

1 vote

1 answer

7

Made Easy Test Series | Prog And DS | Linked List
The following C function rearranges the members of a single-linked list of integers that is passed as a parameter. The list of numbers 1, 2, 3, 4, 5, 6, and 7 in the specified order is passed to the function when it is called. How many components will move about in the list once the function is finished running?

Souvik33 asked in Programming Jan 11

98 views

0 votes

0 answers

8

Made Easy Test Series | Prog. and DS | Dynamic Memory Allocation | Malloc
Which line number contains an error or warning:

Souvik33 asked in Programming Jan 9

159 views

0 votes

1 answer

9

Made Easy Test Series Question
Consider a binary tree T with 50 nodes having 2 children and 80 nodes having 1 children. The number of nodes which are not cut vertex is ____ I understand how the question can be answered. I want to know if the question would be about the ... to answer this. Main problem that I am facing is how to consider the structure of the tree? Is there a systematic approach?

TusharRana asked in DS Jan 2

147 views

0 votes

0 answers

10

damz1499 asked in DS Dec 29, 2022

49 views

Page:

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

Recent questions tagged data-structures