TCS Exam 23rd August 2022 9Am Slot Answers Live

TCS Exam 23rd August 2022 9Am Slot Answers Live 

Aptitude 

1.339

2.0.0625

3.less than 1

4.30

5.153 

6.8.13

7.20000

8.346.05

9.40,30 

10.loss 165 

11.2,420

12.3,800

13.3 1/11

14)576

15. 7hr

16.7.94

17.37.4

18.67%

19. 27

20. 2.6

--------------------------------------------------------------------

Verbal

1) Really mean

2) uk economy

3) need of the hour

4) Recognise

5) DABC

6) The Indian cricket had

7) No great adventure

8) All the Glitters or under your belt

9) 3124

10) ABCDE

11) PQ

12) at a relatively low cost

13) doesn't always agree

14) flagrant

15) Flock

16) CBADE

17) abdec

18) QR

19) On the base

20) Kushang and kishita

21) Others

22) Special Gov

24) common

25) from black banks

--------------------------------------------------------------------

Reasoning Answers

1) WB

2) TMIK

3), 4) 

5) Both 1 & 2

6) Both

7) Brothers wife 

8) only 1 & 3

9) 63

10) 4

11) Selected 

12) A True , R False

13) Both 1 & 2

14) Number 12

15) E,F,J

16) 

17) QQH

18) T

--------------------------------------------------------------------

Advanced Quants :-

1) 0.78

2) 2.4/5 sqrt 30

3) qr5/p6

4) a=0,b=8

5) 25

6) 90

7) 101

8) toxicogy 

9) 3071

10) 96

--------------------------------------------------------------------

Advance 2

1) yes

2) R 

3) 4968

4) pochampally 

5) data in statement 1 alone is sufficient 

6) if only Pf 

7) Bishesh

8) KYFOHRSWV

9) Both 

10) Only conclusion 3 & 4

--------------------------------------------------------------------

Coding Answers 

1. Praveen buying the code

x=int(input())

y=[]

for i in range(1,x+2):

      y.append(i)

if(x>=1):

      print (x+1)

2. 

Python

C++

3. Python

King Jeremy Code

n=int(input())

a=input()

b=input()

res,res2="",""

for x in range (len(a)):

    if a[x]!=b[x]:

        res+=a[x]

        res2+=b[x]

for x in set(res2):

    if x not in a :

        print(-1)

        break

else:

    print(len(set(res2)))

C++ :-

John Code :-

Python

John code  

n,k=map(int,input().split())

m=list(map(int,input().split()))

for i in range(k):

    x,y=map(int,input().split())

    m[x-1]=y

for i in range(n-1):

    if m[i]==m[i+1]:

        m.pop(i+1)

print(len(m))