MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 49 Mcqs, each offering curated multiple-choice questions to sharpen your Bechtel knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which one of the following statement about HTTP is false? |
| A. | It can be used to test the validity of a hypertext links |
| B. | It allows information to be stored in a URL |
| C. | It runs over TCP protocol |
| D. | It describes the structure of web pages |
| Answer» E. | |
| 2. |
_____________ indicates a correct association of the three commands PROMPT, HEAD and RCPT with protocols where these are used. |
| A. | FTP, HTTP, SMTP |
| B. | HTTP, FTP, SMTP |
| C. | SMTP, HTTP, FTP |
| D. | HTTP, SMTP, FTP |
| Answer» B. HTTP, FTP, SMTP | |
| 3. |
The objects that can be used in expression and scriplets in JSP without explicitly declaring them is |
| A. | Response and session only |
| B. | Session and request only |
| C. | Request and response only |
| D. | Session, request and response |
| Answer» C. Request and response only | |
| 4. |
We have an HTML form that is to be designed to enable purchase of office stationary. For the items that are selected mark it with check. Submit button is to be pressed ones the credit card details are filled. Assuming that security is handled in a way that is transparent to the form design, the option that would be appropriate for sending the data to the server is |
| A. | Only POST |
| B. | Only GET |
| C. | Either GET or POST |
| D. | Neither GET nor POST |
| Answer» D. Neither GET nor POST | |
| 5. |
Out of the four test cases, the test cases that will be successful in exposing the flaw if array p is made to hold the string abcde is |
| A. | Only IV |
| B. | II and IV |
| C. | III and IV |
| D. | I and III |
| Answer» D. I and III | |
| 6. |
If the tester carries out the testing of the program on all input strings of five characters a, b, c, d and e with duplicates allowed using these test cases, the number of test cases that will be able to capture the flaw is |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | All 4 |
| Answer» C. 3 | |
| 7. |
A software for digital signal processing which is expected to have 40000 lines of code needs to be developed by a company. This software is to be developed using the basic COCOMO model and for this the company needs to determine the effort in person-months. For the software development on the embedded system, the multiplicative factor for this model is 2.8 and the exponentiation factor is 1.20. The estimated effort in person month is |
| A. | 287.47 |
| B. | 950.35 |
| C. | 234.25 |
| D. | 122.5 |
| Answer» D. 122.5 | |
| 8. |
Out of the options given below the one, which is not a client server application is |
| A. | Ping |
| B. | |
| C. | Web browsing |
| D. | Internet chat |
| Answer» B. E-mail | |
| 9. |
For the good software requirement specifications (SRS) document |
| A. | Goals of implementation are not desired. |
| B. | Algorithm for software implementation is not desired |
| C. | Non-functional requirements are not desired |
| D. | Functional requirements are not desired |
| Answer» C. Non-functional requirements are not desired | |
| 10. |
In some programming language, L denotes the set of letters and D denotes the set of digits. An identifier is permitted to be a letter followed by any number of letters or digits. The expression that defines an identifier is |
| A. | (L.D)* |
| B. | (L + D)* |
| C. | L (L.D) |
| D. | L (L + D)* |
| Answer» E. | |
| 11. |
S->xx W {print”1”} S->y {print”2”} W->Sz {print”3”} A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar. Using the syntax directed translation scheme described by the above rule, the translation of xxxxyzz is |
| A. | 11231 |
| B. | 11233 |
| C. | 23131 |
| D. | 33211 |
| Answer» D. 33211 | |
| 12. |
We have two sets of LR (1) items of LR (1) grammar described below. X->c.X, c/d X->c.X, $ X->.cX, c/d X->.cX, $ X->.d, c/d X->.d, $ Related to the merging of two sets in the corresponding parser, the statement that does not hold true is |
| A. | Cannot be merged since look aheads are different. |
| B. | Cannot be merged but will result in R-R conflict |
| C. | Cannot be merged but will result in S-R conflict |
| D. | All of the above |
| Answer» E. | |
| 13. |
What information need to be included in an object module, if a linker is given object modules for a set of programs that were compiled separately? |
| A. | Names and locations of all external symbols defined in the object module |
| B. | Object code |
| C. | Absolute addresses of internal symbols |
| D. | Relocation bits |
| Answer» D. Relocation bits | |
| 14. |
When is the type checking usually done? |
| A. | During syntax directed translation |
| B. | During lexical analysis |
| C. | During code optimization |
| D. | During syntax analysis |
| Answer» B. During lexical analysis | |
| 15. |
The languages that need heap allocation in the runtime environment are |
| A. | Those that use global variables |
| B. | Those that use dynamic scoping |
| C. | Those that support recursion |
| D. | Those that allow dynamic data structure |
| Answer» E. | |
| 16. |
We have the grammar E->E + n I E x n I n. The handles in the right-sentential form of the reduction for a sentence n + n x n are |
| A. | n, n + n and n + n x n |
| B. | n, E + n and E x n |
| C. | n, E + n and E + E x n |
| D. | n, E + n and E + n x n |
| Answer» C. n, E + n and E + E x n | |
| 17. |
Assume that no other optimization other than optimizing register allocation is applied. To compile this code segment without any spill to memory the minimum number of registers needed in the instruction set architecture of the processor is |
| A. | 3 |
| B. | 6 |
| C. | 4 |
| D. | 5 |
| Answer» D. 5 | |
| 18. |
Only two registers are available in the instruction set architecture of the processor. The code motion moves the statements from one place to another while preserving correctness. The only allowed complier optimization is code motion. In the compiled code, the minimum number of spills to memory is |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» B. 1 | |
| 19. |
We have a grammar with not epsilon and unit production (i.e. of type A->ε and A ->a) to parse a string, with n tokens. What is the maximum number of reduces moves that can be taken by a bottom-up parser for this grammar? |
| A. | 2n - 1 |
| B. | 2n |
| C. | n-1 |
| D. | n/2 |
| Answer» B. 2n | |
| 20. |
Which one of the following statement is false for the SLR (1) and LALR (1) parsing tables for a context free grammar? |
| A. | The reduce entries in both the tables may be different |
| B. | The error entries in both the tables may be different |
| C. | The go to part of both tables may be different |
| D. | The shift entries in both the tables may be identical |
| Answer» D. The shift entries in both the tables may be identical | |
| 21. |
Consider the grammar where P, Q, R are not terminals and r, s, t are terminals a. P->Q R b. P->Q s R c. P->ε d. P->Q t R r The grammar rules that violate the requirements of an operator grammar is |
| A. | a and c only |
| B. | b and c only |
| C. | a and d only |
| D. | a only |
| Answer» B. b and c only | |
| 22. |
In compilers generation of intermediate code based on an abstract machine model is useful because |
| A. | Syntax-directed translations can be written for intermediate code generation |
| B. | To generate code for real machines directly from high-level language programs is not possible |
| C. | Portability of the front end of the compiler is enhanced |
| D. | Implementation of lexical and syntax analysis is easier |
| Answer» E. | |
| 23. |
For the C program given below the statement that does not hold true is for (i = 0; ifor(j = 0; jif (i%c) { x += (4*j+5*i); y+=(7+4*j); } } } |
| A. | There is a scope strength reduction |
| B. | There is a scope of dead code elimination |
| C. | There is a scope of common sub-expression elimination |
| D. | None of the above |
| Answer» C. There is a scope of common sub-expression elimination | |
| 24. |
What is the output of the following program? Char m[ ] = “HATE 2020” Char *a = x; Printf (“%s”, a + a[3] – a[1]); |
| A. | E2020 |
| B. | 2020 |
| C. | HATE 2020 |
| D. | 020 |
| Answer» B. 2020 | |
| 25. |
Consider an empty binary search tree into which the following numbers are inserted in the given order: 10,1, 3, 5, 15, 12, 16. The height of the maximum distance of a leaf node from the root is |
| A. | 2 |
| B. | 4 |
| C. | 3 |
| D. | 8 |
| Answer» D. 8 | |
| 26. |
Once the valid 3-ary heap is found from question 18, the elements 7, 2, 10 and 4 are inserted in that order into this 3-ary heap. The sequence of items in the array representing the resultant heap is |
| A. | 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 |
| B. | 10, 7, 9, 8, 3, 1, 5, 2, 6, 4 |
| C. | 10, 9, 4, 5, 7, 6, 8, 2, 1, 3 |
| D. | 10, 8, 6, 9, 7, 2, 3, 4, 1, 5 |
| Answer» C. 10, 9, 4, 5, 7, 6, 8, 2, 1, 3 | |
| 27. |
The valid sequence of elements in an array representing 3-ary max heap is |
| A. | 9, 5, 6, 8, 3,1 |
| B. | 9, 6, 3, 1, 8,5 |
| C. | 9, 3, 6, 8, 5,1 |
| D. | 1, 3, 5, 6, 8,9 |
| Answer» B. 9, 6, 3, 1, 8,5 | |
| 28. |
When the function max is called as max (513, 2) the return value will be |
| A. | 2 |
| B. | 1 |
| C. | 7 |
| D. | 6 |
| Answer» C. 7 | |
| 29. |
The logic programming languages and functional languages have the common properties that |
| A. | Both use Horn-clauses |
| B. | Both are declarative |
| C. | Both are procedural languages |
| D. | Both are based on ?-calculus. |
| Answer» C. Both are procedural languages | |
| 30. |
Consider a stack S of size n ≥ 1 which is initially empty. In an empty stack first n natural numbers are pushed in sequence and then n pop operations are performed. Push and pop operations take x seconds each. The time elapse between the end of one stack operation and the start of the next operation is y. For m ≥ 1, define the stack-life of m as the time elapsed from the end of push (m) to the start of the pop operation that removes m from stack S. What is the average stack-life of an element of this stack? |
| A. | 3y + 2x |
| B. | n (x + y) - x |
| C. | n (x + y) |
| D. | y + 2x |
| Answer» C. n (x + y) | |
| 31. |
To check whether an arithmetic expression has balanced parenthesis, the best data structure that can be used is |
| A. | Stack |
| B. | Tree |
| C. | List |
| D. | Queue |
| Answer» B. Tree | |
| 32. |
What is the goal of structured programming? |
| A. | Able to infer the flow of control from the program text |
| B. | Able to infer the flow of control from the Compiled code |
| C. | To avoid the use of GOTO statements |
| D. | None of the above |
| Answer» B. Able to infer the flow of control from the Compiled code | |
| 33. |
On the correct answer to the previous question, the content of the array after two delete operations is |
| A. | {14, 13, 8, 12, 10} |
| B. | {14, 13, 12, 10, 8} |
| C. | {14, 12, 13, 8, 10} |
| D. | {14, 13, 12, 8, 10} |
| Answer» E. | |
| 34. |
The array that represents a binary max-heap is |
| A. | {25, 12, 16, 13, 10, 8, 14} |
| B. | {25, 14, 16, 13, 10, 8, 12} |
| C. | {25, 14, 12, 13, 10, 8, 16} |
| D. | {25, 14, 13, 16, 10, 8, 12} |
| Answer» C. {25, 14, 12, 13, 10, 8, 16} | |
| 35. |
Consider a C variable declaration int *i[10], j[10][10]; Which one of the following expression if used as left hand sides of assignment statements will not give compile time? |
| A. | i[5] |
| B. | i[1][2] |
| C. | j[2][3] |
| D. | j[6] |
| Answer» D. j[6] | |
| 36. |
What is the output of the following program? Int f (int a, int *pb, int **ppc) { int b, c; **ppc += 1; c = *ppc; *pb += 2; b = *pb; a += 3; return a + b + c; } void main() { int z, *y, **x, z = 4; y = &z; x = &y; printf (“%d”, f (z, y, x)); } |
| A. | 19 |
| B. | 18 |
| C. | 22 |
| D. | 24 |
| Answer» B. 18 | |
| 37. |
Consider a program that reads 500 integers in the range of [0, 100] that represents the score of 500 students. Frequency of each score above 50 is then printed. For the program to store the frequencies the best way is |
| A. | A dynamically allocated array of 550 numbers |
| B. | An array of 100 numbers |
| C. | An array of 500 numbers |
| D. | An array of 50 numbers |
| Answer» E. | |
| 38. |
The size of modular bricks, is |
| A. | 22.5 x 10 x 8.5 cm |
| B. | 19 x 9 x 9 cm |
| C. | 10 x 10 x 9 cm |
| D. | 22.5 x 8.0 x 9 cm |
| Answer» C. 10 x 10 x 9 cm | |
| 39. |
The point of contraflexture occurs in |
| A. | cantilever beams only |
| B. | over hanging beams only |
| C. | Fixed beams only |
| D. | both (a) and (b) |
| Answer» C. Fixed beams only | |
| 40. |
The time required to close a valve gradually is (where L is the length of pipe and C = velocity of pressure wave) |
| A. | 4L/C |
| B. | > 2L/C |
| C. | >4L/C |
| D. | 2L/C |
| Answer» C. >4L/C | |
| 41. |
If the volume of a liquid weighing 3750 kg is 5 cubic metres, 0.75 is its |
| A. | specific gravity |
| B. | specific mass |
| C. | specific weight |
| D. | none of these. |
| Answer» B. specific mass | |
| 42. |
The steel generally used in R.C.C. work, is |
| A. | Stainless |
| B. | Alloy steel |
| C. | high carbon steel |
| D. | Mild steel |
| Answer» E. | |
| 43. |
The maximum area of tension reinforcement in beams shall not exceed |
| A. | 0.75% |
| B. | 1% |
| C. | 4% |
| D. | 2.5% |
| Answer» D. 2.5% | |
| 44. |
What does gets and puts operate on ? |
| A. | stdin and stdout |
| B. | stderr |
| C. | files |
| D. | Nothing |
| Answer» B. stderr | |
| 45. |
For a typical C program, the input is taken using. |
| A. | scanf |
| B. | cin |
| C. | Command-line |
| D. | None of the mentioned |
| Answer» E. | |
| 46. |
What is the scope of local variable ? |
| A. | inter program |
| B. | local |
| C. | inside main() |
| D. | None of these |
| Answer» C. inside main() | |
| 47. |
Which of the following class access protected and private members of other class? |
| A. | Friend class |
| B. | Virtual class |
| C. | Main class |
| D. | None of these |
| Answer» B. Virtual class | |
| 48. |
A Pixel is _________ |
| A. | A computer program that draws picture |
| B. | A picture stored in secondary memory |
| C. | The smallest resolvable part of a picture |
| D. | None of these |
| Answer» D. None of these | |
| 49. |
Which of the following is the programs that is used to find out possible faults and their causes? |
| A. | Operating system extensions |
| B. | Cookies |
| C. | Diagnostic software |
| D. | Boot diskettes |
| Answer» D. Boot diskettes | |