CSS past papers · 2018

CSS 2018 Computer Science Combined Papers Past Paper

Download and review the CSS 2018 Computer Science Combined Papers Past Paper on CSS Vista, with archive details, related papers and a direct PDF link for examination preparation.

Paper details

Examination
CSS
Year
2018
Subject
Computer Science
Paper
Combined Papers
Subject type
Optional
Mode
Subjective

Browse the complete CSS Vista past-paper archive.

Questions recorded from this paper

These 12 question wordings are transcribed from CSS Vista’s structured Computer Science past-paper record for CSS 2018.

  1. Q2 · Introduction to Computing(a) How many layers are in the TCP/IP stack? What are the names? (4) (b) How digital evidences can be preserved from a crime scene. Write in details by taking (4) examples of digital devices commonly used these days. (c) What are the responsibilities of Operating system kernel? (3) (d) List down any four best practices for coding standards. (3) (e) Why do modern processors use more power when their clock frequency is increased? (2) (f) Ali is telling Ahmad that he is representing a -ve number and its most significant bit is 1, (2) Ahmad immediately shouted you are representing numbers using 2's compliment. True or False. And why? (g) If time slice is of 50 milliseconds and context switch requires a microsecond, how many processes can the machine service in a second?
  2. Q3 · Introduction to Computing(a) Write a program grade average calculator, User will input marks for five subjects and (5) program will output the average of its marks. Print appropriate message on the base of its mark's average e.g.; Well done, Keep it up, Better luck next time etc. (b) Given that i,j,k,n & m are integer variables. Write a condition such that: (2) i- hello is only printed when, any of the following conditions are met: i is twice the value of j, j is smaller than k and less than n, or m is negative. inti,j,k,n,m; cin>>i>>j>>k>>n>>m; if( ) cout<<”hello”; ii. hello is only printed when i does not lies in the interval 6-9 inti; cin>>i; if( ) cout<<“hello”; (c) Write equivalent instruction to following instruction without the use of += operator: (1) where w,z are integers. w+=2*z+4; (d) Predict the values of variables a & b after every instruction (2) integer a=5 b=6 a=(b++) + 3; b=--a; (e) Complete the code such that it prompts the user for +ve number n. Then displays the (5) output.(whatever the value of n is)(HINT: instead of triangles of stars its triangles of increasing numbers)[marks 1 2 3 4 . . . n 1 2 3 4 ..n-1 . . . . . . for n=4 it will print void main() { int n; cin>>n; // your loops will go here } (f) In following code replace the character at posth location in the string st with the ,character (5) ch. For example in string helloworld replacing 2nd character with i would result in hilloworld void main( ) {char st[15]; int pos; char ch; int size=0; cin>>st; cin>>pos>>ch; while(st[size]!='\0') { size++; // calculating length of current string } // write your code here }
  3. Q7 · Software(a) Outline the difference between software verification and software validation. (4) (b) Give an outline of the unit testing process for verification. (4) (c) Agile Development is a process that values responding to change over following a plan. (4) Discuss three issues a Software Engineer should be mindful of when adopting this approach during software development. (d) What type of project is not suited to incremental methods? (4) (e) Outline the difference between Black box and White box testing. (4)
  4. Q8 · Components of a programming language(a) What is the difference between lexers and parsers? (5) (b) Write a grammar (BNF) for the language of palindromes. (5) (c) Here DFA is given for the language L find the DFA for L2 (5) (d) Convert the following DFA to a RE: (5) Roll Number
  5. Q4 · protected membersConsider the inheritance hierarchy shown below. Each part of this question is independent. (a) In which class(es) would it make most sense to have protected members? Which class(es) (5) would be able to access those protected members directly? (b) Which class(es) can access private members of class C directly? (5) (c) Suppose class C contains a pure virtual function. Suppose we wish to instantiate objects of (5) this hierarchy. Which class(es) are or could be abstract and which are concrete? (d) Consider the following list of classes: Car, SteeringWheel, Vehicle, Van, Minivan, (5) AudioSystem, ParkingLot. Your task is to describe all of the is-a and has-a relationships between these classes. Include an inheritance hierarchy for all classes that fit. Fill in the table with is-a or has-a relationship while leaving the cells empty where no relation is applicable. Mini Steering Audio Parking Vehicle Car Van Van Wheel System Lot Vehicle Car is-a Van Mini Van Steering Wheel Audio System Parking Lot
  6. Q5 · Binary Search(a) What is dangling pointer? (3) (b) What data structure would employ to build a text editor and why? (5) (c) Random insertion of nodes into a binary search tree would result in what types of tree (7) shape. Elaborate. (d) How would you modify a link list based queue so that first and last node can be accessed (5) in a constant time regardless of data nodes in the queue?
  7. Q6 · Binary Search(a) Define balanced tree both for AVL and Binary search tree. (4) (b) What is informed or heuristic search what type of algorithm is used to do such a search? (6) (c) Differentiate between graph and trees. Which is special case of the other? (5) (d) Explain what type of problems can be solved by genetic algorithm. (5)
  8. Q2 · Instruction execution cycle(A) Briefly describe the functionality of the following CPU special-purpose (8) registers: Instruction Register (IR), Memory Data Register (MDR) and Program Counter (PC). (B) Differentiate between Address, Data and Control bus. (6) (C) Discuss instruction pipelining in the context of fetch-decode-execute cycle. (6)
  9. Q3 · Network Address Translation (NAT)(A) Differentiate between hub, bridge, switch and router. (8) (B) Discuss how Network Address Translation (NAT) works and why is it useful? (6) (C) Elaborate the working of multiplexing/de-multiplexing at the transport layer. (6)
  10. Q4 · Virtual Memory Management(A) There are three processes P A , P B and P C and three resources R A , R B and R C . (8) Resources R A and R B have one instance each while resource R C has two instances. P A is holding one instance of R C and has requested for R A. Process P B is holding R A and has requested for R B . R B is allocated to P C which has also requested an instance of R C. Represent the scenario with a resource allocation graph. Discuss whether there is a deadlock or not? If yes, which processes are blocked? (B) In the context of Paging, consider the case where memory addresses are 32 bits (6) i.e. 20 bits Virtual Page Numbers and 12 bits of offset. How many virtual pages are there and what is the size of each page? Given the virtual address 0x7589, find the virtual page number and offset. If the respective page table entry contains 0x900DF, find the physical address. (C) In the context of I/O management, differentiate between Pooling and Interrupts. (6) Section – B
  11. Q5 · Relational Algebra & Calculus(A) Given two relations R and S, where R contains M tuples, S contains N tuples, (8) and M >N > 0, give the minimum and maximum possible sizes (in tuples) for the resulting relation produced by each of the following relational algebra expressions. i. R −S ii. R ∪S iii. R ∩S iv. R S (B) Elaborate the concepts of super key, candidate key and foreign key with (6) examples. (C) Discuss the difference between physical data independence and logical data (6) independence.
  12. Q6 · Image Sampling and Quantization(A) Differentiate between image sampling and quantization. Discuss how these (8) concepts relate to spatial and intensity resolutions. (B) In the context of image smoothing, discuss the differences between mean and (6) median filters. (C) For the image ‘X’ shown in Figure 1, show the result of applying the given (6) morphological operators. Assume zero padding for border pixels. i. Dilation of X by structuring element [1 1 1]. ii. Erosion of X by structuring element [1 1 1]T iii. Dilation of X by a 3x3 structuring element containing all ones.

Topic-wise Computer Science past-paper analysis.