HCL APTITUDE REASONING TECHNICAL HR-PI INTERVIEW QUESTIONS

HCL PROGRAMMING QUESTIONS, HCL C LANGUAGE QUESTIONS WITH ANSWERS, HCL APTITUDE REASONING TECHNICAL HR-PI INTERVIEW QUESTIONS WITH ANSWERS, HCL WRITTEN EXAM PAPERS DOWNLOAD FREE

COMPUTER PROGRAMMING PRINCIPLES AND APPLICATIONS
Q1. A 8-bit signed integer has the following range:
a.0 to 255
b. -128 to 127
c.-25 5 to 254
d. 0 to 509

Q2. What will be the output of the following code statements?
integer x = 34.54, y = 20, z = -5
print ( y > 50 AND z > 10 or x > 30 )
a.0
b. 1
c.-1
d. 10

Q3. Pankaj makes a program to print the product of cubes of the first 10 whole numbers. She writes the following program:
integer x = 0 // statement 1
integer sum = 0 // statement 2
while ( x < 10 ) // statement 3
{
sum = x*x*x // statement 4
x = x + 1 // statement 5
}
print sum // statement 6 Is her program correct? If not, which statement will you modify to correct it?
a.
No error, the program is correct.
b. Statement 1
c.Statement 4
d. statement 6

Q4. I have a problem to solve which takes as input a number n. The problem has a property that given the solution for (n-1), I caneasily solve the problem for n. Which programming technique will I use to solve such a problem?
a.Iteration
b. Decision-making
c.Object Oriented Programming
d. Recursion

Q5. Given: integer x = 40, y = 35, z = 20, w = 10 Comment about the output of the following two statements: print x * y / z - w print x * y / (z - w)
a.Differ by 80
b. Same
c.Differ by 50
d. Differ by 160

Q6. Data and function in which area of a class are directly accessible outside the class?
a.Public
b. Private
c.Protected
d. None of these

Q7. Here is an infix notation: ((A+B)*C-(D-E))^(F+G) Choose the correct postfix notation of the above from the given options.
a.AB+CD*E--FG+^
b. AB+C*DE--FG+^
c.AB+C*DE-FG-+^
d. A+BC*DE-FG-+^

Q8. If the depth of a tree is 3 levels, then what is the size of theTree?
a.2
b. 4
c.6
d. 8

Q9. One of the following options is a form of access used to add and remove nodes from a queue.
a.LIFO
b. FIFO
c.Both LIFO and FIFO
d. None of these

Q10. What is the time complexity of adding three matrices of size NXN cell-by-cell?
a.O(N)
b. O(N^2)
c.O(N^3)
d. None of these


Aptitude – General 21 January 2011
There were 4 sections in written test. It will be for 2 hours. No gap in between
1English Comprehension
2Quantitative Ability
3Reasoning and Logical Ability
4Computer Programming Principles and Application
1.English Comprehension
Synonyms/Antonyms/Word Meaning (Vocabulary)
*Complete the Sentence (Grammar)
*Spot error/Correct sentence (Grammar/sentence construction)
*Sentence Ordering (Comprehension skills)
*Questions based on passage (Comprehension skills)



2 Quantitative Ability
*Basic Math Understanding and Algebra: Decimals, fractions, powers,
HCF, LCM,Solving equations, etc.
*Word Problems
*Understanding of Logarithms and exponents
*Permutation and Combination, Probability

3Reasoning and Logical Ability
*Analogical Reasoning: Analogy and Classification questions
*Deductive Logic: Statement-Conclusion, Statement-Assumption, Data-sufficiency type, Syllogisms, etc.
*Pattern Recognition: Coding and Decoding Questions, Alphabet Test
* Composition ofComplex relations: Blood Relation, Direction Understanding, Logical Word Sequence
* Reasoning Puzzles, Theme Detection

4 Computer Programming Principles and Application
This test is based on no particular programming language. The test is completely language independent and tests the programming and algorithm development concepts of the candidate. The topics include:
1 Structure and constructs of Computer Programs
* Programming flow, Procedures, Functions and Arguments, Methods
* Data-types, how data is stored incomputers, input/output, manipulation, methods of referencing and assessing data (including pointers).
*Iteration, decision-making, recursions
*Algorithm Complexity: Space and time Complexity, Asymptotic Notation
*Compilation, Linking and Execution; debugging, kinds of errors.

2Data-structures and Basics Algorithms
*Data Storage Methods: Linked lists, Arrays, Queues, Stacks, Trees, Heaps, Hash tables, graphs; Stress on which data structure to use for a given application
* Data retrieval, Insertion of new data, merging of data from two data structures
*Data search and sorting, Methods of array sorting and trade-off

3Object Oriented Programming Concepts
*Classes, objects and methods
*Data Encapsulation, Data hiding, Inheritance
*Polymorphism, Overloading, Abstractt

Aptitude - General 15 December 2010
The Written Exam
* AMCAT test module
*Adaptive testing (GRE MODULE)


 

HCL HR INTERVIEW QUESTIONS WITH ANSWERS

The HR round was a group interview cum discussion. There were 10 interviewees per batch. Each participant had to justify why he/she is the ideal choice for the job Participants were
asked to identify amongst themselves the least eligible candidate if only 9 out of the 10 were to be short listed. The interviewer also asked them to list their strengths and weaknesses. The participants were asked to conclude the proceedings in the last 40 seconds. And the most important of all is HCL will never allow any backlog history in your engineering career and the final result.
*16 2 appeared for written test
*44 cleared written test
* 6 were removed for their backlog history

Tweet