Tamilnadu SET 2016 Computer Science Questions & Answers Updated

1.      The decision tree classifier is a widely used technique for..............

a.      Classification 

b.      Association

c.       Partition

d.      Clustering

2.      The depth of a complete binary tree is given by

a.       Dn = n log2n

b.      Dn = n log2n+1

c.       Dn = log2n

d.      Dn = log2n+1

3.      How many flip flop circuits are needed to divide by 16?

a.       2

b.      4

c.       8

d.      16

4.      A decimal counter has………..states

a.       5

b.      10

c.       15

d.      20

5.      In PL/SQL, which part contains the condition section

a.      Executable Commands

b.      Exception Handling

c.       Declaration

d.      Result part

6.      Fractals deals with curves that are

a.       Irregularly irregular

b.      Regularly irregular

c.       Irregularly regular

d.      Regularly regular

7.      Which of the following registers is loaded with the contents of the memory location pointed by the program counter?

a.       Memory address Register

b.      Memory data register

c.       Instruction Register

d.      Program Counter

8.      The error distribution in the case of coding is

a.       10%

b.      20%

c.       40%

d.      50%

9.      Cyclomatic complexity method comes under in………..testing method

a.      White box

b.      Black box

c.       Green box

d.      Yellow box

10.  ………………..is one of the brute force search technique

a.      Depth first search

b.      Heristic search

c.       Best first search

d.      Beam search