MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1690 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 701. |
What is not true about distributed system ? |
| A. | It is a collection of processor |
| B. | All processors are synchronized |
| C. | They do not share memory |
| D. | None of the mentioned |
| Answer» C. They do not share memory | |
| 702. |
Internet provides _______ for remote login. |
| A. | telnet |
| B. | http |
| C. | ftp |
| D. | RPC |
| Answer» B. http | |
| 703. |
The capability of a system to adapt the increased service load is called |
| A. | scalability |
| B. | tolerance |
| C. | capacity |
| D. | none of the mentioned |
| Answer» B. tolerance | |
| 704. |
In distributed systems, link and site failure is detected by |
| A. | polling |
| B. | handshaking |
| C. | token passing |
| D. | none of the mentioned |
| Answer» C. token passing | |
| 705. |
Which routing technique is used in distributed system? |
| A. | fixed routing |
| B. | virtual routing |
| C. | dynamic routing |
| D. | all of the mentioned |
| Answer» E. | |
| 706. |
Processes on the remote systems are identified by |
| A. | host ID |
| B. | host name and identifier |
| C. | identifier |
| D. | process ID |
| Answer» C. identifier | |
| 707. |
Logical extension of computation migration is |
| A. | process migration |
| B. | system migration |
| C. | thread migration |
| D. | data migration |
| Answer» B. system migration | |
| 708. |
Which technique is based on compile-time program transformation for accessing remote data in a distributed-memory parallel system. |
| A. | cache coherence scheme |
| B. | computation migration |
| C. | remote procedure call |
| D. | message passing |
| Answer» C. remote procedure call | |
| 709. |
Network operating system runs on |
| A. | server |
| B. | every system in the network |
| C. | both server and every system in the network |
| D. | none of the mentioned |
| Answer» B. every system in the network | |
| 710. |
If one site fails in distributed system |
| A. | the remaining sites can continue operating |
| B. | all the sites will stop working |
| C. | directly connected sites will stop working |
| D. | none of the mentioned |
| Answer» B. all the sites will stop working | |
| 711. |
In distributed system each processor has its own |
| A. | local memory |
| B. | clock |
| C. | both local memory and clock |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 712. |
What are two capabilities defined in CAP system ? |
| A. | data & software capability |
| B. | address & data capability |
| C. | hardware & software capability |
| D. | software capability |
| Answer» B. address & data capability | |
| 713. |
What are characteristics of Cambridge CAP system as compared to Hydra system ? |
| A. | It is simpler and less powerful than hydra system |
| B. | It is more powerful than hydra system |
| C. | It is powerful than hydra system |
| D. | It is not as secure as Hydra system |
| Answer» B. It is more powerful than hydra system | |
| 714. |
What is the problem of mutually suspicious subsystem ? |
| A. | Service program can steal users data |
| B. | Service program can malfunction and retain some rights of data provided by user |
| C. | Calling program can get access to restricted portion from service program |
| D. | Calling program gets unrestricted access |
| Answer» C. Calling program can get access to restricted portion from service program | |
| 715. |
What are characteristics of rights amplification in Hydra ? |
| A. | This scheme allows a procedure to be certified as trustworthy |
| B. | Amplification of rights cannot be stated explicitly in declaration |
| C. | It includes kernel rights such as read |
| D. | All of the mentioned |
| Answer» B. Amplification of rights cannot be stated explicitly in declaration | |
| 716. |
What are characteristics of Hydra system ? |
| A. | It consist of known access rights and interpreted by the system |
| B. | A user can of protection system can declare other rights |
| C. | Hydra system is not flexible |
| D. | Hydra doesn’t provide rights amplification |
| Answer» B. A user can of protection system can declare other rights | |
| 717. |
How can Keys be defined or replaced ? |
| A. | create [keyname] [bits]. |
| B. | set-key |
| C. | Key |
| D. | MAKE [Key Name]. |
| Answer» C. Key | |
| 718. |
What is true about Indirection to revoke capability ? |
| A. | Capabilities point indirectly to the objects |
| B. | Each capability will not have a unique entry in global |
| C. | Table entries cannot be reused for other capabilities |
| D. | This system was adopted in MULTICS system |
| Answer» B. Each capability will not have a unique entry in global | |
| 719. |
What is false regarding Back-Pointers scheme to revoke capability ? |
| A. | List of pointers is maintained with each object |
| B. | When revocation is required these pointers are followed |
| C. | This scheme is not adopted in MULTICS system |
| D. | These point to all capabilities associated with that object |
| Answer» D. These point to all capabilities associated with that object | |
| 720. |
What is the reacquisition scheme to revoke capability ? |
| A. | When a process capability is revoked then it won’t be able to reacquire it |
| B. | Pointers are maintained for each object which can be used to revoke |
| C. | Indirect pointing is done to revoke object’s capabilities |
| D. | Master key can be used compare and revoke. |
| Answer» B. Pointers are maintained for each object which can be used to revoke | |
| 721. |
Why is it difficult to revoke capabilities ? |
| A. | They are too many |
| B. | They are not defined precicely |
| C. | They are distributed throughout the system |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 722. |
What is incorrect methods of revocation of access rights ? |
| A. | Immediate/Delayed |
| B. | Selective/General |
| C. | Partial/total |
| D. | Crucial |
| Answer» E. | |
| 723. |
What is need of protection ? |
| A. | Prevent mischievous violation |
| B. | Prevent and intentional |
| C. | Ensure that each program component uses resources allotted to it only |
| D. | All of the mentioned |
| Answer» E. | |
| 724. |
What is principle of least privilege ? |
| A. | Less privileges provide difficulty in executing admin tasks |
| B. | Users can get temporary high privilege access |
| C. | Users should be given just enough privileges to perform their tasks |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 725. |
What is main objective of protection ? |
| A. | Ensure all objects are protected individually |
| B. | Objects have different priority and thus different levels of protection |
| C. | Ensure that each object is accessed correctly and only by allowed processes |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 726. |
What is correct way the segmentation program address is stored ? |
| A. | name, offset |
| B. | start, stop |
| C. | access, rights |
| D. | offset, rights |
| Answer» B. start, stop | |
| 727. |
What is major feature of segmentation ? |
| A. | Program is divided in data memory and program memory |
| B. | Program is executed in segments |
| C. | Program is divided into pieces having different access rights |
| D. | It has effect of an unbounded architecture |
| Answer» D. It has effect of an unbounded architecture | |
| 728. |
What is best solution to have effect of unbounded number if base/bound registers? |
| A. | Tagged architecture |
| B. | Segmentation |
| C. | Fence method |
| D. | None of the mentioned |
| Answer» C. Fence method | |
| 729. |
What is true regarding tagged architecture ? |
| A. | Every word of machine memory has one or more extra bits |
| B. | Extra bits are used to do padding |
| C. | Extra bits are not used to identify rights to that word |
| D. | It is very compatible to code upgrades |
| Answer» B. Extra bits are used to do padding | |
| 730. |
How is disadvantage of all-or-nothing approach overcome ? |
| A. | Base/Bound |
| B. | Relocation technique |
| C. | Fence method |
| D. | Tagged architecture |
| Answer» E. | |
| 731. |
What is all-or-nothing situation for sharing in memory ? |
| A. | Program makes all its data available to be accessed |
| B. | It prohibits access to some |
| C. | It creates rules who can access program memory |
| D. | It separates program memory and data memory |
| Answer» B. It prohibits access to some | |
| 732. |
How can fence and relocation be used together ? |
| A. | To each program address, the contents of fence register are added |
| B. | To contents of fence register is subtracted from actual address of program |
| C. | To each program address, the contents of fence register are not added |
| D. | None of the mentioned |
| Answer» B. To contents of fence register is subtracted from actual address of program | |
| 733. |
What is correct regarding ‘relocation’ w.r.t protecting memory ? |
| A. | It is a process of taking a program as if it began at address 0 |
| B. | It is a process of taking a program as if it began at address 0A |
| C. | Fence cannot be used within relocation process |
| D. | All of the mentioned |
| Answer» B. It is a process of taking a program as if it began at address 0A | |
| 734. |
What is true regarding ‘Fence’ ? |
| A. | Its a method to confine users to one side of a boundary |
| B. | It can protect Operating system from one user |
| C. | It cannot protect users from each other |
| D. | All of the mentioned |
| Answer» E. | |
| 735. |
In asymmetric encryption |
| A. | same key is used for encryption and decryption |
| B. | different keys are used encryption and decryption |
| C. | no key is required for encryption and decryption |
| D. | none of the mentioned |
| Answer» C. no key is required for encryption and decryption | |
| 736. |
Multipartite viruses attack on |
| A. | files |
| B. | boot sector |
| C. | memory |
| D. | all of the mentioned |
| Answer» E. | |
| 737. |
File virus attaches itself to the |
| A. | source file |
| B. | object file |
| C. | executable file |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 738. |
Which one of the following is not an attack, but a search for vulnerabilities to attack? |
| A. | denial of service |
| B. | port scanning |
| C. | memory access violation |
| D. | dumpster diving |
| Answer» C. memory access violation | |
| 739. |
What is a trap door in a program? |
| A. | a security hole, inserted at programming time in the system for later use |
| B. | a type of antivirus |
| C. | security hole in a network |
| D. | none of the mentioned |
| Answer» B. a type of antivirus | |
| 740. |
Which one of the following is a process that uses the spawn mechanism to revage the system performance? |
| A. | worm |
| B. | trojan |
| C. | threat |
| D. | virus |
| Answer» B. trojan | |
| 741. |
The pattern that can be used to identify a virus is known as |
| A. | stealth |
| B. | virus signature |
| C. | armoured |
| D. | multipartite |
| Answer» C. armoured | |
| 742. |
The internal code of any software that will set of a malicious function when specified conditions are met, is called |
| A. | logic bomb |
| B. | trap door |
| C. | code stacker |
| D. | none of the mentioned |
| Answer» B. trap door | |
| 743. |
The code segment that misuses its environment is called a |
| A. | internal thief |
| B. | trojan horse |
| C. | code stacker |
| D. | none of the mentioned |
| Answer» C. code stacker | |
| 744. |
When an attempt is to make a machine or network resource unavailable to its intended users, the attack is called |
| A. | denial-of-service attack |
| B. | slow read attack |
| C. | spoofed attack |
| D. | starvation attack |
| Answer» B. slow read attack | |
| 745. |
In UNIX, domain switch is accomplished via |
| A. | file system |
| B. | user |
| C. | superuser |
| D. | none of the mentioned |
| Answer» B. user | |
| 746. |
Which one of the following is capability based protection system? |
| A. | hydra |
| B. | cambridge CAP system |
| C. | both hydra and cambridge CAP system |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 747. |
For a domain _______ is a list of objects together with the operation allowed on these objects. |
| A. | capability list |
| B. | access list |
| C. | both capability and access list |
| D. | none of the mentioned |
| Answer» B. access list | |
| 748. |
Global table implementation of matrix table contains |
| A. | domain |
| B. | object |
| C. | right-set |
| D. | All of the mentioned |
| Answer» E. | |
| 749. |
Access matrix model for user authentication contains |
| A. | a list of objects |
| B. | a list of domains |
| C. | a function which returns an object’s type |
| D. | all of the mentioned |
| Answer» E. | |
| 750. |
If the set of resources available to the process is fixed throughout the process’s lifetime then its domain is |
| A. | static |
| B. | dynamic |
| C. | neither static nor dynamic |
| D. | none of the mentioned |
| Answer» B. dynamic | |