Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
does the minimum ning tree of a graph give the shortest distance between any 2 specified nodesno the minimal ning tree makes sure that the
what is a ning treea ning tree is a tree associated with a networkall the nodes of the graph appear on the tree once a minimum ning tree
in rdbms what is the efficient data structure used in the internal storage representationb tree because in b tree all the data is kept only in leaf
if you are using c language to implement the heterogeneous linked list what pointer type will you usethe heterogeneous linked list having different
what are the main data structures used in the following areas rdbms network data model and hierarchical data modelrdbms array ie array of
what is data structurea data structure is a way of organizing data that considers not only the items kept but also their relationship to each
what is ipc what are the various schemes availablethe term ipc inter-process communication explains various ways by which different process running
what is an advantage of executing a process in backgroundthe most common reason to put a process in the background is to permit you to do something
how would you kill a processthe kill command takes the pid as one argument this signifies which process to terminatethe pid of a process can be got
what is a daemona daemon is a method that detaches itself from the terminal and runs disconnected in the background waiting for requests and
normal 0 false false false en-us x-none x-none
what are the process states in unixas a process implements it changes state according to its circumstances unix processes have the following
types of categorizationthe subsequent categorization of parallel computers has been identified1 categorization based on the instructions and data
what is a zombiewhen a program forks and the child finishes before the parent the kernel still keeps some of its information about the child in case
how can a parent and child process communicatea parent and child can communicate by any of the normal inter-process communication schemes pipes
massively parallel systemindicates to a parallel computer system involving a huge number of processors the numbers in a huge number of processors
what are various ids associated with a processunix identifies each process with a unique integer known as processid the process that implements the
parallel overheadthe amount of time needed to organize parallel tasks as opposed to undertaking useful work parallel overhead may comprise factors
granularityin parallel computing granularity can be defined as a qualitative assess of the ratio of computation to communication1 coarse granularity-
communicationsparallel tasks normally have to exchange data there are various manners in which this can be achieved like over a network or through a
shared memory shared memory refers to memory component of a computer system in which the memory can accessed directly by any of the processors in
serial executionexecution of a program serially one statement at one instance of time in the simplest case thats what takes place on a one processor
task a task is logically discrete section of computational work a task is normally a program or else set of instructions which are executed by a
mathematical simulation and modelling applicationsthe tasks include mathematical simulation and modelling need lots of parallel processing three
ai applicationssearch is a important element of an ai system and search functions are executed on huge quantities of complicated structured data by