Vous êtes sur la page 1sur 1

S&P Capital Placement Preparation

Round 1: Basic Quantitative aptitude, Verbal ability, SQL Queries, OOPS


Round 2: Coding
Print the sum of all paths in a Binary tree.
Find n
th
node from the end of a linked list.
Given an integer array, return 1 if sum of any two numbers is zero.


Given a continuous stream of characters, find the first non-repeating character.
Count the number of set bits in a character.
Print a string representing a given number as words. For e.g. 123 = one hundred twenty-three.
Mirror image of binary tree.
Count leaf node in binary tree.
Remove duplicates from an array of integers.
Given a list of integers, find the k maximum integers.
Given two nodes P, Q on a tree, find the smallest sub-tree containing both of them.
Given a string, write a program to find the longest palindrome present in the given string.
Given two files, write a program to read strings from one file and store them in ascending order in the otherfile.You can take
any assumptions you want.
Write a program to find the depth of a BST.
Write a program to insert a number into BST.
Round 3: Group Discussion
Round 4: Technical Interview
Design "Undo" and "Redo" feature for a text editor.
Use two dice to create a random number generator (0-15).
What is a Race Condition?
Some questions related to Database schema design, ER diagrams, TCP/IP and Cache design.
How does google search engine work?
Pseudo code to get stock quotes of public companies using an API and a cache efficient way to store it to reduce server load per
calls.
Write down the Fibonacci algorithm.
What happens when you click on a link and get the web page? what's the process behind that?
Usage of a linked list. Differences with a vector. In which situations is it better to use a vector or a list and why.
Two arrays with integers. Find the values that are present in both of them. What is the time complexity? How to do you ensure
that there are no duplicates in the final output?
Solid knowledge of OO design principles (Constructors, destructors, inheritance, polymorphism, private, virtual, Singleton
classes).
For an array of integers, find the first sequence whose sum is equal to a given value. Output the starting and ending indexes of
the sequence.
Draw a schema of a shopping website and then:
-> Write queries to perform various operations on it.
-> Database indexes and retrieval of data from the database.
How does gmail store user information despite HTTP being a stateless protocol?
Some question on DNS.
Some question on Database serializability.
How are databases stored internally? Can you think of any improvements to the storage of databases?
What is indexing in databases and how does it help?
Differences between search engine index and database index?
What is paging in operating system?
Explain the difference in different types of paging in different situations. What are the constraints on the implementation?
How can you implement paging in databases?
What happens when you search for a value in a database?
What are the different types of cache available? Explain about L1, L2 and onchip, offchip caches and their access times and cost.
What is an RDBMS? What are the differences or relation between RDBMS and DBMS?
What are the different types of joins in a database? Explained every join (Natural,Inner, Outer, etc) with examples.

Vous aimerez peut-être aussi