NatWest Group Senior Associate Software Engineer Interview Questions and Answers

3 coding que easy,med and hard

Q1. Os related que What is kernel , OS types ,what happens after booting computr ,etc
Add your answer
Q2. Creat a array and print all elements , which database used for pdf storing sql or nosql
Add your answer

Q1. OOps related que abstraction , inheritance , code it
Add your answer
Q2. Middel element of linked list
Add your answer

Q1. What challenges u faced in engineering?
Add your answer
Q2. Situational based questions
Add your answer

Q1. Why u choose to work deustch bank ?
Add your answer
Q2. Project related quw
Add your answer

Mcq+coding which are medium level questions

Q1. Multiple inheritance allowed in java?
Ans. 
No, multiple inheritance is not allowed in Java.
• Java does not support multiple inheritance for classes to avoid the diamond problem.

• However, multiple inheritance is allowed for interfaces in Java.

• Example: class A extends B, C is not allowed, but interface X extends Y, Z is allowed.
Answered by AI
Add your answer
Q2. Diff btw static and final
Ans. 
Static is used to define class-level variables and methods, while final is used to define constants and prevent inheritance or modification.
• Static variables and methods belong to the class itself, while final variables cannot be changed once initialized.

• Static members can be accessed without creating an instance of the class, while final members must be accessed through an instance.

• Static variables are shared among all...read more
Answered by AI
Add your answer
Q3. What is data encapsulation?
Ans. 
Data encapsulation is the concept of bundling data and methods that operate on the data into a single unit, known as a class.
• Encapsulation hides the internal state of an object and only exposes the necessary functionalities through methods.

• It helps in achieving data abstraction and information hiding.

• Example: A class 'Car' encapsulates data like speed, color, and methods like accelerate() and brake().
Answered by AI
Add your answer

Q1. Tell me about yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java, Python, and web development technologies

• Strong problem-solving skills

• Team player with excellent communication skills
Answered by AI
Add your answer
Q2. What are company core values
Ans. 
Company core values are the fundamental beliefs that guide the behavior and decisions of employees.
• Integrity - acting with honesty and transparency in all dealings

• Innovation - constantly seeking new and better ways to solve problems

• Customer focus - prioritizing the needs and satisfaction of customers

• Teamwork - collaborating effectively with colleagues to achieve common goals
Answered by AI
Add your answer

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. System design , HLD, LLD , coding question
Add your answer

Q1. Data structure algos
Add your answer
Q2. Find middle of linked list
Ans. 
To find the middle of a linked list, use the slow and fast pointer technique.
• Initialize two pointers, slow and fast, both pointing to the head of the linked list.

• Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.

• The position of the slow pointer will be the middle of the linked list.
Answered by AI
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