Home
Q&A
Education
Technology
Credit
General
Health
Insurance
Questions
Ask a Question
Recent questions tagged Data-structures-&-algorithms-mcq
0
votes
Q: Which of the following declares the current plot undeclared?
Which of the following declares the current plot undeclared? (a) New = H (b) New = T (c) New = J ... Neural Networks of R Programming Select the correct answer from above options...
asked
Feb 9, 2022
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. The time complexity of performing deQueue operation is (Using only stack operations like push and pop)(Tightly bound).
You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ... from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: Consider you have an array of some random size. You need to perform dequeue operation. You can perform it using stack operation (push and pop) or using queue operations itself (enQueue and Dequeue). The output is guaranteed to be same. Find some differences?
Consider you have an array of some random size. You need to perform dequeue operation. You can perform ... from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: Consider yourself to be in a planet where the computational power of chips to be slow. You have an array of size 10.You want to perform enqueue some element into this array. But you can perform only push and pop operations .Push and pop operation both take 1 sec respectively. The total time required to perform enQueue operation is?
Consider yourself to be in a planet where the computational power of chips to be slow. You have an ... from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: You have two jars, one jar which has 10 rings and the other has none. They are placed one above the other. You want to remove the last ring in the jar. And the second jar is weak and cannot be used to store rings for a long time.
You have two jars, one jar which has 10 rings and the other has none. They are placed one above ... answer from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: Given an array of size n, let’s assume an element is ‘touched’ if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‘touched’). Now you need to perform Dequeue operation. Each element in the array is touched atleast?
Given an array of size n, let's assume an element is touched' if and only if some operation is ... answer from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: When an operand is read, which of the following is done?
When an operand is read, which of the following is done? (a) It is placed on to the output (b) ... answer from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: What is the ancestor of the leaf node in a given minimum ternary heap?
What is the ancestor of the leaf node in a given minimum ternary heap? (a) 1 (b) 10 (c) ... correct answer from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: The actual pairing heap implementation uses the right child and left child representation.
The actual pairing heap implementation uses the right child and left child representation. (a) true (b) ... from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
0
votes
Q: Naïve merge cannot be done in a skew merge.
Naïve merge cannot be done in a skew merge. (a) true (b) false Select the correct answer from above options Data Structures and Algorithms questions and answers...
asked
Nov 14, 2021
in
Education
by
JackTerrance
data-structures-&-algorithms-interview-questions
data-structures-&-algorithms-interview-questions-answers
data-structures-&-algorithms-multiple-choice-questions
data-structures-&-algorithms-mcq-with-answers
data-structures-&-algorithms-mcq
data-structures-&-algorithms-questions
To see more, click for the
full list of questions
or
popular tags
.
...