Filter interviews by
I applied via Referral and was interviewed before Sep 2020. There were 3 interview rounds.
Piling works involve the construction of deep foundations to support structures on unstable soil or rock.
Piling works are used to transfer the load of a structure to a deeper, more stable layer of soil or rock.
Different types of piles are used, such as driven piles, bored piles, and auger cast piles.
Piling works are commonly used in the construction of bridges, high-rise buildings, and waterfront structures.
Piles can b...
There are typically three types of polymer tests conducted before drilling pile.
Polymer viscosity test
Polymer filtration test
Polymer compatibility test
Viscosity is the measure of a fluid's resistance to flow. The viscosity of a polymer depends on its molecular weight and temperature.
Viscosity is a property of fluids that determines their flow behavior.
It is a measure of a fluid's resistance to flow.
Viscosity is influenced by factors like temperature and molecular weight.
Polymers can have different viscosities depending on their molecular weight and temperature.
Higher...
The number of pile load tests required depends on various factors such as project specifications, soil conditions, and design requirements.
The number of pile load tests is determined based on the project specifications and design requirements.
The soil conditions at the site play a crucial role in determining the number of pile load tests.
Different types of pile load tests, such as static load tests and dynamic load tes...
The depth of bore pile is decided based on soil investigation report and load-bearing capacity of soil.
Soil investigation report helps to determine the soil type and its load-bearing capacity.
The load-bearing capacity of soil is determined by conducting Standard Penetration Test (SPT) or Cone Penetration Test (CPT).
The depth of bore pile is decided based on the load-bearing capacity of soil and the design load of the s...
Top trending discussions
I am a software engineer with experience in developing web applications and mobile apps.
I have a degree in Computer Science
I have worked with Java, Python, and JavaScript
I have experience with front-end frameworks like React and Angular
I have developed mobile apps using React Native
I am familiar with Agile methodologies
I have a passion for software development and enjoy the challenges it presents.
I have always been interested in technology and programming
I have taken courses and completed projects in software development
I enjoy problem-solving and finding efficient solutions
I believe software engineering is a constantly evolving field with endless opportunities for growth
A program to check if a given number is prime or not.
A prime number is a number that is only divisible by 1 and itself.
Start checking from 2 up to the square root of the number.
If the number is divisible by any number in the range, it is not prime.
Otherwise, it is prime.
Optimization: check only odd numbers after 2.
Fibonacci program generates a series of numbers where each number is the sum of the two preceding ones.
The program can be implemented using recursion or iteration.
The first two numbers in the series are always 0 and 1.
The next number is the sum of the previous two numbers.
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418,...
Flowchart for two programs
Identify inputs and outputs
Determine program logic
Create decision points and loops
Connect program components
Include error handling
Test and debug
Document the flowchart
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 3 reviews
Rating in categories
Quality Engineer
4
salaries
| ₹3.3 L/yr - ₹4.3 L/yr |
Civil Site Engineer
3
salaries
| ₹3 L/yr - ₹5.1 L/yr |
TCS
Accenture
Cognizant
Infosys