Scribd
Upload
19 views9 pages

Data - Structures 8

The document lists 6 problems: 1) checking if a postfix expression is correct, 2) designing a data structure to insert/delete from front/rear in O(1) time, 3) detecting loops in a linked list, 4) counting moves in the Towers of Hanoi problem, 5) checking if an infix expression is correct, and 6) automating the Bulls and Cows game.

Uploaded by

nareshvenkat007
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views9 pages

Data - Structures 8

The document lists 6 problems: 1) checking if a postfix expression is correct, 2) designing a data structure to insert/delete from front/rear in O(1) time, 3) detecting loops in a linked list, 4) counting moves in the Towers of Hanoi problem, 5) checking if an infix expression is correct, and 6) automating the Bulls and Cows game.

Uploaded by

nareshvenkat007
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Problems

Problems
. Problem I .. Check whether a given postx .expression is correct.

Problems
. Problem I .. Check whether a given postx .expression is correct. . Problem II .. Design a data structure that supports -

Problems
. Problem I .. Check whether a given postx .expression is correct. . Problem II .. Design a data structure that supports Inserting and deleting elements from front in O(1) time. .

Problems
. Problem I .. Check whether a given postx .expression is correct. . Problem II .. Design a data structure that supports Inserting and deleting elements from front in O(1) time. . Inserting and deleting elements from rear in O(1) time.

Problems
. Problem I .. Check whether a given postx .expression is correct. . Problem II .. Design a data structure that supports Inserting and deleting elements from front in O(1) time. . . Problem III .. .Detect loop in a linked list. Inserting and deleting elements from rear in O(1) time.

Problems
. Problem I .. Check whether a given postx .expression is correct. . Problem II .. Design a data structure that supports Inserting and deleting elements from front in O(1) time. . . Problem III .. .Detect loop in a linked list. Inserting and deleting elements from rear in O(1) time. . Problem IV .. Count the number of moves of towers .of Hanoi.

Problems
. Problem I .. Check whether a given postx .expression is correct. . Problem II .. Design a data structure that supports Inserting and deleting elements from front in O(1) time. . . Problem III .. .Detect loop in a linked list. Inserting and deleting elements from rear in O(1) time. . Problem IV .. Count the number of moves of towers .of Hanoi. . Problem V .. Check whether a given inx expression is correct. .

Problems
. Problem I .. Check whether a given postx .expression is correct. . Problem II .. Design a data structure that supports Inserting and deleting elements from front in O(1) time. . . Problem III .. .Detect loop in a linked list. Inserting and deleting elements from rear in O(1) time. . Problem IV .. Count the number of moves of towers .of Hanoi. . Problem V .. Check whether a given inx expression is correct. . . Problem VI .. .Automate the Bulls and Cows game.

You might also like