Given X = {1,3,5}. R1 is a relation on X, defined by aRīb if and only į la – b| is an even integer. Q2 (a) (i) List all possible elements of set RL. (ii) Write the matrix represent RL . Let B = {r, t, s} and R2 is a relation on set defined by the following matrix 1 1 1 0 10 0 0 1 (i) Draw the digraph for the relation R2.

Given X = {1,3,5}. R1 is a relation on X, defined by aRīb if and only į la – b| is an even integer. Q2 (a) (i) List all possible elements of set RL. (ii) Write the matrix represent RL . Let B = {r, t, s} and R2 is a relation on set defined by the following matrix 1 1 1 0 10 0 0 1 (i) Draw the digraph for the relation R2.

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

Adjacency matrix. Given a relation relation (as a numpy.array, see example below) and number of nodes n, define a function adjacency to construct the adjacency matrix A (as a numpy.array).You can assume that n is a positive integer and treat relation as a list of directed edges. # Example from p112 of VMLSrelation = np.array([[1, 2], [1, 3], [2, 1], [2, 4], [3, 4], [4, 1]])n = 4 # Modify the function adjacency below with your answer for Q8def adjacency(relation, n): A = None ########################### ### YOUR CODE HERE ######## ## REMOVE THIS LINE-------- raise NotImplementedError() ## ------------------------ ########################### return A
Let M, represent the matrix representation of a certain relation R on the set A. Consider a set A with n distinct elements. M, would therefore be a n x n matrix. How many 1s and 0s will M contain if R is a rooted (directed) tree?
For a given relation R on the set A, let M stand for the matrix representation of R. Let's pretend there's a set A with n unique items. Therefore, M would be an n-by-n matrix. If R is a rooted (directed) tree, how many 0s and 1s does M have?
Implement the following Racket functions: Transitive? Input: a list of pairs, L. Interpreting L as a binary relation, Transitive? returns #t if L is a transitive relation and #f otherwise. Examples: (display "Transitive? \n") (Transitive? '((a b) (b c) (a c))) ---> #t (Transitive? '((a a) (b b) (c c))) ---> #t (Transitive? '((a b) (b a))) ---> #f (Transitive? '((a b) (b a) (a a))) ---> #f (Transitive? '((a b) (b a) (a a) (b b))) ---> #t (Transitive? '())---> #t
M is the matrix representation of a relation R on A. A has n elements. M is a n x n matrix. M contains how many 1s and 0s if R is a rooted (directed) tree?
Suppose there is a relation r(A, B, C), with a B+-tree index with search key(A, B). What is the worst-case cost of finding records satisfying 10 < A < 50 ∧ 5 < B < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above?
Question 2: Let S be a set of n points in R 2 . We consider each point of S to be the location of a city. With each point of S, we are also given the size of the population of the city represented by this point. Describe a data structure of size O(n log n) that supports the following type of query in O(log2 n) time: Given a query point q in R 2 and a query range [a, b], report the city with a population in the range [a, b] that is closest to q. Justify the size and query time of your data structure.
Big-O notation is defined as follows: The function f(n) is O(g(n)) if there are positive integers c and N such that f(n) ≤ c · g(n) for all n > N. Is the relation “f(n) is O(g(n))” reflexive? symmetric? transitive? Justify your answers. “Θ(g(n))” is defined as follows: f(n) is Θ(g(n)) if and only if (f(n) is O(g(n)) & g(n) is O(f(n))). Is the relation “f(n) is Θ(g(n))” reflexive? symmetric? transitive? Justify your answers
In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main ( ), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId ( ) which returns the id of the manager if present or else returns -1. The function managerId ( ) takes two arguments - the square matrix of N *N and its size N. Call managerId ( ) from the main ( ) output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company.
Given set A={1,2,3,4,5} and let R and S be a binary relation on set A. ? = {(?, ?) ? ??? | ?|? } ??? ? = {(2,1), (2,3), (3,4), (3,5), (4,5)} a.) Evaluate the Domain and Range of SoR. b.) Evaluate (???) −1 ??? ??? ̅̅̅̅̅.
Q # 3; (a). The relation ‘R’ is defined on the set M=(4,5,6,7) as the following;R={(5,5),(5,6),(5,7),(6,5),(6,6),(6,7)} Check is it reflexive , symmetric and transitive. (b). Let the string having length eight of an arrays is defined as ; 01001010 , 01101101Apply the definition of Tautology on it. Q # 4; (a). Let ‘T’ and ‘S‘ are two non-empty sets which are defined as; T={x ; -1 ≤x≤1}=S and modulus function f: T→S defined by; f(x)=x|x| Check it for injective and also draw its graph(b). Simplify by using Boolean algebra definition; AB+BC+B ̅C=AB+C Q # 5. Given a simple graph G as below in figure ; Check it for the following ;Find its chromatic number which must be threeFind the degree of the graph and write it in degree sequence Label its edges and also write down its in vertex form
Consider the following extended relational-algebra operators. Sort and hash each step. Semi-joining (): The multiset semijoin operator r's definition is as follows: if a tuple ri occurs n times in r, it appears n times in r's result if there is at least one tuple sj such that ri and sj meet predicate ; otherwise, ri does not appear.