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 Selenium Interview Questions
Questions Answers Views Company eMail

difference between Implicit Wait and Explicit Wait with syntax.?

7 9069

what are the Dynamic elements in web Application?

2 8456

difference between Close() and Quit()?

2 5494

How do you handle Alerts and Pop Ups?

2 6587

How do you handle Multiple windows in your application?

3 6267





How do you get all the values from Drop Down list?

5 7675

How do you get data from Web Table?

1 5802

How do you find element using Java Script?

2 5686

List of Exceptions may occur in selenium?

3 6278

How do you Upload or Download a File in Web Application?

2 7117

What is the difference between TESTNG and JUNIT? List out Annotations?

1 5359

How do you Skip Test Case from execution?

4 6885

Difference between @findByMethod and @findelement?

3 8734

What is the build Tool you have used in your project?

3 7807

How do you attach File on a page?

1 3676

Post New HCL Selenium Interview Questions



Un-Answered Questions

what is futures and options?

858


Any one is alembic pharmaceutical ltd. On starting to job ?

466


What is ferro-resonance in electrical system? Why it occurs and what are measures to prevent it?

1101


Technical Ability Test: This was difficult. three questions to be attempted in 60 min. The Coplete Technical Paper was as follows: Write the Pseudo code for the following: 1. Wrie a function which returns the most frequent number in a list of integers. Handle the case of more than one number which meets this criterion. public static int[] GetFrequency(int[] list) 2. Counting in Lojban, an artificial language developed over the last fourty years, is easier than in most languages The numbers from zero to nine are: 0 no 1 pa 2 re 3 ci 4 vo 5 mk 6 xa 7 ze 8 bi 9 so Larger numbers are created by gluing the digit togather. For Examle 123 is pareci Write a program that reads in a lojban string(representing a no less than or equal to 1,000,000) and output it in numbers. 3. Where now stands that small knot of villages known as the Endians, a mighty forest once stood. Indeed, legand has it that you could have stoodon the edge of the wood and seen it stretch out for miles, were it not for the trees getting in the way. In one section of the forest, the trees stood in a row and were of hight from 1 to n, each hight occurring once and once only. A tree was only visible if there were no higher trees before it in the row. For example, if the heights were 324165, the only visible trees would have been those of height 3,4 & 6. Write a Program that takes an array of integers representing the heights of the trees in the row as input and prints the list of the visible trees. //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// ////////////////// Ques1: Given an array containing k nos in the range 1..n and another scratch array of size n. Write an program to remove the duplicates from the array. Ques2: Given a table of the form: Product Sold on A 1/1/1980 B 1/1/1980 C 1/1/1980 A 1/1/1980 B 1/1/1980 C 2/1/1980 A 2/1/1980 There are 30 products and 10,000 records of such type. Also the month period during which sales happened is given to u. Write the program to display the result as: Product Month No. of copies A January 12 A February 15 A March 27 B January 54 B February 15 B March 10 C January 37 Ques3: Definition of priority queue was given. We have to implement the priority queue using array of pointers with the priorities given in the range 1..n. The array could be accessed using the variable top. The list corresponding to the array elements contains the items having the priority as the array index. Adding an item would require changing the value of top if it has higher priority than top. Extracting an item would require deleting the first element from the corresponding queue. The following class was given: Ques4: An array of size 5X5 is given to us. The elements from 1 to 25 are to be inserted in the array, such that starting from a particular position for an element i, the next element i+1can be inserted only at the mentioned positions (u,v), and if these all positions are occupied then it returns giving a count of how many positions have been occupied in the array: //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// ////////////////// Example: if the starting element is 1 with the given positions (1,2), then next element 2 can be placed at any one of the positions marked with *. _ _ _ _ _ 1 _ _ _ * _ _ _ _ _ _ _ * _ _ * _ _ _ _ 2. Four questions of programming in c++, questions were:( 1:30 hr) a) Bubble sort through recursion b) Display Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 … c) Perform the functionality of 2-D array through 1-D array and in it the functions to be performed were: (1) Display the array in 2-D format (2) Display a particular element (3) Display a particular row (4) Display a particular column d) Give an efficient program for string matching like: Text: this is the code in the text which you have to search by code Pattern: Code Count the no. of occurrences of the pattern to be searched //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// ////////////////// a) suppose u r given a 4*3 rectangle like (take these values from user) Now u have to calculate the no. of squares in this rectangle like: No. of squares of dimension 1 is 12 No. of squares of dimension 2 is 6 No. of squares of dimension 3 is 2 No. of squares of dimension 4 is 0 Total no. of squares are 20. b) Suppose u r given a string. U have to find the occurance of the characters A-Z in that string. Each character must appear in the string and must appear only once. If It that occurs in string more than one time return 1 showing it is a perfect string otherwise return 0 showing it is not a perfect string. c) Suppose u r given 10000 marks. U have to pick up top 20 top marks from them and display it on the screen. (Use the optimal sorting algorithm) d) Suppose u have a chess board. U have to insert 8 queens on the chessboard in the style that the queens don’t intersect in the diagonals, columns and rows. If they intersect return 1 else return 0.(that is no more than one queen should be present either in row or column or diagonals.) If the queen is inserted at a position in the chessboard, its count is 1.

2606


what solution for High Utilization Cisco router 2851 ? please Need Help ASAP.

748






can anyone suggest me any low cost tool that can support both Manual and Automation testing ?

810


What is the profile of QA engineer

802


who is your famous personality

1267


3. Differentiate between ultrasonic flowmeter and radar type flow meter.

1584


- Types of triggers - View - Dcl - Procedures, packages, functions - Metasolve - Can use Dcl in triggers - package case study - Cursor and its types - triggers schedule - Wrap - Why we are using fetch and for in cursor. difference?

448


At the time of creating GRN can I mention business area?

1252


what are the risk factors in the project? what is the base for testplan and entry criteria ,exit criteria for test plan?

782


what is description object?

894


How to define service agreement, warranty and extended warranty,

782


how to prepare the balance sheet of private ltd. company & what roll should be play by Income tax, compnay law & accounting standard in India & world.

753






HCL Selenium 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)