TCS Elevate Wings 1 DCA Coding Questions With Solutions 2024 | TCS DCA Python Java MCQ Questions

TCS Elevate Wings 1 DCA Coding Questions With Solutions 2023 | TCS Wings 1 DCA Coding Questions & Answers | TCS Wings 1 DCA Python Coding Questions & Answers | TCS Wings 1 DCA Java Coding Questions & Answers 

TCS Elevate Wings 1 DCA Coding Questions With Solutions 2023: The coding test is medium complexity, meaning that while passing it is not impossible, it is also not very simple. If you practiced some of the code questions from the previous year’s examination, you would undoubtedly have an advantage in the upcoming TCS Digital coding exam. Let’s look at a few test patterns, TCS DCA Java MCQ Questions and Answers/ TCS Wings 1 DCA Python MCQ Questions in Python, C, C++, Java, and Python code problems and their fixes. In the below section, you can find the TCS Elevate Wings 1 Exam Questions and Answers/TCS Wings 1 DCA Coding Questions & Answers 2023

Previous recruiting campaigns’ coding examinations placed a strong focus on arrays and other fundamental programming principles. One can easily pass the first round and even the ones after that if they prepare adequately. You must select a language that you are comfortable with, such as C, C++, Java, or even Python, in order to complete the coding tasks. More details like TCS DCA Coding Questions and Answers, TCS Elevate Wings 1 DCA Coding Questions & Answers, TCS Elevate Wings 1 DCA Java Coding Questions & Answers, TCS Elevate Wings 1 DCA Python Coding Questions & Answers, etc. available on its website

TCS Elevate Wings 1 Exam Questions and Answers/TCS Wings 1 DCA Coding Questions & Answers 2023

Question: Parallel Columbus

Problem Statement: Nobel Prize-winning Austrian-Irish physicist Erwin Schrödinger developed a machine and brought as many Christopher Columbus from as many parallel universes he could. Actually he was quite amused by the fact that Columbus tried to find India and got America. He planned to dig it further.

Though totally for research purposes, he made a grid of size n X m, and planted some people of America in a position (x,y) [in 1 based indexing of the grid], and then planted you with some of your friends in the (n,m) position of the grid. Now he gathered all the Columbus in 1,1 positions and started a race.

Given the values for n, m, x, y, you have to tell how many different Columbus(s) together will explore you as India for the first time.

Remember, the Columbus who will reach to the people of America, will be thinking that as India and hence wont come further.

Function Description:

Complete the markgame function in the editor below. It has the following parameter(s):

Parameters:

Name Type Description
n Integer The number of rows in the grid.
m Integer The number of columns in the grid.
x Integer The American cell’s Row.
y Integer The American cell’s Column.

Constraints:

  • 1 <= n <= 10^2
  • 1 <= m <= 10^2
  • 1 <= x <= n
  • 1 <= y <= m

Input Format:

  • The first line contains an integer, n, denoting the number of rows in the grid.
  • The next line contains an integer m, denoting the number of columns in the grid.
  • The next line contains an integer, x, denoting the American cell’s row.
  • The next line contains an integer, y, denoting the American cell’s column.

Sample Cases

Sample Input 1

2

2

2

1

Sample Output 1

1

Explanation

The only way possible is (1,1) ->(2,1) -> (2,2), so the answer is 1.

C++ PROGRAM

#include <bits/stdc++.h>

using namespace std;

unordered_map<int,long long int> f;

 

long long int Fact(int n)

{

if(f[n]) return f[n];

return f[n]=n*Fact(n-1);

}

 

int main()

{

int n,m,x,y;

cin>>n>>m>>x>>y;

n-=1;m-=1;x-=1;y-=1;

f[0]=f[1]=1;

int p=(Fact(m+n)/(Fact(m)*Fact(n)));

int imp=((Fact(x+y)/(Fact(x)*Fact(y)))*(Fact(m-x+n-y)/(Fact(m-x)*Fact(n-y))));

cout<<p-imp;

}

PYTHON PROGRAM

import math

n=int(input())-1

m=int(input())-1

x=int(input())-1

y=int(input())-1

 

ans=math.factorial(n+m)

ans=ans//(math.factorial(n))

ans=ans//(math.factorial(m))

 

ans1=math.factorial(x+y)

ans1=ans1//(math.factorial(x))

ans1=ans1//(math.factorial(y))

 

x1=n-x

y1=m-y

 

ans2=math.factorial(x1+y1)

ans2=ans2//(math.factorial(x1))

ans2=ans2//(math.factorial(y1))

print(ans-(ans1*ans2))

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))

TCS Elevate Wings 1 Java Coding Questions/ TCS Wings 1 DCA Python Coding Questions

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)

Q) Write a program that will take one string as input. The program will then remove vowels a, e, i, o, and u (in lower or upper case ) from the string. If there are two or more vowels that occur together then the program shall ignore all of those vowels.

Example 1

  • Input:  Cat
  • Output:  Ct

Example 2

  • Input:  Compuuter
  • Output: Cmpuutr

C++  PROGRAM

#include<bits/stdc++.h>

using namespace std;int main()

{

string s;

int c=0;

getline(cin,s);

for (auto i:s)

{

if(i=='(‘) c++;

if(i==’)’) c–;

}

cout<<(c==0);

}

PYTHON PROGRAM

s=input()

c=0

for i in s:

if i =='(‘:

c+=1

elif (i==’)’) and c>0 :

c-=1

print(int(c>0))

JOB ALERT ON INSTAGRAM FOLLOW NOW>>
JOB ALERT ON YOUR EMAIL DAILY SUBSCRIBE NOW>>

Keep an eye on Dailyrecruitment.in for the most up-to-date information about upcoming exams and results. Find out about official notices, Exam Patterns, Syllabus, Previous Question Papers, Expected Cut Off, Results, Merit List, Study Materials, and much more. Now is the time to bookmark in order to take advantage of even more amazing career opportunities.

Govt Jobs by Qualifications

Education & Vacancies Salary Apply Link
10th Pass Govt Jobs - 5,000 Vacancies Rs. 5,200 - 63,200 Apply Now
12th Pass Govt Jobs - 18,000+ Vacancies Rs. 5,200 - 92,300 Apply Now
ITI Pass Jobs - 3,500 Vacancies Rs. 5,200 - 35,000 Apply Now
Any Graduate Jobs - 19,100 Vacancies Rs. 5,200 - 92,300 Apply Now
Central Govt Jobs Rs. 5,200 - 17,000 Apply Now
Bank Jobs - 1,000 Vacancies Rs. 5,200 - 29,200 Apply Now
Diploma Jobs - 9,300 Vacancies Rs. 5,200 - 35,000 Apply Now
BTech/BE Jobs - 18,000 Vacancies Rs. 15,000 - 1,00,000 Apply Now
Data Entry Jobs - 1,300 Vacancies Rs. 5,200 - 29,200 Apply Now
Private Jobs Rs. 10,000 - 67,700 Apply Now