TANCET Study Material CSE

Will you please provide me the TANCET CSE question paper as study material?

You are looking for the TANCET CSE question paper as study material, here i am providing:

1. A man alternately tosses a coin and throws a dice, beginning with the coin. Then probability that he will get a head before he gets a 5 or 6 on dice is

1) 1/4 2) 3/4
3) 4/5 4) 4/7

2. If mean = (3 median – mode) x, then value of x is

1) 1 2) 2
3) 1/2 4) 3/2

3. If the standard deviation for two variables X and Y are 3 and 4 respectively and their covariance is 8, then correlation coefficient between them is

1) 2/3 2) 8 (3 2)
3) 9 (8 2) 4) 2/9

4. If P(A) = 0.4, P(AÈB) = 0.7 and A, B are independent, then P(B) =

1) 0.2 2) 0.3
3) 0.5 4) 0.6

5. A language is denoted by a regular expression L = (x) * (x|yx). Which one of the following is not a legal string within L?

1) yx 2) xyx
3) x 4) xyxyx

6. Which one of the following pairs of regular expressions are equivalent?

1) 1(01)* and (10)*1 2) x(xx)* and (xx)* x
3) x+ and x*x+ 4) All of the above

7. Time taken by one tape TM to simulate n moves of k-tape TM is

1) O(n) 2) O(nk)
3) O(n2) 4) None of the above

8. Minimum Hamming distance method is used for correction of

1) syntactic errors 2) semantic errors
3) algorithmic errors 4) transcription errors

9. Tancet 20139. A compiler for a high level language that runs on one machine and produces code for a different machine is called

1) Optimising compiler
2) One pass compiler
3) Cross compiler
4) Multipass compiler

10. In an absolute loading scheme, which loader function is accomplished by assembler

1) Reallocation 2) Allocation
3) Linking 4) Loading

11. Relocatable programs

1) cannot be used with fixed partitions
2) can be loaded almost anywhere in memory
3) do not need a linker
4) can be loaded only at one specific location

12. The most efficient data set organisation is

1) a sequential file
2) an ISAM file
3) variable depending upon the usage of the data
set
4) a partitioned data set

13. A file is

1) An abstract data type
2) Logical storage unit
3) File is usually non volatile
4) All of the above

14. How many comparisons are needed to sort an array of length 5 if a straight selection sort is used and array is already in the opposite Order?

1) 1 2) 10
3) 15 4) 20

15. How many real links are required to store a sparse matrix of 10 rows, 10 columns and 15 non-zero entries?

1) 15 2) 20
3) 50 4) 100

16. Which one of the following is useful in traversing a given graph by breadth first search?

1) Stack 2) Set
3) List 4) Queue

17. Maximum possible height of an AVL tree with

7 nodes is
1) 3 2) 4
3) 5 4) None of the above

18. Consider that n elements are to be sorted. The worst case time complexity of Bubble sort is

1) O(1) 2) O(log n)
3) O(n) 4) O(n2)

19. Algorithm which solves the all pair shortest path problem is

1) Dijkstra’s algorithm
2) Floyd’s algorithm
3) Prim’s algorithm
4) Warshall’s algorithm

For detailed question paper here is attachment:

Attached Files Available for Download

TANCET CSE Question paper.doc (43.5 KB, 258 views)

please send me the TANCET study materials for CSE