Give examples of a stack.
Unit IV · Stacks and Queues
Study the related answer →DS Previous Exam Questions
Topic-matched questions from the seven supplied JNTUH papers. Wording is normalised for readability; printed marks, sessions, source pages and question numbers are retained. DS01–DS07 identify supplied files, not official examination codes.
No direct matches were found for Units I and II in these papers. Their study answers are available from the current syllabus; advanced topics outside it are excluded from this bank.
45 questions
How can a queue be constructed using stacks?
Unit IV · Stacks and Queues
Study the related answer →Give an example of an adjacency list of a graph.
Unit V · Trees and Graphs
Study the related answer →Write and explain push and pop algorithms using a linked list.
Unit IV · Stacks and Queues
Study the related answer →Describe queue overflow and underflow conditions.
Unit IV · Stacks and Queues
Study the related answer →Discuss applications of queues.
Unit IV · Stacks and Queues
Study the related answer →Illustrate search in a binary search tree.
Unit V · Trees and Graphs
Study the related answer →Compare BFS and DFS for a graph.
Unit V · Trees and Graphs
Study the related answer →Starting stack bottom-to-top: 10, 20, 50, 30, 90, 60; capacity 10. Apply pop, push(30), push(40), pop, push(60), pop, pop, pop. Find the final peek value.
Unit IV · Stacks and Queues
Study the related answer →Implement a queue using a singly linked list.
Unit IV · Stacks and Queues
Study the related answer →Write a function to delete the last occurrence of a student from a list.
Unit III · Introduction to Data Structures
Study the related answer →Implement a stack using a singly linked list.
Unit IV · Stacks and Queues
Study the related answer →Compare BFS and DFS with examples.
Unit V · Trees and Graphs
Study the related answer →Define a singly linked list.
Unit III · Introduction to Data Structures
Study the related answer →Give queue applications.
Unit IV · Stacks and Queues
Study the related answer →Define a binary search tree.
Unit V · Trees and Graphs
Study the related answer →Define a graph.
Unit V · Trees and Graphs
Study the related answer →Give singly linked-list insertion and deletion algorithms.
Unit III · Introduction to Data Structures
Study the related answer →Explain array-based push and pop.
Unit IV · Stacks and Queues
Study the related answer →Starting stack bottom-to-top: 10, 20, 50, 30, 90, 60; capacity 10. Apply pop, push(30), push(40), pop, push(60), pop, pop, pop. Find the final peek value.
Unit IV · Stacks and Queues
Study the related answer →Convert A + B - C * D * E / F - G to postfix.
Unit IV · Stacks and Queues
Study the related answer →Give BST deletion algorithm with an example.
Unit V · Trees and Graphs
Study the related answer →Represent the supplied five-city flight network as a directed graph, adjacency matrix and adjacency list.
Unit V · Trees and Graphs
Study the related answer →Explain DFS with an example.
Unit V · Trees and Graphs
Study the related answer →Explain BFS with an example.
Unit V · Trees and Graphs
Study the related answer →Discuss singly linked lists.
Unit III · Introduction to Data Structures
Study the related answer →Write a C program to convert infix to postfix.
Unit IV · Stacks and Queues
Study the related answer →Explain binary search trees.
Unit V · Trees and Graphs
Study the related answer →Explain depth-first graph traversal with an example.
Unit V · Trees and Graphs
Study the related answer →Define a singly linked list and show its node structure and sketch.
Unit III · Introduction to Data Structures
Study the related answer →Explain queue operations.
Unit IV · Stacks and Queues
Study the related answer →Write a program implementing stack operations.
Unit IV · Stacks and Queues
Study the related answer →Explain queue applications.
Unit IV · Stacks and Queues
Study the related answer →Define a binary search tree.
Unit V · Trees and Graphs
Study the related answer →Give DFS algorithm with an example.
Unit V · Trees and Graphs
Study the related answer →Give insertion and deletion algorithms for a singly linked list.
Unit III · Introduction to Data Structures
Study the related answer →Convert A+B-C*D*E$F$G to postfix.
Unit IV · Stacks and Queues
Study the related answer →Differentiate BFS and DFS.
Unit V · Trees and Graphs
Study the related answer →Write a program implementing a linked-list stack.
Unit IV · Stacks and Queues
Study the related answer →Explain queue operations with an example.
Unit IV · Stacks and Queues
Study the related answer →Give BST deletion algorithm.
Unit V · Trees and Graphs
Study the related answer →Give push and pop algorithms.
Unit IV · Stacks and Queues
Study the related answer →Differentiate stack and queue.
Unit IV · Stacks and Queues
Study the related answer →Give an algorithm to insert a node at the last position of a linear linked list.
Unit III · Introduction to Data Structures
Study the related answer →Evaluate postfix 5 3 + 6 2 / * 3 5 * +, showing steps.
Unit IV · Stacks and Queues
Study the related answer →No matching source questions. Try another filter; use the unit study index for full syllabus coverage.
Source paper sessions
- DS01 · April/May 2023
- DS02 · August/September 2022
- DS03 · February 2024
- DS04 · March 2021
- DS05 · March 2022
- DS06 · October 2020
- DS07 · September 2021