NatWest Group Senior Software Engineer 2 Interview Questions and Answers

Q1. Explain event driven architecture of node.js
Ans. 
Node.js uses event-driven architecture where events trigger callbacks to handle asynchronous operations.
• Node.js uses event loop to handle asynchronous operations efficiently

• Events are emitted by various objects in Node.js like HTTP servers, file system, etc.

• Callbacks are registered to handle events and execute code when events occur
Answered by AI
Add your answer

Q1. What is Overlaoding and overriding?
Ans. 
Overloading is having multiple methods in the same class with the same name but different parameters. Overriding is implementing a method in a subclass that is already defined in the superclass.
• Overloading allows multiple methods with the same name but different parameters in the same class.

• Overriding involves implementing a method in a subclass that is already defined in the superclass.

• Overloading is resolved at compi
Answered by AI
Add your answer
Q2. What are the Java features?
Ans. 
Java features include object-oriented programming, platform independence, automatic memory management, and multithreading.
• Object-oriented programming: Java supports classes and objects, allowing for modular and reusable code.

• Platform independence: Java programs can run on any platform with the Java Virtual Machine (JVM).

• Automatic memory management: Java uses garbage collection to automatically manage memory allocation ...read more
Answered by AI
Add your answer
Q3. What is abstrack class?
Ans. 
Abstract class is a class that cannot be instantiated and may contain abstract methods.
• Cannot be instantiated directly

• May contain abstract methods that must be implemented by subclasses

• Used to define a common interface for subclasses
Answered by AI
Add your answer

Q1. System design , HLD, LLD , coding question
Add your answer

Island Perimeter and Number of Provinces. Basic Leetcode question

Q1. Technical questions related to security
Add your answer

Simple algorithm question about sorting

Q1. Algorith question about quick sort
Add your answer
Q2. Nlonn run time of the sort
Ans. 
The time complexity of the quicksort algorithm is O(n log n).
• Quicksort has an average time complexity of O(n log n).

• The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.

• The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
Answered by AI
Add your answer

Q1. Sql, reporting tool, control m , unix, power bi
Add your answer
Q2. Sql, unix, testing tool
Add your answer

Q1. - DSA questions (leetcode easy) - Javascript concepts
Add your answer

Q1. With India Panel -LLD was asked
Add your answer

Q1. WIth UK Panel Design round 1 - Threading concepts - Async Programming - 1 Design Question
Add your answer

Q1. With Director Design round 2 - Questions on code quality - 1 design question - Behavioral questions
Add your answer