Deutsche Telekom Digital Labs Senior Test Engineer Interview Questions and Answers

It has aptitude and coding based questions.For coding you can choose any coding language

There will be a GD for 7-10 people on random topic

Q1. 1st TR,ask to write a code of your preference.Linux commands,SQL
Add your answer

Q1. 2nd TR ,ask about the projects you have done
Add your answer

Q1. Basic HR round,where they will discuss about the company , job role etc
Add your answer

Q1. Programming in C language
Ans. 
C language is a powerful and efficient programming language commonly used for system programming and embedded systems.
• C language is a procedural programming language

• It is widely used for developing operating systems, compilers, and embedded systems

• C is known for its efficiency and low-level access to memory

• Example: Declaring an array in C - int arr[5];
Answered by AI
Add your answer
Q2. DS basics Linked list
Add your answer

Q1. Basic questions of angular and javascript.
Add your answer
Q2. Es6 feature , typescript features
Add your answer
Q3. Promise, observable, focus on syntax of every thing like interceptor, routing, gaurd and all .
Add your answer

Q1. Behaviour subject, subject, life cycle hooks
Add your answer
Q2. This round was not very easy in my case.
Add your answer
Q3. Be prepared for array and object of array questions. Like sorting, searching, filtering , any logic .
Add your answer

Q1. Basic HR questions and managerial round. Not being hard . But learn about your project and past organisation
Add your answer

2 coding questions and 7 aptitude questions

Q1. Linked List creation was asked
Add your answer

General HR questions

Duration: 1hr
Topics: Array, LinkedList,Stack

Q1. Write code for Insertion in a binary tree.
Ans. 
Code for insertion in a binary tree
• Create a new node with the given data

• If the tree is empty, make the new node as root

• Else, traverse the tree to find the appropriate position to insert the new node

• If the data is less than the current node, go to the left subtree

• If the data is greater than the current node, go to the right subtree

• Repeat until an appropriate position is found

• Set the new node as the child of the appropri
Answered by AI
Add your answer
Q2. Write code for quick sort
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
• Choose a pivot element from the array

• Partition the array around the pivot element

• Recursively apply quick sort to the left and right sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer

Q1. Various DBMS related question(JOINS, SORT, LIMIT)
Add your answer

Q1. Tell us about yourself.
Add your answer
Q2. Why do want to join the company
Add your answer

Android basic + DSA and problem solving

Q1. Android in depth
Ans. 
Android is a mobile operating system developed by Google, based on the Linux kernel.
• Android is open-source and allows developers to create applications using Java or Kotlin.

• Android apps can be distributed through the Google Play Store or other third-party app stores.

• Android supports a wide range of devices, from smartphones and tablets to smart TVs and wearables.

• Android provides a rich set of APIs for accessing device ...read more
Answered by AI
Add your answer