TANCET Previous Year Question Papers  With Solutions Free PDF Download
TANCET Previous Year Question Papers
Get the Best Method to Crack the
Exam: Let’s Prepare with TANCET Previous Year Question Papers!!! Candidates who
are planning to prepare for Tamil Nadu Common Entrance Test may get TANCET
Sample Papers from this page. Previous Question Papers contains the question
from all possible sections are as defined in the syllabus of Tamil Nadu Common
Entrance Test. Candidates may also download free TANCET Model Question Papers in
PDF form through online mode. Here on this page we are also providing you the TANCET
Previous Year Question Papers With Solutions which will help you to get success
in examination.
Anna University, Chennai conducts
TANCET Entrance Exam for admission to Post Graduate Courses such as MBA, MCA,
and ME/M.Tech/M.Arch/M.Plan etc. Candidates who will qualify in the exam they
may get the admission in Anna University. For more details regarding TANCET
Question Papers, candidates may go through the below section of this page which
is created by the team members of privatejobshub.in
Preparation Links

TANCET Previous Year Question Papers
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
Take a Test Now

5. A language is denoted by a regular expression L = (x) * (xyx). 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
ktape 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 : 410. In an absolute loading scheme, which loader function is accomplished by assembler
1) Reallocation
2) Allocation
3) Linking
4) Loading
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 organization 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
Related Updates

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 nonzero entries?
1) 15
2) 20
3) 50
4) 100
Ans : 416. 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 : 419. 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(n1) + 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 : 124. 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 mod6
counter?
1) 3
2) 2
3) 1
4) 0
Ans : 3
Above listed questions are
frequently asked in a exam and keeping this in mind the we have covered all the
sections and then provided you a series of questions that has been asked in
TANCET Previous Year Question Papers. Dear Visitors you may subscribe our free
mail services to obtain most recent information in your mailbox directly. If
you want to get daily updates through Facebook and Google+, so you can also
follow us on Facebook and Google Plus. Visitors may also bookmark the
privatejobshub.in by pressing Ctrl+ D option for getting the latest updates.
Take Help From These Preparation Stuff

No comments
Don't Add Comment with Spam Purpose