1.group by clause explain along with an example
- 1 Answers
- 4981 Views
- Parexel, I also Faced
- E-Mail Answers
Answer / guest
The GROUP BY clause will gather all of the rows together
that contain data in the specified column(s) and will allow
aggregate functions to be performed on the one or more
columns.
| Is This Answer Correct ? | 9 Yes | 0 No |
What is the difference between DECISION COVERAGE(DC) and MODIFIED CONDITION/DECISION COVERAGE(MCDC)?
Outline the two important features of a terminating recursion. Any ideas?
1.) - Design the class model and produce a class diagram for a set of vehicle types for a vehicle manufacturer. At a minimum, the class model should include the following information: - Type of vehicle (e.g. sedan, truck, etc), - Number of seats - Number of doors - Color of the vehicle - Transmission type (auto vs manual) - Engine’s rated horsepower - Number of engine cylinders - Engine size (in liters) - Number of stereo speakers - Does it include satellite radio? - Does it have a CD player? (and if so, how many CDs can it hold?) - Is it front, rear, all, or 4 wheel drive? - Truck bed type (e.g. short, standard, long) - Trunk size (for those vehicle types that have a trunk) 2.) I want to create an in-memory definition for a set of airline routes for a small airline company. I want to maintain a list of all of my planes and their current locations (or their destination location if they are currently in the air). One of the possible locations needs to be “hangar” for maintenance or repairs. I want to have the full airline schedule available so that I can look for available flights. I also want to store information on which planes are operating each schedule. Assuming that a customer comes to the ticketing counter at one of my airports when it opens at 6:00am, I want to be able to give a customer the fastest option to get from one airport to another. Keep in mind that it may take more than one flight to get from one airport to another. Describe how you would fulfill this request with your design. 3.) I want to create a course registration database for a university. I want to store information for each department, information for each course (including which department they’re offered under as well as which professors are teaching them), information for each professor, and the list of the registered students and which courses each student has registered for. Keep in mind that an instance of a course could be taught by multiple instructors (i.e. one instructor for the first half of the course and then a different instructor for the second half). Also keep in mind that there could be multiple instances of a given course offered by different sets of instructors (e.g. offered by Bob Smith on Mondays & Wednesdays at 10am and Bill Jones on Tuesdays & Thursdays at 1pm). Design a set of database tables to store this information. 4.) Given the following: You have an application that consists of three parts: a front end GUI, a middle-ware layer where all the processing of data takes place and a database where data is read from. What are the areas that would be most likely to break? What would your testing strategy for this be? Why? 5.) Imagine I am handing you a wine glass and I ask you to test it. What would your testing strategy for this be?
what is the current salary package in India for a lamp programmer
What is meant by STACK?
given a height balanced tree. If we add one more node , how many nodes gets unbalanced ?
In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 ≤ i0 <i1….< ik-1 ≤ n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.
How can you incorporate a Datawindow to a Oracle8i stored procedure?
what is the diffrence between software and hardware language?
Busy waiting is a method whereas a taskwaits for a given event by continiously checking for an event to occur. What is the main problem with this approach
5. How do you round the addition or subtraction of two numbers in assembler?
what is difference between c and C#
C 
