Scribd
Upload
5 views1 page

Ds Lab Internal-2 Setsnew

The document outlines various programming tasks grouped into sets, focusing on data structures such as stacks, queues, hash tables, and binary search trees. Each set contains specific implementation requirements, including evaluating expressions, checking for balanced parentheses, and simulating systems like printer queues. The tasks emphasize both array and linked list implementations, as well as collision resolution techniques in hash tables.

Uploaded by

satish muthyala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views1 page

Ds Lab Internal-2 Setsnew

The document outlines various programming tasks grouped into sets, focusing on data structures such as stacks, queues, hash tables, and binary search trees. Each set contains specific implementation requirements, including evaluating expressions, checking for balanced parentheses, and simulating systems like printer queues. The tasks emphasize both array and linked list implementations, as well as collision resolution techniques in hash tables.

Uploaded by

satish muthyala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

SET-1:

A) Implement a stack using arrays.


B) Implement a hash table with collision resolution techniques.

SET-2:

A) Write a program to evaluate a postfix expression using a stack.

B) Implement a program to check for balanced parentheses using a stack.

SET-3:

A) Implement a stack using linked list.

C) Solve problems involving circular queues.

SET-4:

A) Use a stack to evaluate an infix expression and convert it to postfix.

B) ) Implement a stack or queue to perform comparison and check for symmetry.

SET-5:

A) Implementing a BST using Linked List.

C) Implement a circular queue using arrays.

SET-6:

A) Implement a double-ended queue (deque) with essential operations

B) Create a program to determine whether a given string is a palindrome or not.

SET-7:

A) Implement a queue using arrays.


B) Write a program to implement a simple cache using hashing

SET 8:

A) Develop a program to simulate a simple printer queue system.


B) Implement a queue using linked lists.

You might also like