Write an efficient algorithm for the following problem, and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem: Binary Array Core Input: Two integers p and q and a binary array A[1...n], i.e., each entry contains either a 0 or 1.  Output: Print Yes - if there exists a subarray A[i...k], where 1<= i < k <= n, with exactly p zeros in A[1...i-1] (there may be 1s) and exactly q ones in A[k+1...n] (there may be 0s). Print No - otherwise.   Outputs with examples Input: A = [0,1,1,0,1], p = 2, q =1, Output:  No.    Input: A = [0, 1,1,0, 0,1,0,1], p = 1, q =1, Output:  Yes because we can have A[1...i-1] = [0] and A[k+1 ... n] = [0,1,0,1]

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Write an efficient algorithm for the following problem, and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm.

Problem: Binary Array Core

Input: Two integers p and q and a binary array A[1...n], i.e., each entry contains either a 0 or 1. 

Output: Print Yes - if there exists a subarray A[i...k], where 1<= i < k <= n, with exactly p zeros in A[1...i-1] (there may be 1s) and exactly q ones in A[k+1...n] (there may be 0s). Print No - otherwise.

 

Outputs with examples

Input: A = [0,1,1,0,1], p = 2, q =1, Output:  No.   

Input: A = [0, 1,1,0, 0,1,0,1], p = 1, q =1, Output:  Yes because we can have A[1...i-1] = [0] and A[k+1 ... n] = [0,1,0,1]

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY