Interview questions
Software Developer interview questions – page 13
945 questions. Tap “Show answer” to check yourself.
-
project details in your resume?
-
Given a 7mt long gold bar , need to cut and give to worker for 7 days (1 meter long) How many min cuts?
-
Write algo to mirror a given Binary Tree?
-
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.]
-
In some tournament 139 teams have participated. Tournament is knock out. what is the number of matches to choose the champion to be held?
-
What is Recursion Function?
-
find maximum length BST in a given binary tree?
-
Write an algorithm to find the absolute max subsequence of an array containing both positive and negative numbers in O(n) time ?
-
Given an array eliminate the duplicates and print it. Linear time complexity?
-
What are class access modifiers?
-
What is the purpose of Normalisation?
-
What is the difference between Truncate and Delete?
-
What is the difference between DBMS and RDBMs?
-
What is the difference between DML and DLL?
-
What is the difference between primary key and unique key?
-
What is a stack?
-
What is library functions?
-
What is the difference between default and copy constructor?
-
What are access specifiers?
-
C++ Virtual Functions
-
ANN(Artificial Neural Networks)
-
GP(Genetic Programming)
-
differences between them and how it is better than linear regression
-
What is SVM (Support Vector Machines
-
Whole database design of one of my project. Asked some SQL queries also
-
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
-
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?
-
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
-
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
-
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