Data Structures & Algorithms

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

No questions yet — be the first to ask.

Need Paper? See all →

Need a paper or stuck on a question? Ask here — students reply and you get an email.

Ayesha Mustafa· 3 days ago

BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025

0 replies Reply →
Abubakar· 3 days ago

Literary criticism

1 reply Reply →
Guest· 4 days ago

this paper consists of 60 marks but now we have 35 marks paper.

1 reply Reply →
Annie· 4 days ago

Can you please tell me more past papers please because my exams are starting from next week

1 reply Reply →
Ahmed· 8 days ago

Did you provide the past papers of the science of society uos?

1 reply Reply →

See all

Part-III (Subjective)

QUESTION # 3 [10 marks]

Convert following In-fix expression to Post-fix expression. Evaluate both In-fix and Post-fix

expression to compare results?

(3 * (6/3))+ (8/ (6-4))

QUESTION # 4 [10 marks]

Write a C++ function bool isMaxHeap (int A[], int size) to determine whether the array A is a

Max Heap or not. This function should return true if the array A is a Max Heap and it should

return false otherwise. You can assume that the indices of the array start at 1 (instead of 0).

QUESTION # 5 [10 marks]

Write a C++ function Node * middleLinkedList(Node *head) to find the middle of a linked

list. This function receives the head of linked list as parameter and then after finding returns the

address of middle node.

Good Luck