HCL Placement Paper | Logical Reasoning Set - 1 Last Updated : 15 Jul, 2019 Comments Improve Suggest changes Like Article Like Report This is an HCL model placement paper on Logical Reasoning for placement preparation. This placement paper will cover logical reasoning questions that are asked in HCL recruitment drives and also strictly follows the pattern of questions asked in HCL interviews. It is recommended to solve each one of the following questions to increase your chances of clearing the HCL interview. Logical Reasoning What will be the next number? 3, 5, 7, 11, 13, 17……. 21 19 23 20 Answer: 19 Explanation: 3, 5, 7, 11, 13, 17 is a prime number series. Hence next prime number in this series is 19 Find wrong number in series: 12, 25, 49, 99, 187, 395, 789 7789 187 99 49 Answer: 187 Explanation: 12*2+1 =25 25*2-1 = 49 49*2+1 = 99 395*2-1 = 789 Directions to solve Question 3 and 4: Each of the questions given below consists of a statement and/or a question and two statements numbered I and II given below it. You have to decide whether the data provided in the statement(s) is/are sufficient to answer the given question. Read both the statements and Give answer (a) if the data in Statement I alone is sufficient to answer the question, while the data in Statement II alone is not sufficient to answer the question. (b) if the data in Statement II alone is sufficient to answer the question, while the data in Statement I alone is not sufficient to answer the question. (c) if the data in each Statement I and Statement II alone is sufficient to answer the question. (d) if the data even in both Statements I and II together are not sufficient to answer the question. (e) if the data in both Statements I and II together are necessary to answer the question. If x, y are integers, then (x2 + y2)1/2 is an integer? Statement I - x2 + y2 is an integer Statement II - x2 - 3y2 = 0 (a) (b) (c) (d) (e) Answer: (b) data in Statement II alone is sufficient to answer the question, while the data in Statement I alone is not sufficient to answer the question. Explanation: Given Statement II => x2 - 3y2 = 0 => x2 = 3y2 Putting the above in the question => (x2 + y2)1/2 => (3y2 + y2)1/2 => (4y2)1/2 => ((2y)2)1/2 => (2y) which is an integer as y is an integer What day is 14th of a month? Statement I - 3rd Saturday of the month is seventeenth Statement II - 2nd last day of the month is Tuesday (a) (b) (c) (d) (e) Answer: (a) data in Statement I alone is sufficient to answer the question, while the data in Statement II alone is not sufficient to answer the question. Explanation: Given Statement I, 17th, of the month, is Saturday. Therefore 14th will be Wednesday Consider the following phrase: Statement: A line from Ram's appointment letter is "you are hereby appointed as a systems engineer with a probation period of two years and your performance will be reviewed at the end of the period for confirmation." Assumptions: I. At the time of appointment, the performance of one generally is not well known. II. In the probation period, one tries to prove his worth generally. Choose the correct option given below. If only assumption I is implicit If only assumption II is implicit. If either I or II is implicit. If neither I nor II is implicit. If both I and II are implicit. Answer: (e) Both I and II are implicit. Explanation: Both the statements are implicit because since Ram is newly appointed in this company, so at the time of appointment, the performance of Ram is not well known. Also, they have to test performance over a span of time. So Ram (systems engineer) tries to prove his worth generally in the probation period. So, option (E) is correct. Consider the following phrase: Statement: The price for safeda mango is terribly priced at Rs. 200/kg. Assumptions: I. The price for other types of mangoes are decently priced. II. Rs 200 is a very big amount to pay for a safeda mango. Choose the correct option given below. If only assumption I is implicit If only assumption II is implicit. If either I or II is implicit. If neither I nor II is implicit. If both I and II are implicit. Answer: (b) Only assumption II is implicit. Explanation: The Assumption I might or might not be true according to the given Statement, but the Assumption II is definitely true. Hence only Assumption II is implicit. Statements: I - All mangoes are bananas. II - Some bananas are a globe. III - All globe are square. Conclusions: I. Some mangoes are square. II. No mango is square. Choose the correct option given below: only conclusion I is true. only conclusion II is true. either conclusion I or conclusion II is true neither conclusion I nor conclusion II is true both conclusions I and II are true. Answer: (c) either conclusion I or conclusion II is true Explanation: Statements: I - Some C are T II - Some T are R III - All R is M Conclusions: I. Some M are T II. Some C are M Choose the correct option given below: only conclusion I is true. only conclusion II is true. either conclusion I or conclusion II is true neither conclusion I nor conclusion II is true both conclusions I and II are true. Answer: (a) only conclusion I is true. Explanation: Some C might or might not be M. But some M are definitely T. Find wrong number in series: 23, 29, 31, 33, 41, 43, 47 29 33 41 47 Answer: 33 Explanation: The given series is prime numbers from 23 Find wrong number in series: 8, 24, 12, 36, 18, 54, 26 12 24 18 26 Answer: 26 Explanation: Mixture of two alternate series: 8*3=24 24/2=12 12*3=36 36/2=18 18*3=54 54/2=27 Find wrong number in series: 2, 3, 6, 0, 8, -3, 14, -6 3 0 8 3 Answer: C Explanation: Two alternate series: 2 + 4 = 6, 3 - 3 = 0 6 + 4 = 10, 0 - 3 = -3 10 + 4 = 14 -3 - 3 = -6 9848 x 125 = ? 1232000 1242000 1231000 1233000 Answer: 1231000 Explanation: 9848 x 125 = 9848 x 53 = 9848 x (10 / 2) 3 = 9848 x (103 / 23) = 9848 x (1000/8) = 1231000 Directions to solve Question 13 and 14: Each of the questions given below consists of a statement and/or a question and two statements numbered I and II given below it. You have to decide whether the data provided in the statement(s) is/are sufficient to answer the given question. Read both the statements and Give answer (a) if the data in Statement I alone is sufficient to answer the question, while the data in Statement II alone is not sufficient to answer the question. (b) if the data in Statement II alone is sufficient to answer the question, while the data in Statement I alone is not sufficient to answer the question. (c) if the data in each Statement I and Statement II alone is sufficient to answer the question. (d) if the data even in both Statements I and II together are not sufficient to answer the question. (e) if the data in both Statements I and II together are necessary to answer the question. Is x + y = 0? Statement I - x.y < 0 Statement II - x2 = y2 (a) (b) (c) (d) (e) Answer: (e) if the data in both Statements I and II together are necessary to answer the question. Explanation: For x + y = 0, there are 2 cases: Case 1: x and y are of opposite sign. This can be inferred from x.y < 0 Case 2: x = y = 0 This can be inferred from x2 = y2 Hence the data in both Statements I and II together are necessary to answer the question. What is the probability that x3 - 8 = 0 when x is selected from a set of 8 integers? Statement I. The smallest number in the set is -11 Statement II. The arithmetic mean of the set is 1/8. (a) (b) (c) (d) (e) Answer: (d) if the data even in both Statements I and II together are not sufficient to answer the question. Consider the following phrase: Statement: All C are J. All J are B. No B is R. Conclusions: I. All B are C. II. Some J are C Choose the correct option given below: only conclusion I is true. only conclusion II is true. either conclusion I or conclusion II is true neither conclusion I nor conclusion II is true both conclusions I and II are true. Answer: (b) only conclusion II is true. Explanation: All B are not C Comment More infoAdvertise with us Next Article Types of Asymptotic Notations in Complexity Analysis of Algorithms R RishabhPrabhu Follow Improve Article Tags : Placements DSA HCL HCL-Placement-Papers Practice Tags : HCL Similar Reads Basics & PrerequisitesTime Complexity and Space ComplexityMany times there are more than one ways to solve a problem with different algorithms and we need a way to compare multiple ways. Also, there are situations where we would like to know how much time and resources an algorithm might take when implemented. To measure performance of algorithms, we typic 13 min read Types of Asymptotic Notations in Complexity Analysis of AlgorithmsWe have discussed Asymptotic Analysis, and Worst, Average, and Best Cases of Algorithms. The main idea of asymptotic analysis is to have a measure of the efficiency of algorithms that don't depend on machine-specific constants and don't require algorithms to be implemented and time taken by programs 8 min read Data StructuresGetting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr 14 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like