Basic question from your engineering
Fresher Software Interview Questions
5,364 fresher software interview questions shared by candidates
What would you do if I give you One Billion Dollars? (Final HR)
Basics OPPS concepts, sql concepts and unix commands
structures
Complex SQL queries,joins,procedures,etc
Series problem,puzzles and some HR questions
Tell me about yourself. Write a loop to display a star pattern. What are joins in SQL? The manager round requires the presence of mind.
given a binary tree with 27 nodes . calculate the no of null branches.
question no 2: ================== You are given a forest (it may contain a single tree or more than one tree) with N nodes. Each node is given an integer value 0 to (N-1). You have to find: ================== Level order traversal: print nodes at every level of the forest. N can be very large. Aim for an algorithm with a time complexity of O(N). INPUT FORMAT ============== An integer T, denoting the number of testcases, followed by 2T lines, as each testcase will contain 2 lines. First line of each testcase has the value of N. Second line of each testcase has list of N values where the number at index i is the parent of node i. The parent of root is -1. ( The index has the range [0, N-1] ). OUTPUT FORMAT ================ For each testcase given, Suppose m is the height of tree, then next m lines must contain the nodes of that level in ascending order separated by space. After printing level order traversal of each testcase, print a new line. SAMPLE INPUT ================ 2 6 5 -1 1 1 5 2 13 4 3 -1 -1 1 2 7 3 1 4 2 1 2 SAMPLE OUTPUT =============== 1 2 3 5 0 4 2 3 1 5 7 10 12 4 6 8 11 0 9
1.law of equilibiruim 2.poissons ratio
Viewing 751 - 760 interview questions