TEKsystems Associate Engineer Interview Questions and Answers

6 sections with section timings
Aptitude 10 questions
Reasoning 10 questions
Coding 1(30min)
Data structure 10
Pseudo Code 10
About Company 5

Topic 1-drone
Topic - self driving cars

Q1. Program to count spaces in string Program to print only digits in string
Ans. 
Program to count spaces and print digits in string
• For counting spaces, loop through the string and check for ' ' character

• For printing digits, loop through the string and check for '0' to '9' characters

• Use isdigit() function in Python to check for digits

• Use a counter variable to keep track of spaces

• Use a separate string variable to store digits and print it at the end
Answered by AI
Add your answer
Q2. Why string is immutable
Ans. 
String is immutable because it cannot be changed once created.
• Immutable objects are safer to use in multi-threaded environments

• String pool in Java is possible because of immutability

• StringBuffer and StringBuilder are mutable alternatives to String
Answered by AI
Add your answer
Q3. About Constructor Dictionary Access modifiers in python
Add your answer

Q1. Which is difficult program that you wrote in python Which is difficult program wrote in c Dictionary use with code implications
Ans. 
Difficult program in Python: A web scraper to extract data from dynamic websites. Difficult program in C: A program to implement a custom data structure.
• Python program required knowledge of web scraping libraries like BeautifulSoup and Selenium

• C program required understanding of memory management and pointers

• Python program had to handle dynamic website elements and login authentication

• C program had to implement a custo...read more
Answered by AI
Add your answer

Q1. Self intro About Company Hobbies Related to resume
Add your answer

Q1. Self intro Intrested field
Add your answer

Easy questions can be solved simply

Nothing much have to speak about topic

Q1. Basics dsa stuff have to write code
Ans. 
Understanding basic data structures and algorithms is crucial for coding interviews.
• Data Structures: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs.

• Algorithms: Sorting (e.g., Quick Sort, Merge Sort), Searching (e.g., Binary Search).

• Complexity Analysis: Big O notation to evaluate performance.

• Example: Use a stack to reverse a string efficiently.
Answered by AI
Add your answer
Q2. Basic oops questions which also can be answered easily
Add your answer

It was a online test on one of the platforms, with basic aptitude and reasoning.

Consisted of 3 coding questions

A topic was given and their views were asked one by one in a group, online through zoom

Q1. Technical questions on project, java, coding
Add your answer
Q2. Binary search code was asked to be written
Ans. 
Binary search is an efficient algorithm for finding an item from a sorted array by repeatedly dividing the search interval in half.
• Binary search works on sorted arrays only.

• It has a time complexity of O(log n), making it faster than linear search (O(n)).

• Example: To find '5' in [1, 2, 3, 4, 5, 6], check middle element (4), then search right half [5, 6].

• The algorithm can be implemented recursively or iteratively.
Answered by AI
Add your answer

Q1. This was kind of mixed with interest in domain, and normal HR questions by a Technical lead
Add your answer