PPSC Lecturer Computer Science Quiz No 15 A.J. Bhatti October 20, 2020 Welcome to your PPSC Mock Test Preparation Quiz no 9 Name Email Computer system is a (A) Hardware (B) Software (C) Bioware (D) Virtual ware Object model is a (A) Rule (B) Process guidance (C) System model (D) Entity Software engineering is an engineering discipline concerned with (A) Software development (B) Software production (C) Software implementation (D) All the above . A workflow model represents (A) Sequence of activities (B) Role of users involved (C) Set of activities (D) None of these Sensor component (A) Causes changes in system environment (B) Communicate with other components (C) Collects information from system environment (D) Coordinate the operation of other components. Which is the correct order ? (A) System development ? system installation ? system operation (B) System installation ? system operation? system development (C) System decomposition? system installation ? system design (D) None of these. Sensor component is a (A) Functional component (B) Non-functional component (C) Reliability component (D) None of these Which one is not the non-functional activity ? (A) Reliability (B) Performance (C) Coordination (D) Maintainability 9. Sub system is (A) Dependent system (B) Independent system (C) Component (D) None of these System architecture model identifies (A) Hardware components (B) Software components (C) Virtual components and software components (D) Hardware and software components both 11. Which one is functional component ? (A) Reliability (B) Maintainability (C) Computation (D) Performance 12. A class room in a school is a (A) System (B) Sub-system (C) Module (D) None of these 13. Floating point process is a (A) Communication component (B) Computation component (C) Coordination component (D) Sensor component 14. Digital-analog converter that converter digital input into analog output is a (A) Communication component (B) Computation component (C) Sensor component (D) Interface component 15. In software system requirements, the functional requirement for the system describes (A) Services the system is expected to provide (B) Factors of system development (C) Reliability, response time or system capacity (D) None of these 16. In software system requirements, the interface requirements are (A) Requirements that are derived from the interface of existing system (B) Requirements that are derived from the interface of proposed system (C) Requirements that are derived from the interface of existing and proposed systems (D) None of these 17. Validation plan describes (A) Quality procedure (B) Schedule procedure (C) Management procedure (D) None of these 18. Software requirement specification is (A) The official statement of what is required of the system developers (B) The non official statement of system interface (C) Non specified format of system working (D) None of these 19. What is Ethnography (A) A graphic tool (B) Observational technique used to understand social and organizational requirements (C) A graph with nodes (D) None of these 20. In Data Processing model . (A) Here data-flow diagram show, how data is processed at different stages in the system. These are behavioral models (B) It registers all/ selected activities of a computer system. (C) Technique used to transform raw data into a more useful form. (D) Data is shifted to modern data base management system In Data recording (A) Here data-flow diagram show, how data is processed at different stages in the system. (B) It registers all/ selected activities of a computer system. (C) Technique used to transform raw data into a more useful form. (D) Data is shifted to modern data base management system Thermo couple in furnace is a (A) Communication component (B) Computation component (C) Sensor component (D) Interface component In block diagrams, relationship between components is shown by (A) Boxes (B) Ovals (C) Circular (D) Lines/Arrows Cities, states and country can be defined as (A) Subsystem – Cities, states: System – country (B) Subsystem – state :System– country, cities (C) Subsystem – Country: System– cities, state (D) Subsystem– Country, state: System– Cities Which of the following is correct system design process ? (A) Identify system requirement – define system – develop system (B) Define system – develop system – identify system (C) Identify system – develop system – operate system (D) None of these Making different sub-system to work together is (A) System definition (B) System operation (C) System integration (D) System decomposition System procurement process involves (A) Specifying system requirement (B) Choosing suppliers (C) A and B both (D) None of these 28. System decommissioning normally takes place (A) At the beginning of the development process (B) At the middle of the development process (C) After the end of useful operational time (D) At the beginning of the useful operational time (D) At the beginning of the useful operational time 29. System operation takes place after (A) System specification (B) System design (C) System installation (D) System decomposition Software processes are (A) Activities involved in producing software system (B) Activities involved in selling software systems (C) Activities involved in system design (D) Activities involved in managing systems 31. Iterative model includes (A) Waterfall model (B) Sequential model (C) Incremental development (D) Random model 32. In iterative process model, software process represents (A) Sequential activities (B) Cycle of activities (C) Random activities (D) None of these 33. In spiral development the software process form (A) Sequences (B) Loops (C) Zigzag (D) None of these 34. Spiral development involves (A) Risk assessment (B) Reduction of risk (C) A and B both (D) None of these 35. Requirement Engineering involves (A) Feasibility studies (B) Requirement analysis (C) Requirement validation (D) All the above 36. Analysis and design workbench (A) It supports system modeling during the analysis and design stages of the software process (B) Organization responsible for approving U.S. standards (C) Stimuli that occurs irregularly (D) Formalized set of software calls and routines that can be referenced by an application program in order to access supporting system or network services 37. ANSI (American National Standards Institute) is (A) It supports system modeling during the analysis and design stages of the software process (B) Organization responsible for approving U.S. standards (C) Stimuli that occurs irregularly (D) Formalized set of software calls and routines that can be referenced by an application program in order to access supporting system or network services Aperiodic stimuli is (A) It supports system modeling during the analysis and design stages of the software process (B) Organization responsible for approving U.S. standards (C) Stimuli that occurs irregularly (D) Formalized set of software calls and routines that can be referenced by an application program in order to access supporting system or network services 39. Which is not the part of software process ? (A) Software specification (B) Software design (C) Software evolution (D) Software selling 40. Which one is not the generic process model ? (A) Waterfall model (B) Evolutionary development (C) Re-use oriented development (D) Marketing model 41. Spiral model is (A) Iterative model (B) Non-iterative model (C) Random model (D) None of these 42. Software design activities involved (A) System programming (B) System operations (C) Component design (D) Component development 43. Software implementation converts system specifications into (A) Development system (B) System decomposition (C) Executable system (D) None of these 44. Which one is not be structured design model ? (A) Data flow model (B) Entity relation model (C) Object-oriented model (D) Debugging 45. Software process models are (A) Abstract representation of software process (B) Software running the systems (C) Software managing the systems (D) Software implementation 46. Debugging is a process of (A) Developing faults (B) Removing faults (C) Ignoring faults (D) None of these 47. Software validation is (A) Checking system conformations to its specifications (B) Developing system conformations to its specifications (C) Operating system (D) None of these 48. Unit testing process is (A) Software designing process (B) Software operating process (C) Software validation process (D) Software decomposition process 49. CASE environment supports (A) Individual process tasks (B) Individual process phases (C) Most process tasks and process phases (D) None of these 50. CASE work benches support (A) Individual process tasks (B) Process phases and activities (C) Development software (D) Operation software Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called (A) Elementary items (B) Atoms (C) Scalars (D) All of above 2. Which of the following statement is false ? (A) Arrays are dense lists and static data structure (B) Data elements in linked list need not be stored in adjacent space in memory (C) Pointers store the next data element of a list (D) Linked lists are collection of the nodes that contain information part and next pointer 3. Binary search algorithm cannot be applied to (A) Sorted binary trees (B) Sorted linear array (C) Pointer array (D) Sorted linked list 4. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called (A) Housefull (B) Saturated (C) Underflow (D) Overflow 5. The situation when in a linked list START=NULL is (A) Underflow (B) Overflow (C) Housefull (D) Saturated 6. The following is two-way list (A) Grounded header list (B) Circular header list (C) Linked list with header and trailer nodes (D) None of above 7. The following name does not relate to stacks (A) FIFO lists (B) LIFO list (C) Piles (D) Push-down lists 8. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called (A) Leaf (B) Branch (C) Path (D) Thread 9. In a graph if e=(u, v) means (A) e begins at u and ends at v (B) u is processor and v is successor (C) both B and C are true (D) none is true 10. If every node u in G is adjacent to every other node v in G, A graph is said to be (A) Isolated (B) Complete (C) Finite (D) Strongly connected 11. A variable P is called pointer if (A) P points to the address of first element in DATA (B) P can store only memory addresses (C) P contain the DATA and the address of DATA (D) P contains the address of an element in DATA. 12. The Worst case occur in linear search algorithm when (A) Item is not in the array at all (B) Item is the last element in the array (C) Item is the last element in the array or is not there at all (D) None of above 13. The Average case occur in linear search algorithm (A) When Item is somewhere in the middle of the array (B) When Item is not in the array at all (C) When Item is the last element in the array (D) All the above 14. The complexity of the average case of an algorithm is (A) Much more complicated to analyze than that of worst case (B) Much more simpler to analyze than that of worst case (C) Sometimes more complicated and some other times simpler than that of worst case (D) None of the above 15. The following data structure allows deleting data elements from front and inserting at rear (A) Stacks (B) Queues (C) Deques (D) Binary search tree 16. This data structure allows deletions at both ends of the list but insertion at only one end. (A) Input-restricted deque (B) Output-restricted deque (C) Priority queues (D) None of the above 17. The following data structure is non-linear type (A) Strings (B) Lists (C) Stacks (D) None of the above 18. The following data structure is linear type (A) Strings (B) Lists (C) Queues (D) All of the above 19. To represent hierarchical relationship between elements, the following data structure is not suitable (A) Deque (B) Priority (C) Tree (D) All of above 20. A binary tree whose every node has either zero or two children is called (A) Complete binary tree (B) Binary search tree (C) Extended binary tree (D) None of above 21. The depth of a complete binary tree is given by (A) Dn = n log2n (B) Dn = n log2n+1 (C) Dn = log2n (D) Dn = log2n+1 22. The complexity of Binary search algorithm is (A) O(n) (B) O(log ) (C) O(n log n) (D) None of the above 23. The complexity of Bubble sort algorithm is (A) O(n) (B) O (n2) (C) O(n log n) (D) None of the above 24. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return (A) FAEKCDBHG (B) FAEKCDHGB (C) EAFKHDCBG (D) FEAKDCHBG 25. When representing any algebraic expression E the following uses only binary operations in a 2-tree (A) the variable in E will appear as external nodes and operations in internal nodes (B) the operations in E will appear as external nodes and variables in internal nodes (C) the variables and operations in E will appear only in internal nodes (D) None of the above 26. When converting binary tree into extended binary tree, all the original nodes in binary tree are (A) internal nodes on extended tree (B) external nodes on extended tree (C) vanished on extended tree (D) None of the above 27. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal (A) ABFCDE (B) ADBFEC (C) ABDECF (D) None of the above 28. Which of the following data structure is linear data structure? (A) Trees (B) Graphs (C) Arrays (D) None of the above 48. The operation of processing each element in the list is known as (A) Merging (B) Inserting (C) Traversal (D) All the above 30. Finding the location of the element with a given value is called (A) Traversal (B) Search (C) Sort (D) All of the above 31. Arrays are best data structures for (A) relatively permanent collections of data (B) the size of the structure and the data in the structure are constantly changing (C) both of above situation (D) none of above situation 32. Linked lists are best suited for (A) relatively permanent collections of data (B) the size of the structure and the data in the structure are constantly changing (C) both of above situation (D) none of above situation 33. Each array declaration need not give, implicitly or explicitly, the information about the (A) name of array (B) data type of array (C) first data from the set to be stored (D) index set of the array 34. The complexity of merge sort algorithm is (A) O(n) (B) O(log n) (C) O(n log n) (D) None of these 35. The indirect change of the values of a variable in one module by another module is called (A) internal change (B) inter-module change (C) side effect (D) all the above 36. Two main measures for the efficiency of an algorithm are (A) Time and space (B) Processor and memory (C) Complexity and capacity (D) Data and space 37. The time factor when determining the efficiency of algorithm is measured by (A) Counting the number of key operations (B) Counting the number of statements (C) Counting the kilobytes of algorithm (D) None of the above 38. The space factor when determining the efficiency of algorithm is measured by (A) Counting the maximum memory needed by the algorithm (B) Counting the minimum memory needed by the algorithm (C) Counting the average memory needed by the algorithm (D) Counting the maximum disk space needed by the algorithm 39. All the above* Which of the following data structures are indexed structures (A) linear arrays (B) linked lists (C) both of above (D) none of above 40. Which of the following is not the required condition for binary search algorithm (A) there must be mechanism to delete and/ or insert elements in list (B) the list must be sorted (C) there should be the direct access to the middle element in any sublist (D) none of the above 41. Which of the following is not a limitation of binary search algorithm ? (A) binary search algorithm is not efficient when the data elements are more than 1000. (B) must use a sorted array (C) requirement of sorted array is expensive when a lot of insertion and deletions are needed (D) there must be a mechanism to access middle element directly 42. Two dimensional arrays are also called (A) tables arrays (B) matrix arrays (C) both of the above (D) none of the above 43. The term “push” and “pop” is related to the (A) Array (B) Lists (C) stacks (D) all of above 44. A data structure where elements can be added or removed at either end but not in the middle is referred as (A) Linked lists (B) Stacks (C) Queues (D) Deque 45. The following sorting algorithm is of divideand-conquer type (A) Bubble sort (B) Insertion sort (C) Quick sort (D) None of the above 46. An algorithm that calls itself directly or indirectly is known as (A) Recursion (B) Polish notation (C) Traversal algorithm (D) None of the above 47. The elements of an array are stored successively in memory cells because (A) by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated (B) the architecture of computer memory does not allow arrays to store other than serially (C) A and B both false (D) A and B both true 48. The memory address of the first element of an array is called (A) base address (B) floor address (C) foundation address (D) first address 49. The memory address of fifth element of an array can be calculated by the formula (A) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array (B) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array (C) LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array (D) None of the above 50. The following data structure can’t store the non-homogeneous data elements (A) Arrays (B) Records (C) Pointers (D) None of the above Author: A.J. Bhatti
