Machine-translated by Google. Questions are authored in English.
Top

MH SET 2015: 6 September, Paper II, Computer Science and Applications

  • Date: 6 September 2015
  • Paper code: AUG-37215
  • Language: Bilingual
  • 16 pages
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 1 of 16
Page 1 of 16
Text of page 1
Test Booklet No.
                                                                                                                     F
                       COMPUTER SCIENCE AND APPLICATION
Signature and Name of Invigilator                                                                 Seat No.
1. (Signature) .........................................                                                   (In figures as in Admit Card)
      (Name) ................................................                     Seat No. ..............................................................
2. (Signature) .........................................                                                    (In words)

      (Name) ................................................                       OMR Sheet No.

AUG - 37215                                                                                          (To be filled by the Candidate)
Time Allowed : 1¼ Hours]                                                                              [Maximum Marks : 100
Number of Pages in this Booklet : 16                                                     Number of Questions in this Booklet : 50
                      Instructions for the Candidates
1.         Write your Seat No. and OMR Sheet No. in the space provided             1.
           on the top of this page.
2.         This paper consists of 50 objective type questions. Each question
           will carry two marks. All questions of Paper-II will be compulsory,     2.
           covering entire syllabus (including all electives, without options).
3.         At the commencement of examination, the question booklet
           will be given to the student. In the first 5 minutes, you are
           requested to open the booklet and compulsorily examine it as            3.
           follows :
           (i)      To have access to the Question Booklet, tear off the
                    paper seal on the edge of this cover page. Do not accept
                                                                                           (i)
                    a booklet without sticker-seal or open booklet.
           (ii)     Tally the number of pages and number of questions
                    in the booklet with the information printed on the                     (ii)
                    cover page. Faulty booklets due to missing pages/
                    questions or questions repeated or not in serial
                    o rder or any other discre pancy should not be
                    accepted and correct booklet should be obtained
                    from the invigilator within the period of 5 minutes.
                    Afterwards, neither the Question Booklet will be
                    replaced nor any extra time will be given. The same
                    may please be noted.
           (iii)    After this verification is over, the OMR Sheet Number
                    should be entered on this Test Booklet.                                (iii)
4.         Each question has four alternative responses marked (A), (B),
           (C) and (D). You have to darken the circle as indicated below on
           the correct response against each item.                                 4.                      (A), (B), (C)    (D)
           Example : where (C) is the correct response.

                              A        B                 D
                                                                                                     (C)
5.         Your responses to the items are to be indicated in the OMR
           Sheet given inside the Booklet only. If you mark at any place                                   A         B              D
           other than in the circle in the OMR Sheet, it will not be evaluated.
                                                                                   5.
6.         Read instructions given inside carefully.
7.         Rough Work is to be done at the end of this booklet.
8.         If you write your Name, Seat Number, Phone Number or put                6.
           any mark on any part of the OMR Sheet, except for the space             7.
           allotted for the relevant entries, which may disclose your              8.
           identity, or use abusive language or employ any other unfair
           means, you will render yourself liable to disqualification.
9.         You have to return original OMR Sheet to the invigilator at the
           end of the examination compulsorily and must not carry it with          9.
           you outside the Examination Hall. You are, however, allowed
           to carry the Test Booklet and duplicate copy of OMR Sheet on
           conclusion of examination.
10.        Use only Blue/Black Ball point pen.                                     10.
11.        Use of any calculator or log table, etc., is prohibited.                11.
12.        There is no negative marking for incorrect answers.                     12.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 2 of 16
Page 2 of 16
Text of page 2
AUG - 37215/II




2
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 3 of 16
Page 3 of 16
Text of page 3
AUG - 37215/II
                Computer Science and Application
                                        Paper II
Time Allowed : 75 Minutes]                                       [Maximum Marks : 100
Note : This paper contains Fifty (50) multiple choice questions. Each question
        carries Two (2) marks. Attempt All questions.


1.   Let    = {a, b} be an alphabet. The
                                                    3.   For which of the following does there
     strings of length seven over        are
     listed in dictionary (lex) order. What              exist a tree satisfying the specified
     is the first string after ‘aaaabaa’ that
     is a PALINDROME (which is same                      constraints ?

     read forwards and backwards) ?
                                                         (A) A full binary tree with 31 leaves,
     (A) aaaabab

     (B) aaabaaa                                             each leaf of height 5.

     (C) aababaa
                                                         (B) A rooted tree of height 3 where
     (D) aabbbaa
                                                             every vertex has at most 3
2.   The binary relation, R = {(0, 0),
     (1, 1)} on A = {0, 1, 2, 3} is :                        children and there are 41 total
     (A) Reflexive, Not Symmetric,
                                                             vertices.
           Transitive

     (B) Not Reflexive, Symmetric,                       (C) A full binary tree with 11
           Transitive
                                                             vertices and height 6.
     (C) Reflexive, Symmetric, Not
           Transitive
                                                         (D) A binary tree with 2 leaves
     (D) Reflexive, Not Symmetric,
           Not Transitive                                    and height 100.

                                                3                                      [P.T.O.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 4 of 16
Page 4 of 16
Text of page 4
AUG - 37215/II

4.   Match all items in List I with               5.   Consider the following Finite State

     correct options from those given in               Automaton :

     List II. Choose the correct answer

     from the codes given below :

         List I               List II

     (P) Regular        (1)   Syntax
                                                       The language accepted by this
         Expression           analysis
                                                       automaton is given by the regular
     (Q) Push down (2)        Code                     expression :

                                                       (A) b*ab*ab*ab
         automata             generation
                                                       (B) (a+b)*
     (R) Dataflow       (3)   Lexical
                                                       (C) b*a(a+b)*
         analysis             analysis
                                                       (D) b*ab*ab

     (S) Register       (4)   Code                6.   Using binary arithmetic, a number
                                                       c is computed by taking the n-bit
         allocation           optimization
                                                       two’s complement of ‘a – b’. If n is
     Codes :                                           eleven, a = 101000010012 and b =
                                                       101012 then c = ?
     (A) (P)–(4), (Q)–(1), (R)–(2), (S)–(3)
                                                       (A) 011000011112
     (B) (P)–(3), (Q)–(1), (R)–(4), (S)–(2)
                                                       (B) 011000011002
     (C) (P)–(3), (Q)–(4), (R)–(1), (S)–(2)            (C) 011000111002

     (D) (P)–(2), (Q)–(1), (R)–(4), (S)–(3)            (D) 010001111002

                                              4
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 5 of 16
Page 5 of 16
Text of page 5
AUG - 37215/II

7.   Consider the following :                     8.   In a half-adder, CARRY is obtained

                                                       by using :
     m = “Jack is a math major,”
                                                       (A) OR gate
     c = “Jack is a computer science

         major,”                                       (B) NAND gate

     g = “Jack’s friend is a literature                (C) EX-OR gate

         major,”                                       (D) AND gate

     h = “Jack’s    friend    has      read       9.   A circuit produces 1’s complement of

         Shakespeare’s Hamlet,” and                    the input word, one application is

                                                       binary subtraction. It is called :
     t = “Jack’s    friend    has      read

         Shakespeare’s The Tempest.”                   (A) Logic gate

                                                       (B) Register
     Which of the following expresses the

     statement “Jack is a computer                     (C) Multiplexer

     science major and a math major, but               (D) BCD converter
     his friend is a literature major who
                                                  10. When an inverter is placed between
     hasn’t read Shakespeare’s both The                both inputs of an SR flip-flop, then
     Tempest and Hamlet” ?                             resulting flip-flop is :

     (A) c   m     (g   (~h     ~t))                   (A) JK flip-flop

     (B) c   m     g    (~h     ~t)                    (B) D flip-flop

     (C) c   m     g    (~h     ~t)                    (C) SR flip-flop

     (D) c   m     (g   (~h     ~t))                   (D) Master slave JK flip-flop

                                              5                                     [P.T.O.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 6 of 16
Page 6 of 16
Text of page 6
AUG - 37215/II

                                               13. Pick out the correct statement :
11. Explicit call to a constructor
                                                   (A) A derived class’s constructor
    means ?
                                                       cannot explicitly invoke its base
                                                       class’s constructor.
    (A) Not providing the construction
                                                   (B) A derived class’s destructor
        name at all
                                                       cannot invoke its base class’s
                                                       destructor.
    (B) Is the shorthand method
                                                   (C) A derived class’s destructor
    (C) Providing the constructor name                 can invoke its base class’s
                                                       destructor.
        explicitly to invoke it
                                                   (D) None of the mentioned

    (D) Providing the constructor name         14. How do we declare an interface
                                                   class ?
        implicitly to invoke it
                                                   (A) By declaring the class as
12. A   class    having     no    public               interface     with      keyword
                                                       interface
    constructors is :
                                                   (B) By making all the methods
    (A) A public protected class                       abstract using the keyword
                                                       abstract in the class
    (B) A public class
                                                   (C) By making all the methods pure
                                                       virtual in the class
    (C) A protected class
                                                   (D) It is not possible to create
    (D) A private class                                interface classes in C++

                                           6
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 7 of 16
Page 7 of 16
Text of page 7
AUG - 37215/II


15. In which header file is the NULL              17. Consider relations student and

                                                      takes :
    macro defined ?
                                                      student(id, name, dept-name,
    (A) stdio.h
                                                      tot_cred)

    (B) stddef.h                                      takes(id, course_id, sec_id, semester,

                                                      year, grade)
    (C) stdio.h and stddef.h
                                                      Choose the correct query for “Find
    (D) math.h
                                                      all students who have not taken

16. A value that appears in one relation              any course”.


    for a given set of attributes also                (A) Select id from student natural

                                                          left outer join takes where
    appears for a certain set of attributes
                                                          course-id is null
    in another relation :
                                                      (B) Select id from student natural

    (A) Integrity constraints                             right outer join takes


    (B) Referential-Integrity constraints             (C) Select * from student natural

                                                          right outer join takes
    (C) Domain constraints
                                                      (D) Select * from student join takes

    (D) Assertions                                        on student.id = takes.id

                                              7                                     [P.T.O.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 8 of 16
Page 8 of 16
Text of page 8
AUG - 37215/II

18. If         holds and          holds,        21. The terms PUSH and POP are
    then           holds.
                                                    related to :
    Which rule of Armstrong’s axioms
                                                    (A) Arrays
    satisfies this property ?

    (A) Reflexivity Rule                            (B) Stacks

    (B) Transitivity Rule                           (C) Linked list

    (C) Union Rule
                                                    (D) Queue
    (D) Pseudotransitivity Rule
                                                22. The postfix expression for *+ab–cd
19. The number of possible variations
                                                    is :
    of connectivity in n-ary relationship
    is :                                            (A) ab+cd – *

    (A) n + 2                                       (B) abcd + – *
    (B) n + 1
                                                    (C) ab+cd*–
    (C) n – 3
                                                    (D) ab+ – cd*
    (D) n + 3
                                                23. Data warehouse bus matrix is a
20. Which construct can be used to
    perform multiple updates with a                 combination of :

    single update statement in SQL ?
                                                    (A) Dimensions and data marts
    (A) if then else
                                                    (B) Dimensions and facts
    (B) case
                                                    (C) Facts and data marts
    (C) if then elsif

    (D) for loop                                    (D) Dimensions and detailed facts

                                            8
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 9 of 16
Page 9 of 16
Text of page 9
AUG - 37215/II

24. A hash table has space for 100               27. Formal analysis of protocols is an
    records. What is probability of                  important part of establishing
    collision before the table 10% full ?
                                                     confidence in the correctness of
    (A) 0.45
                                                     proposed communications products.
    (B) 0.5                                          The tools that are widely used in
    (C) 0.3                                          formal analysis are :

    (D) 0.34                                         (A) Petri net model
25. In what features, the data link layer
                                                     (B) Finite State Machine
    and transport layer are common :
                                                     (C) Options (A) and (B)
    (A) Both        layers   can   provide
         recovery from transmission                  (D) CRC model
         errors
                                                 28. The role of bit stuffing in DLL for
    (B) Both layers can provide flow                 frame transmission is to :
         control
                                                     (A) Avoid abnormal interpretation
    (C) Both layers can multiplexing
                                                         of header preamble occurring in
    (D) Options (A), (B) and (C) only
                                                         data pay load
26. Does      the     Ethernet     support
                                                     (B) To improve the error checking
    connection          oriented      and
                                                         and correcting mechanism
    connectionless services, both :

    (A) It depends on configuration                  (C) To make robust checking

    (B) No, connectionless only                          mechanism       compared     to

                                                         checksum
    (C) No, connection oriented only

    (D) Both (B) and (C)                             (D) It is to avoid the CRC check

                                             9                                    [P.T.O.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 10 of 16
Page 10 of 16
Text of page 10
AUG - 37215/II

29. The ALOHA protocol is used to share         31. Which of the following statements

    a 56-kbps satellite channel. Suppose
                                                    is true ?
    that frames are 1000 bits long. Find
                                                    (A) SLR is more powerful than
    the maximum throughput of the

    system in frames/second.                            LALR


    (A) 13                                          (B) LALR is more powerful than

    (B) 12                                              canonical LR

    (C) 10
                                                    (C) Canonical LR is more powerful

    (D) 11
                                                        than LALR parser

30. A Compiler-Compiler is a/an :
                                                    (D) The SLR, canonical CR and
    (A) Compiler, which compiles a
                                                        LALR have same power
        compiler program

                                                32. Context-free languages are :
    (B) Software tool used in automatic

        generation of a compiler                    (A) Closed Under Union

    (C) Compiler written in the same
                                                    (B) Closed Under Complementation
        language it compiles
                                                    (C) Closed Under Intersection
    (D) Another     name    for    cross

        compiler                                    (D) Closed Under Kleene Closure

                                           10
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 11 of 16
Page 11 of 16
Text of page 11
AUG - 37215/II
                                               35. Consider the 3 processes, P1, P2 and
33. To overcome the problems of the
                                                   P3 shown in the table :
    assembler in dealing with branching        Process Arrival time Time units
    code we use :                                                            required
                                                  P1            0                5
    (A) Interpreter                               P2            1                7
                                                  P3            3                4
    (B) Debugger                                   The completion order of the 3
                                                   processes under the policies FCFS
    (C) OP-Assembler                               and RR2 (round robin scheduling
                                                   with CPU quantum of 2 time units)
    (D) Two-pass Assembler                         are :
                                                   (A) FCFS : P1, P2, P3;
34. Generation of intermediate code                     RR2 : P1, P2, P3
    based on an abstract machine model             (B) FCFS : P1, P3, P2;
                                                        RR2 : P1, P3, P2
    is useful in compilers because :
                                                   (C) FCFS : P1, P2, P3;
    (A) It makes implementation of                      RR2 : P1, P3, P2
                                                   (D) FCFS : P1, P3, P2;
        lexical analysis and syntax                     RR2 : P1, P2, P3
        analysis easier                        36. A thread is usually defined as a
                                                   “light weight process” because an
    (B) Syntax-directed translations               operating system maintains smaller
                                                   data structures for a thread than for
        can be written for intermediate            a process. In relation to this, which
                                                   of the following is true ?
        code generation
                                                   (A) On per-thread basis, the OS
                                                        maintains only CPU register
    (C) It enhances the portability of                  state
        the front end of the compiler              (B) The OS does not maintain a
                                                        separate stack for each thread
    (D) It is not possible to generate             (C) On per-thread basis, the OS
                                                        does not maintain virtual
        code for real machines directly                 memory state.
        from high level language                   (D) On per-thread basis, the OS
                                                        maintains only scheduling
        program                                         and accounting information
                                          11                                     [P.T.O.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 12 of 16
Page 12 of 16
Text of page 12
AUG - 37215/II

37. For every successful login, which
                                                  40. In Software Engineering, code of
    script will be executed ?

    (A) /etc/inittab                                  ethics and professional practice is

    (B) /etc/profile                                  given by joint task force of :

    (C) /etc/login
                                                      (A) ANSI/IEEE-CS
    (D) /etc/init

38. The first thing that is searched                  (B) ACM/IEEE-CS
    when a command references a file
    is its :                                          (C) ACM/ANSI-CS

    (A) i-node
                                                      (D) ACM/UTI-CS
    (B) i-node number

    (C) permission setting                        41. In software engineering, one of the

    (D) directory entry                               requirements included in software

39. As per software engineering process,
                                                      performance specification is :
    one of the attributes of good software
    is :
                                                      (A) OOP
    (A) Software’s interface to user
                                                      (B) Unified Modeling
    (B) Software’s response time to user
           querry
                                                      (C) Reliability analysis
    (C) Software’s complexity level

    (D) Software’s services to user                   (D) Prototyping

                                             12
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 13 of 16
Page 13 of 16
Text of page 13
AUG - 37215/II

42. In software engineering, structured         44. MPI stands for :
    approach to requirement analysis
                                                    (A) Message Parallel Interface
    consists of :

    (A) Hardware level requirement                  (B) Multiple Passing Interface

        analysis and Software level                 (C) Message Passing Interface
        requirement analysis
                                                    (D) Member Passing Interface
    (B) Product level requirement
        analysis and System level               45. FLOPS stands for :
        requirement analysis                        (A) Functional Layout Operation
    (C) System level requirement                         Per Second
        analysis and Software level
                                                    (B) Floating Operations Per Second
        requirement analysis

    (D) System level requirement                    (C) Fluctuating Operations Per

        analysis and Hardware level                      Seconds
        requirement analysis
                                                    (D) Function Living Operation Per
43. The software engineering discipline
                                                         Second
    related with software production is
    concerned with :                            46. Increased security is the main
                                                    advantage of the ........................... IR
    (A) Practicalities of validating and
        delivering useful software                  system in wireless communication.

    (B) Practicalities of validating and            (A) Point-to-Multipoint
        evolving useful software
                                                    (B) Point-to-Point
    (C) Practicalities of specifying and
                                                    (C) Multipoint to one point
        evolving useful software

    (D) Practicalities of developing and            (D) Multipoint           to    Multipoint

        delivering useful software                       Possibly
                                           13                                             [P.T.O.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 14 of 16
Page 14 of 16
Text of page 14
AUG - 37215/II

                                                       49. Which of the following processes
47. The data is stored, retrieved and
                                                           includes data cleaning, data
     updated in :                                          integration, data selection, data
                                                           transformation, datamining, pattern
     (A) OLAP
                                                           evolution        and      knowledge
                                                           presentation ?
     (B) OLTP
                                                           (A) KDD process
     (C) SMTP                                              (B) ETL process

                                                           (C) KTL process
     (D) FTP
                                                           (D) MDX process
48. An .............................. system is
                                                       50. What is a mobile intelligent

     market-oriented and is used for data                  agent ?

                                                           (A) A mobile agent is needed for a
     analysis by knowledge workers,
                                                               computer to communicate with
     including managers, executives and                        another computer over a
                                                               network
     analysts.
                                                           (B) A mobile intelligent agent is

     (A) OLAP                                                  an intelligent program that
                                                               contains the clients requests
     (B) OLTP
                                                           (C) A mobile intelligent agent is an
                                                               intelligent robot used for
     (C) ONGC
                                                               communication

     (D) FTP                                               (D) None of the above

                                                  14
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 15 of 16
Page 15 of 16
Text of page 15
AUG - 37215/II

ROUGH WORK




    15              [P.T.O.
MH SET 2015 question paper, 6 September 2015, Paper II, Computer Science and Applications, page 16 of 16
Page 16 of 16
Text of page 16
AUG - 37215/II

ROUGH WORK




    16
Page 1 of 16

Source: Savitribai Phule Pune University. Question paper published by Savitribai Phule Pune University.