Will you tell me what is the process for selection for the candidate of HCL Recruitment?

HCL Recruiting the eligible candidate through recruitment tests.

Candidates are selected on the basis of the :
Written test
interview

Written test

There were 4 sections in written test. It will be for 2 hours.

Negative mark 0.25

1) Verbal-24questions-30 mins
2) Aptitude-25 questions-35 mins
3) Reasoning-25 questions-35 mins
4) Computer programing-25-35 mins


Syllabus:

1) Verbal-24questions-30 mins

Verbal Ability
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) Aptitude-25 questions-35 mins
Quantitative Ability
Basic Math Understanding and Algebra
Decimals, fractions, powers, HCF, LCM, Solving equations, etc.
Understanding of Logarithms and exponents
Permutation and Combination, Probability

3) Reasoning-25 questions-35 mins
Analogical Reasoning: Analogy and Classification questions
Deductive Logic: Statement-Conclusion,
Statement-Assumption,
Data-sufficiency type,
Syllogisms, etc.
Pattern Recognition
Coding and Decoding
Alphabet Test
Blood Relation,
Direction Understanding,
Logical Word Sequence
Reasoning Puzzles, Theme Detection

4) Computer programing-25-35 mins
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:
Structure and constructs of Computer Programs
Programming flow, Procedures, Functions and Arguments, Methods
Data-types, how data is stored in computers, 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.

2. Data-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

3. Object Oriented Programming Concepts
Classes, objects and methods
Data Encapsulation, Data hiding, Inheritance
Polymorphism, Overloading, Abstraction
Second Section
Technical and HR
As usual questions
Teel me about yourself
Your Project etc..,,