IN COLLABORATION WITH IVTB. Diploma in Information Technology

Transcription

1 IN COLLABORATION WITH IVTB Diploma in Information Technology Cohort DIP/04 Part Time Resit Examinations for / Semester 2 MODULE: STRUCTURED PROGRAMMING MODULE CODE: BISE060 Duration: 2 Hours 15 Minutes Instructions to Candidates: 1. You are required to answer any 3 questions. 2. Answer on the answer sheet provided. 3. Always start a new question on a fresh page. This question paper contains 5 questions and 5 pages. Page 1 of 5

2 QUESTION 1 : (25 MARKS) a) Define the data structure Queue. Explain any one of its application (6 Marks) b) Describe two types of Priority Queue and the operations performed on them. c) The following operations are performed on the data structure Stack. Write implementation codes for the following operations: 1) PUSH AN ELEMENT 2) POP AN ELEMENT 3) CHECK STACK UNDERFLOW(empty). 4) DISPLAY STACK CONTENTS (Note: Use Static Implementation) (16 Marks) QUESTION 2 : (25 MARKS) a) Define a Linked List and give its representation in C. b) Give two advantages and two disadvantages of a Linked List over an Array. (4 Marks) c) Implement a dynamic Linked List to perform the following operations. (15 Marks) 1) Add an element at the end of the Linked List 2) Add an element at the beginning of the Linked list 3) Display the contents of the Linked List d) Graphically represent a Doubly Linked List and write one of its advantages as compared to Singly Linked List. Page 2 of 5

3 QUESTION 3: (25 MARKS) a) The Resource Center of a software development company maintains Books, Magazines and CD s for its Software professionals. Following are the major activities that take place at the Resource Center Stock Maintenance-Keep records of all types of items. Borrow Items-The employees can borrow a book/cd/magazine provided he/she is a Member of the Resource Center. He cannot borrow more than any 2 items nor can he borrow items if he has pending fine to pay. Return of Items-He will be penalized if he keeps any item with him for more than 15 days. He pays a Fine of Rs 1/- per day. Write Functional Specifications for i) Add items in Stock ii) Borrow an Item iii) Return an Item b) (i) Optimize the following segment of code (12 Marks) if (value = = 1) displayone(value); if (value = = 2) displaytwo(value); if (value = = 3) displaythree(value); if (value = =4) displayfour(value); if (value = =5) displayfive(value); (7 Marks) (ii) State the advantages of the optimized code you have achieved above. c) Explain the benefits of code Optimization Page 3 of 5

4 QUESTION 4:(25 MARKS) 1. Construct a binary Tree for the following list of numbers Give an advantage of storing the above numbers in a Binary Tree as compared in an Array. (5 + 1 Marks) 2. Consider the Expression Tree given below and write down the output in traversing the tree in the following ways: a) Inorder b) Preorder c) Postorder (3x5 Marks) / * e f a b c d 3. List four necessary conditions for any Deadlock to occur. (4 Marks) Page 4 of 5

5 QUESTION 5: 25 MARKS 1. Using Big-O notation Determine the Order of the execution time for the following segment of Code. void main() { int i, j, k=0; for(i=0 ; i < (N/2) ; i++) for(j=0; j <n ; j++) } while(k < (n*n)) { printf( %d, i*j*k); k++; (15 Marks) 2. a) Write Short notes on Indexed Sequential Files. b) Define i) Recovery testing ii) Security testing (6 Marks) (2x2 Marks) *** END OF QUESTION PAPER*** Page 5 of 5