Given the following snippet of code: cl::NDRange offset(4); cl::NDRange globalSize(128); cl::NDRange localSize(8); queue.enqueueNDRangeKernel(kernel, offset, globalSize, localSize); Which of the following statements is TRUE? Select one: a. 128 work-groups will be created b. Each work-group will contain 4 work-items c. 32 work-groups will be created d. 8 work-groups will be created e. 16 work-groups will be created Clear my choice Which of the following statements is/are FALSE? 1. A wait lists can contain one or more event objects 2. User events are controlled by the device 3. If not set, a wait list defaults to NULL Select one: a. 2 and 3 b. 1 and 3 c. 1 only d. 2 only e. 1 and 2 Clear my choice Which of the following statements about parallel computing is/are FALSE? 1. Physical hardware resources are required to enable parallel computing 2. Concurrency is the same as parallelism 3. Parallelism refers to performing multiple tasks simultaneously Select one: a. 2 only b. 2 and 3 c. 1 and 3 d 1 and 2

Given the following snippet of code: cl::NDRange offset(4); cl::NDRange globalSize(128); cl::NDRange localSize(8); queue.enqueueNDRangeKernel(kernel, offset, globalSize, localSize); Which of the following statements is TRUE? Select one: a. 128 work-groups will be created b. Each work-group will contain 4 work-items c. 32 work-groups will be created d. 8 work-groups will be created e. 16 work-groups will be created Clear my choice Which of the following statements is/are FALSE? 1. A wait lists can contain one or more event objects 2. User events are controlled by the device 3. If not set, a wait list defaults to NULL Select one: a. 2 and 3 b. 1 and 3 c. 1 only d. 2 only e. 1 and 2 Clear my choice Which of the following statements about parallel computing is/are FALSE? 1. Physical hardware resources are required to enable parallel computing 2. Concurrency is the same as parallelism 3. Parallelism refers to performing multiple tasks simultaneously Select one: a. 2 only b. 2 and 3 c. 1 and 3 d 1 and 2

LINUX+ AND LPIC-1 GDE.TO LINUX CERTIF.

5th Edition

ISBN:9781337569798

Author:ECKERT

Publisher:ECKERT

Chapter7: Working With The Bash Shell

Section: Chapter Questions

Problem 15RQ

See similar textbooks

Similar questions

Choose the correct option 1)Which functions allow to change the location of the get and put positions ?a)sg() and sp()b)sekg() and sekp()c)gog() and gop()d)seekg() and seekp() 2)Which of the following operator is used to release the dynamically allocated memory in CPP?a) removeb)freec)deleted)both b and c 3) Local variables are stored in an area called ___________a) Heapb) Permanent storage areac) Free memoryd) Stack 4)Choose the correct option?#include<iostream>using namespace std;class Base {};class Derived: public Base {};int main(){Base *bp = new Derived;Derived *dp = new Base;}a. No Compiler Errorb.Compiler Error in line “Base *bp = new Derived;”c. Compiler Error in line ” Derived *dp = new Base;”d. Runtime Error 5)When the inheritance is private, the private methods in base class are __________ in the derived class (in C++).a. Inaccessibleb.. Accessiblec.. Protectedd. Public
Which one of the following is an application of Queue Data Structure? A. When a resource is shared among multiple consumers. B. When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes C. Load Balancing D. All of the above
Which of the following is a solution to the challenge of deadlock in process-based concurrent programming? Question 4 options: Acquiring locks (binary semaphore) in a specific order Using counting semaphores instead of locks Using condition variables instead of locks All of the above
Please explain step by step how processes are created. 1. Including the parent process, how many processes are created by the following program? Assumethat all fork() system calls succeed. #include <unistd.h>#include <stdio.h>int main(int argc, char **argv) {for (int i = 0; i < 3; i++)fork();/* ... */}2. Given the following program, please determine how many times the word “hello” is printed out.Assume that fork() is always successful. #include <sys/types.h>#include <stdio.h>int main() {pid_t a, b;a = fork();b = fork();if (a == 0)b = fork();if (b == 0)a = fork();printf(“hello\n”);return 0;} 2. Given the following program, please determine how many times the word “hello” is printed out.Assume that fork() is always successful. [1 pt]#include <sys/types.h>#include <stdio.h>int main() {pid_t a, b;a = fork();b = fork();if (a == 0)b = fork();if (b == 0)a = fork();printf(“hello\n”);return 0;}
97. Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify : a. the set of processes that have been deadlocked b. the set of processes in the deadlock queue c. the specific process that caused the deadlock d. all of the mentioned
I need to correct the following two pseudo code assignments, and I have trouble finding more mistakes in the code. Can anyone help me find them? // Cooper College maintains a master file of students and credits// earned. Each semester the master is updated with a transaction// file that contains credits earned during the semester.// Each file is sorted in Student ID number order. start Declarations num masterID string masterName num masterCredits num transID num transCredits string bothDone = "N" num HIGH_VALUE = 999999 InputFile master InputFile trans OutputFile newMaster getReady() while bothDone = "N" detailLoop() endwhile allDone()stop getReady() open master "master.dat" //changed to "master.dat" open trans "trans.dat" //changed to "trans.dat" open newMaster "newMaster.dat" //changed to "newMaster.dat" readMaster() readTrans()…
What is meant by the phrase "non-preemptive priorities"?
Create a java socket program which has the following functionality: Server: The server contains the IDs of multiple students (minimum 6). It accepts two types of operations from the client. The first one is a search operation, where the client provides an ID to the server. If the ID is found in the server’s list, the server returns found, otherwise the server returns not-found. The second one is an add operation, where the client provides an ID to the server, and the server adds that ID to its ID list. Note: The ID list can be an array / ArrayList or you can even use files. Client: The client sends 2 types of requests. The first one is for searching a student, where the client sends the student ID. If the data is found in the server, the server sends back found. Otherwise, the server sends not-found. The client shows the data sent by the server. The second type of request is adding a new student to the server. The client sends id of the new student to the server and the server adds…
When a process creates a new process using the fork() operation, whichof the following states is shared between the parent process and the child process. Explain?a. Stackb. Heapc. Shared memory segments
EXPLAIN THE BELOW PYTHON AND DBMS CODE STEP BY STEP WITH TERMINOLOGY import osimport platformimport mysql.connectorimport pandas as pdimport datetimemydb = mysql.connector.connect(user='root', password='Arun@102003',host='localhost',database='food')mycursor=mydb.cursor() def MenuSet(): #Function Food Booking System print("Enter 1 : To Add Cutomer details") print("Enter 2 : For Food Order") print("Enter 3 : Exit") try: #Using Exceptions For Validation userInput = int(input("Please Select An Above Option: ")) #Will Take Input From User except ValueError: exit("\nHy! That's Not A Number") #Error Message else: print("\n") #Print New Line if(userInput == 1): Customer() elif (userInput==2): orderitem() elif (userInput==3): Food() elif (userInput==4): OrderFood() elif (userInput==5): View() else: print("Enter correct choice. . . ") MenuSet() def Customer(): L=[] c_name=input("Enter…
Which data structure conveniently used to implement DFS? Select one: a. Priority Queues b. All of the mentioned c. Queues d. Stacks
If you're a developer, you should try not to argue that deep access is better than shallow access based on speed alone.