Technosys Security Systems Interview Questions and Answers

In this round, we have questions from time relation, blood relation, programming questions. Around 45 questions in 30 minutes,

In this round, we have two programming questions. Both are hacker rank easy to medium level.

Q1. In this round, we have questions from the core java and a famous scooter tire question.
Add your answer

Duration 1 hour
Data structure and algorithms

Duration 1.5 hour
Data structure and algorithms

Q1. Given a value find next sibling on right side of it without using global/heap variables
Ans. 
Use a binary tree traversal algorithm to find the next sibling on the right side of a given value.
• Implement an in-order traversal algorithm to traverse the binary tree

• Keep track of the parent node and the direction of traversal to find the next sibling on the right side

• If the given value is the right child of its parent, move up the tree until finding a node that is the left child of its parent
Answered by AI
Add your answer

If you are a fresher , then this is for you else almost no coding test for experienced candidates.

Q1. Javascript basics, Angular react general questions depends upon profile.
Add your answer

Q1. They asked general questions related to some hectic situation faced in previous company / project..
Add your answer

Round duration - 60 mins
Round difficulty - Medium

Q1. 
Railway Seat Berth Determination
Given a railway seat number represented as an integer, determine if it is a valid seat number and identify its berth type. Possible berth types include lower berth, middle...read more
Ans. 
Given a railway seat number, determine if it is valid and identify its berth type.
• Parse input integer 't' for number of test cases

• For each test case, check if seat number is valid (1 <= N <= 100)

• Identify berth type based on seat number and output the result

• Possible berth types are Lower, Middle, Upper, Side Lower, and Side Upper
Answered by AI
Add your answer

Round duration - 90 mins
Round difficulty - Hard

First they asked me to introduce myself then they started questioning on oops concept from basic to advance level such as inheritance, polymorphism, abstraction, exception handling , STL etc. Next they started questioning on data structures. They asked me the logic of “how to find the middle of a linked list”.

Q1. 
Matrix Symmetry Check
You are provided with a square matrix. Your task is to return true if the matrix is symmetric; otherwise, return false.
A symmetric matrix is characterized by its transpose being eq...read more
Ans. 
Check if a square matrix is symmetric by comparing it with its transpose.
• Iterate through the matrix and compare each element with its corresponding element in the transpose

• If any pair of elements do not match, return false immediately

• If all pairs match, return true at the end
Answered by AI
Add your answer