NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 503 - 506 of 2012
Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.
Rs. 550.00 or
How to register?
Question number: 503
» Programming Languages » HTML
Appeared in Year: 2012
Question
Match the following with respect to HTML tags and usage. (December Paper III)
| List-Ⅰ (HTML Tags) | List-Ⅱ (Usage) |
|---|---|
| (A) CITE | (i) Argument to a programme |
| (B) SAMP | (ii) Represents to other source |
| (C) VAR | (iii) Represents output from programmes |
| (D) EM | (iv) Italic representation |
Choices
| Choice (4) | Response | |
|---|---|---|
| ||
| a. |
|
|
| b. |
|
|
| c. |
|
|
| d. |
|
|
Question number: 504
» Linear Programming Problem » LPP Standard Form, LPP in Canonical Form
Appeared in Year: 2012
Question
If dual has an unbounded solution, then its corresponding primal has (December Paper III)
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | no feasible solution |
|
| b. | unbounded solution |
|
| c. | feasible solution |
|
| d. | Question does not provide sufficient data or is vague |
|
Question number: 505
» Neural Networks and AI » Application
Appeared in Year: 2012
Question
A crypt arithmetic problem of the type
Can be solved efficiently using (December Paper III)
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | Depth first technique |
|
| b. | Breadth first technique |
|
| c. | Constraint satisfaction technique |
|
| d. | Bidirectional technique |
|
Question number: 506
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2012
Question
Let be the function defined by which of the following is TRUE? (December Paper III)
Choices
| Choice (4) | Response | |
|---|---|---|
| a. |
|
|
| b. |
|
|
| c. |
|
|
| d. |
|
|