Vinculum Solutions Manual Testing Interview Questions and Answers for Freshers

Duration:30 min
Question from percentage,ratios ,HCF/LCM etc.,
Logical reasoning, English

Q1. Reverse a string by making groups of given 'm' characters
Ans. 
Reverse a string by grouping 'm' characters together
• Iterate through the string in groups of 'm' characters

• Reverse each group of 'm' characters

• Concatenate the reversed groups to get the final reversed string
Answered by AI
View 1 more answer

Q1. General HR questions
Add your answer
Q2. What is your family background?
Add your answer
Q3. Why should we hire you?
Add your answer

Q1. Tell me something about Data Sturcture
Ans. 
Data structure is a way of organizing and storing data in a computer so that it can be accessed and used efficiently.
• Data structures can be linear (arrays, linked lists) or non-linear (trees, graphs)

• Common operations on data structures include insertion, deletion, and searching

• Examples of data structures include stacks, queues, hash tables, and binary trees
Answered by AI
Add your answer

Includes basic aptitude question with additional questions based on coding languages fundamentals.....

Q1. Question were based on oops concepts. My next question was write a code of binary search and explain it and lastly I was asked an aptitude question ...
Add your answer
Q2. Write a code of binary search and explain it
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Divide the array into two halves

• Compare the target value with the middle element

• If the target value matches the middle element, return its position

• If the target value is less than the middle element, search the left half of the array

• If the target value is greater than the middle element, search the right half of the arra...read more
Answered by AI
Add your answer

General aptitude and reasoning

General coding questions

Q1. 2 medium coding questions, oops concepts and CS fundamentals
Add your answer

Q1. Linux basics, coding questions
Add your answer

Most rounds were regarding English proficiency and 1 round regarding logical reasoning

Q1. What is your family background?
Add your answer
Q2. Why should we hire you?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer
Q4. Tell me about yourself.
Add your answer

Programming on basics of C

Programming on basics of C

Q1. Salary details and location preference
Add your answer

Round duration - 70 Minutes
Round difficulty - Hard

Q1. DBMS Questions
difference between delete and truncate.
How to create and update a table.
Add your answer
Q2. Candies
Prateek is a kindergarten teacher. He wants to give some candies to the children in his class. All the children stand in a line and each of them has a grade according to his or her performance in ...read more
Ans. Brute Force
There can be four cases :
 
CASE 1: STUDENTS[i - 1]  > STUDENTS[i]  < STUDENTS[i + 1]
CASE 2: STUDENTS[i - 1]  < STUDENTS[i]  < STUDENTS[i + 1]
CASE 3: STUDENTS[i - 1]  > STUDENTS[i]  > STUDENTS[i + 1]
CASE 4: STUDENTS[i - 1]  < STUDENTS[i]  > STUDENTS[i + 1]
 
1. For case 1, the ‘i’th child will get one candy.
2. For case 2, the ‘i’th child will ge...read more
Answered by CodingNinjas
View 1 more answer
Q3. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered by CodingNinjas
View 1 more answer