Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 

This question was previously asked in
UGC NET Computer Science (Paper 2) 07 Dec 2023 Official Paper
Download PDF Attempt Online
View all UGC NET Papers >
  1. abcba
  2. abba
  3. abbbba
  4. adba

Answer (Detailed Solution Below)

Option 4 : adba
Free Tests
View all Free tests >
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
8.8 K Users
50 Questions 100 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

The correct answer is adba

EXPLANATION:

A palindromic subsequence is one that remains the same when reversed. The given string is "ababcdabba".

  • From this string:
    • "abcba" is a palindromic subsequence ('a', 'b', 'c', 'b', 'a').
    • "abba" is a palindromic subsequence ('a', 'b', 'b', 'a').
    • "abbbba" is not a palindromic subsequence. There are only two 'b's in the input string, and 'abbbba' would require at least four.
    • "adba" is not a palindromic subsequence. There is no 'd' in the input string.

Therefore, the non-palindromic subsequences are 3) abbbba and 4) adba.

Mistake Points Above question two correct answer and ugc also give both are correct answer.

Download Solution PDF
Latest UGC NET Updates

Last updated on Jun 6, 2025

-> The UGC NET Exam Schedule 2025 for June has been released on its official website.

-> The UGC NET Application Correction Window 2025 is available from 14th May to 15th May 2025.

-> The UGC NET 2025 online application form submission closed on 12th May 2025.

-> The June 2025 Exam will be conducted from 21st June to 30th June 2025

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

‹‹ Previous Ques
Next Ques ››

More Dynamic Programming Questions

Q1.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q2.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?
Q3.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>?
Q4.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
Q5.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
Q6.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?
Q7.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: 
Q8.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 :
Q9.Define Rn to be the maximum amount earned by cutting a rod of length n meters into one or more pieces of integer length and selling them. For i > 0, let p[i] denotes the selling price of a rod whose length is i meters. Consider the array of prices: p[1] = 1, p[2] = 5, p[3] = 8, p[4] = 9, p[5] = 10, p[6] = 17, p[7] = 18 Which of the following statements is/are correct about R7?

More Algorithm Design Techniques Questions

Q1.Which one of the diagrams is used to start / stop in a flowchart?
Q2.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:
Q3.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q4.2-3-4 trees are B - trees of order 4. They are isometric of _____ trees.
Q5.A. If some NP-complete problem P is in ℙ that ℙ = ℕℙ B. TSP is in ℕℙ C. SAT is in ℕℙ D. Hamilton circuit problem is not NP-complete Choose the correct answer from the options given below: 
Q6.A B-tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then maximum number of nodes that could be newly created in the process is
Q7.The total cost of retrieving records in sorted order using an unclustered B+ tree is (P-Average number of records per data page N-Data pages F-Ratio of the size of a data entry to the size of a data record) 
Q8.Match List I with List II LIST - I LIST - II A. Dijkstra's Algorithm I. Calculates path matrix B. Prim's Algorithm II. Stores minimum cost edge C. Warshall's Algorithm III. Stores the total cost from a source node to the current node D. Kruskal's algorithm IV. Finds Minimum Spanning Tree Choose the correct answer from the options given below: 
Q9.Circuit satisfiability problem: Given a Boolean combinatorial circuit composed of AND, OR and NOT gates, is it satisfiable? A one output Boolean combinatorial circuit is satisfiable means for the given inputs the output will be 1. A. The circuit satisfiability problem belongs to class NP B. The circuit satisfiability problem is at least as hard as any language in NP C. The circuit satisfiability is NP - Complete D. The size of the circuit is Θ(K2 + 1) E. If P ≠ NP, this situation would contradict the NP - Completeness of the problem. Choose the correct answer from the options given below:
Q10.The A* algorithm is optimal when, 

More Algorithms Questions

Q1.______ is a pictorial representation of solving a problem
Q2.Which one of the diagrams is used to start / stop in a flowchart?
Q3.Match the following: List I List II 1. Dijkstra's algorithm i. Backtracking 2. Merge sort ii. Dynamic programming 3. Traveling Salesman Problem (approximate) iii. Greedy algorithm 4. N-Queens Problem iv. Divide and conquer
Q4.Match the following Question: List I List II A. Insertion sort I. T(n) = 2T(n/2) + O(n) B. Heap sort II. T(n) = T(n/2) + k C. Merge sort III. T(n) = T(n − 1) + log2(n) D. Binary search IV. T(n) = T(n-1) + n
Q5.Adjacent elements are compared and swapped in ________ sorting technique.
Q6.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:
Q7.Which of the following is TRUE ? 
Q8.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q9.Which collision resolution technique involves maintaining a linked list of collided keys ? 
Q10.2-3-4 trees are B - trees of order 4. They are isometric of _____ trees.
Super Coaching
UGC NET Test Series
UGC NET Previous Year Papers
UGC NET Syllabus
UGC NET Books
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
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
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti game - 3patti poker teen patti classic teen patti master list teen patti tiger teen patti master update