SCHOOL OF COMPUTER AND COMMUNICATION ENGINEERING. EKT224: ALGORITHM AND DATA STRUCTURES (Stack, Queue, Linked list)

Size: px

Start display at page:

Download "SCHOOL OF COMPUTER AND COMMUNICATION ENGINEERING. EKT224: ALGORITHM AND DATA STRUCTURES (Stack, Queue, Linked list)"

Ashlie Rosa Rogers
5 years ago
Views:

1 ASSIGNMENT 2 SCHOOL OF COMPUTER AND COMMUNICATION ENGINEERING EKT224: ALGORITHM AND DATA STRUCTURES (Stack, Queue, Linked list) Date: 30/9/2015 Due Date: 30/10/2015 Early Bird Date: 23/10/2015 QUESTION 1: Stack a) Define Stack b) Write down ADT for Stack completely. (Include the algorithm for all stack operations.) [2 marks] [6 marks] c) The following is a pseudocode of a series of operations on a stack S, PUSH(S,X) pushes an element X into S, POP(S,X) pops out an element from stack S as X, PRINT(X) displays the variable X and EMPTYSTACK(S) is a Boolean function which returns true is S is empty and false other wse. What is the output of the code. [12 Marks] Line No Statement Line No Statement 1 K = 1; 9 PRINT(K) 2 PUSH(S,K); 10 While not EMPTYSTACK(S) 3 While K<20) 11 POP(S,K); 4 K=K*2; 12 PRINT(K) 5 PUSH(S,K); 13 End while 6 End while 14 Figure 1 Steps STACK K Output Displayed Page 1

2 d) The following pseudo code in Figure 1 is a recursive program mod which computes a mod b given a and b as inputs. Design and construct the contents of the stack during the execution of the call mod (43, 9). Hint: Use Figure 2 to construct your answer int Mod(int a, int b) { if (a < b) then Mod = a else { x1 = a - b; y1 = Mod(x1, b); Mod = y1 } }//end Mod Figure a b x1 y1 Figure 2 e) For the infix given below, obtain the equivalent postfix expression. Then evaluate the postfix using the algorithm eval_postfix, where A= 80, B=20, C =2, D=5, E=30, F=7, H=3 and I=3. Show your steps in tables below. ((A/B)/D)^C + E F * H * I Expression Sub-expression Postfix expression X (string expression) Stack Action/Output Page 2

3 f) Write a program to evaluate any given postfix expression. Your program should ask user to input a postfix expression for example ( ). Your program should able to process mathematical expression involve addition, subtraction, multiplication, division and the power of functions. Test your program for the evaluation of the equivalent postfix form of expression and print the output. Please submit your program (hand written) and the program output. [15 Marks] QUESTION 2: Queue a) Based on figure 4 below answer the following questions. Front: 1 Rear : 3 Y A [1] [2] [3] [4] [5] [6] Executions 1. ENQUEUE (Q,'W'); 2. ENQUEUE (Q,'L'); 3. DEQUEUE (Q); 4. DEQUEUE (Q); 5. ENQUEUE (Q,'B'); 6. ENQUEUE (Q,'C'); Figure 4 b) Consider the normal queue in figure 4, show the value of Front and Rear, and the array contents after each of the execution given. [8 Marks] c) Discuss the disadvantage of the queue and how to fix it. [2 Marks] d) Change the normal queue above to your proposal in your answer for question c. Show the value of Front and Rear and the content of the array after each of the execution given. e) Write a program for a circular queue graphically using the array structure. Your program should perform operation of insertion, deletion operation on a queue. Please give message when the queue is full and empty. Your program should display the content of the queue everytime after an operation take place. Please submit your program (hand written) and the print out of your program output for every action perform on the queue [20 marks] QUESTION 3: Linked list Page 3

4 a) Refer to diagram above: i. Write an algorithm to print the list (2 marks) ii. Insert an nnode contain word go at the end of the list. (3 marks) iii. Insert the nnode in (2) after node2. (3 marks) iv. Insert nnode at the beginning of the list. (2 marks) v. How to make the list above circular linked list. Write down full algorithm for that. (4 marks) vi. Write an algorithm to search the node which contains the word HERE in the linked list T above. (4marks) [20 Marks] b) Write a program to manipulate an ascending linear list of students information. The list should list ascendantly according to their names. Your program should able to insert student at the beginning of the list, in the middle and end of the list. Your program able to print the list of the students' name and program when ever user want to. Every time when there is an insertion or deletion print out the latest list of the students' name. User also should be able to search a student name and your program should be able to print out the searched student's name, age and program taken. Your program should use linked list data structure. The list should be able to hold the name, age and program taken (RK20 or RK93). Therefore, your data structure should look like this: struct studnode { char Name; int age; char program; struct studnode * link; } ; [30 Marks] Page 4

5 c) Implementing stack (LIFO) using linked list Write a program to evaluate a postfix expression using the linked list data structure. Your program should asked user to submit a postfix expression and your program should print out the result. Your program should able to handle the addition, multiplication, subtraction, division and power of mathematical function. [20 marks] Page 5

1 P age DS & OOPS / UNIT II

1 P age DS & OOPS / UNIT II UNIT II Stacks: Definition operations - applications of stack. Queues: Definition - operations Priority queues - De que Applications of queue. Linked List: Singly Linked List, Doubly Linked List, Circular