CodingHuman #Coding_Help , All exam codes, Coding solutions, accenture TCS Wipro Nagarro Persistent Cisco
588 subscribers
136 photos
310 links
We Provide free material, Coding stuff, Placement material, Handwritten Notes, previous year company questions, Job updates and many more.
Conding help.
Download Telegram
TCS REASONING
1)113
2)222
3)14
4)607
5)42
6)624
7)VD
8)MN
9)i
10)Social
11)prose
12)brown
13)her case - general manager
14)A,B & C only
15) brother in law
Telegram- https://t.me/Coding_human
Loot deals : https://t.me/DMAD_Discussion
Tcs IRA JAVA:

1.)All of the Above
2.)Volume,velocity,variety
,veracity
3.)veracity.
4.)True
5.)50
6.)offering others.....productivity.
7.)white socks are seen....
8.Trap of assumptions
9.)cluster all products....
10.)The project proposals should be...
11.)C.)Tata consultancy services ...
12.)Error
13.)....Begin and end blocks
14.)grep myempid""FuncName"*
15.)
16.)alter table employee alter assets int
17.)check
18.)False
19.)
Amazon/FK offers : https://t.me/DMAD_Discussion
Telegram - https://t.me/Coding_human
Discussion(Coding Help) : https://t.me/infosys_accolite_all_slots_exam
PYTHON

1.Robotics
2.True
3.all of the above
4. Value
5. Inexpensive
6. D
7. B
8. B&D
9. B
10. D
36.Error
37. n
41.5
43.HELLO
44.[76,54,99]
45.Error
46. {3,a}
47. B
48. A
49. 1
50. 3210

https://t.me/Coding_human
https://t.me/DMAD_Discussion
https://t.me/infosys_accolite_all_slots_exam
def bfs(graph,c,t):
s=1
n=len(graph)-1
dist=[]
pred=[]
color=[]
q=[]
count=0
for _ in range(len(graph)):
dist.append(9999)
pred.append(None)
color.append('w')
q.append(s)
dist[s]=0
color[s]='g'
while len(q)!=0:
u=q.pop(0)
if u==n:
break
count+=1
color[u]='b'
for i in graph[u]:
if color[i]=='w':
q.append(i)
color[i]='g'
dist[i]=dist[u]+c
pred[i]=u
return dist[n]

n,m,t,c=map(int,input().split())
graph=[[] for _ in range(n+1)]
for _ in range(m):
x,y=map(int,input().split())
graph[x].append(y)
graph[y].append(x)
time=bfs(graph,c,t)
signal='g'
signals=[None]
for _ in range(t):
signals.append('g')
for i in range(t,time+1):
if i==0:
continue
if (i//t)%2==0:
signals.append('g')
else:
signals.append('r')
for i in range(0,time,c):
if signals[i]=='r':
time+=(signals[i+1:].index('g'))

print(time)

Python accolite beautiful path
Tg : https://t.me/Coding_human
C++👆

def authentication (n):
A=list(range(1,n+1))
i=2
While i<len(A):
A= A[j for j in range(len(A)) if j%i !=0]
i+=1
return ("Yes" if len(A)>0 else "No")

print(authentication(int(input()))

Python3
strong number code
Telegram -https://t.me/Coding_human
https://t.me/DMAD_Discussion
def compute_hcf(x, y):
if x > y:
smaller = y
else:
smaller = x
for i in range(1, smaller+1):
if((x % i == 0) and (y % i == 0)):
hcf = i
return hcf

num1 = 54
num2 = 24

print("The H.C.F. is", compute_hcf(num1, num2))



Telegram👇

@Coding_human
@Coding_human
@Coding_human
@tata_elxsi_exam_mindtree_help
@DMAD_Discussion
def extractSecretMessage(Str, Sub): Str= Str.replace(Sub, " ") return Str.strip() Str = input("") Sub = input("") print(extractSecretMessage(Str, Sub))


Fanny occurrences code
Python

Telegram- @Coding_human
@tata_elxsi_exam_mindtree_help
@DMAD_Discussion
@Coding_human
TCS NQT
NUMERICAL

1.)8
2.)49
3.)90
4.)1596
5.)4
6.)5.14
7.)4784
8.)6.25
9.)20
@Coding_human
10.)74.8 nanograms
11.)20%
12.)10 & 11
13.)45
14.)40
15.)4 Days
16.)-1/3
17.)12.2
18.)both I and II
1.)8
2.)49
3.)90
4.)1596
5.)4
6.)5.14
7.)4784
8.)6.25
9.)20
10.)74.8 nanograms
11.)20%
12.)10 & 11
13.)45
14.)40
15.)4 Days
16.)-1/3
17.)12.2
18.)both I and II
19.)13.1
20.)18
21.)3,2
22.)Data is tri mode
23.)2019
24.)13
25.)2016
26.)
Telegram- @Coding_human
@tcs_nqt_exam_mindtree_help
TCS NQT (05/02/22)
VERBAL:
----------------------
1.)Out of the Box,up the ..
2.).....out of harms way
3.)A.)do me a.....
4.)Writing is one person
@Coding_human
5.)During the...
6.)to sustain
7.)in the long term survival....
8.)C-II
9.)a-3,b-4,c-1,d-2
10.)
Telegram-@Coding_human
@tcs_nqt_exam_mindtree_help