• Tech apti(covering oops, data structures, dbms, java pseudo code, time
compexity )
• One coding question(with permutation I solved)
Total count of sorted
numbers upto N digits in range [L, R] (Magnificent necklace combinatorics problem)
Technical interview:
Time: 50 minutes
• First I was asked to introduce myself
• Asked about projects and internship I did and some questions related to
that
• As my area of interest was OOPs and rdbms ,he asked question related
to that
• Questions:
1. Explain oops basic pillars
2. Normalization in dbms
3. Acid properties
4. About foreign and primary key
5. Various type of joins
6. Difference between group by and order by
7. Difference between abstract class and interface
8. Where ‘having’ and ‘where’ clause will be used
9. Operator overloading
10.Which programming language are you comfortable with ?
• One coding question was given to solve
Count the number of palindromes in a given string
Input: my mom and dad are good to me
Output:2
(as the string contains 2 palindromes such as mom & dad)
• Any question to me
SHANKARI S— xxx@student.tce.edu —19C093