TCS Digital questions and solutions 2018

TCS Digital questions and solutions 2018

TCS Digital questions and solutions 2018

TCS digital questions and solutions of TCS digital exam conducted today (20th July 2018) are discussed here. TCS digital questions and solutions would give you a rough idea of your performance and score in the exam.

In most colleges, the test was conducted in 3 slots. People who attempted TCS digital mock test found it helpful since the pattern is very similar to the mock. However, people found the actual exam to be way tougher than the mock test.

There are no questions getting repeated between the slots. No negative marking for Fill-ups and there is a negative marking for MCQs

 

TCS Digital questions and solutions:

TCS is likely to announce the TCS digital exam results tomorrow. While others are waiting for results, you can analyze our TCS digital questions and solutions to know your approximate score.

Question 1: How many ordered pairs satisfy x+y-xy=49?

Answer:20

Question 2: How many words are there between anegl to egnla, if you arrange the letter of word ANGEL in all possible ways?

Answer:16

Question 3: 7 letters are to be delivered to 7 addresses. In how many ways can all the letters can be deliver to a wrong address?

Answer: 1854

Question 4: The word Night, Wrist and Stop can be linked to “watch”, similarly what is the fourth word linking Right, Cat, carbon

Answer: Copy

Question 5: Suppose s is a set of positive integer , each of which is less than 25 such that no two elements of s has a common divisor greater then one. What is the largest possible number of elements in s?

Answer: 10

Question 6: Six points are marked on the circumference of a circle and all the pairs of points are joining by straight lines. No three lines have a common point and any two intersect at a point inside the circle. Into how many regions is the interior of the circle divided by these lines?

  1. 32
  2. None of these
  3. 24
  4. 31

Answer: 32

Question 7: A plane can be divided into 2 regions by one line, 4 regions by two lines, and 7 regions by three lines. What is the maximal number of regions that a plane can be divided into by 100 lines?

  1. 4051
  2. 5051
  3. 7051
  4. 6051

Answer: 5051

Question 8: A Quadratic polynomial f satisfies f(x)>= 1 for all x, f(2)=1, and f(3)=3

 What is f(5)? 

  1. Cannot be found from the given information
  2. 19
  3. 9
  4. 25

Answer: Cannot be found from the given information

Question 9: There are 120 possible ways if we arrange the word “ANGLE”. If all 120 are arranged alphabetical order starting with AEGLN and ending with NLGEA. Which position does the word ANGLE occupy?

Answer: 22

*Question 10: x/a = y/b=z/c=2018 xy=(a+b)(b+c)(c+a)/abc(x+y)(y+z)(z+x)

Answer: 1

Question 11 Meaning of “Proxy War”

Answer: War fought by two powers by using a supplement country in between

Question 12: Meaning of “Perspective”

Answer: View Point

Question 13: Construct the English words for minimum length Four using the characters of the words operations

Answer: Atropine, Operant, Painter, Pointer, Repaint, Portion, Stoner, Stoner, Enroot, Option, Parent, Retain, Proton

Question 14: ab313ab is divisible by 12 then the smallest value of a+b where a,b > 0

  1. 3
  2. 6
  3. 7
  4. 13

Answer:

Question 15: Given set of ‘n’ (7 or 9) dots on a circumference of a circle,how many equilateral triangles can be formed

Question 16:  One man moves forward or backward. Probability to forward or backward is 1/2. Total he can take 6 steps. What is the probability he reaches starting point?

Answer: 5/16

Question 17: For the words ‘NIGTH,WRIST,TIME’ the fourth word is WATCH. Then what is the fourth word for ‘MEASURE, WORM, VIDEO’.

Answer: Tape

Question 18: Levenshtein distance is a string metric for measuring the difference between two sequences informally, the Levenshtein distance between two words is the minimum number of single-character edits(insertions, deletions or substitutions)required to change one word into the other. These edits (insertions, deletions or substitutions) may carry the same weightage or different weightage. Let us say we want to find the Levenshtein distance between “Kittens” and “sitting” if the weightage of substitution, insertion, insertion and deletion are 1 respectively. what is the Levenshtein distance between these words based on the said weightages?

  1. 6
  2. 4
  3. 9
  4. 10 

Question 19: How many points required from “kittens” to “sitting”, Points substitute – 3, Insertion-2, deletion – 1.

Answer: 9

Question 20: 

A=1^n(-4)+ 2^n(-4)+ 3^n(-4)+…….

B=1^n(-4)+ 3^n(-4)+ 5^n(-4)+…….

find A/B=

Answer: 16/15

Question 21: A function f satisfies f(0)=0, f(2n)=f(n), and f(2n+1)=f(n)+1 for all positive integer n. What is value of f(2018)?

Answer: 7

Question 22: How many pairs (m,n) of integers satisfy the equation 4^m=n^2+15?

Answer : 4

Question 23: Suppose S is a set of positive integer , each of which is less than 25, such that no two elements of S have a common divisor greater than 1. What are the possible numbers of elements in 5?

  1. 10
  2. 5
  3. 8
  4. 12

Answer:10

Question 24: Consider a hash table with 100 slot. Collisions are resolved using Chaining. Assuming simple uniform hashing probability that the first 3 slot are unfilled after the first 3 insertions?

  1. (97 x 96 x 95)/(3! X 1003)
  2. (97 x 96 x 95)/ 1003
  3. (97 x 97 x 97)/ 1003
  4. (99 x 98 x 97)/ 1003

Answer: (97 x 97 x 97)/ 1003

Question 25: How many possible pairs of m and n? 4^n m=n^2 +15 (m,n)

Answer: 4

Question 26: Synonym for RAVE

  1. Admit
  2. Party
  3. Rant
  4. Blabber

 Answer: Blabber

Question 27: The inorder and preorder traversal of a binary tree b d e a f c g and a b d e c f g respectively. The postorder traversal of the binary tree is

  1. e d b g f c a
  2. e d b f g c a
  3. d e b f g c a
  4. d e f g b c a

Answer: d e b f g c a

 

We would keep updating the questions and their solutions. Stay tuned and get to know answers of questions you missed out in the exam.

 

c