1. Write a Python code which takes a sequence of comma-separated four-digit binary numbers as an input, and prints their corresponding decimal values as well as sorted comma-separated four-digit binary numbers (ascending order). Sample Run 1 Enter a sequence: 1101,0011,1001,0001,0110,1100 Decimal values: [13, 3, 9, 1, 6, 12] 0001,0011,0110,1001,1100,1101 Sorted sequence: Sample Run 2 Enter a sequence: 1101,0010,0110 Decimal values: [13, 2, 6] 0010,0110,1101 Sorted sequence: Hints: Take binary numbers (separated by comma) and put them into a list For each binary number, find its decimal value and store in the list. From a list of decimal values, copy a list and sort it. For each element in the list of sorted decimal values, find its index in the list of decimal values (before sorting. With that index, you should be able to get the right binary sequence.

1. Write a Python code which takes a sequence of comma-separated four-digit binary numbers as an input, and prints their corresponding decimal values as well as sorted comma-separated four-digit binary numbers (ascending order). Sample Run 1 Enter a sequence: 1101,0011,1001,0001,0110,1100 Decimal values: [13, 3, 9, 1, 6, 12] 0001,0011,0110,1001,1100,1101 Sorted sequence: Sample Run 2 Enter a sequence: 1101,0010,0110 Decimal values: [13, 2, 6] 0010,0110,1101 Sorted sequence: Hints: Take binary numbers (separated by comma) and put them into a list For each binary number, find its decimal value and store in the list. From a list of decimal values, copy a list and sort it. For each element in the list of sorted decimal values, find its index in the list of decimal values (before sorting. With that index, you should be able to get the right binary sequence.

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

. Write a program in C to convert a binary number into a decimal number without using array, function and while loop. Test Data :Input a binary number :1010101Expected Output :The Binary Number : 1010101The equivalent Decimal Number : 85
As input, enter two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary (maybe sequence-1 has four numbers, and sequence-2 has seven). Your code needs to then output a third sequence that is a combination of sequence 1 and sequence 2 and is sorted in non-decreasing order. How is non-decreasing order different from increasing order? This means there can be a repeated number in the third sequence (see Example runs 1&2 for examples of output with a repeated number). A strictly increasing order sequence cannot have repeat numbers at all (Example runs 3 & 4 have output that is in increasing order). Remember, all input sequences must be in strictly increasing order! HINT: use three separate lists to solve this!
Write a C++ program to read a 1D array of n integer elements. Then, find the output for each of the following: 5. Swap between the locations of the largest odd number and the smallest even number.
Write a C++ program that takes an char array of size twenty. Take input a sorted array from the user. Display the char array on console such that each row has only five elements separated by spaces. Then, you are required to then take a char x from the user and use binary search to search for element x in the array. Display the index of the element on the console. Also display two elements before and after the element x. Note: Don't use functions and strings.
Code language Java 1, Add a print statement to say “Multiplication Table” and then prompt theuser to enter an integer. Your program should then prints “times table” for thenumbers from 1 to the given integer (inclusive). That is, for input n, you would printa table of n rows (lines) each with n columns, where the cell at row i and columnj contains the value i × j. You do need separate rows, but don’t worry about thecolumns lining up nicely yet. 2. Add a print statement to say “Prime Testing”.Using the integer entered by the user above, print out all the prime numbers between2 and the number squared. E.g., if the user types 12 for the multiplication table part,you should print all the prime numbers that are not larger than 144.All integers are either prime or composite. A prime number is one that has no integerfactors other than itself or one. Examples are 2, 3, 5, 7, 11, 13, . . .. A compositenumber, by contrast, has multiple factors. Examples are 4, 6, 12, 15, 18, 21, . . ..Testing…
Make a python code/program for the following: Inputs - Dictionary words (words are to be separated by a space) - Input word (a single scrambled word) All words, including both the dictionary words and the scrambled word, consist only of lowercase English letters and will be at least one and at most six characters long. The dictionary is not necessarily in sorted order, but each word in the dictionary is unique. Output Your program should output "True" if one or more of the dictionary words can be formed (matched exactly) by rearranging the letters of the input word. Otherwise, output "False". For example, Input is: work seven study air rokw Output is: True Input is: one woman post course tree omnw Output is: False
in python Write a function that receives a string containing a 32-bit hexadecimal integer. The function must return the string’s integer value. Write a function that receives an integer. The function must return a string containing the binary representation of the integer. Write a function that receives an integer. The function must return a string containing the hexadecimal representation of the integer. Write a function that adds two hexadecimal strings, each as long as 1,000 digits. Return a hexadecimal string that represents the sum of the inputs.
Write a code that would be able to perform matrix operations of variable size depending on user to input operations should include matrix addition,multiplication,and transpose. If the user wishesh to perform a transpose operation the program should accept a single matrix only. In python.
i want code in python Rahul is a maths genius so he came up with a game and as raj is Rahul's best friend so Rahul decided to play the game with raj. Rahul gives raj two numbers LL and RR and asks raj to find the count of numbers in the range from LL to RR (LL and RR inclusive) which are a digit palindromic. A number is a digit palindromic if its first digit is the same as its last digit. As raj is not very good at maths so your task is to help Raj find out how many numbers are a digit palindromic in the range LL to RR. For example if LL = 88 and RR = 2525 .The following numbers are a digit palindromic in the range of LL to RR: 8, 9, 11, and 22. If LL = 12511251 and RR = 12661266. The digit palindromic numbers are 1251 and 1261. Input format The first line contains an integer denoting the number of test cases. Each test case is described by a single line that contains two integers LL and RR. Output format For each test case output, an integer denoting how many a digit palindromic…
Exercise Fibonacci (Overflow): Write a program called FibonacciInt to list all the Fibonacci numbers, which can be expressed as an int (i.e., 32-bit signed integer in the range of [-2147483648, 2147483647]). The output shall look like: F(0) = 1 F(1) = 1 F(2) = 2 ... F(45) = 1836311903 F(46) is out of the range of int Hints: The maximum 32-bit int is kept in constant Integer.MAX_VALUE. You cannot use F(n-1) + F(n-2) > Integer.MAX_VALUE to check for overflow. Instead, overflow occurs for F(n) if (Integer.MAX_VALUE – F(n-1)) < F(n-2), i.e., no room for the next number. Try: Write a similar program for Tribonacci numbers. Exercise NumberConversion: Write a method call toRadix() which converts a positive integer from one radix into another. The method has the following header: public static String toRadix(String in, int inRadix, int outRadix) // The input and output are treated as String. Write a program called NumberConversion, which prompts the user for an input number, an input…
Create a python program a) Add a function called reversed_ascii_caps() to this program that takes a list of characters as its input parameter and returns a list of integers that contains the ASCII code of every uppercase character in the input-list in the reversed order. Sample output: >>> result = reversed_ascii_caps(['H', 'e', 'l', 'L', 'o', 'W', 'o', 'r', 'l', 'D']) >>> print(result) [68, 87, 76, 72] Note that the ASCII codes for the characters 'H', L', 'W', and 'D' are 72, 76, 87, and 68, respectively. And they appeared in the reversed order in the resulting list. You must not use negative indexing (i.e., the numbers you write in the square brackets to retrieve a value from the list must be nonnegative). You must not use the built-in list.reverse() method. You may use ord() and chr() functions in your solutions. b) Write three (3) unit tests in your program to show that your function works for 3 different classes of inputs. No need to write another function…
CSE Python LAB: Question 2} You initially start with a binary string S0 which is of length N and has all 0s. You are then given U updates, which keep transforming the string. The i-th update transforms the string Si-1 into Si, and hence after all the U updates you will be left with SU. A single update is of the form (Li, Ri), which means that all the 1s in the range [Li, Ri] (both end points included) should be changed into 0s, and all the 0s in that range should be changed to 1s. You need to find out which among the U+1 binary strings: S0, S1, .., SU, is lexicographically the largest, and print that string. You have to develop a python program that output a single line containing one binary string Sample Input: 10 10 9 10 6 10 9 10 1 8 3 5 3 3 3 4 3 9 4 8 7 7 Sample Output: 1111100011