Q.4 Consider a word-addressable memory where 1 word = 4 bytes. If the memory address consists of 10 bits, then what will be the size of memory?Ans 1. 4096 bytes2. 1024 bytes3. 2048 bytes4. 4096 bitsCorrect Ans Provided: ...
RankiQ Discuss Latest Questions
Q.11 Collecting data from spreadsheets and posting General Ledger (GL) entries is related to the _________ use-case of the RPA in Finance and Accounting.Ans 1. P2P2. T&E3. O2C4. R2RCorrect Ans Provided: 4
Q.8 Which of the following represents worse-case scenario for linear search? (i) When items to be searched appears at the end of the list.(ii) When items to be searched in not present in the list.Ans 1. (i) only2. ...
Q.9 O2C, R2R and P2P are some of the RPA use-cases in Finance and Accounting. What is the full-form of O2C?Ans 1. Over the Cash2. Order to Cash3. Order to Cashier4. Over two CentsCorrect Ans Provided: 2
Q.12 Which of the following statements is/are TRUE? (i) For a serializable schedule there could be more than one equivalent serial schedules.(ii) Strict two-phase locking protocol is not deadlock free.Ans 1. Neither (i) nor (ii)2. Both (i) and ...
Q.14 Which of the following statements about Data Science is/are TRUE? (i) Modeling the data using various complex and efficient algorithms.(ii) Visualizing the data to get a better perspective.(iii) Understanding the data to make better decisions and ...
Q.13 Which of the following statements about Robotic Process Automation (RPA) is/are TRUE? (i) It reduces operational costs(ii) It lowers operational risks(iii) It allows to deliver faster servicesAns 1. (i) and (ii) only2. (i), (ii) and (iii)3. ...
Q.5 Which of the following OSI layers ensures error-free transfer of data frame?Ans 1. Data link layer2. Physical layer3. Transport layer4. Network layerCorrect Ans Provided: 1
Q.7 Which of the following video format was developed by Microsoft and it is commonly used in video cameras and TV hardware? (i) MPEG(ii) AVI(iii) WMVAns 1. (ii) and (iii) only2. (i) and (ii) only3. (i) and ...
Q.2 The purpose of a CPU scheduling algorithm is: (i) Maximum throughput(ii) Minimum turnaround time(iii) Minimum waiting timeAns 1. (i), (ii) and (iii)2. (i) and (ii) only3. (i) and (iii) only4. (ii) and (iii) onlyCorrect Ans Provided: ...
