Battle With DSA

Which of the following data structures can be efficiently implemented using a stack?

• Queue

• Binary Search Tree

• Heap

• Graph

What is the output of the following code?

• 0

• 1

• 2

• Attribute error

Which of the following highly uses the concept of an array?

• Binary Search tree

• Caching

• Spatial locality

• Scheduling of Processes

Convert the equivalent expression to prefix

• -+/abc+d*ef

• /+-abcd+*ef

• -/+abc+*def

• /-+abc+d*ef

What is the outcome of the prefix expression?

• 18

• 17

• 25

• 26

What is the time complexity of the following code snippet in C++?

• O(n)

• O(n²)

• O(logn)

• O(nlogn)

What is the post order traversal for the given graph?

• 4,12,10,18,24,22,15,31,44,35,90,66,70,50,25

• 4,12,10,15,18,24,22,25,31,44,35,66,90,70,50

• 4,10,12,15,18,22,24,25,31,35,44,50,66,70,90

• 4,12,10,18,24,22,15,31,44,35,66,90,70,50,25

Answer the following question

• O(n)

• O(log n)

• O(n/2)

• O(1)

Find the time complexity of the given code snippet

• O(n)

• O(n²)

• O(nlogn)

• O(logn)

Find the time complexity of the given code snippet

• O(n)

• O(n²)

• O(nlogn)

• O(n log² n)