Operating System Top 500 + MCQS Download Pdf Set No 10

written by Assad Javaid | May 10, 2021

451. At the point when a cycle opens its first document expressly it will get descriptor number ?

  1. 1
  2. 2
  3. 3
  4. 4

452. I MB or 1 megabyte is comparable to?

  1. 1024 bytes
  2. 10242 bytes 
  3. 10243 bytes
  4. 1000000 bytes

453. The base layer in the layered methodology of Operating System is ?

  1. Hardware
  2. User interface
  3. Hardware
  4. Kernel

454.  has a various leveled document framework structure?

  1. DOS
  2. Windows
  3. UNIX

455. You can utilize the – order in UNIX to make an index?

  1. RM dir MK dir
  2. cp
  3. ccg

456. Records that start with a – in UNIX/Linux registry structure are as covered up documents ?.

  1. (spot)
  2. ( hash )
  3. /(slice)
  4. ~ (slant)

457. The making cycle is as a – measure while the new cycles are as the – of that measure ?

  1. Children, parent
  2. Parent, kids 
  3. Zombie, single

458. cushion puts  commonsense cutoff on the size of the cradle ?

  1. Bounded
  2. Unbounded
  3. Both Unbounded and limited

459. The are utilized for correspondence between related or irrelevant cycles on a similar framework or random measures on various frameworks?

  1. Pipes
  2. BSD Sockets  
  3. Named pipe (FIFO)

460.An is a theoretical key for getting to a record. ?

  1. File descriptor 
  2. Input Redirection
  3. Output Redirection
  4. FIFO

461. order gives a depiction of the current cycles.

  1. PS  
  2. top
  3. who
  4. Ls

462. You can show the entirety of the signs upheld by your framework, alongside their numbers, by utilizing the task?

  1. <Ctrl-A>
  2. FG
  3. jobs
  4. kill -I

463. The time it takes for the dispatcher to stop one cycle and start running is ?

  1. Dispatch inertness 
  2. Scheduling
  3. Context exchanging

464. First-Come, First-Served (FCFS) is a – booking calculation.?

  1. preemptive
  2. n-preemptive
  3. both preemptive and n-preemptive

465. The Shortest-Job-First Scheduling calculation can be ?

  1. Preemptive as it were
  2. n-preemptive as it were
  3. preemptive or n-preemptive.

466. Preemptive – booking is w and again called shortest remaining-time-first planning.

  1. First-Come-First-Served (FCFS)
  2. Round-Robin
  3. Sorted Job First (SJF)  
  4. Priority

467. The fundamental reason for is to assist the clients with using the equipment assets for finishing various assignments in a worked on way?

  1. Operating framework  
  2. Application programming
  3. All Software
  4. All of the given

468. Operating system helps deals with the accompanying aside from?

  1. Application programming
  2. Bus speed of the framework
  3. Memory
  4. Virtual memory

469. scheduler chooses the cycle from the work pool and put them in fundamental memory. ?

  1. Long term
  2. Short term
  3. Medium term
  4. Swapper

470. A parent cycle calling framework call will be suspended until youngsters measure ends?.

  1. wait
  2. fork
  3. exit
  4. exec

471. n-measure basic segment issue can be settled by utilizing?

  1. The bread kitchen calculation
  2. Deterministing displaying
  3. Analytic assessment

472. is a piece of code in a participating interaction wherein the cycle may refreshes shared information (variable, document, data set, and so forth) ?

  1. Critical examination
  2. Critical area
  3. Critical way
  4. Critical code

473. Cooperative calculation is like planning however seizure is added to switch between measures?.

  1. Shortest work first
  2. Shortest Remaining Time First
  3. First Come First Server  

474. DOS is single client working framework?.

  1. True  
  2. False

475.An interaction is supposed to be in basic area in the event that it executes code that controls shared information

  1. True  
  2. False

476. At the point when interaction opens its first document unequivocally it will get descriptor number

  1. 1
  2. 2
  3. 3  
  4. 4

478. A significant issue with need booking calculations is .

  1. Deadlock
  2. Aging
  3. Starvation

479. All strings inside an interaction share the location space.

  1. Same
  2. Different

480. shows data about the top cycles.

  1. Is
  2. Cs
  3. Top
  4. Cd

481.Utilities used for system administration (halt, if config, fdisk, etc.) are stored in                            directory.

  1. /dev
  2. /boot
  3. /lib
  4. /SBIN 

482. RM and [r]Mk dir commands are used to directory.?

  1. Create
  2. Move
  3. Remove
  4. Modify

483. You can use the mov file1 file2 command to move?             

  1. file1 to file2file 2 to file 1
  2. this command will t work for moving files.
  3. Both option a and b are correct

484. Taking the CPU from one process and giving the CPU to process is termed as?

  1. Context Switching
  2. Dispatching
  3. Swapping
  4. Tracking

485. A Process that has finished working, as well as its parent process has also finished its execution. In this state the process A will be called as……….  process.

  1. Child
  2. Thread
  3. Zombie
  4. Fork

486. Bounded Buffer is a buffer of …………    size?

  1. Variable
  2. fixed     

487. In………..  communication the process which wants to communicate with the other process must explicitly?

  1. name the recipient and the sender.
  2. Direct
  3. Indirect
  4. Automatic
  5. Self

488. In indirect inter process communication, a sender ……mention the name of the recipient.?

  1. Does
  2. does t    

489.The returned code to the child process after successful fork system call execution is?

  1. 1
  2. 2
  3. 3
  4. 0   

490. If the fork system call fails, it returns?

  1. 1
  2. -1
  3. 2
  4. 0

491. When a process opens its first file explicitly it will get descriptor number?              

  1. 1
  2. 2
  3. 3
  4. 4

491. I MB or 1 megabyte is equivalent to—-?

  1. 1024 bytes
  2. 10242  bytes
  3. 10243 bytes
  4. 1000000 bytes

492. The bottom layer in the layered approach of Operating System is———–?

  1. Hardware
  2. User interface
  3. Hardware
  4. Kernel

493. ————has a hierarchical file system structure?

  1. DOS
  2. Windows
  3. UNIX   

494. You can use the ———command in UNIX to create a directory?

  1. Rmdir
  2. make dir
  3. cp
  4. Gcc

495. Files that start with a ——– in UNIX/Linux directory structure are known as hidden files ?

  1. . (dot)
  2. ( hash )
  3. / (slash)
  4. ~ (tilt)

496. The creating process is called a————— process while the new processes are called the ———- of that process?

  1. one of the given options
  2. Children, parent
  3. Parent, children
  4. Zombie, single

  497.  buffer places  practical limit on the size of the buffer?

  1. Bounded
  2. Unbounded 
  3. Both Unbounded & bounded

498. The …….  are used for communication between related or unrelated processes on the same system or unrelated processes on different systems?

  1. Pipes
  2. BSD Sockets
  3. Named pipe (FIFO)

499. It  is an abstract key for accessing a file?

  1. File descriptor
  2. Input Redirection
  3. Output Redirection
  4. FIFO

500. ——- command gives a snapshot of the current processes?

  1. PS
  2. Top
  3. Who
  4. ls

<Previous Page

Take Quiz No 10

Next Page >