No. 1 Fresher Jobs Website in India.
Are you employer? Register to Post Jobs Login
Search Jobs

CIT, Gubbi - 21 January 2011 by HCL

Details of CIT, Gubbi - 21 January 2011 by HCL conducted by HCL for job interview.
Share This Job With Others
There were 4 sections in written test. It will be for 2 hours. No gap in between

1. English Comprehension
2. Quantitative Ability
3. Reasoning and Logical Ability
4. Computer 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

3. Reasoning 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 of Complex 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 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