You are given an nxn matrix. Find if it has a visual 'envelope' pattern. First input is n, remaining numbers are the binary matrix content. Result should be 1 or 0 (envelope or not, respectively). By envelope, we mean, boundary, diagonal and anti-diagonal are set to 1, others are set to 0. You should use at most 6 loops (utilize functions), otherwise there may be grade reductions. You solution should work for any n; it should be generalizable. So, use malloc to allocate multi-dimensional array. If the input is 5 11111 11011 10101 11011 11111 the result should be 1 If the input is 5 10101 11011 10101 11010 10111 the result should be 0 (boundaries are not set to 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
Type of work: Individual work
You are given an nxn matrix. Find if it has a visual 'envelope' pattern. First input is n, remaining numbers are the binary matrix content. Result should be 1 or 0 (envelope or not, respectively).
By envelope, we mean, boundary, diagonal and anti-diagonal are set to 1, others are set to 0. You should use at most 6 loops (utilize functions), otherwise there may be grade reductions. Your
solution should work for any n; it should be generalizable. So, use malloc to allocate multi-dimensional array. If the input is
11111
11011
10101
11011
11111
the result should be 1
If the input is
5
10101
11011
10101
11010
10111
the result should be 0 (boundaries are not set to 1).
1
0 0 0
Below are the examples of diagonal and anti-diagonal of a matrix. 0
1
0 0 1
1
1
0 0 0
1
1
Transcribed Image Text:Type of work: Individual work You are given an nxn matrix. Find if it has a visual 'envelope' pattern. First input is n, remaining numbers are the binary matrix content. Result should be 1 or 0 (envelope or not, respectively). By envelope, we mean, boundary, diagonal and anti-diagonal are set to 1, others are set to 0. You should use at most 6 loops (utilize functions), otherwise there may be grade reductions. Your solution should work for any n; it should be generalizable. So, use malloc to allocate multi-dimensional array. If the input is 11111 11011 10101 11011 11111 the result should be 1 If the input is 5 10101 11011 10101 11010 10111 the result should be 0 (boundaries are not set to 1). 1 0 0 0 Below are the examples of diagonal and anti-diagonal of a matrix. 0 1 0 0 1 1 1 0 0 0 1 1
Expert Solution
steps

Step by step

Solved in 4 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