Escorts Kubota Limited Internship Trainee Interview Questions and Answers

Diesel engine works by compressing air in the cylinder and injecting fuel at the right time to ignite the mixture.

• Air is compressed in the cylinder by the piston

• Fuel is injected into the cylinder at the right time

• The heat generated by the compressed air ignites the fuel

• The expanding gases push the piston down, creating power

• Diesel engines are more efficient than gasoline engines

CC stands for carbon copy, a term used in email communication to indicate additional recipients of a message.

• CC is used to send a copy of an email to someone other than the primary recipient

• CC recipients are visible to all other recipients of the email

• CC is often used for informational purposes or to keep others in the loop

• CC can also be used to show transparency in communication

Compression ratio is the ratio of the volume of gas in a cylinder when the piston is at the bottom of its stroke to the volume of gas when the piston is at the top of its stroke.

• It is a measure of how much the engine compresses the air/fuel mixture before ignition.

• Higher compression ratios can lead to better fuel efficiency and more power.

• Compression ratio is calculated by dividing the volume of the cylinder at bottom

Swept volume is the volume of space swept by a piston in an engine cylinder during one stroke.

• It is the volume of the combustion chamber when the piston is at the bottom of its stroke subtracted from the volume of the combustion chamber when the piston is at the top of its stroke.

• It is used to calculate the engine displacement.

• For example, a four-cylinder engine with a 500cc swept volume has a total displacement of 2,0...read more

Reverse a linked list

• Iterative approach: Traverse the list and change the pointers to reverse the list

• Recursive approach: Recursively reverse the rest of the list and change the pointers

• Use a stack to push all the nodes and then pop them to create a reversed list

Stack is a data structure that follows Last In First Out (LIFO) principle.

• Stack can be implemented using arrays or linked lists.

• Push operation adds an element to the top of the stack.

• Pop operation removes the top element from the stack.

• Peek operation returns the top element without removing it.

• Stack overflow occurs when the stack is full and push operation is performed.

• Stack underflow occurs when the stack is empty and

Queues are a data structure that follows the FIFO principle.

• Queues can be implemented using arrays or linked lists.

• Enqueue adds an element to the end of the queue, while dequeue removes an element from the front.

• Peek returns the element at the front of the queue without removing it.

• Queues are used in scheduling, buffering, and breadth-first search algorithms.