National Australia Bank Software Developer Interview Questions and Answers

It was data structures and algorithm

Q1. What is friend function
Add your answer
Q2. Basic definitions of oops
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. Can you provide details about your project?
Add your answer

1)Buy and sell stock
2)2 sum
3) system design
4) Elastic search
5) deployment

Q1. Explain Encapsulation
Ans. 
Encapsulation is the concept of bundling data and methods that operate on the data into a single unit.
• Encapsulation helps in hiding the internal state of an object and only exposing necessary functionalities.

• It allows for better control over the data by preventing direct access from outside the class.

• Encapsulation also helps in achieving data abstraction and information hiding.

• Example: In a class representing a car, th...read more
Answered by AI
Add your answer
Q2. How to call rest API
Ans. 
To call a REST API, you can use tools like Postman or code in languages like JavaScript or Python.
• Use tools like Postman to make HTTP requests to the API endpoints

• In programming languages like JavaScript, use libraries like Axios or Fetch to make API calls

• Include necessary headers, parameters, and authentication tokens in the request

• Handle the response data accordingly, whether it's JSON, XML, or other formats
Answered by AI
Add your answer

Q1. Oops, basic ,SQL ,ado
Add your answer

Curd operation with SQL connectivity

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

Ms office,Core Java , Tally , C,

In my Opinion,view , If you ask me, As far as I can see/I am Concerned , It seems to me that , I think /feel/reckon/ belive , If you want my option , What we have to decide