1 831
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
Ques of DXC-
1.Tell me about yourself.
2. Why you want to join DXC?
3. What technical knowledge you have ?
Ques from python
4.What is python
5.PEP word,List and tuple
6. Write the syntax of List and tuple
Ques from C
7. Pointer to Pointer
8.syntax of for loop and ques regarding body and expression in for loop
9. Write program to add 2 number
10. Structure inside structure
11. Syntax of Structure inside structure
12. How to store negative integer value
13.Token?
14.Do you have any questions from me?
Tcs NQT syllabus
Important topics
▶️English
Prepositions
Articles
Subject-Verb Agreement
Vocabulary
Tenses
Pronoun Agreement
Modifiers
Comparison
▶️Quant
Permutation and Combination
Number System
Probability
Time Speed and Distance
Equations
Geometry, Mensuration and Progressions
Ratios and Proportions
Functions, Logarithms and Graphs
Clocks, Direction Sense
Profit and Loss, Averages, Mixtures and Alligations
Puzzles
Physics
Base Conversion
▶️C MCQ
Operators
Looping statements
Control statements
Arrays
Strings
Functions
Object Oriented Programming (OOPS)
Standard Template Libraries (STL)
Object Modeling
Compiler Design
Threading
Data Structures: Linked List, Stack, Queue, Trees and Graphs
Recursion
▶️coding section consisted of one question, which is to be solved in 30 minutes. Candidates will use an inbuilt compiler to solve their questions in C/C++/Java/Perl/Python programming language. There is no limit to the number of times you can compile the code.
◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️
Join us for more TCS NQT Study Material
👇👇
@placementupdatess
◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️
Tech Mahindra Interview questions
1) show your I'd proff?
2) self intro?
3) which language your are comfortable ?
4) what is structure?
5) what is calloc and mallic?
6)static memory allocation?
7)Dynamic memory allocation?
8)What is null pointer?
Write the program
9)Fibonacci serious and explain?
10)speak non technical topic in 5 mins ?
11) project details?
12) do u have any questions?
Telegram:-@placementupdatess
TCS IRA APRIL 25th
TCS IRA PYTHON
1. Numerical regression
2.2003
3.neural networks
4.2017
5.machine learning
6. Go stright away into the rework
7.A
8.ALL THE ABOVE
9.C
10.reason for the meeting
11.B
12.A
13.ALL
14.D
15.B
16.Salad
17.c
18.false
19. B
20.B
21.D
22.C
23.A
24.apple
25.martime museum
26.>2000
27.C
28.B
29.B
30.A
31.
32.1
33.D
34.A
35.1
36.PRESERVE WATER RESERVE
37.ERROR
38.false
39.15
40. A or C
41.A
42. For sale
43.C
44.20
45.syntax error
46.D
47.Sweden D
48.northern lights can on scotland
49.0
50.D
TCS IRA PYTHON
Telegram:-@placementupdatess
IRA java:
1)all the above
2) option 1 and 2
3)Immediate line
35) option A
36)arrayind...
37)false
38) option B
39)it will sort ......(option D)
40)there is no issue with thecode.
41) option C
46)0
telegram:-@placementupdatess
IRA Python:
1) classification
2)2003
3) machine learning
4)2018
5)Machine learning
6)Apologize to the client for not meeting his expectation
11)Display the number of characters
36)1 3 5
37)false
38)New employee id name
50)false false
Telegram:-@placementupdatess
int ans = 0;
for(int i = 0; i < N; ){
int num = A.get(i);
int j;
for(j = 0; j < N; j++){
if(i == j)
continue;
if(num % A.get(j) == 0)
break;
}
if(j == N)
ans++;
i++;
}
return ans;
Java
ANOTHER DIVISOR PROBLEM Code
Telegram - @placementupdatess
class Solution:
def countSubstrings(self, s: str) -> int:
n = len(s)
c=0
for i in range(0,n-1): #i=0
print('i:',i)
for j in range(i+1,n+1): #j=1
print('j',j)
temp = s[i:j]
if len(temp) == 1:
c+=1
# if the len of substring is even,
# check if the reverse of the string is same as the string
elif(len(temp)%2 == 0):
if (temp == temp[::-1]):
c+=1
print("c",c)
else:
# create a dict to check how many times
# each value has occurred
d = {}
for l in range(len(temp)):
if temp[l] in d:
d[temp[l]] = d[temp[l]]+1
else:
d[temp[l]] = 1
print(d)
return c
op = Solution()
op.countSubstrings('aabb')
Python
Wedding code
x=[]
for i in range(N):
x.append(1)
a=1 examcell
while(a<N):
for i in range(a,N,a+1):
x[i]=x[i]+1
a=a+1
print(x.count(K))
Python
Performing strange task codde
@placementupdatess
Flip Or Swap
def flip( ch):
return '1' if (ch == '0') else '0'
# Utility method to get minimum flips when
# alternate string starts with expected char
def getFlipWithStartingCharcter(str, expected):
flipCount = 0
for i in range(len( str)):
# if current character is not expected,
# increase flip count
if (str[i] != expected):
flipCount += 1
# flip expected character each time
expected = flip(expected)
return flipCount
# method return minimum flip to make binary
# string alternate
def minFlipToMakeStringAlternate(str):
# return minimum of following two
# 1) flips when alternate string starts with 0
# 2) flips when alternate string starts with 1
return min(getFlipWithStartingCharcter(str, '0'),
getFlipWithStartingCharcter(str, '1'))
# Driver code to test above method
if name == "main":
str = "0001010111"
print(minFlipToMakeStringAlternate)
Python flip or …
#include <iostream>
using namespace std;
class gas {
public:
int gas;
int distance;
};
int findStartIndex(gas stationQueue[], int n) {
int start_point = 0;
int end_point = 1;
int curr_gas = stationQueue [start_point].gas - stationQueue [start_point].distance;
while (end_point != start_point || curr_gas < 0) {
while (curr_gas < 0 && start_point != end_point) {
curr_gas -= stationQueue[start_point].gas - stationQueue [start_point].distance;
start_point = (start_point + 1) % n;
if (start_point == 0)
return -1;
}
curr_gas += stationQueue[end_point].gas - stationQueue [end_point].distance;
end_point = (end_point + 1) % n;
}
return start_point;
}
int main() {
gas gasArray[] = {{4, 6}, {6, 5}, {7, 3}, {4, 5}};
int n = sizeof(gasArray)/sizeof(gasArray [0]);
int start = findStartIndex(gasArray, n);
if(start == -1)
cout<<"No solution";
else
cout<<"Index of first gas station : "<<start;
}
C++
GAS STATION Code
// Java program to find the XOR of
// all elements in the array
class GFG {
// Function to find the XOR of
// all elements in the array
static int xorOfArray(int arr[], int n)
{
// Resultant variable
int xor_arr = 0;
// Iterating through every element in
// the array
for (int i = 0; i < n; i++) {
// Find XOR with the result
xor_arr = xor_arr ^ arr[i];
}
// Return the XOR
return xor_arr;
}
// Driver Code
public static void main (String[] args)
{
int arr[] = { 3, 9, 12, 13, 15 };
int n = arr.length;
// Function call
System.out.println(xorOfArray(arr, n));
}
}
Java
Prefix XOR
#include <iostream>
using namespace std;
#define ll long long
ll qdSum(ll n){
if (n==0){
return 0;
}
return ((n%10)*(n%10)*(n%10)*(n%10)) + qdSum(n/10);
}
ll getProduct(ll n){
// Base Case
if(n == 0){
return 1 ;
}
// get the last digit and multiply it with remaining digits
return (n%10) * getProduct(n/10) ;
}
ll gcd(ll a, ll b)
{
return b == 0 ? a : gcd(b, a % b);
}
bool isSpecial(ll N){
if(gcd(qdSum(N),getProduct(N)) > 1){
return 1;
}
return 0;
}
int main() {
int T;
cin>>T;
while(T--){
ll N;
cin>>N;
int count=0;
while(N != 1){
if(isSpecial(N)){
count++;
}
N--;
}
cout<<count<<endl;
}
}
C++
Primo numbers in the Array
Infosys 24th April slot time
