Question
Q2:Instruction: Describe one static priority and one dynamic priority real-time scheduling algorithm. You should discuss the issue of admission control, and comment on the data
Q2:Instruction: Describe one static priority and one dynamic priority real-time scheduling algorithm. You should discuss the issue of admission control, and comment on the data structures that an implementation would need to maintain and on how these would be used to make scheduling decisions.are a data structure protected by a mutual exclusion lock.
(i) What scheduling problem could arise here? [6 marks] Suppose that in some (correct) instance of R the query (Z,W2(R) Z,Y(2R)) 2R is not empty. What can we conclude about the functional dependency @@Z W? Explain your answer. [40 marks]
(c) In the process of using functional dependencies to normalise a schema, what is meant by a lossless join decomposition and how is such a decomposition guaranteed? [40 marks] (d) In schema normalisation, is Boyce-Codd Normal Form (AAABCNF) always to be preferred over 3rd Normal Form (13NF)? Explain your answer. : Write program to read a string and display its length (number of characters). in c+ : Write program to read a letter and indicate whether the letter is 'a' or not. programing language is VB8 write program to read in a string from the keyboard and display the whole string backward (a) Describe the provisions of the Data Protection Act. [28 marks]
(b) You are designing and are about to launch a mobile phone app which will seek to understand the emotional condition of the user, using multiple inputs such as motion sensing, facial expression recognition, voice stress measurement and the analysis of entered text. Its declared purpose is to enable services to interact more empathically with users. You propose to monetize it by serving ads at times when the user is more likely to buy. Your "backers" have raised a concern that this app will be able to diagnose depression, and that in consequence you may be storing substantial amounts of sensitive personal information. Discuss this problem from the viewpoints of both data protection law and ethics.
(a) Windows implements static inheritance for the access-control lists of NTFS files and folders.
(i) What does static inheritance mean here and how does it differ from dynamic inheritance? 0[4 marks]
(ii) Five flag bits (ci,oi,np,io,i) in each NTFS access-control entry (ACE) manage how it is inherited. Briefly describe the purpose of each bit. [5 marks] (iii) User mike gives his folder project the following access-control list: project AllowAccess mike: full-access (wi,cwi) AllowAccess alice: read-execute (ci,nwwp) AllowAccess bob: read-only w(oi) It contains one folder and two text files, none of which have any noninherited access-control entries: project\doc.txt project\src project\src\main.c For each of these three objects, list all inherited access-control entries, showing in parentheses the inheritance-control flag bits that are set (using the same notation as above). [50 marks]
(b) Describe the purpose and four typical functions of a root kit. Data Structures and Algorithms (a) Describe and justify an algorithm for finding the shortest distance between each pair of vertices in an undirected graph in which each edge has a given positive length. If there is no path between a pair of vertices a very large result should arise. [120 marks] (b) Is it sensible to use your algorithm to discover whether such a graph is connected? Suggest an alternative that would be appropriate for a graph of 13000 vertices and 130,000 edges.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Q2 RealTime Scheduling Algorithms and Related Concepts a Static Priority and Dynamic Priority RealTime Scheduling Algorithms Static Priority Scheduling Algorithm RateMonotonic Scheduling RMS Descripti...Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started