Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z




HCL Group I Interview Questions
Questions Answers Views Company eMail

Please give NAMES and PHONE NUMBERS OF coaching centers for GROUP 1 exam in HYDERABAD ? thank you.

13 40666

how to get appsc group 1&2 New sylabus meterial?

64 43750

Post New HCL Group I Interview Questions



Un-Answered Questions

What is royalty reserve?

3479


how to carry out Magnetizing Current Test on Distribution transformer and what purpose we are doing this test. why transformer rating in always in KVA ? what ispositive, negative, zero sequence impedence? How ElCB tripping if Neutral touch with ground Why AC & DC capacitor are use in UPS ? why motor rating in KW? how to syncronize two dg sets

923


as a technical developer in oracle applications which type errors feced in your experience sofar

1049


What is main of k*abs in uv visible spectroscopy

937


How to determine the names of the installed comm ports?

722






Give some examples of queries delivered with BW statistics?

775


what is the pattern of written test for the post of trainee mechanical engg.

1037


DATA STRUCTURE QUESTIONS What is a data structure? What does abstract data type means? Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked) Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked) How is it possible to insert different type of elements in stack? Stack can be described as a pointer. Explain. Write a Binary Search program Write programs for Bubble Sort, Quick sort Explain about the types of linked lists How would you sort a linked list? Write the programs for Linked List (Insertion and Deletion) operations What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion? Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. Explain binary searching, Fibinocci search. What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute? When will you sort an array of pointers to list elements, rather than sorting the elements themselves? The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? Which sort show the best average behavior? What is the average number of comparisons in a sequential search? Which data structure is needed to convert infix notations to post fix notations? What do you mean by: • Syntax Error • Logical Error • Runtime Error How can you correct these errors? In which data structure, elements can be added or removed at either end, but not in the middle? How will inorder, preorder and postorder traversals print the elements of a tree? Parenthesis are never needed in prefix or postfix expressions. Why? Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Data Structure Questions 1. What is data structure? 2. List out the areas in which data structures are applied extensively? 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? 5. Minimum number of queues needed to implement the priority queue? 6. What is the data structures used to perform recursion? 7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? 8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations. 9. Sorting is not possible by using which of the following methods? 10. A binary tree with 20 nodes has null branches? 21 Let us take a tree with 5 nodes (n=5) 11. What are the methods available in storing sequential files ? 12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees. i ii iii iv v 13. List out few of the Application of tree data-structure? 14. List out few of the applications that make use of Multilinked Structures? 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none 16. What is the type of the algorithm used in solving the 8 Queens problem? 17. In an AVL tree, at what condition the balancing is to be done? 18. What is the bucket size, when the overlapping and collision occur at same time? 19. Traverse the given tree using Inorder, Preorder and Postorder traversals. 20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 21. In the given binary tree, using array you can store the node 4 at which location? At location 6 1 2 3 - - 4 - - 5 Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4 where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45 23. For the given graph, draw the DFS and BFS?  BFS: A X G H P E M Y J  DFS: A X H P E Y M J G 24. Classify the Hashing Functions based on the various methods by which the key value is found. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? 26. In RDBMS, what is the efficient data structure used in the internal storage representation? 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78 28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree 29. What is a spanning Tree? 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? 31. Convert the given graph with weighted edges to minimal spanning tree. 32. Which is the simplest file structure? (d) Sequential (e) Indexed (f) Random 33. Whether Linked List is linear or Non-linear data structure? 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q) 35. For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX. Data Structure Questions 1. What is data structure? 2. List out the areas in which data structures are applied extensively? 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? 5. Minimum number of queues needed to implement the priority queue? 6. What is the data structures used to perform recursion? 7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? 8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations. 9. Sorting is not possible by using which of the following methods? 10. A binary tree with 20 nodes has null branches? 21 Let us take a tree with 5 nodes (n=5) 11. What are the methods available in storing sequential files ? 12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees. i ii iii iv v 13. List out few of the Application of tree data-structure? 14. List out few of the applications that make use of Multilinked Structures? 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none 16. What is the type of the algorithm used in solving the 8 Queens problem? 17. In an AVL tree, at what condition the balancing is to be done? 18. What is the bucket size, when the overlapping and collision occur at same time? 19. Traverse the given tree using Inorder, Preorder and Postorder traversals. 20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 21. In the given binary tree, using array you can store the node 4 at which location? At location 6 1 2 3 - - 4 - - 5 Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4 where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45 23. For the given graph, draw the DFS and BFS?  BFS: A X G H P E M Y J  DFS: A X H P E Y M J G 24. Classify the Hashing Functions based on the various methods by which the key value is found. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? 26. In RDBMS, what is the efficient data structure used in the internal storage representation? 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78 28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree 29. What is a spanning Tree? 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? 31. Convert the given graph with weighted edges to minimal spanning tree. 32. Which is the simplest file structure? (d) Sequential (e) Indexed (f) Random 33. Whether Linked List is linear or Non-linear data structure? 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q) 35. For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX. Data Structure Questions 1. What is data structure? 2. List out the areas in which data structures are applied extensively? 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? 5. Minimum number of queues needed to implement the priority queue? 6. What is the data structures used to perform recursion? 7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? 8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations. 9. Sorting is not possible by using which of the following methods? 10. A binary tree with 20 nodes has null branches? 21 Let us take a tree with 5 nodes (n=5) 11. What are the methods available in storing sequential files ? 12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees. i ii iii iv v 13. List out few of the Application of tree data-structure? 14. List out few of the applications that make use of Multilinked Structures? 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none 16. What is the type of the algorithm used in solving the 8 Queens problem? 17. In an AVL tree, at what condition the balancing is to be done? 18. What is the bucket size, when the overlapping and collision occur at same time? 19. Traverse the given tree using Inorder, Preorder and Postorder traversals. 20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 21. In the given binary tree, using array you can store the node 4 at which location? At location 6 1 2 3 - - 4 - - 5 Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4 where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45 23. For the given graph, draw the DFS and BFS?  BFS: A X G H P E M Y J  DFS: A X H P E Y M J G 24. Classify the Hashing Functions based on the various methods by which the key value is found. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? 26. In RDBMS, what is the efficient data structure used in the internal storage representation? 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78 28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree 29. What is a spanning Tree? 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? 31. Convert the given graph with weighted edges to minimal spanning tree. 32. Which is the simplest file structure? (d) Sequential (e) Indexed (f) Random 33. Whether Linked List is linear or Non-linear data structure? 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q) 35. For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

