TCS Atlas Previous Year Questions & Answers (Last 5 Years) | TCS Atlas Statistics Questions & Answers

TCS Atlas Previous Year Questions & Answers | TCS Atlas Statistics Questions & Answers | TCS Atlas Exam Solved Question | TCS Atlas Previous Year Placement Question | TCS Atlas Statistics Exam Solved Questions

TCS Atlas Previous Year Questions & Answers 2024: To qualify for each exam, you should prepare well for the Previous Year Question Papers. Before attending any exam you should solve the Old Question Papers to boost up your preparation. All the aspirants should deeply know about the TCS Atlas Previous Year Question Paper & Answers, Exam Scheme, etc. You may get the direct URL link to download the Previous Year’s Question Paper on this blog. More details like TCS Atlas Statistics Questions & Answers, TCS Atlas Coding Questions & Answers, TCS Atlas Previous Year Coding Questions & Answers, etc. available on its website

TCS Atlas Hiring Cut Off & Pass Marks>>

TCS Atlas Hiring 2024 Test Pattern >>

TCS Atlas Hiring 2024 Syllabus

• Statistics
• Mathematics
• Economics
• Coding

TCS Atlas Previous Year Questions With Solutions

TCS Atlas Quantitative Ability Placement Question Paper	Download PDF>>
TCS Atlas Mathematics Previous Year Questions	Download PDF>>
TCS Atlas Interview Questions & Answers	Download PDF>>
TCS Atlas Logical Reasoning Questions Paper	Download PDF>>
TCS Atlas Economics Placement Questions Paper	Download PDF>>
TCS Atlas English Placement Question Paper	Download PDF>>
TCS Atlas Aptitude Placement Question Paper	Download PDF>>
TCS Atlas Model Question Paper	Download PDF>>

TCS Atlas Coding Questions & Answers

Question: Amusement Park

Problem Statement: Aashay loves to go to WONDERLA , an amusement park. They are offering students who can code well with some discount. Our task is to reduce the cost of the ticket as low as possible.

They will give some k turns to remove the cost of one ticket where the cost of tickets are combined and given as string. Help Aashay in coding as he is not good in programming and get a 50%  discount for your ticket.

Constraints:

• 1 <= number of tickets <= 10^5
• 1 <= K <= number of tickets

Input Format for Custom Testing:

• The first line contains a string,Tickets, denoting the given cost of each ticket.
• The next line contains an integer, K, denoting the number of tickets that is to be removed.

Sample Cases:

• Sample Input 1
  203
  3
• Sample Output 1
  0

C++ PROGRAM

#include <iostream>

#include <bits/stdc++.h>

using namespace std;

int smallestNumber (string num, int k)

{

if(num.length()<=k)

return 0;

unordered_map<char,int> pos;

for(int i=0;i<num.length();i++)

{ pos[num[i]]=i;}

string temp=num;

sort(num.begin(),num.end());

string ans=num.substr(0,num.length()-k);

vector<int> v;

for(int i=0;i<ans.length();i++)

v.push_back(pos[ans[i]]);

sort(v.begin(),v.end());

string ret;

for(int i=0;i<v.size();i++)

{ret+=temp[v[i]];}

int final=stoi(ret);

return final;

}

int main()

{

string s;

cin >> s;

int k;

cin >> k;

int ans;

cout<<smallestNumber(s,k)%(int)(pow(10,9)+7);

return 0;

}

PYTHON PROGRAM

import sys

n=input()

k=int(input())

n1=len(n)

if len(n)<=k:

print(0)

sys.exit()

a=”

i=0

while i<(n1-1) and k>0:

if int(n[i])>int(n[i+1]):

i+=1

k-=1

continue

else:

a+=n[i]

i+=1

a+=n[i]

i+=1

if k>0:

a=a[:-k]

if i<=(n1-1):

while i<n1:

a+=n[i]

i+=1

print(int(a)%((10**9)+7))

Q) Write a program that receives a word A and some texts as input. You need to output the texts (without modifying them) in the ascending order of the number of occurrences of the word A in the texts. The input is as follows: an integer M(between 1 and 100, inclusive), followed by the word A in the next line, and some text in each of the M next lines.

Note: The texts and the word A contain only lowercase Latin letters (a,b,c…,z) and blank spaces (“ ”). The maximum size of the texts and the word A is 100 Characters. Every text has a different number of occurrences of the word A.

Note 2:you must print one text per line without modifying the texts.

Example 1

• Input: 2
  Java
  I hate java
  Python is a good programming language
• Output: Python is a good programming language
  I hate java

Example 2

• Input:  3
  python
  I like to code in python
  python is named after a show name monty python and not after the snake python
  I think python is good i think python is important than php
• Output: i like to code in python
  i think python is good i think python is important than php
  python is named after a show name monty python and not after the snake python

C++ PROGRAM 

#include<bits/stdc++.h>

using namespace std;

string s;

map<string,int> m2;

bool cmp(pair<string, int>& a,

pair<string, int>& b)

{

return a.second < b.second;

}

void sort(map<string, int>& M)

{

vector<pair<string, int> > A;

for (auto& it : M) {

A.push_back(it);

}

sort(A.begin(), A.end(), cmp);

for (auto& it : A) {

for(int i=0;i<m2[it.first];i++)

cout << it.first <<endl; } } int count(string s1) { istringstream ss(s1); int c=0; while(ss) { string w; ss>>w;

if(w==s) c++;

}

return c;

}

