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

• ABC aptitute test questions (20)
• ABC interview questions (562)
• ABC placement papers (2)
• ABC technical test questions (48)

ABC Flash Action Scripting Interview Questions

How can we goto next Scene by giving code on a button inside a movie clip. in short. =>Scene 1. ====>MovieClip ======>Button [ on(release) { gotoAndPlay("Scene 2", 1); } ] =>Scene 2. This thing is not working. Please tell me the answer of how to goto next scene from this scene 1.

7088

In VVVF DRIVES VOLTAGE IS ALSO VARY WITH THE FREQUENCY. HOW? WHAT IS THE DIRECT FORMULA RELATING THESE TWO.

1080

what is the procedure getting road permit form online

364

what is account & what is finance

860

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.

2492

689

What is Goods Lost by Fire/Accident/Theft ?

390

I have code and test bench however it is not working porperly. Need help to get it working. module fsm(clock,reset,coin,vend,state,change); \\these are the inputs and the outputs. input clock; input reset; input [2:0]coin; output vend; output [2:0]state; output [2:0]change; \\i need to define the registers as change,coin and vend reg vend; reg [2:0]change; wire [2:0]coin; \\my coins are declared as parameters to make reading better. parameter [2:0]NICKEL=3’b001; parameter [2:0]DIME=3’b010; parameter [2:0]NICKEL_DIME=3’b011; parameter [2:0]DIME_DIME=3’b100; parameter [2:0]QUARTER=3’b101; \\MY STATES ARE ALSO PARAMETERS . I DONT WANT TO MAKE YOU READ \\IN MACHINE LANGUAGE parameter [2:0]IDLE=3’b000; parameter [2:0]FIVE=3’b001; parameter [2:0]TEN=3’b010; parameter [2:0]FIFTEEN=3’b011; parameter [2:0]TWENTY=3’b100; parameter [2:0]TWENTYFIVE=3’b101; \\AS ALWAYS THE STATES ARE DEFINED AS REG reg [2:0]state,next_state; \\MY MACHINE WORKS ON STATE AND COIN always @(state or coin) begin next_state=0; \\VERYFIRST NEXT STATE IS GIVEN ZERO case(state) IDLE: case(coin) \\THIS IS THE IDLE STATE NICKEL: next_state=FIVE; DIME: next_state=TEN; QUARTER: next_state=TWENTYFIVE; default: next_state=IDLE; endcase FIVE: case(coin) \\THIS IS THE SECOND STATE NICKEL: next_state=TEN; DIME: next_state=FIFTEEN; QUARTER: next_state=TWENTYFIVE; //change=NICKEL default: next_state=FIVE; endcase TEN: case(coin) \\THIS IS THE THIRD STATE NICKEL: next_state=FIFTEEN; DIME: next_state=TWENTY; QUARTER: next_state=TWENTYFIVE; //change=DIME default: next_state=TEN; endcase FIFTEEN: case(coin) \\THIS IS THE FOURTH STATE NICKEL: next_state=TWENTY; DIME: next_state=TWENTYFIVE; QUARTER: next_state=TWENTYFIVE; //change==NICKEL_DIME default: next_state=FIFTEEN; endcase TWENTY: case(coin) \\THIS IS THE FIFTH STATE NICKEL: next_state=TWENTYFIVE; DIME: next_state=TWENTYFIVE; //change=NICKEL QUARTER: next_state=TWENTYFIVE; //change==DIME_DIME default: next_state=TWENTY; endcase TWENTYFIVE: next_state=IDLE; \\THE NEXT STATE HERE IS THE RESET default : next_state=IDLE; endcase end always @(clock) begin \\WHENEVER I GIVE A RESET I HAVE TO MAKE THE STATE TO IDLE AND VEND TO 1 if(reset) begin state <= IDLE; vend <= 1’b0; // change <= 3’b000; end \\THE CHANGE ALSO HAS TO BECOME NONE else state <= next_state; case (state) \\HERE WE DECIDE THE NEXT STATE \\ALL THE STATES ARE DEFINED HERE AND THE OUTPUT IS ALSO GIVEN IDLE: begin vend <= 1’b0; change <=3’d0; end FIVE: begin vend <= 1’b0; if (coin==QUARTER) change <=NICKEL; else change <=3’d0; TEN: begin vend <= 1’b0; if (coin==QUARTER) change <=DIME; else change <= 3’d0; FIFTEEN : begin vend <= 1’b0; if (coin==QUARTER) change <=NICKEL_DIME; else change TWENTY : begin vend <= 1’b0; if (coin==DIME) change <=NICKEL; else if (coin==QUARTER) TWENTYFIVE : begin vend <= 1’b1; change <=3’d0; end default: state <= IDLE; endcase end endmodule module test; \\THE INPUT IN THE FSM MODULE ARE REG HERE reg clock,reset; reg [2:0]coin; \\THE OUTPUT IN THE FSM MODULE ARE WIRES HERE wire vend; wire [2:0]state; wire [2:0]change; \\THE PARAMETERS AGAIN FOR THE COIN AND STATE parameter [2:0]IDLE=3’b000; parameter [2:0]FIVE=3’b001; parameter [2:0]TEN=3’b010; parameter [2:0]FIFTEEN=3’b011; parameter [2:0]TWENTY=3’b100; parameter [2:0]TWENTYFIVE=3’b101; parameter [2:0]NICKEL=3’b001; parameter [2:0]DIME=3’b010; parameter [2:0]NICKEL_DIME=3’b011; parameter [2:0]DIME_DIME=3’b100; parameter [2:0]QUARTER=3’b101; \\I MONITOR THE TIME,DRINK,RESET,CLOCK,STATE AND CHANGE FOR CHANGES. initial begin \$display("Time\tcoin\tdrink\treset\tclock\tstate\tchange"); \$monitor("%g\t%b\t%b\t%b\t%b\t%d\t% d",\$time,coin,vend,reset,clock,state,change); \\NEW FEATURE: MY MACHINE HAS THE FACILITY TO DUMP VARIABLES SO THAT \\ I CAN VIEW THEM USING A VCD VIEWER. \$dumpvars; \$dumpfile("file.vcd"); // Dump output file. \\THIS IS WHERE THE COINS ARE ADDED. clock=0; reset=1; \\FIRST LETS RESET THE MACHINE #2 reset=0; coin=NICKEL; \\CHECK FOR STATE 1 #2 reset=1; coin=2’b00; #2 reset=0; coin=DIME; \\RESET AGAIN AND CHECK FOR STATE 2 #2 reset=1; coin=2’b00; #2 reset=0; \\RESET AGAIN AND CHECK FOR STATE 5 coin=QUARTER; #2 reset=1; coin=2’b00; #2 reset=0; \\RESET AGAIN AND CHECK FOR STATE 5 coin=NICKEL; #2 coin=NICKEL; #2 coin=NICKEL; #2 coin=NICKEL; #2 coin=NICKEL; #2 reset=1; coin=2’b00; #2 reset=0; \\RESET AGAIN AND CHECK FOR STATE 5 AND SO ON coin=NICKEL; #2 coin=DIME; #2 coin=DIME; #2 reset=1; coin=2’b00; #2 reset=0; coin=NICKEL; #2 coin=DIME; #2 coin=QUARTER; #2 reset=1; coin=2’b00; #2 reset=0; coin=NICKEL; #2 coin=NICKEL; #2 coin=NICKEL; #2 coin=DIME; #2 reset=1; coin=2’b00; #2 reset=0; coin=NICKEL; #2 coin=NICKEL; #2 coin=NICKEL; #2 coin=NICKEL; #2 coin=DIME; #2 reset=1; coin=2’b00; #2 reset=0; coin=NICKEL; #2 coin=NICKEL; #2 coin=QUARTER; #2 reset=1; coin=2’b00; #2 reset=0; coin=NICKEL; #2 coin=QUARTER; #2 reset=1; coin=2’b00; #2 \$finish; end \\THE CLOCK NEEDS TO TICK EVERY 2 TIME UNIT always #1 clock=~clock; //always @(state) // coin=!coin; initial begin if (reset) coin=2’b00; end \\THIS IS WHERE I INSTANTIATE THE MACHINE fsm inst1(clock,reset,coin,vend,state,change); endmodule

