- Implementation of Infix to postfix expression conversion algorithm.
- Implementation of stack using an array (push, pop, peek operations).
- Implementation of queue using an array (insert, delete operations).
- Implementation of linked list. (insert, delete, concat, search operations)
- Implementation of stack using linked list. (push, pop, peek operations)
- Implementation of stack using linked list. (insert, delete operations)
- Implementation of Infix to postfix expression evaluation algorithm.
- Implementation of double ended queue. (input restricted, output restricted)
- implementation of priority queue. (ascending order, descending order priority queue)
- Implementation of quick sort.
- Implementation of bubble sort.
- Implementation of insertion sort.
- Implementation of merge sort.
- Implementation of hashing with collision resolution as open addressing chained hashing.
- Implementation of index sequential search on array. (array of strings, array of integers)
- Implementation of binary search on array. (array of strings, array of integers)
Note:
- Text in bracket indicates variations of programs/ questions.
- Question to implement will be given on random order upon arriving for exam.
- In practical exam, in 2 hours given one question has to implemented with working code and proper output.
- No help in error removal, has to be done on own.
- External examiner may suggest additional changes in question.
- Oral exam will be followed separately or along with practical exam.
- Be prepared and no cheat by any means.