Nomura Holdings
10+ Nuvoco Vistas Interview Questions and Answers
Q1. 2. What programming language are you good at?
I am proficient in Python and Java.
I have experience in developing web applications using Django framework in Python.
I have also worked on Java projects using Spring framework.
I am familiar with object-oriented programming concepts and data structures.
I have worked on projects involving database management using SQL.
I am constantly learning and improving my skills in these languages.
Q2. What do you know about hashing, hash table, hashing key?
Hashing is a technique to convert data of arbitrary size to a fixed size. Hash table is a data structure that uses hashing to store data.
Hashing is used to index and retrieve items in a database because it is faster than other methods.
Hash table is a data structure that uses a hash function to map keys to array indices.
Hashing key is the input to the hash function that produces a hash value.
Hashing is used in password storage, checksum generation, and data encryption.
Q3. What is SDLC? Explain all phases in detail
SDLC stands for Software Development Life Cycle. It is a process followed by software development teams to design, develop and test high-quality software.
The phases of SDLC are Planning, Analysis, Design, Development, Testing, Deployment, and Maintenance.
Planning involves defining the project scope, goals, and objectives.
Analysis involves gathering and analyzing requirements.
Design involves creating a detailed design of the software.
Development involves coding and building th...read more
Q4. What is inner join, outer join, left outer join?
Inner join, outer join, and left outer join are types of SQL joins used to combine data from multiple tables.
Inner join returns only the matching rows from both tables
Outer join returns all rows from both tables, with null values for non-matching rows
Left outer join returns all rows from the left table and matching rows from the right table
Example: Inner join - SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.id
Example: Outer join - SELECT * FROM table1 FULL OUTER...read more
Q5. Can you implement circular queues using stacks?
Yes, we can implement circular queues using two stacks.
We can use two stacks to implement a circular queue.
One stack will be used for enqueue operation and the other for dequeue operation.
When the enqueue stack is full, we can transfer all elements to the dequeue stack and vice versa.
This way, we can maintain the circular nature of the queue.
Example: https://www.geeksforgeeks.org/queue-using-stacks/
Q6. Can you implement queues using stacks?
Yes, we can implement queues using two stacks.
We can use two stacks, one for enqueue operation and another for dequeue operation.
To enqueue an element, push it onto the first stack.
To dequeue an element, pop all elements from the first stack and push them onto the second stack, then pop the top element from the second stack.
This ensures that the first element that was enqueued is the first one to be dequeued.
Time complexity for enqueue and dequeue operations is O(1).
Q7. What are derivatives? What are interest rate swaps ? What is forward contract? What is future contract? What are options? Three golden rules of accounting? What is nostro account?
Derivatives are financial contracts that derive their value from an underlying asset or security.
Interest rate swaps involve exchanging fixed and floating interest rate payments between two parties.
Forward contracts are agreements to buy or sell an asset at a predetermined price on a future date.
Futures contracts are similar to forward contracts but are traded on exchanges and have standardized terms.
Options give the holder the right, but not the obligation, to buy or sell an...read more
Q8. What do mean by stacks and queues?
Stacks and queues are data structures used to store and manipulate collections of elements.
Stacks follow the Last-In-First-Out (LIFO) principle, where the last element added is the first one to be removed.
Queues follow the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed.
Examples of stacks include the call stack in programming and the undo/redo feature in text editors.
Examples of queues include waiting in line at a store and pr...read more
Q9. Do you know any other sorting algorithm?
Yes, I know several sorting algorithms.
One of the most popular is QuickSort, which uses a pivot element to divide the array into smaller sub-arrays and recursively sorts them.
Another common algorithm is MergeSort, which divides the array into smaller sub-arrays and then merges them back together in sorted order.
InsertionSort is a simple algorithm that iterates through the array and inserts each element into its correct position in a sorted sub-array.
BubbleSort compares adjace...read more
Q10. Tell me something about heap sort
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.
It has a worst-case time complexity of O(n log n).
Q11. Rate yourself on scale of 10 in Java and database
I would rate myself 8 in Java and 7 in database.
I have extensive experience in Java programming and have worked on multiple projects using Java.
I am proficient in database management and have worked with various database systems like MySQL and Oracle.
I am constantly learning and improving my skills in both Java and database management.
I have also completed relevant courses and certifications in Java and database management.
I am confident in my ability to handle complex progra...read more
Q12. Solve Monty Hall problem using Bayesian probability
Solving Monty Hall problem using Bayesian probability
Assign prior probabilities to each door
Update probabilities based on host's action
Calculate posterior probabilities and choose the door with highest probability
Example: If prior probability of winning behind each door is 1/3, and host opens a door with a goat, the posterior probability of winning behind the remaining door is 2/3
Example: Bayes' theorem can be used to calculate the posterior probability
Q13. What is var? Explain types of var
Var is a measure of the potential loss on an investment due to market risk.
Var stands for Value at Risk
Types of var include historical var, parametric var, and Monte Carlo var
Var helps in assessing the potential risk of loss in an investment portfolio
Q14. Journal entries in Trading
Journal entries in trading are used to record financial transactions and events.
Journal entries are used to record transactions such as purchases, sales, and expenses.
They are used to keep track of the financial health of a company.
Examples of journal entries in trading include recording the purchase of inventory, recording the sale of goods, and recording expenses such as rent and utilities.
Journal entries are typically recorded in a general ledger.
They are important for fin...read more
Q15. Why Global markets why nomura
Nomura is a leading global financial services firm with expertise in global markets.
Nomura has a strong presence in global markets, offering a wide range of services such as investment banking, asset management, and research.
They have a global network of offices and clients, providing opportunities to work on diverse and challenging projects.
Nomura's reputation for innovation and excellence in global markets makes it an attractive choice for analysts seeking a dynamic and fas...read more
Q16. Gmail writing on paper
Writing Gmail on paper is not practical.
Writing emails on paper defeats the purpose of using email as a digital communication tool.
It is time-consuming and inefficient to write out emails by hand.
Gmail is designed to be used on a computer or mobile device, not on paper.
Top HR Questions asked in Nuvoco Vistas
Interview Process at Nuvoco Vistas
Top Analyst Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month