2376

How to Create a Prompted Query?

550

what is the path of thunderlightening? once both a buffalo and a person were standing 5m apart but lightening hit and killed buffalo not person?

1615

how to prepare the technical test

728

What is the feature’s in Group Policy? What is DNS? what is the use of DNS?

786

One of the optimizing technique to improve the session performance is push down optimization,by using push down optimization we push as much as transformation logic to source/target database,but this degrades the d/b performance,how to overcome this?

959

how to calculation increase capacitor,increase power factor for three phase.

905

Write JavaScript code to use file system in binary format?

1346

Which all profiles did you use?

873

ABC Flash Action Scripting Interview Questions
• C (8)
• C++ (1)
• STL (1)
• OOPS (2)
• C++ General (2)
• MFC (1)
• PHP (3)
• Programming Languages AllOther (2)
• CGI Perl (2)
• JavaScript (1)
• SNMP (1)
• TCP IP (1)
• Networking AllOther (3)
• Visual Basic (4)
• C Sharp (3)
• ASP.NET (9)
• VB.NET (3)
• IIS (1)
• BizTalk (1)
• Dot Net Framework (3)
• Dot Net WindowsForms (1)
• Dot Net General (1)
• Exchange Server (2)
• WCF (1)
• Oracle General (2)
• Forms Reports (2)
• SQL Server (14)
• MySQL (2)
• SQL PLSQL (4)
• Windows AllOther (2)
• Unix Commands (1)
• Unix General (1)
• Unix AllOther (1)
• Solaris General (1)
• Data Structures (1)
• WinRunner (1)
• QTP (12)
• Test Director (2)
• Rational TestSuite (1)
• Automation Testing AllOther (1)
• Manual Testing (26)
• QA Concepts (3)
• Mobile Testing (1)
• Test Cases (10)
• Test Documents Reporting (3)
• Testing AllOther (4)
• Apache (1)
• COBOL (3)
• JCL (2)
• DB400 (1)
• Core Java (8)
• Servlets (3)
• HTML DHTML (2)
• Flash Action Scripting (1)
• Cognos (1)
• Informatica (4)
• Data Stage (3)
• SAS (2)
• ETL (1)
• Data Warehouse General (2)
• HR Questions (2)
• Design Patterns (2)
• UML (1)
• Project Planning (3)
• Project Management (1)
• Telecom Routers Switches (1)
• SAP Basis (8)
• SAP ABAP (4)
• SAPScript (1)
• SAP MM (2)
• SAP PM (1)
• SAP FI CO (6)
• SAP HR (9)
• SAP CRM (1)
• SAP Security (4)
• SAP Netweaver (3)
• SAP B1 (1)
• SAP AllOther (1)
• Oracle Apps Financial (6)
• Oracle Apps HRMS (1)
• Software Quality Analysis (1)
• Bio Technology (2)
• Zoology (1)
• General Physics (1)
• Organic Chemistry (1)
• Analytical Chemistry (2)
• General Science (1)
• Civil Engineering (16)
• Mechanical Engineering (3)
• Electrical Engineering (48)
• Electronics Communications (8)
• Chemical Engineering (2)
• Instrumentation (1)
• Power Plant Engineering (1)
• Engineering AllOther (3)
• Marketing Sales (6)
• Banking Finance (5)
• Human Resources (6)
• Personnel Management (2)
• Industrial Management (2)
• IT Management (4)
• Audit (5)
• CompanyAffairs CS (2)
• Taxation (50)
• Accounting General (42)
• Accounting AllOther (34)
• Architecture Design AllOther (2)
• Call Centre AllOther (13)
• UPSC General Studies (1)
• SSC General Science (1)
• SSC General Studies (1)
• SSC AllOther (2)
• POs (1)
• BSRB Clerical (3)
• BSRB AllOther (1)
• Group I (2)
• APPSC AllOther (6)
• General Knowledge_Current Affairs (12)
• Government AllOther (4)
• Law AllOther (3)
• Tourism Hotel AllOther (2)
• Funny Interview Questions (1)
• Everything Else AllOther (7)
• English (4)
• General Aptitude (9)
• Puzzles (3)
• Placement Papers (2)
• CCNA (1)
• CISA Certification (2)
• ISTQB Certification (3)
• Certifications AllOther (3)
• H1B Visa (6)
• USA Student Visa F1 Visa (2)
• L1 Visa (4)
• USA Visitor Visa B2 Visa (1)
• USA Business Visa B1 Visa (3)
• USA Fiance Visa K1 Visa (1)
• USA Dependent Visa H4 Visa (1)
• C Code (1)
• C++ Code (5)