Trending

## TANCET model question paper for cse with latest syllabus

TANCET (Tamil Nadu Common Entrance Examination) is a examination regularly conducted by the Anna university for the students who aspire to do MBA, MCA, ME, M.Tech, M.Arch, M.Plan as their post graduate degree course. TANCET MBA Entrance Test will have sections like Business situation analysis , Reading comprehension , Quantitative Section , Data sufficiency , Verbal ability. In this section we have provided the set of questions asked in a TANCET exam as initial preparation for the examination. After keeping in mind the main examination pattern of TANCET this TANCET model question paper for CSE have been prepared.  We have covered all the sections to be asked during the main examination. Still if it contains any error please do let us know, any type of suggestions will be highly appreciated.

TANCET Model Question Paper for CSE

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

Ans : 2

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

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

Ans : 3

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

Ans : 1

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

Ans : 2

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

Ans : 4

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

Ans : 1

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

Ans : 4

8. Minimum Hamming distance method is used for correction of

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

Ans : 4

9. 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

Ans : 4

1) Reallocation
2) Allocation

Ans : 1

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

Ans : 3

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

Ans : 1

13. A file is

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

Ans : 2

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

Ans : 1

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

Ans : 4

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

Ans : 4

17. Maximum possible height of an AVL tree with

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

Ans : 3

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)

Ans : 4

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

Ans : 1

20. Suppose f, g, h, k : N ® N. If f = O(h) and g = O(k), then

1) f + g = O(h + k)
2) fg = O(hk)
3) Both 1 and 2
4) None of the above

Ans : 4

21. Time complexity of an algorithm T(n), where n is the input size is given by t(N)={t(n-1) + 1/n if n>1 1 otherwise

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

Ans : 2

22. The access method used for obtaining a record from a cassette tape is

1) direct
2) sequential
3) random
4) parallel

Ans : 2

23. Memory refreshing may be done

1) by the CPU that contains a special regress counter only
2) by an external refresh controller only
3) either by the CPU or by an external refresh controller
4) None of the above

Ans : 1

24. An SR flip flop cannot accept the following input entry

1) Both inputs zero
2) Zero at R and one at S
3) Zero at S and one at R
4) Both inputs one

Ans : 2

25. How many illegitimate states has synchronous mod-6 counter?

1) 3
2) 2
3) 1
4) 0

Ans : 3

26. Different computers are connected to a LAN by a cable and

1) modem
2) interface card
3) special wires
4) telephone lines

Ans : 4

27. How many characters per sec (7 bits + 1 parity) can be transmitted over a 2400 bps line if the transfer is synchronous (1 start and stop bit)?

1) 300
2) 240
3) 250
4) 275

Ans : 3

28. End-to-end connectivity is provided from host to host in the

1) Network layer
2) Transport layer
3) Session layer
4) None of the above

Ans : 2

29. Which one of the following can be handled by a gate way?

1) Protocol conversion
2) Packet resizing
3) Data encapsulation
4) Both 1 and 2

Ans : 1

30. Which one of the fol lowing is not the responsibility of the utilities component of DBMS software?

1) Creating the physical and logical designs
2) Removing flagged records for deletion
3) Maintaining the data dictionary
4) Monitoring performance

Ans : 2

31. A data dictionary is a special file that contains

1) the names of all fields in all files
2) the data types of all fields in all files
3) the width of all fields in all files
4) all of the above

Ans : 1

32. The minimum number of record movements required to merge five files A with 10 records, B with 20 records and C with 15 records and D with 5 records and E with 25 records is

1) 165
2) 90
3) 75
4) 65

Ans : 2

33. In the text it was stated that a satellite with two uplink and one downlink slotted ALOHA channels can achieve a downlink utilisation of 0.736, given an infinite amount of buffer space. Expected number of success per slot will be

1) 0.536
2) 0.636
3) 0.736
4) 0.836

Ans : 4

34. Design phase will usually be

1) top-down
2) bottom-up
3) random
4) centrefringing

Ans : 4

35. Railway reservation system currently operational in India can be classified as a

1) batch processing system
2) real time system
3) online system
4) expert system

Ans : 2

36. The visual interface developed by Xerox was modelled on a

1) tree
2) file cabinet
3) desktop
4) testing

Ans : 2

37. Mnemonic codes and variable names are used in

1) A machine language
2) An assembly language
3) A high level language
4) All of the above

Ans : 3

38. Maximum combined length of the command line arguments including the spaces between adjacent arguments is

1) 128 characters
2) 256 characters
3) 67 characters
4) it may vary from one operating system to another

39. Which one of the following comments regarding the reading of a string, using scanf (with option) and gets is true?

1) Both can be used interchangeably
2) Scanf is delimited by end of line, while gets is not
3) Scanf is delimited by blank, while gets is not
4) None of the above

1. CAT Sample Papers
2. GMAT Sample Papers
3. GMAT MODEL TEST PAPERS
4. TANCET Syllabus

1. Abi says:

Nothing

2. Abi says: