Add office photos
Employer?
Claim Account for FREE

Krenai Services

4.3
based on 8 Reviews
Filter interviews by

MGHR Interview Questions and Answers

Updated 5 Feb 2024

Q1. wap to print pyramid star pattern.

Ans.

Print a pyramid star pattern using nested loops.

  • Use nested loops to print spaces and stars in each row

  • Increment the number of stars in each row to form a pyramid shape

Add your answer

Q2. What are procedures in sql.

Ans.

Procedures in SQL are reusable blocks of code that perform a specific task.

  • Procedures are stored in the database and can be called multiple times.

  • They can accept input parameters and return output parameters.

  • Procedures can contain SQL statements, control-of-flow statements, and error handling.

  • Example: CREATE PROCEDURE GetEmployeeDetails AS SELECT * FROM Employees;

  • Example: EXEC GetEmployeeDetails;

Add your answer

Q3. Difference between == and .equals.

Ans.

== is used for comparing reference equality, while .equals is used for comparing object equality in Java.

  • == compares memory addresses of objects

  • .equals compares the actual content of objects

  • == is used for comparing primitive data types

  • .equals is used for comparing objects in Java

Add your answer

Q4. What are sql joins.

Ans.

SQL joins are used to combine rows from two or more tables based on a related column between them.

  • Joins are used to retrieve data from multiple tables in a single query.

  • Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.

  • Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.id;

Add your answer
Discover MGHR interview dos and don'ts from real experiences

Q5. Explain selection sort.

Ans.

Selection sort is a simple sorting algorithm that repeatedly selects the minimum element from an unsorted portion of the array and swaps it with the first unsorted element.

  • Iterate through the array to find the smallest element.

  • Swap the smallest element with the first unsorted element.

  • Repeat the process for the remaining unsorted portion of the array.

  • Time complexity is O(n^2) and space complexity is O(1).

Add your answer

Q6. explain quick sort.

Ans.

Quick sort is a sorting algorithm that uses divide and conquer approach to sort an array efficiently.

  • Divide the array into two sub-arrays based on a pivot element

  • Recursively sort the sub-arrays

  • Combine the sorted sub-arrays to get the final sorted array

  • Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]

Add your answer
Contribute & help others!
Write a review
Share interview
Contribute salary
Add office photos
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Top Interview Questions from Similar Companies

4.0
 • 559 Interview Questions
4.1
 • 403 Interview Questions
3.8
 • 265 Interview Questions
4.0
 • 189 Interview Questions
3.9
 • 153 Interview Questions
View all
Top Krenai Services Interview Questions And Answers
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
70 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions
Get AmbitionBox app

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter