# SET Computer science and Applications Question Answers

SET Computer science and Applications Question Answers for competitive exams: This mock test having mcq question each also from Paper II, Paper III Syllabus, with four choices. On each click on answers system will tell you where the answers is correct or incorrect. You can view this SET Computer science and Applications test question details at the end of the quiz.

You can also participates other Online Mock Test

State Level Eligibility Test is also know as SET  (State Eligibility TestComputer science and Applications questions answers are applicable for any kind of Higher Education especially for Lecturer and PHD examination like UGC NET And CSIR NET. . You can practice as much as you can to gather knowledge of how to answers SET Computer science and Applications critical type papers in short time and this can be a big factor for cracking LS/PHD level exam.

## SET/SLET Computer science and Applications Paper II - Mock Test

Congratulations - you have completed SET/SLET Computer science and Applications Paper II - Mock Test.You scored %%SCORE%% out of %%TOTAL%%.Your performance has been rated as %%RATING%%
Your answers are highlighted below.
 Question 1
Function overloading is done at
 A Compile time B Run time C Linking time D Execution time
 Question 2
OLAP is an acronym for
 A Online Analytical Project B Online Analytical Processing C Online Application Processing D Online Application Project
 Question 3
Architectural design involves in SE
 A E-R diagram B Flow-chart C Algorithm D DFD
 Question 4
An EDP auditor must be an expert in
 A Computerised Business Systems B Computerised System Analysis C Computerised Accounting Analysis D Computerised Program Analysis
 Question 5
If no exception is thrown
 A A catch block will cause an error B The first catch block coded will execute C The last catch block coded will execute D All catch blocks coded will be bypassed
 Question 6
Consider the following pseudo-code: IF ((A > B) AND (C > D)) THEN A=A+1 B=B+1 ENDIF The cyclomatic complexity of the pseudo-code is
 A 2 B 3 C 4 D 5
 Question 7
Which of the following testing methods is normally used as the acceptance test for a software system?
 A Regression testing B Integration testing C Unit testing D Functional testing
 Question 8
Match the following
 I. The beginning of the function code 1. () II. The preprocessor directive always starts with 2. & III.The symbol for the address operator 3. { IV. The name of a function always ends with 4. #

 I II III IV (A) 1 2 3 4 (B) 3 4 2 1 (C) 3 2 4 1 (D) 3 2 1 4

 A (A) B (B) C (C) D (D)
 Question 9
Match the following:
 1. Data Link Layer i. The lowest layer whose function is to activate, deactivate and maintain the circuit between DTE and DCE 2. Physical Layer ii. Perform routing 3. Presentation Layer iii. Detection and recovery of errors in the transmitted data 4. Network Layer iv. Provides syntax for the data

 A 1 —iii, 2—i, 3—iv, 4—ii B 1 —ii, 2—i, 3—iv, 4—iii C 1 —iv, 2—i, 3—ii, 4—iii D 1 —ii, 2—i, 3—iii, 4—iv
 Question 10
Match the following
 I. 0 (log n) 1. Heap sort II. 0 (n) 2. DES III. 0 (n log n) 3. Binary search IV. 0 (n2) 4. Bubble sort

 A I—3, II—2, III—1, IV—4 B I—4, II—1, III—3, IV—2 C I—3, II—1, III—2, IV—4 D I—3, II —2, III—4, IV —1
 Question 11
Choose the category of following SQL operations INSERT, DELETE and UPDATE
 A DDL B PL C DML D DCL
 Question 12
Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples, then the maximum and minimum sizes of the join respectively are
 A m + n and O B mn and O C m + n and |m-n| D mn and m + n
 Question 13
Assertion A : The technique of building new classes from the existing classes is called polymorphism. Reason R : Polymorphism requires postponement of binding of a function call to the member function until runtime.
 A Both (A) and (R) are true and (R) is the reason for (A) B Both (A) and (R) are true but (R) is not a reason for (A) C Only (A) is true and (R) is false D Only (R) is true and (A) is false
 Question 14
Suppose a tree has d1 vertices of degree 1,2 vertices of degree 2,4 vertices of degree 3 and 3 vertices of degree 4 then d1 value is
 A 6 B 4 C 8 D 12
 Question 15
A Binary Search Tree (BST) stores values on the range 37 to 573. Consider the following sequence of keys i. 81, 537, 102, 439, 285, 376, 305 ii. 52, 97, 121, 195, 242, 381, 472 iii. 142, 248, 520, 386, 345, 270, 307 iv. 550, 149, 507, 395, 463, 402, 270 Which of the following statements is TRUE?
 A i, ii and iv are inorder sequences of three different BSTs B i is a preorder sequence of some BST with 439 as the root C ii is an inorder sequence of some BST where 121 is the root and 52 in a leaf D iv is a post order sequence of some BST with 149 as the root
 Question 16
Assertion A: Implicit type conversion in C++ can lead to errors keeping into the program, if adequate care is not taken. Reason R : Use of explicit type conversion is recommend in mixed mode expression.
 A Both (A) and (R) are true and (R) is the reason for (A) B Both (A) and (R) are true but (R) is not a reason for (A) C Only (A) is true and (R) is false D Only (R) is true and (A) is false
 Question 17
If X is a Boolean variable, then among following what are the statements true according to Idempotent law? I. X+X=X II. X.X=X III. X.1=X IV. X+1=1
 A I and II are correct B I and IV are correct C II and III are correct D All four (I, II, III and IV) are correct
 Question 18
Exterior Gateway Protocol is
 A To exchange routing information between gateway hosts B To connect two bridges C Loop-free interdomain routing between autonomous systems D To provide quality of service
 Question 19
Find the following statements in the context of software testing are TRUE or FALSE S1 : Statement coverage cannot guarantee execution of loops in a program under test. S2: Use of independent path testing criterion guarantees execution of each loop in a program under test more than once.
 A True, True B True, False C False, True D False, False
 Question 20
Match the following:
 I. To add 2 bits 1. Full adder II. To add 3 bits 2. Left shift by 1 bit III. To multiply by 2 3. Right shift by l bit IV. To divide by 2 4. Half adder

 I II III IV (A) 3 1 4 2 (B) 4 1 2 3 (C) 4 1 3 2 (D) 1 4 2 3

 A (A) B (B) C (C) D (D)
 Question 21
A medium access control technique for multiple access transmission media is
 A ALOHA B AMPLITUDE C ATTENUATION D MODULATION
 Question 22
In a software project, COCOMO (Constructive Cost Model) is used to estimate
 A Effort and duration based on the size of the software B Size and duration based on the effort of the software C Effort and cost based on the duration of the software D Size, effort and duration based on the cost of the software
 Question 23
The gray code for decimal 7 is
 A 0111 B 1011 C 0100 D 0101
 Question 24
Error detection at the data link level is achieved by
 A Bit stuffing B Cyclic redundancy codes C Equalization D Huffmann code
 Question 25
In Unix, the file descriptor returned by open system call is of type
 A FILE B Integer C Char D Structure
 Question 26
Which of the following tool is known as ‘parser’ generator?
 A LEX B YAAC C TEX D EMACS
 Question 27
The task of the Lexical Analysis phase is
 A To parse the source program into the basic elements or tokens of the language B To build a literal table and an identifier table C To build a uniform symbol table D All of the above
 Question 28
Match the following:
 I. The processes ID 1. grep II. Editor 2. ps III. Searching in files 3. cat IV. Printing a file 4. vi

 I II III IV (A) 2 4 1 3 (B) 3 4 2 1 (C) 2 3 4 1 (D) 4 3 1 2

 A (A) B (B) C (C) D (D)
 Question 29
A compiler for a high level language that runs on one machine and produces code for a different machine is called
 A Optimizing compiler B Cross compiler C One pass compiler D Multi pass compiler
 Question 30
Match the following:
 I. Deadlock avoidance first 1. Shortest job algorithm II. CPU scheduling 2. LRU algorithm III. Mutual exclusion 3. Banker’s algorithm IV. Page replacement 4. Peterson’s algorithm

 I II III IV (A) 1 3 2 4 (B) 4 2 3 1 (C) 3 1 4 2 (D) 2 4 3 1

 A (A) B (B) C (C) D (D)
 Question 31
Match the following:
 P. Regular expression 1. Syntax analysis Q. Pushdown automata 2. Code generation R. Dataflow analysis 3. Lexical analysis S. Register allocation 4. Code optimization

 A P—4,Q—1,R—2, S—3 B P—3,Q—1,R—4, S—2 C P—3,Q—4,R—1, S—2 D P—2,Q—1,R—4, S—3
 Question 32
Reasoning with uncertain knowledge can be dealt with
 A Monotonic reasoning B Simple reasoning C Non-monotonic reasoning D Complex reasoning
 Question 33
Which of the following eliminates transitive dependency?
 A 1 NF B 2 NF C BCNF D None of the above
 Question 34
Electronic credit cards can be in
 A Unencrypted form only B Encrypted form only C Both A and B D None of the above
 Question 35
Consider the following two statements i. A Hash function is an injective function which is often used for computing digital signature ii. An encryption technique DES performs a permutation on the elements of its input alphabet Which of the following is valid for the above two statements?
 A Both are false B i True, ii false C ii True, i false D Both are true
 Question 36
The number of flipflops required in a decade counter is
 A 3 B 10 C 5 D 4
 Question 37
Which of the following is a non-linear data structure? i. Stack ii. Queue iii. Tree iv. Graph v. Doubly linked list
 A All of the above B iii, iv and v C iii and iv D i, ii and v
 Question 38
Consider the following statements: P : A page fault occurs when the required page is not available in the main memory. Q: There exists a situation that, there is no space available in the main memory. Which of the following is true?’
 A Both P and Q are true, and Q is also a reason for P B Both P and Q are true, and Q is not reason for P C P is false but Q is true D Both P and Q are false
 Question 39
Fense Register is used for
 A CPU protection B File protection C Memory protection D I/O unit protection
 Question 40
SQL stands for
 A Structured Query Language B Sequential Query Language C System Query Language D Standard Query Language
 Question 41
Active X control can be added to a webpage by using
 A (OBJECT) tag B (SCRIPT) tag C (ACTIVE) tag D None of the above
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 41 questions to complete.
 ← List →
Shaded items are complete.
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 End

## SET/SLET Computer science and Applications Paper III - Mock Test

Congratulations - you have completed SET/SLET Computer science and Applications Paper III - Mock Test.You scored %%SCORE%% out of %%TOTAL%%.Your performance has been rated as %%RATING%%
Your answers are highlighted below.
 Question 1
A method of providing security to transport e-mails is
 A TLS B PGP C IP-sec D BGP
 Question 2
A combinational circuit is designed to take 4 bit input. The number from 0 to 9 are given as input in the binary form. The circuit outputs ‘1’ if 5,6,7 or 9 are given input. For all other numbers the circuit outputs 0’. The circuit is designed only using AND, OR, NOT gates. What is the minimum number of gates required ?
 A 2 B 3 C 4 D 5
 Question 3
The MAC protocol used in Ethernet is
 A ALOHA B Token ring C CSMA/CD D Token bus
 Question 4
Arrange the following IP addresses in the order of Class A, Class B, Class C and Class D. I. 193.200. 151.2 II. 189. 51.21.200 III. 225. 2. 2. 200 IV. 126. 8. 2. 200
 A I, IV, II, III B III, II, IV, I C IV, II, I, III D II, III, IV, I
 Question 5
Addressing modes of the following 8085 instructions in the same order. LDA, LXI, ADD r1, r2, MOV A,M
 A Implicit, Indirect, Direct, Register B Implicit, Indirect, Register, Immediate C Direct, Indirect, Immediate, Register D Direct, Immediate, Register, Indirect
 Question 6
The concatenation of two lists is to be performed in 0(1) time. Which of the following implementation of a list should be used?
 A Singly linked list B Doubly linked list C Circularly doubly linked list D Array implementation of list
 Question 7
Match the following:
 I.   Non vectored interrupt 1. ISR II.  Non Maskable interrupt 2. RST2 III. Program for interrupt 3. TRAP IV. Software Interrupt 4. INTR

 I II III IV (A) 4 3 1 2 (B) 2 3 4 1 (C) 1 4 3 2 (D) 2 1 3 4

 A (A) B (B) C (C) D (D)
 Question 8
Search algorithms are Judged on the basis of I. Completeness II. Optimality III. Time complexity IV. Space complexity
 A I and II B I, II and III C II, III and IV D All of the above
 Question 9
Choose the answer from the following register (s) that store the address of a memory location. I. Program counter II. Accumulator III. MAR IV. BC Register pair
 A I and II are correct B II and III are correct C I and IV are correct D I and III are correct
 Question 10
If G be a complete undirected graph on 6 vertices. If vertices of G are labeled then the number of distinct cycles of length 4 in G is equal to
 A 15 B 30 C 90 D 360
 Question 11
The number of vectored interrupts in 8085 is
 A 4 B 5 C 6 D 3
 Question 12
The Java compiler translates source code into
 A Machine Code B Assembly Code C Byte Code D All of the above
 Question 13
Object-Modelling Technique was proposed by
 A Booch B Rambaugh C Jacobson D All of the above
 Question 14
The following scheduling algorithm is inherently pie emptive
 A FCFS B SJF C LJF D Round Robin
 Question 15
An Abstract Data Type (ADT) is
 A same as an abstract class B a data type that cannot be instantiated C a data type for which only the operations defined on it can be used D all of the above
 Question 16
In a paged memory the page hit ratio is 0.35. The time required to access a page in secondary memory is equal to 100 nsec. The time required to access a page in primary memory is 10 nsec. The average time required to access a page is
 A 55 nsec. B 68 nsec. C 68.5 nsec. D 78.5 nsec.
 Question 17
_______________ abstraction is a named sequence of instructions that has a specific and limited function.
 A Procedural B Data C Control D Physical
 Question 18
A process executes the code fork (); fork (); fork (); fork (); The total number of child processes created is
 A 4 B 15 C 7 D 5
 Question 19
The complexity of inter connection among modules is described by
 A Cohesion B Temporal cohesion C Logical cohesion D Coupling
 Question 20
A 1000 K byte memory is managed using variable partitions but to compaction. It currently has two partitions of sizes 200 K bytes and 340 K bytes respectively. The smallest allocation request in K bytes that could be denied is for
 A 380 B 520 C 481 D 461
 Question 21
The following page replacement algorithms suffer from Belady’s anomaly. I. Optimal replacement II. LRU III. FIFO IV. MRU
 A I and IV correct B I and III correct C II and III correct D II and IV correct
 Question 22
Given the basic ER and relational models, which of the following is INCORRECT?
 A An attribute of an entity can have more than one value B An attribute of an entity can be composite C In a row of a relational table, an attribute can have more than one value D In a row of a relational table, an attribute can have exactly one value or a NULL value
 Question 23
The PROJECT operator of a relational algebra creates a new table that has always
 A More number of columns than original table B More number of rows than the original table C Same number of rows as the original table D Same number of columns as the original table
 Question 24
The Natural Language sentence will be represented in NLP with I. ATN II. RTN III. FPL IV. FRAMES
 A III, IV B IV, I C I, II D II, III
 Question 25
The file organization in which the physical location of a record is determined by a Mathematical function that maps the key to address of the record is
 A Hashed file organization B B Tree file organization C B’ Tree file organization D Sequential file organization
 Question 26
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE? i. The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph. ii. The cyclomatic complexity of a module is the number of decisions on the module plus one. Where a decision is effectively any conditional statement in the module. iii. The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing
 A i and ii B ii and iii C i and iii D i, ii and iii
 Question 27
Which of the sorting algorithm is the slowest?
 A Bubble sort B Quick sort C Shell sort D Heap sort
 Question 28
The approach used in top-down analysis and design is
 A to identify the top level functions by combining many smaller components into a single entity B to identify a top level function and then create a hierarchy of lower level modules and components C to prepare flowcharts after programming has been completed D all of the above
 Question 29
Match the following:
 I. Flow control 1. Token Bucket II. Error control 2. Sliding window III. Congestion control 3. Manchester encoding IV. Synchronization 4. Parity bit

 I II III IV (A) 2 4 1 3 (B) 3 4 2 1 (C) 4 2 1 3 (D) 1 4 2 3

 A (A) B (B) C (C) D (D)
 Question 30
Slow start is a technique used by the TCP to reduce
 A Number of buffers B Number of timers C Number of TOP connections D Number of timeouts of segments
 Question 31
A B-Tree used as an index for a large database table has four levels including root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are
 A 5 B 4 C 3 D 2
 Question 32
What is difference between a Java applet and a Java application?
 A An application can in general be trusted whereas an applet can’t B An applet must be executed in a browser environment C An applet is not able to access the files of the computer it runs on D All of the above
 Question 33
Types of validation testing
 A Alpha and Beta Testing B Top down and Bottom up testing C Recovery and Integrity testing D All the above
 Question 34
Choose the correct answer, the protocols which returns IP address. I. ARP II. RARP III. HTTP IV.DNS
 A I and II correct B All correct C I, II, III correct D II and IV correct
 Question 35
What is the appropriate pairing of items in the two columns, listing various activities encountered in a software life cycle?
 P. Requirements  capture 1. Module    Development and Integration Q. Design 2. Domain analysis R. Implementation 3. Structural Behavioural Modelling S. Maintenance 4. Performance Tuning

 A P—3, Q—2, R—4, S—1 B P—2, Q—3, R—1, S—4 C P—3, Q—2, R—1, S—4 D All of the above
 Question 36
In UNIX, when the read system call encounters EOF, it returns
 A Some positive integer B Positive integer related to error code C 0 D -1
 Question 37
The message 11001001 is to be transmitted using the CRC polynomial x3 + 1 to protect it from errors. The message that should be transmitted is
 A 11001001000 B 11001001011 C 11001010 D 110010010011
 Question 38
----------is black box testing method.
 A Boundary value analysis B Basic path analysis C Code validation analysis D All of the above
 Question 39
If the hamming distance is ‘m’ then the number of errors that can be corrected is
 A Equal to ‘m’ B Less than m/2 C Equal to 2 m D Greater than 2 m
 Question 40
What is the maximum number of I/O devices that can be interfaced to 8085?
 A 64 B 8 C 32 D 256
 Question 41
Compression Ratio is defined as
 A 1 — (compressed size/uncompressed size) B compressed size/uncompressed size) C 1 — (compressed data rate/ uncompressed data rate) D All of the above
 Question 42
Neural Networks are models of
 A Decision making system B Data processing system C Control systems D Biological nervous systems
 Question 43
Question No.’s 43 and 44 Disk requests come to a disk drive for cylinders 10, 22, 20, 2, 40, 6 and 36 in that order at a time when the disk drive is reading from cylinder 20. The seek time is 6 ms per cylinder. The disk can be rotated either clockwise or counter clockwise.The total seek time if the disk arm scheduling algorithm is first-cum-first served.
 A 360 msec. B 850 msec. C 876 msec. D 900 msec.
 Question 44
If the scheduling algorithm is closest cylinder next, then the total will be
 A 360 msec. B 876 msec. C 900 msec. D 330 msec.
 Question 45
Question No.’s 45, 46 and 47 The next three questions are based on Huffman’s coding for the symbol A with probability 0.3, B with 0.15, C with 0.1, D with 0.25 and E with 0.2. The minimum number of bits required to represent B is
 A 1 B 2 C 3 D 4
 Question 46
The minimum number of bits required to represent all the symbols together is
 A 14 B 11 C 12 D 15
 Question 47
The average code length of the given problem is
 A 2 B 2.25 C 2.45 D 3
 Question 48
Character Recognition is application of
 A Fuzzy Logic B Neural Networks C Genetic Algorithm D Logic
 Question 49
Inference Engine consists of I. Facts II. User Interface III. Search IV. Domain Expert
 A I, II B II, III C I, III D II, IV
 Question 50
With regarding to exceptions following is TRUE
 A Raised by program B Raised by user C Raised by OS D Raised by program and OS
 Question 51
Which of the following concurrency control protocols ensure both conflict serializability and freedom from dead deadlock I. 2 — phase locking II. Time-stamp ordering
 A I only B II only C Both I and II D Neither I nor II
 Question 52
The following system calls are related to file operations in UNIX I. Signal II. Kill III. Seek IV. Unlink
 A I and III correct B III and IV correct C II and III correct D II and IV correct
 Question 53
HTML (Hyper Text Markup Language) has language elements which permit certain actions other than describing the structure of the web document. Which one of the following actions is not supported by pure HTML (without any server or client side scripting) pages?
 A Embed web objects from different sites into the same page B Refresh the page automatically after a specified interval C Automatically redirect to another page upon download D Display the client time as part of the page
 Question 54
Search engine is a ____________ agent.
 A Learning B Negotiation C Intelligent D Business
 Question 55
The commonly used UNIX commands like date, Is, cut etc. are stored in
 A / dev directory B / sys directory C / unix directory D / bin and /usr/bin directory
 Question 56
ADO stands for
 A Active x Data Object B Active x Dynamic Object C Active x Downloadable Object D Active x Durability Object
 Question 57
If f is a linear transformation from the plane to the real numbers and if f (1,1) = 1 and f(-1, 0)= 0 then f (3, 5) =
 A -6 B -5 C 0 D 9
 Question 58
Fuzzy Logic is proposed by
 A MAMDHANI B ZADEH C MUZIMITO D TANAKA
 Question 59
If the inorder and postorder traversal results of a binary tree are A, C, B, F, E, D, G and A, B, C, E, G, D, F respectively. Identify the root node of it.
 A A B D C C D F
 Question 60
NLP includes problems
 A in which the objective function is linear but some constraints are not linear B in which the constraints are linear but the objective function is not linear C in which both the objective function and all the constraints are not linear D all of the above
 Question 61
Which of the following is an assertion?
 A P is true, P and Q are true and K or not (Q) is true implies K is true B P is true, P and Q are true and K or not (Q) is true implies K is false C P is true, P and Q are false and K or not (Q) is true implies K is true D P is true
 Question 62
In 8085, the addressing mode used for LDAX rp instruction is
 A Direct B Indirect C Register D Immediate
 Question 63
The maximum packet size of IPV4 is
 A 1500 bytes B 2MB C 65535 bytes D 48 bytes
 Question 64
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it doesnot have a GROUP by clause. Q: An SQL query can contain a HAVING clause only if it has GROUP by clause. R: All attributes used in the GROUP by clause must appear in the SELECT clause. S: Not all attributes used in the GROUP by clause need to appear in the SELECT clause.
 A P and R B P and S C Q and R D Q and S
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 64 questions to complete.
 ← List →
Shaded items are complete.
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 End

{{ reviewsOverall }} / 5 Users (0 votes)
Rating
What people asked Leave your query
Order by:

Be the first to leave a review.

Verified
{{{review.rating_comment | nl2br}}}

Show more
{{ pageNumber+1 }}
Leave your query