Chapter 10: Data Structures - II: Stacks and Queues

-

Chapter 10: Data Structures - II: Stacks and Queues

Type C: Programming Practice/ Knowledge based Questions

1. Write a program that depending upon user's choice, either pushes or pops an element in a stack.
2. A line of text is read from the input terminal into a stack. Write a program to output the string in the reverse order, each character appearing twice.

(e.g., the string a b c d e should be changed to ee dd cc bb aa )

 3. Write a program that depending upon user's choice, either pushes or pops an element in a stack. The elements are shifted towards right so that top always remains at 0th (zeroth) index.
(N.B: If the elements are shifted downwards or towards right side, then unused free spaces are available at the beginning of the list otherwise free space is available at the end of the list)

 4. Write a program to insert or delete an element from a queue depending upon user's choice. The elements are not shifted after insertion or deletion.

 5. Write a program to insert or delete an element from a queue depending upon user's choice.
(N.B: shifting the elements towards the right so that rear always remains at the 0th index)
 6. Write a program to implement input-restricted deque. (Both the operations i.e., insertions and deletions should be taken care of.)

 7. Each node of a STACK contains the following information:
(i) Pin code of a city,
(ii) Name of city.
Write a program to implement following operations in above stack
(a) PUSH( ) To push a node in to the stack.
(b) POP( ) To remove a node from the stack.

 8. Write a program that implements three queues namely HighestPr, NormalPr and LowestPr.
The program accepts an element along with its priority from the user, e.g.,
          
          Enter element: KP213
          Priority (Highest/ Normal/ Lowest(H/N/L)): H

 As per priority entered, the element is added in the corresponding queue.
A menu offers following options:
          
          1. Insert Element
          2. Search for Element
          3. Change Priority

 For option 1, element is inserted in one queue as described above.
For option 2, ask for an element and search for it in all three queues. If found, display its queue  name, otherwise display "Element not found".
For option 3, ask for an element, if it exists in a queue, ask for its new priority as:

           Want to Increase/ Decrease its priority (I/ D)? I 

 And then remove the element from its existing queue and add it to the new queue as per the changed priority.
(NB: for option 3 if the element (whose priority needs to be changed) is situated at the end of the queue say rear then all of the elements are popped off from the front end and added to the rear until we reach that element)

Comments

  1. Isha27 November 2019 at 19:02

    Thankyou .... Its helping😊

    ReplyDelete
  2. Anonymous28 May 2020 at 16:39

    Great effort. Thanks a lot it helped me. Could u also post answers for Q8. Also for question 3 is it possible that I can provide u with a solution that I found.

    ReplyDelete
    Replies
    1. Anonymous28 May 2020 at 16:41

      I meant Q5. Sorry

      Delete
    2. Johndripper3 June 2020 at 12:08

      Solution for Question 8 is posted enjoy, regarding question 5 it is same as question 4 unless it wants us to use shifting which I thought of adding but never did which I am fixing right now :). And if you want you can share your own solution for it as a pastebin link here :) i will look into it and add it as an alternate solution if it is not the same as mine :)

      Delete

Post a Comment

Popular posts from this blog

Chapter 05 - File Handling

-
Chapter 05 - File Handling Type C: Programming Practice/ Knowledge based Questions 1. Write a program that reads a text file and creates another file that is identical except that every sequence of consecutive blank spaces is replaced by a single space. 2. A file sports.dat contains information in following format: Event ~ Participant. Write a function that would read contents from file sports.dat and create a file named Atheletic.dat copying only those records from sports.dat where the event name is "Athletics". 3. A file contains a list of telephone numbers in the following form: Arvind 7258031 Sachin 7259197 The names contain only one word the names and telephone numbers are separated by white spaces. Write a program to read a file and display its contents in two columns. 4. Write a program to count the words 'to' and 'the' present in a text file "Poem.txt". 5.Write a program to count the number of upper-case alphabets ...
Read more

Dictionary (Python)

-
DICTIONARY 1. Repeatedly ask the user to enter a team name and how many games the team has won and how many they lost. Store this information in a dictionary where the keys are the team names and the values are the lists of the form [wins, losses]. (a) Using the dictionary created above, allow the user to enter a team name and print out the teams winning percentage. (b) Using the dictionary, create a list whose entries are the number of wins of each team. (c) Using the dictionary, create a list of all those teams that have winning records. team_dict ={} winningList=[] winningTeam=[] numofTeams=int(input("Insert Number of Teams: ")) for x in range(numofTeams): teamName=input('Team Name: ') winLossList=[] wins = int(input('Wins: ')) winningList.append(wins) losses=int(input('Losses: ')) if(wins>losses): winningTeam.append(teamName) winLossList.append(wins) winLossList.append(losses) team_dict[teamName] = winLossList print(...
Read more

Tuple (Python)

-
TUPLE 1. Write a Python program that creates a tuple storing first 9 terms of Fibonacci series. fib=(0,) n=int(input('Please enter a number ')) a,b=0,1 for i in range(n): a, b = b, a+b fib=fib+(a,) print(fib) 2. (a) Write a program that receives the index and returns the corresponding value. fib=(0,) n=int(input('Please enter a number ')) a,b=0,1 for i in range(n): a, b = b, a+b fib=fib+(a,) print(fib) readInput=int(input("Enter an index ")) print("Element at index ",readInput," is : ",fib[readInput]) (b) Write a program that receives a Fibonacci term and returns a number telling which term it is for instance, if you pass 3, it returns 5, telling it is 5th term; for 8, it returns 7. fib=(0,) n=int(input('Please enter a number ')) a,b=0,1 for i in range(n): a, b = b, a+b fib=fib+(a,) print(fib) readInput=int(input("Enter a fibonacci term: ")) print(fib.index(readInput)+1) 3. Write a pr...
Read more