Quelpr

CAPE Computer Science Unit 2 · 2014 · Paper 2

34 questions and parts from this paper. Open one to see it in full, then practise it on Quelpr and get it marked against the mark scheme.

  1. 1(a)(i)1 markState whether a stack must exist prior to executing CreateStack.
  2. 1(a)(ii)1 markState whether a stack must exist prior to executing DestroyStack.
  3. 1(b)(i)7 marksDetermine the contents of the stack following the given sequence of procedure calls, showing all steps involved: Push(Stack, X), Push(Stack, Y), Add(Stack), Push(Stack, Z), Push(Stack, W), Mult(Stack), Add(Stack).
  4. 1(b)(ii)1 markState ONE condition that must exist for the Add and Mult procedures to work effectively.
  5. 1(b)(iii)2 marksExplain what will happen to the stack if the ADD operation is continuously applied to it.
  6. 1(c)(i)5 marksExplain the purpose of Enqueue() and Dequeue() in a FIFO queue.
  7. 1(c)(ii)8 marksWrite an algorithm CountQueue using only the standard queue Abstract Data Type (ADT) operations that returns an integer count of the elements in the queue.
  8. 2(a)10 marksExplain how the numbers 5 and 15 would be inserted into the singly linked list and draw the final linked list.
  9. 2(b)(i)2 marksWrite C code to declare an array 'num' that can store 100 integers.
  10. 2(b)(ii)4 marksWrite C code to fill the array 'num' with integers entered by the user.
  11. 2(b)(iii)9 marksWrite C code to read an integer 'key' from the user and search the array 'num' for it. If found, display the location of key; otherwise, display 'Key Not found'.
  12. 3(a)3 marksExplain what is meant by a 'deliverable' in the systems development life cycle.
  13. 3(b)4 marksDescribe TWO factors that can cause an information system to be replaced, explaining why each necessitates developing a new system.
  14. 3(c)6 marksDescribe THREE main factors that must be evaluated during a feasibility study in the systems development life cycle.
  15. 3(d)12 marksDraw an entity-relationship (ER) diagram representing the described scenario.
  16. 4(a)(i)6 marksProvide TWO examples of data that may be entered for EACH of the three options (Student ID, Date of Birth, Course Code and Name).
  17. 4(a)(ii)3 marksFor EACH option, explain whether a textbox, menu, command line, checkbox, or other interface element would be suitable.
  18. 4(a)(iii)3 marksDescribe a validation test that could be applied to EACH option to verify that valid data is entered.
  19. 4(b)13 marksDraw a Level-0 data flow diagram (DFD) showing the flow of information between the pharmacy, the pharmaceutical company, and various departments within the company.
  20. 5(a)(i)6 marksDraw a network diagram showing how the friend's home network would be set up.
  21. 5(a)(ii)3 marksState the role of the modem, switch, and router in the network diagram drawn.
  22. 5(b)1 markExplain what is meant by a hybrid network topology.
  23. 5(c)4 marksDescribe ONE advantage and ONE disadvantage of using fibre optic cabling as a transmission medium.
  24. 5(d)6 marksWith the help of a diagram, explain how data is transmitted in an IEEE 802.11b wireless network.
  25. 5(e)3 marksExplain why the quality of Voice over IP (VoIP) communication might differ from standard telephone communication provided by a telecom company.
  26. 5(f)2 marksState the primary purpose of General Packet Radio Service (GPRS).
  27. 6(a)(i)2 marksDescribe what is meant by primitive batch systems.
  28. 6(a)(ii)2 marksDescribe what is meant by sophisticated multiuser systems.
  29. 6(b)(i)2 marksExplain what is meant by a blocked process.
  30. 6(b)(ii)2 marksExplain what is meant by a running process.
  31. 6(c)3 marksExplain how interrupts are utilized in this scenario.
  32. 6(d)2 marksExplain what is meant by pre-emptive scheduling of processes.
  33. 6(e)9 marksDiscuss THREE methods by which student records stored in a school database on a computer can be secured against unauthorized access.
  34. 6(f)3 marksExplain the role of device driver software that allows the operating system to communicate with hardware devices.

More CAPE Computer Science Unit 2 papers