Questions

The Indian Space Research Organisation(ISRO) is planning its maiden mission to Venus and its second one to Red planet. The same was confirmed by the newly allotted budget to the department of space, which mentions provisions for 'Mars Orbiter Mission II and Mission Venus'.

Routable protocols can work with a router and can be used to build large networks. Non-Routable protocols are designed to work on small, local networks and cannot be used with a router

Teressa Island is located in Andaman & Nicobar of India.

The feeding mechanism is of several types. If it is entirely plant-like (photosynthesis),it is called holophytic. It is entirely (holo) animal-like (zoic), that is devouring already existing food, it is called holozoic.

New salespersons needs:

a) He needs to know the information on company history, its policies, rules and regulations etc.

b) Details about the product- its features, usage , demand.

c) Systems and procedures as followed by the company. This may include the work timings, overimed, field work, work culture of that particular organisation etc.

d) Training on the basic ethics that need to be followed while selling a product.

e) He must know the basics of selling the different products of the company.

Long term scheduler determines which programs are admitted to the system for processing. It controls the degree of multiprogramming. Once admitted, a job becomes a process.

Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.

Short term scheduler, also know as a dispatcher executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption.

Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out.

Saina Nehwal