Persistent Data structure and algorithm Quiz -1

Question 1

Time: 00:00:00
Consider the usual algorithm for determining whether 

a sequence of parentheses is balanced.

Suppose that you run the algorithm on a sequence that 

contains 2 left parentheses and 3 right parentheses (in some order).

The maximum number of parentheses that appear on the stack 

AT ANY ONE TIME during the computation?

1

1

2

2

3

3

4

4

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

how ? i cant understand please explain

Start

Question 2

Time: 00:00:00
Advantages of linked list representation of binary trees 

over arrays?

dynamic size

dynamic size

ease of insertion/deletion

ease of insertion/deletion

ease in randomly accessing a node

ease in randomly accessing a node

both dynamic size and ease in insertion/deletion

both dynamic size and ease in insertion/deletion

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 3

Time: 00:00:00
Level order traversal of a tree is formed with the help of

breadth first search

breadth first search

depth first search

depth first search

dijkstra’s algorithm

dijkstra’s algorithm

prims algorithm

prims algorithm

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 4

Time: 00:00:00
Which algorithmic technique does Fibonacci search use?

Brute force

Brute force

Divide and Conquer

Divide and Conquer

Greedy Technique

Greedy Technique

Backtracking

Backtracking

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 5

Time: 00:00:00
When the Breadth First Search of a graph is unique?

When the graph is a Binary Tree

When the graph is a Binary Tree

When the graph is a Linked List

When the graph is a Linked List

When the graph is an n-ary Tree

When the graph is an n-ary Tree

None of the mentioned

None of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 6

Time: 00:00:00
 If several elements are competing for the same bucket in 

the hash table, what is it called?

Diffusion

Diffusion

Replication

Replication

Collision

Collision

None of the mentioned

None of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 7

Time: 00:00:00
What is the search complexity in direct addressing?

O(n)

O(n)

O(logn)

O(logn)

O(nlogn)

O(nlogn)

O(1)

O(1)

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 8

Time: 00:00:00
Which of the following is not an application of priority queue?

Huffman codes

Huffman codes

Interrupt handling in the operating system

Interrupt handling in the operating system

Undo operation in text editors

Undo operation in text editors

Bayesian spam filter

Bayesian spam filter

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 9

Time: 00:00:00
Which of the following methods can be used to search an 

element in a linked list?

Iterative linear search

Iterative linear search

Iterative binary search

Iterative binary search

Recursive binary search

Recursive binary search

All of the mentioned

All of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 10

Time: 00:00:00
What differentiates a circular linked list from a normal 

linked list?

You cannot have the ‘next’ pointer point to null in a circular linked list

You cannot have the ‘next’ pointer point to null in a circular linked list

It is faster to traverse the circular linked list

It is faster to traverse the circular linked list

You may or may not have the ‘next’ pointer point to null in a circular linked list

You may or may not have the ‘next’ pointer point to null in a circular linked list

All of the mentioned

All of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

["0","40","60","80","100"]
["Need more practice! \r\n","Keep trying! \r\n","Not bad! \r\n","Good work! \r\n","Perfect! \r\n"]
×

Please login to report

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Start Preparing
Detailed performance

Completed

0/10

Accuracy

0%

Prime

Prime Mock

Topic wise Full Mock and much more

(For Persistent)
Get Prime Video
Related Banners
prepinsta
prepinsta
Prepinsta Prime
Get Prepinsta Prime

Get all 200+ courses offered by Prepinsta

Explore Prime or check Course List
Check out our instagram

Never Miss an OffCampus Update

Get OffCampus Updates on Social Media from PrepInsta

Follow us on our Media Handles, we post out OffCampus drives on our Instagram, Telegram, Discord, Whatsdapp etc.

Instagram Whatsapp Telegram Linkedin
Get Hiring Updates
Amazon,Google,Delottie & 30+companies are hiring ! Get hiring Updates right in your inbox from PrepInsta
prepinsta
prepinsta
prepinsta
prepinsta

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.
Get Prime Course List

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.
Get Prime Course List

Get PrepInsta Prime Subscription

Get access to all the courses that PrepInsta offers, check the out below -

Companies

TCS, Cognizant, Delloite, Infosys, Wipro, CoCubes, KPMG, Amazone, ZS Associates, Accenture, Congnizant & other 50+ companies

See Full list here
Get Prime

Programming

Data Structures, Top 500 Codes, C, C++, Java Python & other 10+ subjects

See Full list here
Get Prime

Skills

Full Stack Web Development, Data Science, Machine Learning, AWS Cloud, & other 10+ skills and 20+ projects

See Full list here
Get Prime

Related Pages

August 31, 2020

Comments