Veritas Software Trainee Intern Interview Questions and Answers

Basic questions of fundamentals of cs

My topic was : Is cricket hampering the growth of other sports

Q1. Networking questions
Add your answer
Q2. Linux based os questions
Add your answer
Q3. Cloud computing questions
Add your answer

Q1. Program to find the largest and smallest integer in a program
Ans. 
Program to find the largest and smallest integer in a program
• Iterate through the array of integers to find the largest and smallest values

• Initialize variables to store the largest and smallest values, update them as needed

• Handle edge cases like empty array or array with only one element

• Return the largest and smallest values found
Answered by AI
Add your answer
Q2. Explain internal working of HashMap, what is abstract class
Ans. 
HashMap is a data structure that stores key-value pairs using hashing. An abstract class is a class that cannot be instantiated.
• HashMap uses hashing to store key-value pairs for efficient retrieval.

• Abstract classes cannot be instantiated and can have abstract methods that must be implemented by subclasses.

• Example: HashMap map = new HashMap<>();
Answered by AI
Add your answer

Q1. Which list you will prefer using if you want to create an application that needs constant modification, ArrayList or LinkedList
Ans. 
LinkedList is preferred for constant modification due to faster insertion and deletion times.
• LinkedList is preferred for constant modification because it has faster insertion and deletion times compared to ArrayList.

• LinkedList allows for easy insertion and deletion of elements without the need to shift other elements, making it more efficient for constant modifications.

• ArrayList is better for random access and iteratin...read more
Answered by AI
Add your answer

Karet Interview :
5 back to back System design question, we don't need to explain each component but more like list as many as points. Need to finish all the question in 15min

1-2 problem solving question : It's not fency algorithm round with tough question. But true problem solving round using basic knowledge such as hashmap, heap

Q1. Design File System : You have given file size and collection in input 1 : get total size 2 : find top k collections in size
Ans. 
Design a file system to calculate total size and find top k collections in size.
• Create a file system class with methods to add files and calculate total size.

• Maintain a data structure to store the collections and their sizes.

• Implement a method to find the top k collections based on size.

• Consider using a priority queue or sorting the collections based on size.

• Handle edge cases like empty collections or invalid input siz
Answered by AI
Add your answer
Q2. Find total size
Ans. 
Calculate the total size of an array of strings.
• Iterate through the array and sum the length of each string.

• Use the `length` property of each string to get its size.

• Handle edge cases such as empty strings or null values.
Answered by AI
Add your answer
Q3. Find Top k collections
Ans. 
The question is asking to find the top k collections.
• Use a sorting algorithm to sort the collections in descending order based on a specific criteria.

• Select the top k collections from the sorted list.

• Return the selected collections as an array of strings.
Answered by AI
Add your answer