Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged data-structures
1
votes
1
answer
271
data structure and algorithms -- linked list -- size of a node
as we allocate the space for node in linked list using malloc() so how many bytes malloc allocate for the 1 node i.e. actual value of malloc allocates in ram like i write this code. so what is size of a node of linked ... node *)malloc(sizeof(struct node)); printf("%d",sizeof(struct node)); } what the printf prints and why ?
as we allocate the space for node in linked list using malloc() so how many bytes malloc allocate for the 1 node i.e. actual value of malloc allocates in ram like i write...
ykrishnay
670
views
ykrishnay
asked
Aug 5, 2022
Programming in C
data-structures
linked-list
algorithms
sorting
+
–
0
votes
1
answer
272
NIELIT 2021 Dec Scientist B - Section B: 51
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of nodes of degree $2$ is $10$. The number of leaf nodes in binary tree is: $10$ $11$ $12$ $15$
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of nodes of degree $2$ is $10$. The number of leaf nodes in binary tree is:$10$$11$$12...
admin
302
views
admin
asked
Jul 21, 2022
Others
nielit-2021-it-dec-scientistb
data-structures
binary-tree
+
–
1
votes
1
answer
273
data structure
Consider a standard Circular Queue ‘q’ implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[1], q[2], ……, q[10]. The front and rear pointer are initialized to point at q[2]. In which position will the ninth element be added?
Consider a standard Circular Queue ‘q’ implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are...
jugnu1337
537
views
jugnu1337
asked
Jul 17, 2022
DS
data-structures
test-series
+
–
0
votes
2
answers
274
MadeEasy Test Series
There are 15 vertices and 15 edges in some graph. Now, these edges are arranged in such a way that maximum number of connected components are created in the graph. Find the connected components created. (A) 8 (B) 9 (C) 10 (D) 11 Please explain your answer.
There are 15 vertices and 15 edges in some graph. Now, these edges are arranged in such a way that maximum number of connected components are created in the graph. Find t...
anupamsworld
907
views
anupamsworld
asked
Jul 8, 2022
DS
made-easy-test-series
data-structures
graph-theory
graph-connectivity
+
–
2
votes
3
answers
275
Array
An array VAL[1..15][1..10] is stored in the memory with each element requiring 4 bytes of storage. If the base address of array VAL is 1500, determine the location of VAL[12][9] when the array VAL is stored in Row wise. ?
An array VAL[1..15][1..10] is stored in the memory with each element requiring 4 bytes of storage. If the base address of array VAL is 1500, determine the location of VAL...
Nitesh_Yadav
2.0k
views
Nitesh_Yadav
asked
Jul 2, 2022
Programming in C
array
programming-in-c
data-structures
+
–
0
votes
1
answer
276
Introduction to Alogrithm
Number of max heap possible with n distinct keys.
Number of max heap possible with n distinct keys.
Overflow04
369
views
Overflow04
asked
Jun 29, 2022
DS
data-structures
binary-heap
+
–
0
votes
1
answer
277
uppcl 2021
what is the average-case time complexity for finding the height of the Binary tree.
what is the average-case time complexity for finding the height of the Binary tree.
amit166
616
views
amit166
asked
Jun 1, 2022
Programming in C
data-structures
binary-tree
time-complexity
+
–
Page:
« prev
1
...
5
6
7
8
9
10
11
12
13
14
15
...
60
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
