Interview questions

Software Developer interview questions – page 13

945 questions. Tap “Show answer” to check yourself.

  1. project details in your resume?

  2. Given a 7mt long gold bar , need to cut and give to worker for 7 days (1 meter long) How many min cuts?

  3. Write algo to mirror a given Binary Tree?

  4. Two cops and a robber are located on opposite corners of a cube and move along its edges. They all move at the same rate. Is it possible for the cops to catch the robber. [Each of the 3 people can see each other at all times and can react instantaneously to each others movements. Stopping is allowed.]

  5. In some tournament 139 teams have participated. Tournament is knock out. what is the number of matches to choose the champion to be held?

  6. What is Recursion Function?

  7. find maximum length BST in a given binary tree?

  8. Write an algorithm to find the absolute max subsequence of an array containing both positive and negative numbers in O(n) time ?

  9. Given an array eliminate the duplicates and print it. Linear time complexity?

  10. What are class access modifiers?

  11. What is the purpose of Normalisation?

  12. What is the difference between Truncate and Delete?

  13. What is the difference between DBMS and RDBMs?

  14. What is the difference between DML and DLL?

  15. What is the difference between primary key and unique key?

  16. What is a stack?

  17. What is library functions?

  18. What is the difference between default and copy constructor?

  19. What are access specifiers?

  20. C++ Virtual Functions

  21. ANN(Artificial Neural Networks)

  22. GP(Genetic Programming)

  23. differences between them and how it is better than linear regression

  24. What is SVM (Support Vector Machines

  25. Whole database design of one of my project. Asked some SQL queries also

  26. You are given a triangle with height h and base length b and a square of side length a. How many squares can you fit in triangle? Need to derive formula

  27. Given n dice, each of 'a' sides and a sum b, return the number of ways in which the sum b can be obtained. How can you reduce the time complexity and space complexity?

  28. Given 2 machines, each having 64 GB RAM, containing all integers (8 byte), sort the entire 128 GB data. You may assume a small amount of additional RAM. Extend this to sort data stored in 1000 machines

  29. Given 2 strings like bangalore and blr, return whether one appears as a subsequence of the other. The above case returns true whereas bangalore and brl returns false

  30. Given n pens and n tops, each pen (and each top) having a size different than the other and each pen fitting exactly one top, find the largest pen using minimum number of comparisons. A comparison involves picking a pen and a top and trying to fit them, and would result in a. proper fit b. pen is larger c. top is larger

Companies that ask Software Developer questions