Login
Remember
Register
Recent
Hot!
Most votes
Most answers
Most views
Ask a Question
Recent questions
0
votes
1
answer
A ……….. is a graph that has weights of costs associated with its edges.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
network-graph
0
votes
1
answer
A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
data-structure
0
votes
1
answer
There is an extra element at the head of the list called a ……….
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
head-element
0
votes
1
answer
………… is not the operation that can be performed on queue.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
data-structure
0
votes
1
answer
What will be the value of top, if there is a size of stack STACK_SIZE is 5
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
stack-size
0
votes
1
answer
The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.a s
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
data-structure
0
votes
1
answer
A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
grapg
0
votes
1
answer
Which of the following is not the internal sort?
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-strcture
0
votes
1
answer
In ……………, search start at the beginning of the list and check every element in the list.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-search
0
votes
1
answer
The number of comparisons done by sequential search is ………………
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
sequential-search
0
votes
1
answer
In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-structure
0
votes
1
answer
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
directed-graph
0
votes
1
answer
To represent hierarchical relationship between elements, Which data structure is suitable?
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-elements
0
votes
1
answer
Which of the following data structure is linear type?
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
linear-data-structure
0
votes
1
answer
Which of the following data structure is non linear type?
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
non-linear
0
votes
1
answer
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-structure
0
votes
1
answer
Which data structure is used in breadth first search of a graph to hold nodes?
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data
structure
0
votes
1
answer
Herder node is used as sentinel in …..
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-structue
0
votes
1
answer
Which of the following is non-liner data structure?
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-structure
0
votes
1
answer
A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-structure
0
votes
1
answer
Which of the following data structure can’t store the non-homogeneous data elements?
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
data-structure
+1
vote
1
answer
Which data structure allows deleting data elements from and inserting at rear?
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
data-structure
+1
vote
1
answer
………… is very useful in situation when data have to stored and then retrieved in reverse order.
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
data-structure
+1
vote
1
answer
……………. Is a pile in which items are added at one end and removed from the other.
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
pile-data
+1
vote
1
answer
Which of the following is not the part of ADT description?
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
data-structure
+1
vote
1
answer
last in first out
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
lifo
data-structure
+1
vote
1
answer
Stack is also called as
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
stack
+1
vote
1
answer
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
binary-search
+1
vote
1
answer
Which if the following is/are the levels of implementation of data structure
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
data-structure
+4
votes
1
answer
What characterize is hyperplance in geometrical model of machine learning?
asked
Dec 6, 2022
in
Machine Learning
by
sharadyadav1986
machine-learning
Page:
« prev
1
...
353
354
355
356
357
358
359
360
361
362
363
...
667
...
next »
Recent questions
...
