Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Topic :: Ear





Ear Interview Questions
Questions Answers Views Company eMail

Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

1 4084

 Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

1 4909

Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution

1 2277

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False

1 2066

One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution

1 2173

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

1 3991

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False

1 2014

____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

1 4000

A 4-input neuron has weights 1, 2, 3 and 4. The transfer function is linear with the constant of proportionality being equal to 2. The inputs are 4, 10, 5 and 20 respectively. The output will be: a) 238 b) 76 c) 119 d) 123

1 11312

Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex binary operation that cannot be solved using neural networks c) Because it can be solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

1 8286

. Why are linearly separable problems of interest of neural network researchers? a) Because they are the only class of problem that network can solve successfully b) Because they are the only class of problem that Perceptron can solve successfully c) Because they are the only mathematical functions that are continue d) Because they are the only mathematical functions you can draw

1 8974

Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. a) True – this works always, and these multiple perceptrons learn to classify even complex problems. b) False – perceptrons are mathematically incapable of solving linearly inseparable functions, no matter what you do c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded d) False – just having a single perceptron is enough

1 4768

What is meant by asset clearance . how should i make my entries in tally

1 1738

what are the measuring instrument used to measure Radial and axial clearances of the gas turbine?

1 3313

Design a shear wall of length 4.20 m and thickness of 250mm subjected to the following forces.Assume Fck = 25Mpa and Fy = 415Mpa and the wall is a high wall with central part 3440mm x 250mm and two 380mm x 760mm strong bands at each end with following loading. S.No.       Loading        Axial force      Moment     Shear 1               DL+LL          1950              600            20 2           Seismic load       250              4800          700

L&T,

1 2054




Un-Answered Questions { Ear }

What's happening in the news right now, both in your country and abroad? Where did you hear about it?

2556


How much do you get paid in a year?

2430


hi gurus , plz can anybody forward ur cv of accounts/finance related , exp of 4+ years to afreenjuveriya@yahoo.com

2415


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.

3981


hi, i am appearing in HPCL(CIVIL ENGG.)exam. plz send me placement paper of this exam if u are having

2597


sir,,,, iam appearing in hpcl exam....so plz send previous papers to me of hpcl... anant

2225


Hi Dear this urgent for me i have need of ROLTA India Ltd Mumbai Paper pattern for Testing Person , PLease Help me , if any body have any idea about it

4140


I am in .Net development for past 3.5 years and want to enter in to automated testing and learn QTP. For this I need some good tutorial for beginners. I will be really greatful if any one has and they can send it to me on this address- ruchidureja@gmail.com

2060


please send me latest & previous years question papers for IOCL Technical level questions

1950


Can any one please tell me which is the best institute in Bangalore to learn QA (crash course)? Thanks

2025


can anybody send the project you have tested with the clear descriptions,and recent bugs u found in that

2218


Hi guys,I have 3+ years of exp in manual testing in a bangalore based MNC company.I Like to jump in chennai.So please if u know any jobs in chennai firms please let me know in my email-id. anbarasu2k@rediffmail.com. cheers, anbarasu.

2063


Hi Friends, This is Chennamsubbaraidu.i Have 2+ Years Realtime Exp in Manual Testing.Am Looking to Shift From My Present Company.Please if u Have Any Openings in Your Company's, Please Let Me Know.Any Location Prefer.Thanks.

1916


dear sir pls send me rrb jr.engineer previous question papper to this email id:snap272@gmail.com

2233


HI FRNDS, I HAVE 2.5 years OF exp In Manual Testing,Plz let me know if thr r any oppurtunities in any company in Bangalore ID:dsnithi@gmail.com Thanks in Advance

2269