0% found this document useful (0 votes)
6 views3 pages

FDS Algorithm Pseudocode Questions

The document contains exam questions from various semesters focusing on algorithms and pseudocode, including binary search, quick sort, selection sort, and postfix evaluation. It includes tasks for writing pseudocode in Python and C++, as well as explanations of sorting algorithms and data structure manipulations. Additionally, it covers operations on linked lists, stacks, and queues, emphasizing the complexity of various algorithms.

Uploaded by

stvnsbr2265
Copyright
© © All Rights Reserved
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
0% found this document useful (0 votes)
6 views3 pages

FDS Algorithm Pseudocode Questions

The document contains exam questions from various semesters focusing on algorithms and pseudocode, including binary search, quick sort, selection sort, and postfix evaluation. It includes tasks for writing pseudocode in Python and C++, as well as explanations of sorting algorithms and data structure manipulations. Additionally, it covers operations on linked lists, stacks, and queues, emphasizing the complexity of various algorithms.

Uploaded by

stvnsbr2265
Copyright
© © All Rights Reserved
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

FDS Exam Questions Containing 'Algorithm' or 'Pseudocode'

From Nov_Dec_2022.pdf:

- Q1 a) Write pseudo 'Python' algorithm (recursive) for binary search. Apply your algorithm on the

following numbers stored in array from A[0] to A[10] 9, 17, 23, 38, 45, 50, 57, 76, 90, 100 to search

numbers 10 & 100.

- Q1 b) Explain the quick sort algorithm. Show the contents of array after every iteration from given

array: 27, 76, 17, 9, 57, 90, 45, 100, 79.

- Q2 b) Write an algorithm of selection sort and sort the following numbers: 81, 5, 27, -6, 61, 93, 4,

8, 104, 15.

- Q3 a) Write a pseudo C++ code to sort the elements of a linked list.

- Q4 b) Write Pseudo C++ code for addition of two polynomials using singly linked list.

- Q5 a) Write an algorithm for postfix evaluation with suitable example.

From May_June_2023.pdf:

- Q1 a) Write a pseudo code for binary search. Apply your algorithm to search 23 & 100 in: 9, 17,

23, 40, 45, 52, 58, 80, 85, 95, 100.

- Q1 b) Explain the selection sort with algorithm and sort: 27, 76, 17, 9, 45, 58, 90, 79, 100.

- Q3 a) Write a pseudo code to insert new node into singly linked list.

- Q5 a) Write a pseudo code for basic operation of stack.

- Q6 a) Write algorithm for postfix expression evaluation. Explain with suitable example.

- Q7 a) Write pseudo code to implement circular queue using array.

From May_June_2024.pdf:

- Q1 b) Write an algorithm to search an element using binary search. Stepwise search of 10 in 1-11.

- Q4 a) Write pseudocode to perform merging of two sorted singly linked lists of integers into third

list. Write complexity of it.


- Q5 a) Write rules to convert given infix to postfix using stack. Convert: (A*B - (C + D*E)^ (F*G/H)).

- Q6 b) Write pseudo-C/C++ code to implement stack using array with overflow and underflow.

- Q7 a) Write pseudocode to add and remove element from Circular Queue with Full/Empty

condition.

- Q8 c) Write pseudocode for Linear Queue implementation using array.

From Nov_Dec_2023.pdf:

- Q3 a) Write pseudo code using Singly Linked List of students to:

i) Search given roll no and delete record.

ii) Add given number after specified number.

- Q4 a) Write pseudocode to perform addition of two polynomials using doubly linked list. Write time

complexity.

- Q4 b) Write pseudocode for concatenation of two doubly linked lists.

- Q6 b) Write pseudo-C/C++ code to implement stack using singly linked list with overflow and

underflow.

From Nov_Dec_2024.pdf:

- Q1 c) Write the algorithm to search an element using binary search. Write best/average/worst case

complexity.

- Q2 c) Write pseudocode for Selection sort method. Is this sort stable or unstable?

- Q3 a) Write pseudo code using Doubly Circular Linked List to:

i) Add odd numbers and insert at start

ii) Delete even numbers

- Q4 a) Write pseudocode to add two polynomials using circular linked list. Write complexity.

- Q5 a) Write pseudocode to convert infix to prefix using stack.

- Q6 a) Convert infix to postfix using stack and evaluate it.


- Q7 a) Write insert and delete functions for Circular Queue using static memory.

- Q7 b) Write pseudocode for insert and delete in queue using singly linked list.

You might also like