Data Structures SEE Examination Preparation Plan Part 1

( this mostly also is useful for Lab exam; Part 2 will be shared in a
few days))

1. Develop a boolean function to determine if an input string is a valid

Python identifier
(valid, as defined in class and notes). (SEE Theory and Lab exam)

2. Different versions of GCD programs done in class and lab. (SEE Theory
and Lab Exam)

3. Fibonacci functions done in class and lab.(SEE Theory and Lab exam)

4. Function for Tower of Hanoi problem.(SEE Theory and Lab exam)

5. Stacks, Queues using Python Lists and linked lists.(SEE Theory and Lab
exam)

6. Insertion, deletion of nodes from a singly linked list.(SEE Theory and

Lab exam)

7. Traversal of a singly linked list.(SEE Theory and Lab exam)

8. Checking if a string is a palindrome using a stack.(SEE Theory and Lab

exam)

9. checking if a list of parantheses is well formed using a stack.(SEE

Theory and Lab exam)

10. Circularly linked list using Python list.(Theory and Lab)

11. Circularly linked list using linked lists.(Theory and Lab)

12. Problems given in both the assignments.(Theory and Lab)

13. Sparse Matrix Addition using dictionary.(Lab exam)

14. Question:(Theory exam)

Explain the role of a stack in managing function call and return
mechanism. Write a program with nested function calls and corresponding
function definitions(bodies). Draw a series of states of the stack used
for storing return addresses on the stack for the sample program.

15.6.1.2 Simple Array-based Stack implementation page 231 (Theory

and Lab)
Implementing a Stack using a Python List
pages 232-234
6.1.4 Matching Parenthese and HTML tags pages 236 to 238 (Theory and
Lab)

Practice Problems: (from Text Book) (Theory exam)

Page 250:
R-6.1, R-6.2, R-6.3, R-6.5, R-6.8, R-6.9
Homework:(Theory exam)
 Consider that k operations such as substitute a substring by
another , delete a substring and insert a sub string are performed on a
string s.
String s:
“The lazy fox jumped over the dog”
Substitute “lazy” by “crazy”
Substitute “over” by “upon”

Substitute “dog” by “dog.”

Resulting string:
“The crazy fox jumped upon the dog.”
Implement an undo operation that will undo the most recent change caused
by the last issued command.
First Undo results in
“The crazy fox jumped upon the dog”
Second Undo results in
“The crazy fox jumped over the dog”
Third Undo results in
“The lazy fox jumped over the dog”
Problem: Use Stack data structure and implement a program to Undo the
k(or three changes/commands issued above).
Mentioned any assumptions to be made for the program implementation (such
as assumptions on input string).