Skip to content
MockCSS
All Computer Science Paper I papers

CSS past paper

CSS Computer Science Paper I Past Paper 2020

CSS Computer Science Paper I 2020 carries 100 marks over 3 hours. It has 7 questions.

Marks
100
Time
3 hours
Questions
7

Years

How to attempt: Attempt ONLY FOUR questions from PART-II, by selecting TWO questions from EACH SECTION. ALL questions carry EQUAL marks.

Questions

Question 1 (Part I) is the paper's MCQs, which are not reproduced here.

SECTION-A

  1. Q. 2
    • (a)
      Write a C/C++ program which implements binary logical ‘AND’, ‘OR’ and ‘NOT’ gates. The program takes binary numbers and desired logical gate as inputs and outputs the desired output of the gate.
      (8)
    • (b)
      Write a C/C++ program which inputs a number from a user and prints Fibonacci series up to the number.
      (7)
    • (c)
      Explain the concept of abstract class with an example
      (5)
  2. Q. 3
    • (a)
      Write standard ports for following services HTTP, FTP, SMTP, HTTPS, DNS.
      (4)
    • (b)
      Design an appropriate interface for citizen portal mobile application. The interface should contain different features which are part of the portal application. The Interface may contain different screens to support these features.
      (8)
    • (c)
      If you are transferring a file over the Internet, would you prefer TCP or UDP as the underlying protocol. Explain
      (4)
    • (d)
      If you are transferring live audio in real-time over the Internet, would you prefer TCP or UDP as the underlying protocol. Explain.
      (4)
  3. Q. 4
    • (a)
      Write a program to perform mathematical operations of addition, subtraction and multiplication on complex numbers. Each operation should be supported by a separate method.
      (8)
    • (b)
      How object encapsulation is useful? Explain.
      (4)
    • (c)
      Write a program to convert numbers into words. For instance, if the user types 123, the program should give output one hundred and twenty three. The program should continue functioning until the user types quit.
      (4)
  4. Q. 5
    A university maintains records for students, Faculty, and academic record. Following three classes are part of the system

    Student (ID, Name, Age, Address, Contact, Program, CGPA)

    Teachers (ID, Name, Age, Address, Highest Degree, Subjects, Salary)

    Courses (Semester, Course Code, Student ID, Teacher ID, Grade). All the data is stored in files

    • (a)
      Draw a class diagram to represent the three classes and their relationships
      (5)
    • (b)
      Write C++ programs to compute following:
      (15)
      • (i)
        Add a student
      • (ii)
        Add a course
      • (iii)
        Find a student with respect to CGPA
      • (iv)
        Add a Teacher
      • (v)
        Update a student

SECTION-B

  1. Q. 6
    John rides a Van service from new square (S) to the city harbor (T). The van service charges Rs 10 per Km. There are numerous routes between the two points.
    • (a)
      In order to rip off his customers, John always wanted to use the longest path. To find the longest path, John evaluates all the possible paths and selects the longest path. Write an algorithm to select the longest path using this approach.
      (7)
    • (b)
      Compute the complexity of this algorithm and determine that whether it is in P, NP, or NP-complete.
      (3)
    • (c)
      Write an algorithm to find a minimum distance between ‘S’ and ‘T’.
      (7)
    • (d)
      Derive the complexity of this algorithm.
      (3)
  2. Q. 7
    • (a)
      How many tokens are there in in this C code :
      (5)
      printf("k = %d, &k = %x", k, &k);
    • (b)
      Create State Transition Table from the following graph
      (5)
      State transition graph with states qo, q1, q2, q3, q4 and q5: qo goes to q1 on a,b; q1 goes to q2 on a and to q3 on b; q3 goes to q2 on a and to q4 on b; q2 goes to q4 on a,b; q4 goes to q5 on a,b; q5 loops on a,b.
    • (c)
      Draw Finite State Automata which accepts following input.
      (4)
      • (i)
        JIM
      • (ii)
        JMI
      • (iii)
        JJIIM
      • (iv)
        JJMMII
    • (d)
      Determine which of these inputs are valid for the FSM shown below:
      (6)
      FSM with states S1, S2, S3 and S4 (no start or accepting state marked): S1 goes to S2 on a and on b; S2 loops on a; S2 goes to S4 on c; S3 goes to S1 on a, to S4 on b and to S4 on c.
      • (i)
        aaaaa
      • (ii)
        ababa
      • (iii)
        abcabc
      • (iv)
        abccba
      • (v)
        acbcd
      • (vi)
        acbcdcd
  3. Q. 8
    • (a)
      Is P = NP? Comment
      (4)
    • (b)
      Suppose you are representing a social network (such as facebook) as a graph. Devise an algorithm through which you can determine friends of friends.
      (7)
    • (c)
      Explain the complexity of this algorithm
      (5)
    • (d)
      Optimal problems are generally NP hard problems. Is it appropriate to use heuristics based approaches?
      (4)
  1. Part-II is to be attempted on the separate Answer Book.
  2. Attempt ONLY FOUR questions from PART-II, by selecting TWO questions from EACH SECTION. ALL questions carry EQUAL marks.
  3. All the parts (if any) of each Question must be attempted at one place instead of at different places.
  4. Write Q. No. in the Answer Book in accordance with Q. No. in the Q.Paper.
  5. No Page/Space be left blank between the answers. All the blank pages of Answer Book must be crossed.
  6. Extra attempt of any question or any part of the question will not be considered.