Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged data-structures
2
votes
1
answer
61
Made Easy Test Series
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6). What is the minimum number of jumps required to reach the end of the array?
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, consi...
Ray Tomlinson
835
views
Ray Tomlinson
asked
Aug 9, 2023
Algorithms
made-easy-test-series
made-easy-booklet
algorithms
data-structures
array
algorithm-design
+
–
0
votes
1
answer
62
UGC NET CSE | June 2023 | Part 2: 9
Consider a hash table of size seven with starting index zero and a hash function $(6 x+3) \bmod 4$. Assuming the hash table is initially empty. Which of the following is the content of the table when the sequence $1,3,8,10,5$, is inserted into the table using closed hashing? Here " denotes ... $3,8,1,$_,$10,5$ _,$3,8,1$,_,$10,5$ _$1,3,8,10,5$,_
Consider a hash table of size seven with starting index zero and a hash function $(6 x+3) \bmod 4$. Assuming the hash table is initially empty. Which of the following is ...
admin
658
views
admin
asked
Jul 28, 2023
DS
ugcnetcse-june2023-paper2
data-structures
hashing
+
–
0
votes
1
answer
63
Self Doubt
I have a doubt on simple Queue Implementation by an array Assume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last element If we dequeue the element then front's element will get deleted, Now do we have to ... space is empty) I am not talking about circular queue concept,I am just talking about simple queue implementation using array(Not circular).
I have a doubt on simple Queue Implementation by an arrayAssume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last elementIf we dequ...
viral8702
312
views
viral8702
asked
Jul 22, 2023
DS
queue
self-doubt
data-structures
+
–
0
votes
0
answers
64
Made easy booklet
Çșȇ ʛấẗẻ
171
views
Çșȇ ʛấẗẻ
asked
Jul 19, 2023
Algorithms
made-easy-booklet
data-structures
algorithms
+
–
0
votes
1
answer
65
self-doubt Data structure Linked list. Inserting a node at the beginning of a linked list
How to Visualize this code ? #include<stdio.h> #include<stdlib.h> struct node{ int data; struct node *next; }; void addFirst(struct node **head,int val){ struct node *newNode =malloc(sizeof(struct node ... ); addFirst(&head,30); addFirst(&head,40); addFirst(&head,50); printList(head); }
How to Visualize this code ?#include<stdio.h #include<stdlib.h struct node{ int data; struct node *next; }; void addFirst(struct node head,int val){ struct node *newNode...
gagan55
874
views
gagan55
asked
Jul 13, 2023
DS
data-structures
linked-list
+
–
0
votes
1
answer
66
what is load factor
Gaurav Kadyan
172
views
Gaurav Kadyan
asked
Jul 13, 2023
DS
data-structures
+
–
0
votes
1
answer
67
Go Class data structure asymptotic notation practice video question 21
I have specific doubt on this question and I’ve tried to explain that in the picture , If anyone can explain it then it’ll be of great help. according to sachin sir the answer should be false( fyi).
I have specific doubt on this question and I’ve tried to explain that in the picture ,If anyone can explain it then it’ll be of great help. according to sachin sir th...
kickassakash
395
views
kickassakash
asked
Jul 4, 2023
DS
asymptotic-notation
goclasses
data-structures
+
–
0
votes
0
answers
68
Gate Overflow Test series
Can anyone explain this question to me
Can anyone explain this question to me
priyansh_1705
384
views
priyansh_1705
asked
Jul 3, 2023
Programming in C
linked-list
data-structures
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
60
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register