
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Answer question 28 showing fully all the steps. Solution should be perfect(very correct), clear, brief and explicit enough!

Transcribed Image Text:A. Always liberate space in the
computer memory
B. Needs an express liberation of
space by the programmer after
removal of element from list
C. Needs simply that the element be
removed from the list
D. Needs no pointer manipulation
36. In debugging of a program,
A. We are searching for the.
availability of errors
B. We want to see howa program
F. z= fy
G. z= xy
()x =Z H
20. interrupt driven input output leads to
A. wastage of CPU time
B.optimum use of CPU time
C. adequate execution of real time
processes
D. non-execution of priority process
30. The hardware instruction cycle is
A. Fetch decode store
B. Fetch execute decode
C. Decode execute store
D. Fetch decode execute store
31. A problem is said to be computable if
A. A solution can be found
B. The problem is a mathematical
problem
C. The problem has a feasible
mathematical solution
D. The problem is a classical
computer problem
The program counter (PC)
A. An index number that in creases
every time a loop is executed
B. A CPU register that indicates the
address of the next instruction in a
C. We want to prove that the
program is working
D. We are correcting errors
37. The following data structures are
arranged in decreasing order of
preference in terms of search speed
A. Linked-list Arrays, Binary-search,
Trees
B. Binary search, Trees, Linked-list,
Arrays
C. Binary search, Trees, Array,
Linked-list
D. Arrays, Linked-list, Binary-search,
Trees
The function f defined as
any kind
32.
program
C. A CPU register which stores the
state of a process
D. A CPU register that signals change
of context
=(u)s
0=u '
O<u *(L-u)ju
33. The search for an element on a binary
search tree Has an ayerage
complexity whíchjs
A. Linear
B.Logarithmic
Polynomial
D.Exponential
34. A binary search tree (BST) is said to
be better than binary search in an
array because
A. The complexity is different
B. The BST does not use an index
C. The array has a limited size
D. The BST uses pointers while an
array does not
Is said to be
A. A recursive function
B. A composite function
C. An iterative function
D.A stack nested function
Given the functions for n!, defined as
in 38 (NR) above with f(n) and as
n%3D1×2×3X......xn (NI)
A. NI runs faster than NR for all
values of n
B.NI takes more memory space than
NR
C. NI may not execute for certain
values of n
D. NR has more lines of code than NI
35. Deletion of an element from a linked- 40. A low level programming language
list
A. Makes more system calls than a
high level language

Transcribed Image Text:D. Radio waves
A network interface card(NIC) is
found
A. In every network end-device
(host)
B. In the server only
C. In the router
21. If memory access takes 20 ns with
cache and 110 ns without it, then
utility rate of the cache is
approximately
A. 80%
B. 90%
C. 82%
D. 84%
22. Cache memory acts between
A. CPU and RAM
B. RAM and ROM
15.
D. At the terminal of every transmission_
medium
In memory hierarchy, the larger the
memory the
E. Higher the access time and the
higher the speed of transfer of
data to CPU
F. Higher the access time and the
lower the speed of transfer of
data to the CPU
G. Shorter the access time and the
higher the speed of transfer of
data to CPU
H. Shorter the access time and the
lower the speed of transfer of
data to CPU
16.
C. CPU and Hard Disks
D. None of these
23. generally Dynamic RAM is used as
main memory
computer
system as it
A. consumes less power
B. has higher speed
C has lower cell density
D. needs refreshing circuitry
Logic X-OR operation of
(11101010)2& (10101010)2 has as
results
A. 10010001
B. 01100000
C. 10000000
D. 10000000
(-27)10 can be represented in a signed
magnitude format and in a 1's
complement format as
E.
F.
G.
17. Floating point representation is used
to store
A. Boolean values
B. Whole number
C. Real number
D. integers
18. what characteristic of RAM makes it
not suitable for permänent storage?
A. It is volatile
B. Unreliable
C. Too slow
111011 & 100100
100100 & 111011
011011 & 100100
100100 & 011011
S8
Н.
In computers, subtraction is generally
carried out by the hardware using
A. 9 complement
B. 10's complement
1's complement
D 2's complement
20. What characteristic of ROM memory
makes it suitable for use in embedded
systems?
A. Too slow
B. It is not programmable
C. It keeps information
permanently
D. It has a high capacity
26. The 2s compliment form (use 6 bit
word) of the number 1010 is
A. 111100
B. 110110
C. 110111
D. 1011
27. The memory units that communicates
directly with the CPU is called the
A. Main memory
B. Secondary memory
C. Shared memory
D. Auxiliary memory
28. The equivalence of the Boolean
expression:
z=X(X+P) is
E. z=x(xy)
19.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Know the differences between case-based, model-based, and rule-based inductive reasoning. Describe a negative trait in each individual you meet.arrow_forwardCould you perhaps elaborate on what we mean when we state that the criteria need to be all-encompassing and arranged in a logical fashion?arrow_forward
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education