CSS Computer Science Past Paper 2016

    Optional · 80 marks · three hours

    WhatsApp

    Original FPSC paper

    Download

    Instructions specific to this paper

    • Attempt ONLY FOUR questions from PART-II by selecting TWO questions from EACH
    • 100(2) (ii) 10100(2) (iii) 100101(2)
    • Attempt ONLY FOUR questions from PART-II by selecting TWO questions from

    Questions

    1. Q. 26 marks

      (a) Write a program to input choice from user for temperature conversion from Fahrenheit to Celsius or Celsius to Fahre00000000nheit. After the choice, input temperature from user and display the converted answer. Sample execution of the program is given below; 1. Fahrenheit to Celsius 2. Celsius to Fahrenheit Enter your choice: 1 Enter Temperature in Fahrenheit: 98 Same Temperature in Celsius: 36.7 Press Any Key to Continue.... (b) Which type of computer (supercomputers, mainframe computers, minicomputers, (6) microcomputers) will suit an individual? Justify your answer. (c) Suppose you are trying to build a Student Registration System using object oriented (8) approach. Objective of the system is to store information of course registration of students and their course results. In C++ syntax define following classes with suitable attributes each having getdata( ) and showdata( ) member functions along with suitable constructor functions; Person, Teacher, Student, Course, Section, Allocation (containing information about allocation of a course to a teacher in a semester), Registration (containing information about registration of a student in course, this class will also save course result information of the student). You can add more classes which you think suitable for the system.

    2. Q. 36 marks

      (a) Define a function named monthly-profit which will calculate the monthly profit on the given investment amount. Function will take two float arguments, percent profit rate and investment amount and return the monthly profit (float). Write function prototype, function definition and a main program to demonstrate the functionality. Sample execution of the program is given below. Note that monthly profit 4000 has been calculated by the function by doing (8/100) * 50000. User can enter any values therefore write generalized function (user variables, not given values). Enter percent profit rate: 8 Enter investment amount: 50000 Monthly profit: 4000 Press Any Key to Continue.... (b) Explain and differentiate between volatile and non-volatile memory, giving examples. (6) (c) Suppose you are trying to build a Library Information System using object oriented (8) approach. System should be able to keep track of books issued and returned. It should be able to calculate fine if a book is late. Currently you are required to design classes i.e. not to write C++ code but describe which class you will define, which data members you will add, which member functions you will include in those classes. Define only suitable classes and suitable attributes (data members) in C++ syntax. Names of some classes are like, Student, Teacher, Book, Issue Book etc. You can (but not required to) extend this list of four classes if you think of some other suitable classes.

    3. Q. 48 marks

      (a) Deadlock prevention algorithms prevents deadlock by restraining how requests can be made, the restrain ensure that at least one of the necessary conditions for deadlock cannot occur and hence, that deadlock cannot hold. Explain the Banker’s Algorithm for deadlock avoidance. (b) Central Processing Unit (CPU) scheduling deal with the problem of deciding which of (6) the processes in the ready queue is to be allocated to the CPU. What are the pros and cons of Multilevel Queue Scheduling and Multilevel Feedback Queue Scheduling? (c) What do you know about Process Control Block? Discuss its components in detail. (6)

    4. Q. 58 marks

      (a) Describe the followings (no description with more than three lines); i. Sibling Nodes ii. Degree of a tree iii. Leaf Node iv. Height/ Depth of a tree v. Binary Tree vi. Full Binary Tree vii. Complete Binary Tree viii. Maximum number of nodes in a Binary Tree at level L. (6) (b) Find the time complexity of Binary search by resolving the recurrence (given below) using iterative substitution method. T(1) =2 if n =< 1 T(n) = 4 + T(n/2) if n>1 (c) Draw the given array in the form of binary tree. Then apply ‘Build-Heap’ Algorithm to (6) convert the given tree in the form of Max-Heap (i.e. draw final Max-heap in the form of tree and array). Finally show execution of ‘Heap-sort’ algorithm by rewriting the Heap array after each iteration of the algorithm. A = {8, 14, 2, 26, 10, 12, 16, 28, 20, 7}

    5. Q. 68 marks

      (a) Write Abstract Data Types (ADT) of Stack and Queue. Include the specifications of Add, Delete, IsEmpty, IsFull functions along with their respective functions. (b) For step count expressions n2 + 10 and 2n / 4 find breakeven point i.e. for which value (6) of n (starting from 1,2…) second expression will become greater than value of first expression. (c) In AVL tree balance factor of every node is -1 or 0 or +1. We can calculate the balance (6) factor as Height left-sub-tree – Height right-sub-tree. Construct AVL tree from the given data; A = {8, 14, 2, 26, 10, 12, 16, 28, 20, 7}

    6. Q. 75 marks

      (a) Draw a diagram that illustrates the process of translating a C++ source file into an executable file. Give example of each phase depicted in your diagram of compilation process. (b) Compare and contrast among compiler, interpreter and assembler. (5) (c) Describe Software Development Life Cycle (SDLC). Explain your answer with the help (5) of depicting and describing different phases of pure water fall software life cycle. (d) What is the difference between SRS document and design document? What are the (5) contents we should contain in the SRS document and design document.

    7. Q. 85 marks

      (a) What are the purposes of Data Flow diagrams, Entity-Relationship diagrams? Give an example diagram of each. (b) Explain five properties of language using the example of English. Explain why a (5) software language like MiniJava meets these properties as well. (c) Lexical analysis: Consider the following regular expression (5) r1 = (A | …. | Z) * (0 | …. | 9)* Describe the language defined by r1 in English. Turn r1 into an equivalent finite automaton. Remove ɛ-moves from the finite automation. (d) What do you mean by Context Free Grammar (CFG)? Illustrate your answer with (5) examples.

    Standard FPSC instructions

    Printed on this and every CSS paper.

    • Part-II is to be attempted on the separate Answer Book.
    • All the parts (if any) of each question must be attempted at one place instead of at different places.
    • Write Q. No. in the Answer Book in accordance with Q. No. in the question paper.
    • No page/space be left blank between the answers. All the blank pages of the Answer Book must be crossed.
    • Extra attempt of any question or any part of the attempted question will not be considered.

    New papers and past-paper breakdowns, as they drop

    We post CSS and PMS prep every day to 40,000+ aspirants.