Hi, I have baby(10 monthe old) and i want my mother as to be taken care of him with me. Is it possible to take my baby and my mother as dependent with me?
2001Dear Gurus, Can u please post some real time tickets with solutions and what are the different tools used in Support SD consultant and their team size
1811Roads concatenation Problem
Consider we have some GIS (Geo Information System) operating
over some road network. Each road represented as array of
two-dimensional geographical points. Road network is a set
of roads.
System has function called Concatenate(). This function
takes raw road network and should return optimized road
network. Optimization lies in concatenating roads with
matching start or end points, i.e. if road AB end point
matches road BC start point, then optimized network should
contain concatenated road AC. Optimized network shouldn’t
contain two roads which can be concatenated.
Your task is to suggest set of test cases for Concatenate()
function in order to make sure it works correctly.
public interface IPoint
{
double Lat { get; }
double Lon { get; }
}
public Road : List
Write a program to replace n bits from the position p of the bit representation of an inputted character x with the one's complement. Method invertBit takes 3 parameters x as input character, p as position and n as the number of positions from p. Replace n bits from pth position in 8 bit character x. Then return the characters by inverting the bits.
3683In cryptography, you could often break the algorithm if you know what was the original (plain) text that was encoded into the current ciphertext. This is called the plain text attack. In this simple problem, we illustrate the plain text attack on a simple substitution cipher encryption, where you know each letter has been substituted with a different letter from the alphabet but you don’t know what that letter is. You are given the cipherText as the input string to the function getwordSets(). You know that a plain text "AMMUNITION" occurs somewhere in this cipher text. Now, you have to find out which sets of characters corresponds to the encrypted form of the "AMMUNITION". You can assume that the encryption follows simple substitution only. [Hint: You could use the pattern in the "AMMUNITION" like MM occurring twice together to identify this]
1950IBM QUESTION As all we know PE takes the SQL Request and it will give responce for that query. what is the internal process happening.how it is taking that sql from the system????? thanks in Advance
2 7677At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
1725At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E .. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E, .]. Each Car will load the packet with the same alphabet. So, for example, car A will load all the packets with name A. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car B will come and take all the packets with name B from the shelf, then car C will come. No matter how deep in the shelf any packet B is, all of the B packets will be displaced before the C car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
1804Post New Infosys Interview Questions
What is PL/SQL ?
What are the default margins in word?
What are the different documents needed for shipment of goods? Explain.
Explain the properties of session object?
What is hash table in c?
What is public, protected, private in c++?
How does turbine work?
Compare Grouping and Nesting in CSS ?
What are the different project types you can implement in sap solman?
What is thin driver in jdbc?
Can xml be used for multimedia purpose?
What are the different types of luws?
Are you willing to work irrespective of your domain and field of expertise?
How out of step protection relay works?
What is the difference between goback, stop run and exit program in cobol?