Question 7 You are given a list of courses that are currently available in BRACU that looks like the following: courses = ['CSE110','CSE111','MAT620','CSE520','EI 61','CSE650','MAT510']. All courses till 400 level (499) are for the undergraduate students whereas any courses above 500 are for the graduate c masters students. Write a python program that creates a dictionary from the above list where the ke will be each department name (CSE,EEE,MAT for the above example) ar their values will be a dictionary of two keys Undergraduate Courses and Graduate Courses. Each key will have courses that fall in Undergraduate and Graduate level respectively.

Question 7 You are given a list of courses that are currently available in BRACU that looks like the following: courses = ['CSE110','CSE111','MAT620','CSE520','EI 61','CSE650','MAT510']. All courses till 400 level (499) are for the undergraduate students whereas any courses above 500 are for the graduate c masters students. Write a python program that creates a dictionary from the above list where the ke will be each department name (CSE,EEE,MAT for the above example) ar their values will be a dictionary of two keys Undergraduate Courses and Graduate Courses. Each key will have courses that fall in Undergraduate and Graduate level respectively.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Q_2 The English alphabet contains 5 vowels and 21 consonants. Find the number of 5-letter words (with or without any meaning) composed of 3 different consonants and 2 different vowels.
Q5. According to legend, the monks in a remote mountain monastery knew how to predict when the world would end. They had a set of three diamond needles. Stacked on the first diamond needle were 5 gold disks of decreasing size. The monks moved one disk to another needle each hour subject to the following rules. (CO01) • Only one disk could be moved at a time. • A Larger disk must never be stacked above a smaller one. • One and One auxiliary needle could be used for the intermediate storage of disks. The legend said that when all 5 disks had been transferred to the destination needle, the stars would be extinguished and the world would end.Solve the above problem using recursion and draw a step by step procedure till the disks are transferred from source to destination.
15.17 Circuits N and M have the state tables that follow. (a) Without first reducing the tables, determine whether circuits N and M are equivalent. (b) Reduce each table to a minimum number of states, and then show that N is equivalent to M by inspecting the reduced tables. So S₁ S₂ S3 M X = 0 S3 So So So 1 is in ii S₁ 0 S₁ 0 S₂ 1 S3 1 A To uot khi B с E N X = 0 EFEEBB B B 1 ABDCDU А с D T10000
6) Decryption (Substitution Cipher): The following is a substitution cipher. The letters are substituted randomly. Remember that this is a not shift cipher like the Caesar cipher. What does the following quote say? Who said it? Do this by hand. How long did it take you to decipher this message? D'Y JR EAWPD GTCTZ OTTA DYIRZBWGB, DB PRTJ KRYIADKWBT ADOT! TATWGRZ ZRRJTCTAB
13. ** ** *** *** **** **** ********** **** **** *** *** ** ** *
5.Do Asap please.
1) A+B A-B A*C Where A= 372 and B=156 Calculate the following pairs of octal numbers.
1.1-1 (1010), (100101), (10000001), 1.1-2 82, 109, 3433 1.1-3 Carry out the conversions in Exercises 1. 1-1 and 1.1-2 by converting first to octal form.
(3) 4. Find a Huffman code to store the string. AHUPUAA
1) G1[A]: A-› aABe | a В-›Вb | d check every non-terminal (A and B) 2) G2[A]: A-› baBε B-› Abb | a need to calculate, First (A-› baB)=? First (A-›ε)=? ,First (B-›…)=? 3) G3[S]:S->Aa |b A->SB B->ab , find first（S-》xxx），first set of each production .
16.3 What difference does the order of the two numbers a and b make when we calculate their greatest common divisor using the Euclidean algorithm?
1:19 Moodle P Flag question Use the encryption function f(p) = (p+ 6) mod 26 to find the cipher text for the message "ALL IS WELL" O FQQ NX BJQQ O EPP MW AIPP GRR OY CKRR O HSS PZ DLSS Your answer is incorrect. The correct answer is: GRR OY CKRR Finish review 1 Chapter 5 class notes -|| Jump to... Quiz navigation 1 2 3 4 7 8 II