Jana Small Finance Bank Salesforce Developer Interview Questions and Answers

Given Salesforec Scenario Based Question To Create a 3 input Box and Query the details & Show in Ui

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

Joins, Jobs, stored procedures,cursors.

Q1. What is my package
Add your answer

Topic wt is ms office

Eassys dscover the basic structure of all essaysand see what a goo d essay introduction and conclusion look like

Q1. Ppt presentations and techical skillsare the abilities and knowledge needed to performtastks
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