CSS past papers · 2021

CSS 2021 Computer Science Combined Papers Past Paper

Download and review the CSS 2021 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
2021
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 2021.

  1. Q3 · Software(a) Describe any two of the following briefly: ISP, HTML, SSD, Cloud Computing. (6) (b) Write a program that should output the factors of the number passed as input – one factor on (5) each line. Factors of a number, say x, are those whole numbers which can be multiplied with other whole numbers to get x. (c) What are IDEs? How do they help in software development? List the IDEs you have ever (5) used. (d) Write a program in C/C++ to convert a decimal number to hexadecimal. (4)
  2. Q2 · Computer Crimes and Ethical Challenges(a) What are office productivity tools? Explain uses of any two productivity tools in your (7) home or workplace. (b) Write a detailed note on computer crimes and ethical challenges. (7) (c) What are the different types of computers? Explain the benefits of miniaturization. (6)
  3. Q8 · Components of a programming language(a) Consider the grammar (4) S → cAd A→ ab|a construct a top-down parse tree for the input string w = cad (b) Is the above given grammar ambiguous or unambiguous? Justify your answer. (4) (c) Write similarities and differences of CFG and regular expression. (4) (d) Design grammar for the following language: (4) “The set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1”. (e) Write a note on Aspect Oriented Programming Roll Number
  4. Q6 · Structures(a) Convert following NFA to DFA: (8) (b) Differentiate between overloading and overriding with the help of an example. (6) (c) What is recursion in data structures? Explain three conditions of a recursive function with the (6) help of an example.
  5. Q4 · Object Oriented Paradigm(a) Explain object oriented programming paradigm. Write a detailed note on any two of the (8) principles of object oriented programming paradigm. (b) Why do we need interfaces in OOP? How does it help in achieving abstraction? (6) (c) What do you mean by runtime and compile time errors? (6)
  6. Q5 · Abstract Data Types(a) What is a tree in data structure? Describe its types with the help of examples. (8) (b) What is pass by value and pass by reference? Can we pass an object as a parameter to (6) call a method in java? (c) Convert following infix notation to prefix (6) (i) (30+23)*(43-21)/(84+7) (ii) 2*(1+(4*(2+1)+3))
  7. Q7 · AVL Trees(a) Write detailed notes on any TWO of the following: (8) i. PERT chart ii. Unified Modeling Language iii. AVL Trees (b) What is a Software Process Model? Explain the Spiral model in detail. (7) (c) What do you mean by software quality? List at least five quality attributes. (5)
  8. Q2 · RISC(a) The addressing in a typical instruction format are done by using different addressing (10) modes. Examine any five addressing modes with an example based on the contents of address field, actual address and contents of memory location. (b) The decimal value of address field in an instruction is 120. The addressing mode of the (5) machine’s architecture is register direct and register indirect addressing. Calculate the address of corresponding operand. (c) Compare the set of addressing modes of RISC and CISC machines. Give one example of (5) addressing modes used in RISC and CISC respectively.
  9. Q3 · Memory Organization and StructureMemory managed by BITMAP is shown below: (a) Show properly filled memory according to the BITMAP where memory index starts from zero. (3) (b) Insert a page H of size 3 allocation units in memory drawn in part ‘a’ using first-fit algorithm. (3) Redraw memory and the BITMAP after insertion. (c) Now insert another page K of size 2 allocation units in memory drawn in part ‘b’ using (3) next-fit algorithm. Redraw memory and the BITMAP after insertion. (d) Use linked list data structure for the above memory mapping (Only give equivalent figure). (6) (e) Use hash table to keep track of active pages in the above memory (Only give figure). (5)
  10. Q5 · Computer Communications & Networks(a) Compare Transmission Control Protocol and User Datagram Protocol. How they are used in (6) wireless networks? (b) What mechanism is used by TCP to protect itself from miss delivery? (6) (c) Calculate the TCP window size to fully utilize the line on which WAN link is 2 Mbps and RTT (8) between source and destination is 300 msec.
  11. Q4 · Database SystemsDo as directed: (a) Calculate effective memory access time using following data: (3)  TLB hit ratio is 85%,  TLB access time=20nsec  Memory access time=115nsec Effective memory access time =Hit rate * (TLB access time+ Mem access time)+(1-Hit rate)( TLB access time+Process_table access time+ Mem access time) (b) Consider a logical address and physical address of 31 and 22 bits respectively. What will be (4) total logical and physical address space? (c) Does resource allocation graph shown below consist of a deadlock or not? Justify with (3) reason. (Figure: Resource Allocation Graph) (d) What is race condition? What are the different techniques to avoid race condition in the (10) processes? Which one is optimal and why?
  12. Q6 · Relational Algebra & CalculusConsider the following database schema and write the relational algebra expression for the following queries. Students (Stu_Reg, Stu_Name, Stu_Address) Instructor (Ins_ID, Ins_Name, Ins_Dept_ID) Course (Cr_Code, Cr_Title, Cr_CrHours) Dept (Dept_ID, Dept_Name) Results (Res_Stu_Reg, Res_Cr_Code, Res_Marks, Res_Ins_ID, Res_Grade) (a) Write relational algebraic expression for: (i) To display all the students details in section BSSE. (8) (ii) To display all Instructor Names and their respective Department Names, (if an instructor is not assigned any Dept his name should be displayed as well). (iii) To display Stu_Reg, Stu_Name, Cr_Code, Cr_Title and Res_Marks for students who got 75 or more marks. (iv) To display Res_Stu_Reg, Ins_Name, Res_Grade for Instructors whose Dept_ID is 1. (b) What is the concept of gerund in database? Give one example of gerund. Is this essential to (12) eliminate gerunds from the database? If yes, how and if no, why?

Topic-wise Computer Science past-paper analysis.