$ javac increment.java
$ java increment
32
Multiple Choice Questions
For all Subjects for BCA Bachelors of Computer Application and MCA Masters of Computer Application
Thursday, 5 September 2024
Honoring Educators on Teachers' Day: An Islamic Perspective
Sunday, 26 February 2023
Which technology is popular right now in the IT industry?
Wednesday, 22 February 2023
The Impact of Social Media on Mental Health: A Study of Young Adults
Wednesday, 15 February 2023
The Exam Study Guide-for Medical Student - Crack NEET
The Exam Study Guide-for Medical Student - Crack NEET
Medical students should create a well-thought-out study strategy in order to succeed on the NEET (National Eligibility cum Entrance Test). Concentrating on the subjects covered by the 👉syllabus and taking as many practice exams as possible is crucial. Watching lectures online and organizing study groups with classmates who may impart advice and aid one another in comprehending complex ideas are also advantageous. Last but not least, time management skills are crucial if you want to maximize your score and finish the exam on time.
Medical students need to be organized and well-prepared if they want to succeed in passing the NEET exam. First, it is vital to review the regulations and curriculum in depth. Additionally, students should make and follow a study timetable. Additionally, to become familiar with the structure and subject matter of the exam, students should complete as many question papers as possible.👉
to get the Online test practice click the following Link
It takes commitment and effort to succeed as a medical student, but it is not impossible. The first stage is establishing a good understanding of the basic sciences that constitute the foundation of your medical education. It is crucial to go through the content several times and to complete practice questions to hone your problem-solving abilities. It is also advantageous to use internet resources or attend lectures outside of the classroom.
Sunday, 22 January 2023
Computer Fundamentals by Basit Iqbal from Career Ready J&K
Thursday, 5 May 2022
10 Java Programming (MCQs)
Java Programming (MCQs)
1. Who invented Java Programming?
a) Guido van Rossum
b) James Gosling
c) Dennis Ritchie
d) Bjarne Stroustrup
Explanation: Java programming was developed by James Gosling at Sun Microsystems in 1995. James Gosling is well known as the father of Java.
2. Which statement is true about Java?
a) Java is a sequence-dependent programming language
b) Java is a code dependent programming language
c) Java is a platform-dependent programming language
d) Java is a platform-independent programming language
Explanation: Java is called ‘Platform Independent Language’ as it primarily works on the principle of ‘compile once, run everywhere’.
3. Which component is used to compile, debug and execute the java programs?
a) JRE
b) JIT
c) JDK
d) JVM
Explanation: JDK is a core component of Java Environment and provides all the tools, executables and binaries required to compile, debug and execute a Java Program.
4. Which one of the following is not a Java feature?
a) Object-oriented
b) Use of pointers
c) Portable
d) Dynamic and Extensible
Explanation: Pointers is not a Java feature. Java provides an efficient abstraction layer for developing without using a pointer in Java. Features of Java Programming are Portable, Architectural Neutral, Object-Oriented, Robust, Secure, Dynamic and Extensible, etc.
5. Which of these cannot be used for a variable name in Java?
a) identifier & keyword
b) identifier
c) keyword
d) none of the mentioned
Explanation: Keywords are specially reserved words that can not be used for naming a user-defined variable, for example, class, int, for, etc.
6. What is the extension of java code files?
a) .js
b) .txt
c) .class
d) .java
Explanation: Java files have .java extension.
7. What will be the output of the following Java code?
class increment {
public static void main(String args[])
{
int g = 3;
System.out.print(++g * 8);
}
}
a) 32
b) 33
c) 24
d) 25
Explanation: Operator ++ has more preference than *, thus g becomes 4 and when multiplied by 8 gives 32.
output:
8. Which environment variable is used to set the java path?
a) MAVEN_Path
b) JavaPATH
c) JAVA
d) JAVA_HOME
Explanation: JAVA_HOME is used to store a path to the java installation.
9. What will be the output of the following Java program?
class output {
public static void main(String args[])
{
double a, b,c;
a = 3.0/0;
b = 0/4.0;
c=0/0.0;
System.out.println(a);
System.out.println(b);
System.out.println(c);
}
}
a) NaN
b) Infinity
c) 0.0
d) all of the mentioned
Explanation: For floating-point literals, we have a constant value to represent (10/0.0) infinity either positive or negative, and also have NaN (not a number for undefined like 0/0.0), but for the integral type, we don’t have any constant that’s why we get an arithmetic exception.
10. Which of the following is not an OOPS concept in Java?
a) Polymorphism
b) Inheritance
c) Compilation
d) Encapsulation
Explanation: There are 4 OOPS concepts in Java. Inheritance, Encapsulation, Polymorphism, and Abstraction.
Sunday, 24 April 2022
MCQs on Computer Fundamentals
MCQs on Computer Fundamentals
1. Who is the father of Computers?
Wednesday, 23 January 2019
Operating System MCQ's
a) collection of programs that manages hardware resources
b) system service provider to the application programs
c) link to interface the hardware and application programs
d) all of the mentioned
Explanation: None.
a) System calls
b) API
c) Library
d) Assembly instructions
Explanation: None.
a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
c) kernel is made of various modules which can not be loaded in running operating system
d) kernel remains in the memory during the entire computer session
a) power failure
b) lack of paper in printer
c) connection failure in the network
d) all of the mentioned
Explanation: None.
a) to get and execute the next user-specified command
b) to provide the interface between the API and application program
c) to handle the files in operating system
d) none of the mentioned
Explanation: None.
a) time division multiplexing
b) space division multiplexing
c) both time and space division multiplexing
d) none of the mentioned
Explanation: None.
a) log file
b) another running process
c) new file
d) none of the mentioned
Explanation: None.
a) DTrace
b) DLocate
c) DMap
d) DAdd
Explanation: None.
a) VxWorks
b) Windows CE
c) RTLinux
d) Palm OS
Explanation: None.
a) monolithic kernel
b) hybrid kernel
c) microkernel
d) monolithic kernel with modules
Explanation: None.
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems
d) none of the mentioned
Explanation: Those systems which allows more than one process execution at a time, are called multiprogramming systems. Uniprocessing means only one processor.
a) address space and global variables
b) open files
c) pending alarms, signals and signal handlers
d) all of the mentioned
Explanation: None.
a) fork
b) create
c) new
d) none of the mentioned
Explanation: None.
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
Explanation: None.
a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
d) none of the mentioned
Explanation: When process is unable to run until some task has been completed, the process is in blocked state and if process is using the CPU, it is in running state.
a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned
Explanation: None.
a) each process is blocked and will remain so forever
b) each process is terminated
c) all processes are trying to kill each other
d) none of the mentioned
Explanation: None.
a) Function parameters
b) Local variables
c) Return addresses
d) PID of child process
Explanation: None.
a) wait
b) exit
c) fork
d) get
Explanation: None.
a) CPU registers
b) Program counter
c) Process stack
d) Pipe
Explanation: None.
a) Code
b) Stack
c) Bootstrap program
d) Data
Explanation: None.
a) Output
b) Throughput
c) Efficiency
d) Capacity
Explanation: None.
a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process
Explanation: None.
a) New
b) Old
c) Waiting
d) Running
Explanation: None.
a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory
Explanation: None.
a) Process Register
b) Program Counter
c) Process Table
d) Process Unit
Explanation: None.
a) the number of processes executed per unit time
b) the number of processes in the ready queue
c) the number of processes in the I/O queue
d) the number of processes in memory
Explanation: None.
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Explanation: None.
a) It is placed in an I/O queue
b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue
Explanation: None.
a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Explanation: None.
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned
Explanation: None.
a) full,little
b) full,lot
c) empty,little
d) empty,lot
Explanation: None.
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned
Explanation: None.
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned
Explanation: None.
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
d) None of the mentioned
Explanation: None.
a) block
b) wakeup
c) dispatch
d) none of the mentioned
Explanation: None.
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state
Explanation: None.
a) the processor executes more than one process at a time
b) the programs are developed by more than one person
c) more than one process resides in the memory
d) a single user can execute many programs at the same time
Explanation: None.
a) Running state
b) Ready state
c) Suspended state
d) Terminated state
Explanation: None.
a) cooperating process
b) child process
c) parent process
d) init process
Explanation: None.
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
Explanation: None.
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
Explanation: None.
a) thread
b) pipe
c) semaphore
d) socket
Explanation: None.
a) that can not drop below zero
b) that can not be more than zero
c) that can not drop below one
d) that can not be more than one
Explanation: None.
a) mutex locks
b) binary semaphores
c) both mutex locks and binary semaphores
d) none of the mentioned
Explanation: Binary Semaphores are known as mutex locks.
a) priority inversion
b) priority removal
c) priority exchange
d) priority modification
Explanation: None.
a) hardware level
b) software level
c) both hardware and software level
d) none of the mentioned
Explanation: None.
a) shared data structures
b) procedures that operate on shared data structure
c) synchronization between concurrent procedure invocation
d) all of the mentioned
Explanation: None.
a) a condition variable must be declared as condition
b) condition variables must be used as boolean objects
c) semaphore must be used
d) all of the mentioned
Explanation: None.
a) overloading the system by using a lot of secondary storage
b) under-loading the system by very less CPU utilization
c) overloading the system by creating a lot of sub-processes
d) crashing the system by utilizing multiple resources
Explanation: None.
a) wait
b) fork
c) exit
d) exec
Explanation: None.
a) Normally
b) Abnormally
c) Normally or abnormally
d) None of the mentioned
Explanation: None.
a) Multiprocessing, Multiprogramming
b) Multiprogramming, Uniprocessing
c) Multiprogramming, Multiprocessing
d) Uniprogramming, Multiprocessing
Explanation: None.
a) Process Control Block
b) Device Queue
c) Process Identifier
d) None of the the mentioned
Explanation: None.
a) A Negative integer, Zero
b) Zero, A Negative integer
c) Zero, A nonzero integer
d) A nonzero integer, Zero
Explanation: None.
a) be a duplicate of the parent process
b) never be a duplicate of the parent process
c) cannot have another program loaded into it
d) never have another program loaded into it
Explanation: None.
a) Orphan
b) Zombie
c) Body
d) Dead
Explanation: None.
a) allows processes to communicate and synchronize their actions when using the same address space
b) allows processes to communicate and synchronize their actions without using the same address space
c) allows the processes to only synchronize their actions without communication
d) none of the mentioned
Explanation: None.
a) communicate with one another without resorting to shared data
b) communicate with one another by resorting to shared data
c) share data
d) name the recipient or sender of the message
Explanation: None.
a) write & delete message
b) delete & receive message
c) send & delete message
d) receive & send message
Explanation: None.
a) have to be of a fixed size
b) have to be a variable size
c) can be fixed or variable sized
d) None of the mentioned
Explanation: None.
a) communication link
b) message-passing link
c) synchronization link
d) all of the mentioned
Explanation: None.
a) A communication link can be associated with N number of process(N = max. number of processes supported by system)
b) A communication link can be associated with exactly two processes
c) Exactly N/2 links exist between each pair of processes(N = max. number of processes supported by system)
d) Exactly two link exists between each pair of processes
Explanation: None.
a) there is another process R to handle and pass on the messages between P and Q
b) there is another machine between the two processes to help communication
c) there is a mailbox to help communication between P and Q
d) none of the mentioned
Explanation: None.
a) the sending process keeps sending until the message is received
b) the sending process sends the message and resumes operation
c) the sending process keeps sending until it receives a message
d) none of the mentioned
Explanation: None.
a) the queue can store at least one message
b) the sender blocks until the receiver receives the message
c) the sender keeps sending and the messages don’t wait in the queue
d) none of the mentioned
Explanation: None.
a) is referred to as a message system with buffering
b) is referred to as a message system with no buffering
c) is referred to as a link
d) none of the mentioned
Explanation: None.
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned
Explanation: None.
a) job queue
b) ready queue
c) execution queue
d) process queue
Explanation: None.
a) waiting time
b) turnaround time
c) response time
d) throughput
Explanation: None.
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
Explanation: None.
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) Equal priority processes can not be scheduled
d) None of the mentioned
Explanation: None.
a) all process
b) currently running process
c) parent process
d) init process
Explanation: None.
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Explanation: None.
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Explanation: None.
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned
Explanation: None.
a) kernel level thread
b) user level thread
c) process
d) none of the mentioned
Explanation: User level threads are managed by thread library and the kernel in unaware of them.
a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned
Explanation: None.
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned
Explanation: None.
a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned
Explanation: None.
a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) all of the mentioned
Explanation: None.
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm
Explanation: None.
a) in advance processes rarely know that how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
d) all of the mentioned
Explanation: None.
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned
Explanation: None.
a) deadlock
b) starvation
c) inversion
d) aging
Explanation: None.
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used
Explanation: None.
a) program counter
b) status register
c) instruction register
d) program status word
Explanation: None.
a) stack pointer
b) cache
c) accumulator
d) disk buffer
Explanation: None.
a) physical address
b) absolute address
c) logical address
d) none of the mentioned
Explanation: None.
a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
Explanation: None.
a) fragmentation
b) paging
c) mapping
d) none of the mentioned
Explanation: None.
a) stack pointer
b) page table base register
c) page register
d) program counter
Explanation: None.
a) logical address
b) absolute address
c) physical address
d) relative address
Explanation: None.
a) base address of each page in physical memory
b) page offset
c) page size
d) none of the mentioned
Explanation: None.
a) a technique for overcoming internal fragmentation
b) a paging technique
c) a technique for overcoming external fragmentation
d) a technique for overcoming fatal error
Explanation: None.
a) each process
b) each thread
c) each instruction
d) each address
Explanation: None.
a) operating system
b) cpu
c) user processes
d) all of the mentioned
Explanation: None.
a) in the low memory
b) in the high memory
c) either low or high memory (depending on the location of interrupt vector)
d) none of the mentioned
Explanation: None.
a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
Explanation: None.
a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) none of the mentioned
Explanation: None.
a) less than
b) equal to
c) greater than
d) none of the mentioned
Explanation: None.
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation and limit registers
Explanation: None.
a) is not easily accessible
b) comes and goes as needed
c) stays in the memory always
d) never enters the memory space
Explanation: None.
a) increases
b) decreases
c) changes
d) maintains
Explanation: None.
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned
Explanation: None.
a) the number of partitions
b) the CPU utilization
c) the memory size
d) all of the mentioned
Explanation: None
a) is being used
b) is not being used
c) is always used
d) none of the mentioned
Explanation: None.
a) compaction
b) larger memory space
c) smaller memory space
d) none of the mentioned
Explanation: None.
a) permit the logical address space of a process to be noncontiguous
b) permit smaller processes to be allocated memory at last
c) permit larger processes to be allocated memory at last
d) all of the mentioned
Explanation: None.
a) cannot be done
b) must be done
c) must not be done
d) can be done
Explanation: None.
a) the cost incurred
b) the memory used
c) the CPU used
d) all of the mentioned
Explanation: None.
a) first fit, best fit, worst fit
b) best fit, first fit, worst fit
c) worst fit, best fit, first fit
d) none of the mentioned
Explanation: None.
a) enough total memory exists to satisfy a request but it is not contiguous
b) the total memory is insufficient to satisfy a request
c) a request cannot be satisfied even when the total memory is free
d) none of the mentioned
Explanation: None.
a) first fit is used
b) best fit is used
c) worst fit is used
d) no matter which algorithm is used, it will always occur
Explanation: None.
a) larger than the memory
b) larger than the hole itself
c) very small
d) all of the mentioned
Explanation: None.
a) internal fragmentation occurs
b) external fragmentation occurs
c) both internal and external fragmentation occurs
d) neither internal nor external fragmentation occurs
Explanation: None.
a) frames
b) pages
c) backing store
d) none of the mentioned
Explanation: None.
a) frames
b) pages
c) backing store
d) none of the mentioned
Explanation: None.
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
Explanation: None.
a) frame bit
b) page number
c) page offset
d) frame offset
Explanation: None.
a) process
b) memory
c) page
d) frame
Explanation: None.
a) varied
b) power of 2
c) power of 4
d) none of the mentioned
Explanation: None.
a) m, n
b) n, m
c) m – n, m
d) m – n, n
Explanation: None.
a) internal
b) external
c) either type of
d) none of the mentioned
Explanation: None.
a) page
b) mapping
c) frame
d) memory
Explanation: None.
a) waiting
b) execution
c) context – switch
d) all of the mentioned
Explanation: None.
a) queues
b) stacks
c) counters
d) registers
Explanation: None.
a) very low speed logic
b) very high speed logic
c) a large memory space
d) none of the mentioned
Explanation: None.
a) key
b) value
c) bit value
d) constant
Explanation: None.
a) TLB miss
b) Buffer miss
c) TLB hit
d) All of the mentioned
Explanation: None.
a) address space locator
b) address space identifier
c) address process identifier
d) None of the mentioned
Explanation: None.
a) miss ratio
b) hit ratio
c) miss percent
d) None of the mentioned
Explanation: None.
a) protection algorithm with each page
b) restricted access rights to users
c) restriction on page visibility
d) protection bit with each page
Explanation: None.
a) is in the TLB
b) has data in it
c) is in the process’s logical address space
d) is the system’s physical address space
Explanation: None.
a) error
b) protection
c) valid – invalid
d) access
Explanation: None.
a) not to page
b) a two level paging algorithm
c) the page table itself
d) all of the mentioned
Explanation: None.
a) 3.0 ns
b) 68.0 ns
c) 68.5 ns
d) 78.5 ns
Explanation: None.
a) special support from hardware is required
b) special support from operating system is essential
c) special support from both hardware and operating system is essential
d) user programs can implement dynamic loading without any special support from hardware or operating system
Explanation: None.
a) a segment number & offset
b) an offset & value
c) a value & segment number
d) a key & value
Explanation: None.
a) one address, page number, offset
b) one offset, page number, address
c) page number, offset, address
d) none of the mentioned
Explanation: None.
a) segment base
b) segment peak
c) segment value
d) none of the mentioned
Explanation: None.
a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) none of the mentioned
Explanation: None.
a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) none of the mentioned
Explanation: None.
a) greater than segment limit
b) between 0 and segment limit
c) between 0 and the segment number
d) greater than the segment number
Explanation: None.
a) it is used as a physical memory address itself
b) it is subtracted from the segment base to produce the physical memory address
c) it is added to the segment base to produce the physical memory address
d) none of the mentioned
Explanation: None.
a) the segments are invalid
b) the processes get blocked
c) segments are shared
d) all of the mentioned
Explanation: None.
a) write only
b) read only
c) read – write
d) none of the mentioned
Explanation: None.
a) 13 bits
b) 14 bits
c) 15 bits
d) 16 bits
Explanation: To specify a particular segment, 5 bits are required. To select a particular byte after selecting a page, 10 more bits are required. Hence 15 bits are required.
a) File identifier
b) File name
c) File type
d) None of the mentioned
Explanation: None.
a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file in directory
d) none of the mentioned
Explanation: None.
a) open the file
b) read the file
c) write into the file
d) all of the mentioned
Explanation: None.
a) file name
b) file extension
c) file identifier
d) none of the mentioned
Explanation: None.
a) object file
b) source file
c) executable file
d) text file
Explanation: None.
a) crating of a filesystem
b) deleting a filesystem
c) attaching portion of the file system into a directory structure
d) removing portion of the file system into a directory structure
Explanation: None.
a) file metadata
b) page table
c) virtual memory
d) file system
Explanation: None.
a) network file system
b) local file system
c) volume manager
d) remote mirror
Explanation: None.
a) random access according to the given byte number
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record
Explanation: None.
a) unused space or single file are not contiguous
b) used space is not contiguous
c) unused space is non-contiguous
d) multiple files are non-contiguous
Explanation: None.
a) contiguous
b) linked
c) indexed
d) all of the mentioned
Explanation: None.
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned
Explanation: None.
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned
Explanation: None.
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned
Explanation: None.
a) boot loader
b) bootstrap
c) process control block
d) file control block
Explanation: None.
a) size
b) commands
c) timings
d) file system types
Explanation: None.
a) size of the linear list in memory
b) linear search to find a file
c) it is not reliable
d) all of the mentioned
Explanation: None.
a) disk address of the first block & length
b) length & size of the block
c) size of the block
d) total size of the file
Explanation: None.
a) finding space for a new file
b) inefficient
c) costly
d) time taking
Explanation: None.
a) First fit, Best fit
b) Worst fit, First fit
c) Best fit, Worst fit
d) None of the mentioned
Explanation: None.
a) internal fragmentation
b) external fragmentation
c) starvation
d) all of the mentioned
Explanation: None.
a) compaction
b) check
c) formatting
d) replacing memory
Explanation: None.
a) the file will not work
b) there will not be any space for the data, as the FCB takes it all
c) the file cannot be extended
d) the file cannot be opened
Explanation: None.