The document contains details about an assignment for a Discrete Structures course. It includes 6 problems covering topics like sums, graphs, passwords, words, and recurrence relations.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
19 views2 pages
School of System and Technology: Assignment-4
The document contains details about an assignment for a Discrete Structures course. It includes 6 problems covering topics like sums, graphs, passwords, words, and recurrence relations.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2
School of System and Technology
Department of Computer Science
Course Code: CC1041 Semester: 2nd Title: Discrete Structures Total Marks: 10 Resourse Person: Dr. Saeed Ahmed Student Name: Student ID: Due: June 30, 6:00 p.m. Assignment-4 3 2
1. Find the value of the sum: 3i j .
i 0 j 2 2. Find out the degree of each vertex, adjacency list and adjacency matrix of the given graph.
3. Find out the degree (both in-degree and out-degree) of each vertex, adjacency list and adjacency matrix of the given graph.
4. In a website, users need to create passwords for their accounts. The
password must be four to six characters long. Each character must be a lowercase letter or a digit. Each password must contain at least one digit and one lowercase letter. How many possible passwords are there? 5. In a group of n words, there are 3 words starts with the same letter. What is the smallest value of n that guarantees this property? 6. Find a solution for the following recurrence and prove it using strong induction. a0 = 2 a1 = 6 an = an−1 + 6an−2 1