Johnson Controls General Manager Interview Questions and Answers

A sorting algorithm is a method of arranging elements in a specific order.

• Sorting algorithms can be categorized as comparison-based or non-comparison-based.

• Common sorting algorithms include bubble sort, insertion sort, selection sort, merge sort, quicksort, and heapsort.

• Efficiency of sorting algorithms is measured by their time complexity, space complexity, and stability.

• Example: Sorting an array of strings in alphabet

Implement stack data structure

• Use an array or linked list to store elements

• Push operation adds element to top of stack

• Pop operation removes element from top of stack

• Peek operation returns top element without removing it

Global variables are accessible from any part of the program and can be modified by any function.

• Global variables are declared outside of any function.

• They can be accessed and modified by any function in the program.

• If a function modifies the value of a global variable, the new value is visible to all other functions.

• Global variables can be useful for sharing data between functions.

• However, overuse of global variables

Program to transpose a matrix

• Iterate through rows and columns of the matrix

• Swap the elements at (i,j) and (j,i) positions

• Return the transposed matrix

Pre and post fix operators are used to increment or decrement a value before or after it is used in an expression.

• Pre-fix operator (++x) increments the value of x and returns the new value.

• Post-fix operator (x++) returns the value of x and then increments it.

• Both operators can be used with variables of numeric data types.

• They can also be used with pointers to increment or decrement the memory address they point to.