Discussion
Home ‣ Technical Questions ‣ Software Testing Comments
- Question
Unreachable code would best be found using
Options- A. code inspections
- B. a static analysis tool
- C. code reviews
- D. a test management tool
- Correct Answer
- code reviews
ExplanationCode review is a software quality assurance activity in which one or several humans check a program mainly by viewing and reading parts of its source code, and they do so after implementation or as an interruption of implementation.
- 1. In HTML, ___________ tag is used to construct drop-down list boxes and scrolling list boxes.
Options- A.
- B.
- C.
- 2. Undefined reference to 'pthread_create' How to Fix this error? Discuss
- 3. What would be the output of the following program assuming that the array beigns at location 1002? main() { int a[3][4] = { 1 , 2 , 3 , 4 5, 6 , 7, 8 9, 10 , 11, 12 }; Printf ("\n%u %u %u", a[0] + 1, *( a[0] + 1), *( *(a + 0) + 1) ); } Discuss
- 4. Indicate what would the SWAP macro be expanded to on preprocessing. Would the code compile? #define SWAP (a, b, c ) (c t; t = a, a = b, b = t; ) main() { int x = 10, y = 20; SWAP (x, y, int ); printf ( " %d%d ", x, y); } Discuss
- 5. Will the following function work? f1 ( int a, int b ) { return ( f2 (20) ); } f2 ( int a ) { return ( a * a ); } Discuss
- 6. What is "bug leakage?" and what is "bug release?" Discuss
- 7. main() { float me = 1.1; double you = 1.1; if(me==you) printf("yes"); else printf("No"); }
Options- A. Yes
- B. No
- C. Both
- D. Compilation error Discuss
- 8. Which is the simplest file structure?
Options- A. Sequential
- B. Indexed
- C. Random
- D. None Discuss
- 9. Of the following tree structure, which is, efficient considering space and time complexities?
Options- A. Incomplete Binary Tree
- B. Complete Binary Tree
- C. Full Binary Tree
- D. None Discuss
- 10. Statement coverage will not check for the following
Options- A. Dead Code
- B. Unused Statement
- C. Missing Statements
- D. Unused Branches Discuss
Software Testing problems
Search Results
Correct Answer: <SELECT>
Correct Answer: This is a common error while compiling C program in Linux This error occurs when you are using pthread_create function to create threads in your programs To fix this problem ensure following points: Include header file pthreadh in your program Add ?lpthread linker flag with compilation command 1- Include Header file #include
Correct Answer: 1004 2 2
Correct Answer: ( int t ; t = a, a = b, b = t ;); This code won't compile since declaration of t cannot occur within parentheses
Correct Answer: Yes
Correct Answer: A bug leakage results when a bug is detected which should have been detected in earlier builds/versions of the application A defect which exists during testing yet unfound by the tester which is eventually found by the tester/end-user is also called bug leakage A bug release is when a particular version of s/w is released with a set of known bug(s)/defect(s) These bugs are usually low severity and/or low priority bugs It is done when the company can afford the existence of bug in the released s/w rather than the time/cost for fixing it in that particular version These bugs are usually mentioned in the Release Notes
Correct Answer: No
Explanation:
For floating point numbers (float, double, long double) the values cannot be predicted exactly. Depending on the number of bytes, the precession with of the value represented varies. Float takes 4 bytes and long double takes 10 bytes. So float stores 0.9 with less precision than long double.
Correct Answer: Sequential
Explanation:
Sequential is the simplest file structure
Correct Answer: Complete Binary Tree
Explanation:
Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.
Correct Answer: Missing Statements
Explanation:
Statement coverage is a white box test design technique which involves execution of all the executable statements in the source code at least once. It is used to calculate and measure the number of statements in the source code which can be executed given the requirements.
Comments
There are no comments.