Question

Download Solution PDF

Given the following characteristics :

(i) Optimal substructure

(ii) Overlapping subproblems

(iii) Memorization

(iv) Decrease and conquer

Dynamic programming has the following characteristics :

This question was previously asked in
NIELIT Scientific Assistant CS 5 Dec 2021 Official Paper
Download PDF Attempt in App
View all NIELIT Scientific Assistant Papers >
  1. (i), (ii), (iv) 
  2. (i), (ii), (iii)
  3. (ii), (iii), (iv) 
  4. (i), (iii), (iv)

Answer (Detailed Solution Below)

Option 2 : (i), (ii), (iii)
Free Tests
View all Free tests >
Free
NIELIT Scientific Assistant Quantitative Aptitude Mock Test
20 Qs. 20 Marks 30 Mins
Start Now

Detailed Solution

Download Solution PDF
Download Solution PDF
Latest NIELIT Scientific Assistant Updates

Last updated on Jul 3, 2025

-> NIELIT Scientific Assistant answer key 2025 has been released at the official website. 

-> NIELIT Scientific Assistant admit card 2025 has been released. 

-> NIELIT Scientific Assistant city intimation slip 2025 has been released at the official website.

-> NIELIT Scientific Assistant exam 2025 is scheduled to be conducted on June 28. 

-> A total number of 113 revised vacancies have been announced for the post of Scientific Assistant in Computer Science (CS), Information Technology (IT), and Electronics & Communication (EC) streams.

-> Online application form, last date has been extended up to from 17th April 2025.

->The NIELT has revised the Essential Qualifications for the post of Scientific Assistant. Candidates must possess (M.Sc.)/ (MS)/ (MCA) / (B.E.)/ (B.Tech) in relevant disciplines.

 

-> The NIELIT Scientific Assistant 2025 Notification has been released by the National Institute of Electronics and Information Technology (NIELIT).

‹‹ Previous Ques
Next Ques ››
Exams Tests Super Practice

More Dynamic Programming Questions

Q1.The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is : (m and n are lengths of subsequences) 
Q2.Given the following characteristics : (i) Optimal substructure (ii) Overlapping subproblems (iii) Memorization (iv) Decrease and conquer Dynamic programming has the following characteristics :
Q3.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q4.A 0-1 knapsack problem has four items and knapsack capacity 11. The weight and profit of each item is given in below table. Pi (Rs.) 50 30 32 27    W = 11  Wi (Kg) 5 6 4 3 Which of the following greedy strategy gives the maximum profit?
Q5.Which of the following is the longest common subsequence of the sequences <h, i, n, d, u, i, s, t, a, n> and <i, n, d, i, a, n>?
Q6.The weight of a sequence a0, a1,…,an-1 of real numbers is defined as a0 + a1/2 + ......an-1 / 2n-1. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let X denote the maximum possible weight of a subsequence of a0, a1,..., an-1 and  Y the maximum possible weight of a subsequence of  a1, a2,..., an-1. Then X is equal to
Q7.Four matrices M1, M2, M3 and M4 of dimensions p × q, q × r, r × s and s × t respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ((M1 ×  M2) × (M3 × M4)), the total number of scalar multiplications is part rst+ prt. When multiplied as ((M1 ×  M2) × (M3 )× M4), the total number of scalar multiplications is pqr+ prs + pst . If p = 10, g = 100, r = 20, s = 5, and t = 80, then the minimum number of scalar multiplications needed is
Q8.An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0 : n - 1] is given below. Let Li denote the length of the longest monotonically increasing sequence starting at index i in the array. Initialize Ln-1 = 1 For all i such that 0 ≤ i ≤ n - 2 \(L_i=\left\{\begin{matrix}1+L_{i+1}&\rm if\ A[i]<A[i+1]\\\ 1&\rm otherwise\end{matrix}\right.\) Finally the length of the longest monotonically increasing sequence is Max (L0, L1, ... Ln-1). Which of the following statements is TRUE?
Q9.Match List I with List II List I List II (A) Topological sort of DAG (I) O(V + E) (B) Kruskal's MST algorithm (II) O(VE) (C) Bellman-Ford's single-source shortest path algorithm (III) θ (V + E) (D) Floyd-Warshall's all-pair   shortest path algorithm (IV) θ(V3)   Choose the correct answer from the options given below: 
Q10.Consider the following two sequences : X = < B, C, D, C, A, B, C > and Y = < C, A, D, B, C, B > The length of longest common subsequence of X and Y is :

More Algorithm Design Techniques Questions

Q1.In what manner is a state-space tree for a backtracking algorithm constructed ? 
Q2.The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is : (m and n are lengths of subsequences) 
Q3.Given the following characteristics : (i) Optimal substructure (ii) Overlapping subproblems (iii) Memorization (iv) Decrease and conquer Dynamic programming has the following characteristics :
Q4.Match the LIST-I with LIST-II LIST - I LIST - II A. Breadth First Search I. LISP B. Depth First Search II. Syntax tree C. Prefix III. Stack D. Infix IV. Queue Choose the correct answer from the options given below:
Q5.Which one of the following is not related to the feed forward networks on the Backpropagation Algorithm
Q6.Which of the following is not a divide and conquer method
Q7.Which one of the diagrams is used to start / stop in a flowchart?
Q8.Which of the following is/are NOT CORRECT statement? (A) The first record in each block of the data file is known as actor record. (B) Dense index has index entries for every search key value in the data file. (C) Searching is harder in the B+ tree than B- tree as the all external nodes linked to each other. (D) In extendible hashing the size of directory is just an array of 2d-1, where d is global depth. Choose the correct answer from the options given below:
Q9.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q10.2-3-4 trees are B - trees of order 4. They are isometric of _____ trees.
Suggested Test Series
View All >
NIELIT Scientific Assistant Mock Test 2025
83 Total Tests with 3 Free Tests
Start Free Test

More Algorithms Questions

Q1.The Highest Lower Bound on the number of Comparisons in the worst case for comparison-based sorting order of : 
Q2.In what manner is a state-space tree for a backtracking algorithm constructed ? 
Q3.Which open addressing technique is free from Clustering problems ?
Q4.Assume that P and NP are different i.e. P! = NP then for the expression NP-Complete ∩ P = ? Which among the following is correct ? 
Q5.The recurrence relation for binary search algorithm is : 
Q6.The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is : (m and n are lengths of subsequences) 
Q7.Given the following characteristics : (i) Optimal substructure (ii) Overlapping subproblems (iii) Memorization (iv) Decrease and conquer Dynamic programming has the following characteristics :
Q8.Which of the following is not a stable sorting algorithm ?
Q9.Match the LIST-I with LIST-II LIST - I LIST - II A. Breadth First Search I. LISP B. Depth First Search II. Syntax tree C. Prefix III. Stack D. Infix IV. Queue Choose the correct answer from the options given below:
Q10.Which one of the following is not related to the feed forward networks on the Backpropagation Algorithm
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
support@testbook.com
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti master downloadable content teen patti vip teen patti joy mod apk teen patti wink teen patti apk