World Wide Technology Buyer Interview Questions and Answers

Q1. What is SIngularity in BIW
Ans. 
Singularity in BIW refers to a point where multiple body panels meet in a vehicle's body structure.
• Singularity is a critical point in BIW design where multiple panels converge.

• It is important to ensure proper fit and alignment at singularity points to maintain structural integrity.

• Examples of singularity points include door openings, roof joints, and hood connections.
Answered by AI
Add your answer
Q2. Time taken for Spot welding by robot
Ans. 
The time taken for spot welding by a robot depends on various factors such as material thickness, type of material, welding parameters, and robot speed.
• Time taken for spot welding can vary based on the material thickness. Thicker materials may require longer welding times.

• The type of material being welded can also impact the time taken. Different materials have different conductivity and heat transfer properties.

• Weldin...read more
Answered by AI
Add your answer

Quant, Technical and Logical Reasoning

Q1. What is owasp top 10?
Ans. 
OWASP Top 10 is a list of the most critical web application security risks.
• It is updated every 3-4 years by the Open Web Application Security Project (OWASP)

• The list includes vulnerabilities such as injection, broken authentication and session management, cross-site scripting (XSS), and more

• It is used as a guide for developers and security professionals to prioritize their security efforts

• The latest version is OWASP To
Answered by AI
Add your answer
Q2. Audit Fundamentals? Risk, threat, impact etc.
Add your answer

Scenario based case study, to identify risk based observations

Q1. Knowing RBI Circulars on cybersecurity
Add your answer

Q1. Why you want to join ReBIT?
Add your answer

Q1. About position said for
Add your answer

Q1. Tell me about yourself
Add your answer

Q1. What is a pointer to pointer
Ans. 
A pointer to pointer is a variable that stores the memory address of another pointer variable.
• It is used to create dynamic data structures like linked lists and trees.

• It allows multiple levels of indirection.

• It is denoted by ** in C and C++.

• Example: int **ptr;

• Example: ptr = &p; where p is a pointer variable.
Answered by AI
Add your answer
Q2. Class, object, inheritance, polymorphism,dbms
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
The task is to determine if a given singly linked list forms a cycle or not.
• A cycle occurs when a node's next points back to a previous node in the list.

• To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.

• The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.

• If there is a cycle, the fast pointer will eventually catch up to the slow pointer.

• If the fast pointer ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Minimum Depth of a Binary Tree
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...read more
Ans. 
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
• The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree

• During the BFS traversal, keep track of the current level and increment the depth by 1 for each level

• Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
Answered by AI
Add your answer
Q2. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem is to find the intersection of two sorted arrays.
• Use two pointers to iterate through the arrays.

• Compare the elements at the current pointers and move the pointers accordingly.

• If the elements are equal, add it to the intersection array and move both pointers.

• If the element in the first array is smaller, move the first pointer.

• If the element in the second array is smaller, move the second pointer.

• Repeat until...read more
Answered by AI
Add your answer
Q3. What is the difference between a mutex and a semaphore?
Ans. 
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
• Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.

• Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.

• Mutex has ownership, meaning the thread that locks it must unlock it.

• Semaphore does not hav...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 25 minutes
Round difficulty - Easy

Q1. Technical interview on python, terraform and networking protocols
Add your answer

Technical interview on different types of routing paths

Q1. Manger round about general job discussion on skills and my previous experiences
Add your answer

Q1. Interview on CTC and personality checkup
Add your answer