int main()

{

int n;getline(cin,s);n=stoi(s);

getline(cin,s);

transform(s.begin(),s.end(),s.begin(),::tolower);

vector<string> v(n);

vector<int> a(n);

map<string,int> m;

for(int i=0;i<n;i++)

{

getline(cin,v[i]);

transform(v[i].begin(),v[i].end(),v[i].begin(),::tolower);

m2[v[i]]++;

m[v[i]]=count(v[i]);

}

sort(m);

}

JAVA PROGRAM 

import java.util.*;

public class Main

{

static int countOccurences(String str, String word)

{

String a[] = str.split(” “);

int count = 0;

for (int i = 0; i < a.length; i++)

{

if (word.equals(a[i]))

count++;

}

return count;

}

public static void main(String[] args)

{

Scanner sc=new Scanner(System.in);

int n=sc.nextInt();

sc.nextLine();

String word=sc.next();

//System.out.println(word);

sc.nextLine();

String arr[]=new String[n];

for(int i=0;i<n;i++)

{

arr[i]=sc.nextLine();

//System.out.println(arr[i]);

}

TreeMap<Integer,String> map=new TreeMap<Integer,String>();

for(int i=0;i<n;i++)

{

map.put(countOccurences(arr[i],word),arr[i]);

}

Set s=map.entrySet();

Iterator itr=s.iterator();

while(itr.hasNext())

{

Map.Entry m=(Map.Entry)itr.next();

System.out.println(m.getValue());

}

}

}

PYTHON PROGRAM 

from collections import defaultdict

d=defaultdict(int)

d1=defaultdict(int)

n=int(input())

s=input()

s=s.lower()

l=[]

for i in range(n):

L=list(map(str,input().split()))

s1=’ ‘.join(i for i in L)

c=0

for j in L:

if s==j:

c+=1

l.append(s1)

d[i]=c

d1[i]+=1

c=0

d=sorted(d.items(),key=lambda a:a[1])

for i in d:

for j in range(d1[i[0]]):

print(l[i[0]])

Q) Write a program that will print the sum of diagonal elements of a 10X10 matrix. The program will take a total of 100 numbers as input (10 numbers will be input per line and each number will be separated by a space).

Example 1

• Input:    1  2 3 4 5 6 7 8 9 0
  0 1 2 3 4 5 6 7 8 0
  3 4 5 6 7 8 9 6 4 0
  2 3 4 5 6 7 8 9 3 2
  3 4 5 6 7 4 3 2 1 3
  3 4 5 6 2 4 4 2 4 6
  2 3 4 6 2 4 6 2 3 5
  2 3 5 6 2 4 6 2 3 5
  2 4 6 2 1 4 3 3 5 2
  3 3 5 2 4 6 2 1 4 6
• Output:  42

Example 2

• Input:   1 22 33 44 55 66 77 88 99 100
  100 1 88 77 66 55 44 33 22 11
  88 88 1 66 55 44 33 22 11 100
  88 77 66 1 44 33 22 11 100 99
  77 66 55 44  1 22  11 88 99 100
  66 55 44 33 22 1 77 88 99 100
  44 33 22 11 100 99 1 77 66 55
  33 22 11 100 99 88 77 1 55 44
  22 11 100 99 88 77 66 55 1 33
  100 11 22 33 44 55 99 88 77 1
• Output: 10

C++ PROGRAM

#include<bits/stdc++.h>

using namespace std;

int main()

{

vector<vector<int>> v(10,vector<int>(10));

for(int i=0;i<10;i++)

for(int j=0;j<10;j++) cin>>v[i][j];

int sum=0;

for(int i=0;i<10;i++)

sum+=v[i][i];

cout<<sum;

}

JAVA PROGRAM

import java.util.*;

public class Main

{

public static boolean isVowel(char ch)

{

return ch==’a’ || ch==’e’ || ch==’o’ || ch==’i’ || ch==’u’ || ch==’A’ || ch==’E’ || ch==’I’ || ch==’O’ || ch==’U’;

}

public static void main(String[] args)

{

Scanner sc=new Scanner(System.in);

String str=sc.next();

char arr[]=str.toCharArray();

String res=””;

if(!isVowel(arr[0]))

res+=arr[0];

for(int i=1;i<arr.length;i++)

{

if(isVowel(arr[i])&&isVowel(arr[i-1]))

res+=arr[i-1]+””+arr[i];

if(!isVowel(arr[i]))

res+=arr[i];

}

System.out.println(res);

}

PYTHON PROGRAM

l=[‘a’,’e’,’i’,’o’,’u’,’A’,’E’,’I’,’O’,’U’]

s=input()

s+=” ”

s1=””

if len(s)==0:

print(“”)

elif len(s)==1:

if s[0] not in l:

print(s)

else:

if s[0] in l and s[1] in l:

s1+=s[0]

elif s[0] not in l :

s1+=s[0]

for i in range(1,len(s)-1):

if s[i-1] not in l and s[i] in l and s[i+1] not in l:

continue

s1+=s[i]

print(s1)

Follow regularly our Dailyrecruitment.in site to get upcoming all up-to-date information.