Code in MATLAB Create a code that can translate the order from cartesian to lexicographic, based on below. OBS. L = 16; but the code must work with all possible L-values. the Lattice is in two-dimension. Code should not be longer than 5-10 sentences. Hint. if x =i and y=j Lex(x,y)=i+(j-1)*L 4 3 2 1 Cartesian coordinates (1.4) (2.4) (3,4) (4.4) (1.3) (2.3) (3.3) (4.3) (1.2) (2.2) (3.2) (4.2) (1.1) (2.1) (3.1) (4.1) 1 2 3 4 Lexicographical coordinates 4 3 2 1 ●22 .. ••• •• ●m 20 No .. 1 2 3 4

Code in MATLAB Create a code that can translate the order from cartesian to lexicographic, based on below. OBS. L = 16; but the code must work with all possible L-values. the Lattice is in two-dimension. Code should not be longer than 5-10 sentences. Hint. if x =i and y=j Lex(x,y)=i+(j-1)*L 4 3 2 1 Cartesian coordinates (1.4) (2.4) (3,4) (4.4) (1.3) (2.3) (3.3) (4.3) (1.2) (2.2) (3.2) (4.2) (1.1) (2.1) (3.1) (4.1) 1 2 3 4 Lexicographical coordinates 4 3 2 1 ●22 .. ••• •• ●m 20 No .. 1 2 3 4

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

Log There was a storm recently on Jolibi village. The storm was so strong that some treesfell. There are some logs of varied length lying on the ground. The village ground canbe represented by a string of length N, where the i-th character is either 1 or 0. A singlelog is represented by consecutive characters of 1, and two different logs are separated byone or more 0. For example, for the string 1100010111, there are 3 logs. The first one atposition 1 to 2 with length 2, the second one at position 6 with length 1, and the thirdone at position 8 to 10 with length 3.As a carpenter, you want to take one of these logs home. Because you are the seniorcarpenter, you may take the longest log home. Determine the length of the longest log! Format InputThe first line contains an integer N, the length of the string. The next line contains a string of length N, which represents thevillage ground. Format OutputOutput an integer X, the length of the longest log. Constraints• 1 ≤ N ≤ 104• the i-th…
Correct answer will be upvoted else downvoted. Computer science. Michael is blamed for disregarding the social removing rules and making a danger of spreading Covid. He is currently shipped off jail. Fortunately, Michael knows precisely what the jail resembles from within, particularly since it's actual straightforward. The jail can be addressed as a square shape a×b which is separated into stomach muscle cells, each addressing a jail cell, normal sides being the dividers among cells, and sides on the border being the dividers prompting opportunity. Prior to condemning, Michael can ask his companions among the jail representatives to make (all around stowed away) openings in a portion of the dividers (counting dividers among cells and the furthest dividers). Michael needs to have the option to escape the jail after this, regardless of which cell he is set in. Be that as it may, he likewise needs to break as couple of dividers as could be expected. Your assignment is to…
A = {x| x = 3d + 2, d e N}, B = {x € Z]a? + 9 = 0}, C = {1,5}. Also assume the Universal set is N: Show the following: (a) (Cn A) – B (b) (AUC) – B (с) Р(P(C - В)nA)
Give a implementations to Find first/last occurrence of a specific character:strchr(), strrchr()
Given L = {w = {a, b}*: |w| is even}, the correct statements are: (aa U ab Uba U bb)* is a regular expression that generates L. (ab Uba)* is a regular expression that generates L. aa U ab U ba U bb is a regular expression that generates L. ab U ba is a regular expression that generates L.
A tile of a monkey puzzle has four monkey halves that can be labelled as north(N), east (E), south (S), and west (W) half. In addition to the shape of the borderrectangle, these halves determine which edges can be placed next one other. There isalso another way to define how the tiles can be placed: Each tile corner (i.e. compassdirections NE, SE, SW, and NW) has a monkey quarter. If we abstract this quarter, forexample, with a letter, only the tiles with the same letter in their touching corners canbe adjacent. illustrates one valid solution for this quarter monkey puzzle.Are the two monkey puzzle representations equivalent in the sense that if we have apile of ‘half monkey’ tiles H, it is possible to define a pile of ‘quarter monkey’ tilesQ that gives exactly the same set of solutions for the puzzle (and vice versa)?
Finite language is a language with finite number of strings in it, i.e., there exist exactly k strings in this language such that k eNand k #00. For a finite language L, let |L| denote the number of elements of L. For example, |{A, a, ababb}| = 3. (Do not mix up with the length |x| of a string x.) The statement |L,L2| = |L1||L2| says that the number of strings in the concatenation LL2 is the same as the product of the two numbers |L1| and |L2|. Is this always true? If so, prove, and if not, find two finite languages L1, L2 S {a, b}* such that |L1L2| # |Li||L2l.
Implement the following two functions that allow breaking a string into non-empty tokens using a given delimiter in c language . For example, ● For a string “abc-EFG-hi”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] ● For a string “abc-EFG---hi-”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] ● For a string “abc”, and a delimiter ‘ ’ : the list of tokens is [“abc”] ● For a string “++abc++”, and a delimiter ‘+’ : the list of tokens is [“abc”] That is, we break the string using the given delimiter, and the tokens are only the non-empty substrings.
of the form 1m0n1k, where m, n, k are odd. 3. Build a Finite Automaton to generate all string: of the form 1m0n1k, where m, n and k are greater than 0 and divisible by 3.
Implement the following two functions that allow breaking a string into non-empty tokens using a given delimiter in c language . For example, ● For a string “abc-EFG-hi”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] ● For a string “abc-EFG---hi-”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] ● For a string “abc”, and a delimiter ‘ ’ : the list of tokens is [“abc”] ● For a string “++abc++”, and a delimiter ‘+’ : the list of tokens is [“abc”] That is, we break the string using the given delimiter, and the tokens are only the non-empty substrings. The function count_tokens gets a string str, and a char delim, and returns the number of tokens in the string separated by delim. int count_tokens(const char* str, char delim); For example● count_tokens("abc-EFG--",'-')needstoreturn2. ● count_tokens("++a+b+c",'+')needstoreturn3.● count_tokens("***",'*')needstoreturn0.The function get_tokens gets a string str, and a char delim, and returns the…
A spell checker in a word processing program makes suggestions when it finds a word not in the dictionary. To determine what words to suggest, it tries to find similar words. One measure of word similarity is the Levenshtein distance, which measures the number of substitutions, additions, or deletions that are required to change one word into another. For example, the words spit and spot are a distance of 1 apart; changing spit to spot requires one substitution (i for o). Likewise, spit is distance 1 from pit since the change requires one deletion (the s). The word spite is also distance 1 from spit since it requires one addition (the e). The word soot is distance 2 from spit since two substitutions would be required. a. Create a graph using words as vertices, and edges connecting words with a Levenshtein distance of 1. Use the misspelled word “moke” as the center, and try to find at least 10 connected dictionary words. How might a spell checker use this graph? b. Improve the method…
Draw a DFA over the alphabet {a,b,c}that only accepts strings with no c’s and an even number of a’s, or an odd number of c’s and an odd number of b’s. For example, it should accept aa, aba, abbabaa, cbacabcb, cbcca, and abc but not aca, bacc, or aaa.