4.For which requirement should you configure shared servers? A) accommodating an increasing number of users who run short-duration, infrequent queries in an OLTP environment with limited memory B) accommodating an increasing number of users who run a
35.Your database is using Automatic Memory Management. Which two SGA components must be managed manually? A) default buffer cache B) redo log buffer C) large pool D) shared pool E) keep buffer pool Answer:BE
26.In which state can you back up a database in ARCHIVELOGMODE using RMAN? A. NOMOUNT, MOUNT, AND OPEN B. NOMOUNT AND MOUNT ONLY C. OPEN ONLY D. MOUNT AND OPEN ONLY E. OPEN RESTRICTED ONLY Correct Answer: D
25.Which is true about logical and physical database structures? (Choose the best answer) A. An undo tablespace has a temp file instead of a data file. B. A segment can consist of extents of different sizes. C. A permanent tablespace can only contain
14.Which command is used to display files that no longer conform to the backup retention policy? A) REPORT OBSOLETE B) SHOW DATAFILE BACKUP COPIES C) CROSSCHECK BACKUP D) LIST EXPIRED BACKUP Answer:A
10.Which two are true about consistent database backups? A) They can only be taken when a RECOVERY CATALOG is used. B) They can only be taken if the database Is in ARCHIVELOG mode. C) They can only be taken If shutdown NORMAL, TRANSACTIONAL, or IMMED
9.Which is true about the Automatic Diagnostic Repository (ADR)? A) It includes diagnostic data for critical errors for each server and background process. B) Its location is always set by the ORACLE_BASE variable. C) It is used only if the DIAGNOSTI
题目描述: 中文: 给定一个包括 n 个整数的数组 nums 和 一个目标值 target.找出 nums 中的三个整数,使得它们的和与 target 最接近.返回这三个数的和.假定每组输入只存在唯一答案. 英文: Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of
题目描述: python实现 Search in Rotated Sorted Array2 搜索旋转排序数组 中文: 假设按照升序排序的数组在预先未知的某个点上进行了旋转. ( 例如,数组 [0,0,1,2,2,5,6] 可能变为 [2,5,6,0,0,1,2] ). 编写一个函数来判断给定的目标值是否存在于数组中.若存在返回 true,否则返回 false. 英文: Suppose an array sorted in ascending order is rotated at some
题目描述: 中文: 给定一个包含 n 个整数的数组 nums 和一个目标值 target,判断 nums 中是否存在四个元素 a,b,c 和 d ,使得 a + b + c + d 的值与 target 相等?找出所有满足条件且不重复的四元组. 英文: Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d
本题是力扣网第50题. 实现 pow(x, n) ,即计算 x 的 n 次幂函数. 采用递归和非递归思路python实现. class Solution: #递归思路 def myPow_recursion(self,x,n): if n == 0: #递归终止条件,n==0返回1 return 1 if n < 0: #n小于0,就返回其倒数,-n和其递归结构一致 return 1 / self.myPow_recursion(x,-n) if n & 1: #判断是奇数,则结果为x*(x