3925


What will happend if given Vfd out put to step up transformer

545


what is consumer product accoutning?

704


what is W.T?specify the acceptable range?

665


How does the size of the OPCODE field limit the number of operations? Give an example to support your explanation?

1212


how you taken aotitude test

1124


sir,i am golng to attend BHEL supervisor trainee personal interview on 11 sept.anyone share me that how could i perform well in interview& what they would expect from me. thank you.

2600


Equipment A has a cost of Rs.75,000 and net cash flow of Rs.20000 per year for six years. A substitute equipment B would cost Rs.50,000 and generate net cash flow of Rs.14,000 per year for six years. The required rate of return of both equipments is 11 per cent. Calculate the IRR and NPV for the equipments. Which equipment should be accepted and why?

1479






HCL Group I Interview Questions
  • C (112)
  • STL (1)
  • OOPS (28)
  • C++ General (21)
  • MFC (19)
  • ATL (2)
  • COM DCOM (2)
  • Win32API (3)
  • VC++ AllOther (2)
  • Delphi (2)
  • PHP (24)
  • Programming Languages AllOther (23)
  • ASP (8)
  • CGI Perl (2)
  • JavaScript (6)
  • VB Script (3)
  • JSP (7)
  • Tcl (5)
  • Scripts AllOther (2)
  • SNMP (4)
  • TCP IP (18)
  • Protocols AllOther (7)
  • Networking Administration (56)
  • Networking Security (6)
  • Networking AllOther (16)
  • Visual Basic (10)
  • C Sharp (39)
  • ASP.NET (42)
  • VB.NET (4)
  • ADO.NET (8)
  • IIS (4)
  • Crystal Reports (2)
  • BizTalk (1)
  • Dot Net Framework (4)
  • Dot Net Remoting (2)
  • Dot Net WindowsForms (2)
  • Dot Net General (2)
  • Dot Net AllOther (5)
  • Exchange Server (9)
  • Microsoft Related AllOther (7)
  • Oracle General (16)
  • Architecture (3)
  • Database Management (11)
  • Forms Reports (4)
  • Oracle AllOther (9)
  • SQL Server (63)
  • MySQL (4)
  • Sybase (2)
  • SQL PLSQL (24)
  • Databases AllOther (1)
  • SDK (2)
  • Windows Threads (3)
  • Windows General (7)
  • Windows AllOther (11)
  • Linux Commands (16)
  • Linux Socket Programming (1)
  • Linux System Calls (2)
  • Linux General (4)
  • Linux AllOther (2)
  • Unix Commands (13)
  • Unix IPC (4)
  • Unix AllOther (5)
  • Solaris Commands (5)
  • Solaris System Calls (1)
  • Solaris General (4)
  • Solaris AllOther (14)
  • Operating Systems General Concepts (16)
  • Operating Systems AllOther (2)
  • WinRunner (4)
  • Load Runner (6)
  • QTP (39)
  • Test Director (3)
  • Rational TestSuite (2)
  • Silk Test (1)
  • Selenium (15)
  • Automation Testing AllOther (4)
  • Manual Testing (156)
  • QA Concepts (10)
  • Mobile Testing (3)
  • Test Cases (13)
  • Test Documents Reporting (1)
  • Testing AllOther (12)
  • Tomcat (1)
  • Apache (2)
  • Servers AllOther (1)
  • COBOL (28)
  • JCL (11)
  • CICS (5)
  • DB2 (7)
  • ADABAS (1)
  • Assembler (6)
  • MVS (2)
  • VSAM (4)
  • IBM MainFrame AllOther (2)
  • RPG400 (13)
  • COBOL400 (1)
  • DB400 (3)
  • IBM AS400 AllOther (9)
  • Core Java (62)
  • Advanced Java (26)
  • Swing (1)
  • EJB (9)
  • Servlets (13)
  • Struts (14)
  • JDBC (8)
  • J2EE (5)
  • Weblogic (26)
  • Java J2EE AllOther (13)
  • Java Related AllOther (10)
  • CORBA (1)
  • MQSeries (1)
  • XML XSLT RSS (3)
  • Teradata (3)
  • Business Objects (18)
  • Cognos (67)
  • Informatica (47)
  • Actuate (1)
  • Ab Initio (7)
  • Data Stage (26)
  • SAS (9)
  • ETL (4)
  • Data Warehouse General (6)
  • HR Questions (18)
  • UML (1)
  • OOAD (1)
  • Requirements Management (1)
  • Project Planning (6)
  • Project Management (1)
  • CTC (1)
  • Theoritical (1)
  • Visual Studio IDE (2)
  • Telecom Routers Switches (1)
  • VoIP IP Telephony (1)
  • GSM (1)
  • BlueTooth (1)
  • Telecom General (3)
  • Telecom AllOther (1)
  • SAP Basis (28)
  • SAP ABAP (66)
  • SAPScript (4)
  • SAP SD (39)
  • SAP MM (10)
  • SAP PP (4)
  • SAP FI CO (46)
  • SAP HR (7)
  • SAP CRM (2)
  • SAP SRM (1)
  • SAP Business Warehouse (9)
  • SAP Security (6)
  • SAP Netweaver (2)
  • SAP ALE IDocs (4)
  • SAP B1 (3)
  • PeopleSoft HRMS (2)
  • PeopleSoft Tools (1)
  • ERP General (1)
  • Oracle Apps Technical (7)
  • Oracle Apps Financial (32)
  • 86 Family (3)
  • VLSI (1)
  • Client Server General (1)
  • AI Neural Networks (1)
  • Digital Certificates (1)
  • Ciphers (2)
  • WebMethods (3)
  • TIBCO (2)
  • JCAPS (1)
  • Software Integration & Release (5)
  • Program Management (3)
  • Image Processing AllOther (2)
  • Zoology (2)
  • Geo Physics (1)
  • Organic Chemistry (1)
  • General Science (5)
  • Sciences AllOther (1)
  • Civil Engineering (7)
  • Mechanical Engineering (17)
  • Electrical Engineering (90)
  • Electronics Communications (56)
  • Chemical Engineering (3)
  • Industrial Engineering (1)
  • Instrumentation (9)
  • Engineering AllOther (31)
  • Business Administration (1)
  • Marketing Sales (10)
  • Banking Finance (4)
  • Human Resources (9)
  • Industrial Management (1)
  • Infrastructure Management (1)
  • IT Management (1)
  • Non Technical (1)
  • Business Management AllOther (2)
  • Audit (2)
  • Taxation (10)
  • Accounting General (23)
  • Accounting AllOther (27)
  • Architecture Design AllOther (1)
  • Call Centre AllOther (204)
  • UPSC AllOther (1)
  • SSC History (1)
  • SSC General Studies (1)
  • SSC AllOther (3)
  • RRB (7)
  • CDS (1)
  • NDA (2)
  • POs (4)
  • BSRB Clerical (3)
  • Group I (2)
  • APPSC AllOther (5)
  • General Knowledge_Current Affairs (29)
  • Government AllOther (3)
  • Law AllOther (1)
  • Tourism Hotel AllOther (1)
  • Funny Interview Questions (3)
  • Everything Else AllOther (14)
  • English (19)
  • General Aptitude (52)
  • Puzzles (11)
  • Placement Papers (26)
  • CCNA (70)
  • CCDA (1)
  • Microsoft Certifications (6)
  • Sun Certifications (1)
  • CISA Certification (1)
  • Oracle Certifications (2)
  • ISTQB Certification (1)
  • Certifications AllOther (8)
  • H1B Visa (2)
  • USA Student Visa F1 Visa (1)
  • L1 Visa (9)
  • USA Business Visa B1 Visa (1)
  • USA Dependent Visa H4 Visa (3)
  • UK Visa (1)
  • Australia Visa (2)
  • Canada Visa (4)
  • C Code (49)
  • C++ Code (4)
  • J2SE Code (2)
  • ASP.NET Code (1)
  • VB.NET Code (1)
  • C Sharp Code (1)
  • ADO.NET Code (1)
  • PHP Code (1)
  • JavaScript Code (2)
  • WinRunner Code (1)
  • GATE (2)
  • OPENMAT (1)
  • ICET (3)
  • C C++ Errors (9)
  • Oracle Errors (5)
  • SQLServer Errors (1)
  • Scripts Errors (1)