Answer question 36, 37, 38 showing fully all the steps. Solution should be perfect(very correct), clear, brief and explicit enough! 30. What is the 2's complement35. The preorder transversal of acertain binary search tree is 1053215 12 20, If the value 11is then added to this tree, whatis the preorder transversal ofthe resulting tre0?A. 11 10 53 2 15 12 20B. 10 11 532 15 12 20C. 10 532 1511 12 20D. 10 532 15 12 11 20.representation of-24 in a 16 bitmicrocomputer?B. 1111 1111 1110 01110o win 100000 0000C. 1111 1111 1110 10000o win 100000 000031. Three ways to Improve theperformances of a hard diskincludeA. Disk caching, RAID, and fileexpansion.B. File compression, disk caching, andfile encryption.C. Disk caching, RAID and filecompression.D. RAID, file compression and diskexpansion.32. What did Alan Turning proposeas a way to answer the question"can computers think?"A. Allowing computers to enter theWorld Chess ChampionshipB. The imitation game, later called theTurning testC. Programming a computer to solvecalculus problemsD. Teaching a computer program itself33. The following are thestatements regarding the Non-Polynomial (NP) problems.Choose the right option from thefollowlng options1.36. Memory management is necessarybecauseA. Tfie memory is finiteB. Many programs have to runC. Weoperatea in a multitaskervironmertD. Allof the above37. The ROM Containing the BIOS canconsidered asagA Secondary storage unitBA peripheral unitC. Part of memory unitprocessing unit38. Program pre-emption isA. Forced withdrawal of CPUfrom a program which isexecuting.B. Release of CPU from by aprogram after completing itstask.C. Forceful allotment of CPUby a program to itselfD. Program termination due todetection of an errorAIRNP-completeproblems are not NP-hardII. SomeNP-hardwareproblems are not knownto be NP-complete.39. An operating system.contain 3user processes, each processrequiring 2 units of the resource R.the minimum number of units Rrequired such that there is nopossibility of dead lock on R isA. 6B. 3C. 5A. Both (I) and (II) are trueB. Bothe (1) and (II) are falseC. Only (I) is trueD. Only (II) is true34. A full-adder is simply a connectionof two half-adders joined byA. AND gateB. OR gateC. NAND gateD. NOR gate40. Concurrent processes executingwithout mutual execution can leadA. Faster execution of processesB. Deadlock

According to the given image we need to solve Three questions. 1. Memory management is necessary…

Answered: Answer question 36, 37, 38 showing…

Answer question 36, 37, 38 showing fully all the steps. Solution should be perfect(very correct), clear, brief and explicit enough!

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#1. Draw the Binary and Binary search tree for the following values, and traverse the Binary Search tree in Post, Pre and Inorder.? 100,29,45,120,12,45,140,100,45,150,45,67,89,100,650 Q#2. Convert the following expression into the Prefix and Postfix mentioned notation? And draw their trees. a> a + b + c - d * x / y b> x*(y - a) + (s + t * d)
(1) Create a SINGLE, binary tree using the following three groups of input. After EACH group of input, say whether the tree is full, balanced, and/or complete. PLEASE NOTE you’re only making a SINGLE binary tree in this problem, and answering THREE TIMES. [50,25,30,24,70] [72,71,26,32,22] [56,60,77,54]
Draw the binary search tree that would result if the given elements were added to an empty binary search tree in the given order. Use paint to draw. a. Lisa, Bart, marge, maggie, flanders, smithers, miljouse b. 12,34,1,5,-5,6,19,45,2,-7,47
Show the result of inserting 30, 10, 40, 60, 90, 20, 50, 70 into an initially empty binary search tree. b) Is the above tree a full binary tree? Why? Why not? c)Draw the subtree with the root node as 60.
Construct a Binary Search Tree (BST) using the data provided in shaded row and name it “BST-1”. 50 45 65 60 75 90 15 35 70 45 55 40 20 80 95 85 25 50 74 5 Provide answers to the following considering your constructed BST-1: Write a C++ code that finds and delete a node having exactly two Childs in a BST. Simulate your code on BST-1 and provide a step-by-step procedure to delete “15” and “75” from it.
Construct a Binary Search Tree (BST) using the data provided in shaded row and name it “BST-1”. 50 45 65 60 75 90 15 35 70 45 55 40 20 80 95 85 25 50 74 5 Provide answers to the following considering your constructed BST-1: Write the output strings (only) after taking pre-order, in-order, and post-order traversal of BST-1.
A. Draw a binary search tree based on the sequence of numbers inserted in the following order: {2, 4, 8, 6, 0, 5, 3, 9, 1, 7}. The numbers are inserted into an initially-empty binary search tree. b. Using the same sequence of numbers in Question a. draw the AVL tree. The numbers are inserted into an initially-empty AVL tree. c. From your answer for Question a. and b. discuss insertion analysis of both tree structures. Also discuss how “Lack of balance” problem solve in one of the tree. d. Assuming that the binary search tree in Figure 1 stores integer values that does not have any duplicate elements. Give the range (in the form m – n) of all values which could occupy the node ‘x’. Describe and show the step of rearranging nodes from the binary search tree in Figure 2, when the following nodes are deleted in sequence: node 5 node 63
Q. (a) What is the need for an AVL tree? Construct an AVL search tree for the following items:{ BEGIN, CASE, AND , DO, END, FOR, GOTO, IF, IN, LET, NOT, OR, READ, REPEAT, RESET, THEN, XOR ,UNTIL, WHILE , QUIT} (b) Find the tree whose inorder and postorder traversals are given below-Inorder: U P W V X Y M S T Q RPostorder: U W Y X V P T S R Q MAlso traverse the tree in Preorder and level order.
Suppose T is a binary tree with 17 nodes. What is the minimum possible depth of T? 1 3 4 2 A binary tree of N nodes has _______. Log2 N levels N / 2 levels Log10 N levels N x 2 levels The difference between a binary tree and a binary search tree is that : in binary search tree nodes are inserted based on the values they contain none of these in binary tree nodes are inserted based on the values they contain a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node What is the best code for the following procedure: AddStudent(studentName):add a new student to an array of alphabetically ordered names . Hint: We must shift some students. size contains the number of students in the array AddStudent(studentName){ int i ; for( i=0; i< size-1; i++){ if(arr[i].compareTo( studentName)>0) break; for(int j= size-1 ; j >i…
Your colleague proposed a different definition of a binary search tree: it is such binary tree with keys in the nodes that for each node the key of its left child (if exists) is bigger than its key, and the key of its right child (if exists) is less than its key. Is this a good definition for a binary search tree? A. Yes B. No
A) Suppose the numbers 7 , 5 , 1 , 8 , 3 , 6 , 0 , 9 , 4 , 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. Show A) In order B) pre order C) post order
Given a set of 10 letters { I, D, S, A, E, T, C, G, M, W }, answer the following: a) With the given letters above, we can construct a binary search tree (based on alphabetical ordering) and the sequence < C, D, A, G, M, I, W, T, S, E > is obtained by post-order traversing this tree. Construct and draw such a tree. NO steps of construction required.b) The letter S is first removed from the binary search tree determined above, followed by inserting a new letter R. Draw the updated binary search tree after removal and insertion. Choose the logical predecessor (not successor) of the removing node if necessary c) Determine and list the sequence of elements obtained by pre-order traversing the updated binary search tree after removal and insertion above. No steps required. d) Suppose we are given the first six elements < I, D, S, A, E, T > and their frequencies of occurrence < 5, 6, 2, 4, 5, 2 >, construct and draw the Huffman Tree based on these elements above and their…