Computer Science CSS Paper 2008
FEDERAL PUBLIC SERVICE COMMISSION
COMPETITIVE EXAMINATION FOR RECRUITMENT TO POSTS
IN BPS – 17 UNDER THE FEDERAL GOVERNMENT, 2008.
TIME ALLOWED: THREE HOURS MAXIMUM MARKS:100
Attempt ONLY FOUR question from PART II selecting at least ONE question from each SECTION.
Q2. (a) Compare the TCP/IP and OSI network and describe the functionality of at least two Transport and two network layer protocols
(b)Differentiate between the message switching and packet switching. Which one is better for data networks?
(c)Describe various network Flow control protocol
Q3 (a)Differentiate between thread and process.Explain your answer through example
(b)Various operating systems((i.e WIN 2K,solaris) make use of pages virtual memory technique. Explain the paged virtual memory in general terms with the help of diagram
Q4 (a)Differentiate between interrupt and trap?Explain two approaches that can be taken to deal with multiple interrupt?
(b)Differentiate between the Shortest process next (SPN) and shortest remaining Time (SRT) Uni processor scheduling techniques?
Q5(a)What are view and how they are defined in SQL? Describe the rules pertaining to data updating through views
(b)Describe the process of Normalization and various Normal forms through examples.Also describe two integrity rule
Q6(a)Differentiate between Incremental and RAD models?Which one is better and why?
(b)Giving reasons for your answer based on the type pf system being developed. Suggest the most appropriate generic software process model,which might be used as a basis for managing the development of the following systems.
(i) A Virtual reality system to support software development
(ii) An interactive railway timetable system
(iii) A system to control Anti-lock breaking in a car
(iv) MSN messenger
Support your answer with necessary reasons. Clearly write down the assumptions you made.
Q7 (a) Write note on various internal sorting algorithms. Develop the merge sort algorithm and develop the pseudo code for its implementation.
(b) Write a note on the following data structures:
(i) STACK (ii) QUEUE (iii) DE-QUEUE
Also describe various functions that can be performed on t hem and write the C++ code for implementation of these functions.
Q8 (a) In the context of computer Graphics, describe various 2D and 3D Transformations. Also write a note on Color Theory in this Context.
(b) What is an Expert System? Describe the various methods for knowledge representation.
(c) Develop the C++ code to accomplish the following tasks:
(i) A function that returns TRUE if the string passed on to it is PALINDROME otherwise it shall return FALSE.
(ii) Print the nth element of the Fibonacci series.
8 thoughts on “Computer Science CSS Paper 2008”
239092 394704This really is a very good weblog. Maintain up all of the function. I too love to blog. This is excellent every person sharing opinions 139888
293760 86677Thanks for taking the time to discuss this topic. I actually appreciate it. Ill stick a link of this entry in my blog. 569727
248931 432587extremely good publish, i undoubtedly enjoy this web website, keep on it 305262
776378 481229This really is the suitable weblog for anybody who needs to seek out out about this subject. You notice so a lot its virtually laborious to argue with you (not that I genuinely would wantHaHa). You undoubtedly put a brand new spin on a subject thats been written about for years. Wonderful stuff, just excellent! 827678
735113 324066quite nice post, i surely really like this website, maintain on it 539491
69665 655897Aw, this was a actually nice post. In concept I wish to put in writing like this in addition ?taking time and actual effort to make an outstanding write-up?nevertheless what can I say?I procrastinate alot and by no means seem to get something done. 591949
137317 851165Hi there! Good post! Please do inform us when we could see a follow up! 571357
661172 206639Hi there! I merely want to give a huge thumbs up for the excellent data you could have right here on this post. I will likely be coming once more to your weblog for more soon. 58508