MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1917 Mcqs, each offering curated multiple-choice questions to sharpen your UGC-NET knowledge and support exam preparation. Choose a topic below to get started.
| 1851. |
In UNIX, ______________ creates three subdirectories: 'PIS' and two subdirectories 'progs' and data from just created subdirectory 'PIS'. |
| A. | mdkir PIS/progs PIS/data PIS |
| B. | mkdir PIS progs data |
| C. | mkdir PIS PIS/progs PIS/data |
| D. | mkdir PIS/progs data |
| Answer» D. mkdir PIS/progs data | |
| 1852. |
Consider the following statements :(a) UNIX provides three types of permissions* Read* Write* Execute(b) UNIX provides three sets of permissions* permission for owner* permission for group* permission for othersWhich of the above statement/s is/are true? |
| A. | Only (a) |
| B. | Only (b) |
| C. | Both (a) and (b) |
| D. | Neither (a) nor (b) |
| Answer» D. Neither (a) nor (b) | |
| 1853. |
Which one of the following options is not a shell in UNIX system? |
| A. | Bourne Shell |
| B. | C Shell |
| C. | Net Shell |
| D. | Korn Shell |
| Answer» D. Korn Shell | |
| 1854. |
In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? |
| A. | Heap |
| B. | Stack |
| C. | Shared memory segments |
| D. | Both Heap and Stack |
| Answer» D. Both Heap and Stack | |
| 1855. |
Which statement is not correct about “init” process in Unix? |
| A. | It is generally the parent of the login shell. |
| B. | It has PID 1. |
| C. | It is the first process in the system. |
| D. | Init forks and execs a ‘getty’ process at every port connected to a terminal. |
| Answer» D. Init forks and execs a ‘getty’ process at every port connected to a terminal. | |
| 1856. |
In Unix operating system, special files are used to : |
| A. | buffer data received in its input from where a process reads |
| B. | provide a mechanism to map physical device to file names |
| C. | store list of file names plus pointers associated with i-nodes |
| D. | store information entered by a user application program or utility program |
| Answer» C. store list of file names plus pointers associated with i-nodes | |
| 1857. |
What will be the output of the following Unix command ?$rm chap0\[1 - 3\] |
| A. | Remove file chap0[1 - 3] |
| B. | Remove file chap01, chap02, chap03 |
| C. | Remove file chap\[1 - 3\] |
| D. | None of the above |
| Answer» B. Remove file chap01, chap02, chap03 | |
| 1858. |
Match the following WINDOWS system calls and UNIX system calls with reference to process control and File manipulation.Windows(a) Create - process ()(b) WaitForSingleObject ()(c) CreateFile ()(d) CloseHandle ()UNIX(i) Open ()(ii) Close ()(iii) Fork ()(iv) Wait ()Code : (a) (b) (c) (d) |
| A. | (iii) (iv) (i) (ii) |
| B. | (iv) (iii) (i) (ii) |
| C. | (iv) (iii) (ii) (i) |
| D. | (iii) (iv) (ii) (i) |
| Answer» B. (iv) (iii) (i) (ii) | |
| 1859. |
The Unix Kernel maintains two key data structures related to processes, the progress table and the user structure. Which of following information is not the part of user |
| A. | File descriptor table |
| B. | System call state |
| C. | Scheduling parameters |
| D. | Kernel stack |
| Answer» D. Kernel stack | |
| 1860. |
What does the following command do ?grep − vn "abc" x |
| A. | It will print all of the lines in the file x that match the search string "abc" |
| B. | It will print all of the lines in file x that do not match the search string "abc" |
| C. | It will print total no of the lines in file x that match the search string "abc" |
| D. | It will print the specific line numbers of file x in which there is a match for the string "abc" |
| Answer» B. It will print all of the lines in file x that do not match the search string "abc" | |
| 1861. |
Which statement is not true about process 0 in the Unix operating system? |
| A. | Process 0 is called init process |
| B. | Process 0 is not created by fork system call |
| C. | After forking process 1, process O becomes swapper process |
| D. | Process 0 is a special process created when system boots |
| Answer» B. Process 0 is not created by fork system call | |
| 1862. |
Which or the following commands would return process_id of sleep command? |
| A. | Sleep 1 and echo $? |
| B. | Sleep 1 and echo # |
| C. | Sleep 1 and echo $* |
| D. | Sleep 1 and echo $! |
| Answer» C. Sleep 1 and echo $* | |
| 1863. |
Which of the following flags are set when ‘JMP’ instruction is executed ? |
| A. | SF and CF |
| B. | AF and CF |
| C. | All flags |
| D. | No flag is set |
| Answer» E. | |
| 1864. |
The directory structure used in Unix file system is called |
| A. | Hierarchical directory |
| B. | Tree structured directory |
| C. | Directed acyclic graph |
| D. | Graph structured directory |
| Answer» B. Tree structured directory | |
| 1865. |
In UNIX, which of the following command is used to set the task priority ? |
| A. | init |
| B. | nice |
| C. | kill |
| D. | PS |
| Answer» C. kill | |
| 1866. |
In Unix, how do you check that two given strings a and b are equal? |
| A. | test $a -eq $b |
| B. | test $a -equal $b |
| C. | test $a = $b |
| D. | both a and c |
| Answer» E. | |
| 1867. |
Linux operating system uses |
| A. | Affinity Scheduling |
| B. | Fair Preemptive Scheduling |
| C. | Hand Shaking |
| D. | Highest Penalty Ratio Next |
| Answer» C. Hand Shaking | |
| 1868. |
Everything below the system call interface and above the physical hardware is known as ______. |
| A. | Kernel |
| B. | Bus |
| C. | Shell |
| D. | Stub |
| Answer» B. Bus | |
| 1869. |
_________ is an “umbrella” activity that is applied throughout the software engineering process. |
| A. | Debugging |
| B. | Testing |
| C. | Designing |
| D. | Software quality assurance |
| Answer» E. | |
| 1870. |
______ establishes information about when, why and by whom changes are made in a software. |
| A. | Software Configuration Management |
| B. | Change Control |
| C. | Version Control |
| D. | An Audit Trail |
| Answer» E. | |
| 1871. |
Component level design is concerned with |
| A. | Flow oriented analysis |
| B. | Class based analysis |
| C. | Both of the above |
| D. | None of the above |
| Answer» D. None of the above | |
| 1872. |
RAD stands for ______. |
| A. | Rapid and Design |
| B. | Rapid Aided Development |
| C. | Rapid Application Development |
| D. | Rapid Application Design |
| Answer» D. Rapid Application Design | |
| 1873. |
Testing of software with actual data and in actual environment is called |
| A. | Alpha testing |
| B. | Beta testing |
| C. | Regression testing |
| D. | None of the above |
| Answer» C. Regression testing | |
| 1874. |
Software Configuration Management is the discipline for systematically controlling |
| A. | the changes due to the evolution of work products as the project proceeds |
| B. | the changes due to defects (bugs) being found and then fixed |
| C. | the changes due to requirement changes |
| D. | all of the above |
| Answer» E. | |
| 1875. |
The factors that determine the quality of a software system are |
| A. | correctness, reliability |
| B. | efficiency, usability, maintainability |
| C. | testability, portability, accuracy, error tolerances, expandability, access control, audit |
| D. | All of the above |
| Answer» E. | |
| 1876. |
The relationship of data elements in a module is called |
| A. | Coupling |
| B. | Modularity |
| C. | Cohesion |
| D. | Granularity |
| Answer» D. Granularity | |
| 1877. |
Basis path testing falls under |
| A. | system testing |
| B. | white box testing |
| C. | black box testing |
| D. | unit testing |
| Answer» C. black box testing | |
| 1878. |
Which one from the following is false ? |
| A. | LALR parser is Bottom - Up parser |
| B. | A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1) |
| C. | LR parser is Bottom - Up parser |
| D. | In LL(1), the 1 indicates that there is a one - symbol look - ahead |
| Answer» C. LR parser is Bottom - Up parser | |
| 1879. |
Which phase of compiler generates stream of atoms ? |
| A. | Syntax analysis |
| B. | Lexical Analysis |
| C. | Code generation |
| D. | Code optimization |
| Answer» B. Lexical Analysis | |
| 1880. |
In a two-pass assembler, symbol table is |
| A. | Generated in first pass |
| B. | Generated in second pass |
| C. | Not generated at all |
| D. | Generated and used only in second pass |
| Answer» D. Generated and used only in second pass | |
| 1881. |
The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called __________ |
| A. | Symbol resolution |
| B. | Parsing |
| C. | Assembly |
| D. | Relocation |
| Answer» E. | |
| 1882. |
A program P calls two subprograms P1 and P2. P1 can fail 50% times and P2 40% times. Then P can fail |
| A. | 50% |
| B. | 60% |
| C. | 10% |
| D. | 70% |
| Answer» E. | |
| 1883. |
Which of the following concepts means adding new concepts to a program as it runs? |
| A. | Data hiding |
| B. | Dynamic loading |
| C. | Dynamic typing |
| D. | Dynamic binding |
| Answer» C. Dynamic typing | |
| 1884. |
The translator which performs macro calls expansion is called : |
| A. | Macro processor |
| B. | Micro pre-processor |
| C. | Macro pre-processor |
| D. | Dynamic linker |
| Answer» D. Dynamic linker | |
| 1885. |
Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right |
| A. | Leftmost derivation |
| B. | Leftmost derivation traced out in reverse |
| C. | Rightmost derivation traced out till reverse |
| D. | Rightmost derivation |
| Answer» B. Leftmost derivation traced out in reverse | |
| 1886. |
Match the following:(a) Forward Reference Table (i) Assembler directive(b) Mnemonic Table (ii) Uses array data structure(c) Segment Register Table (iii) Contains machine OP code(d) EQU (iv) Uses linked list data structurecode:(a) (b) (c) (d) |
| A. | (ii) (iii) (iv) (i) |
| B. | (iii) (iv) (ii) (i) |
| C. | (iv) (i) (iii) (ii) |
| D. | (iv) (iii) (ii) (i) |
| Answer» E. | |
| 1887. |
In compiler design ‘reducing the strength’ refers to |
| A. | reducing the range of values of input variables |
| B. | code optimization using cheaper machine instructions |
| C. | reducing efficiency of program |
| D. | None of the above |
| Answer» C. reducing efficiency of program | |
| 1888. |
Perceptron learning, Delta learning and LMS learning are learning methods which falls under the category of |
| A. | Error correction learning - learning with a teacher |
| B. | Reinforcement learning - learning with a critic |
| C. | Hebbian learning |
| D. | Competitive learning - learning without a teacher |
| Answer» B. Reinforcement learning - learning with a critic | |
| 1889. |
If A and B are two fuzzy sets with membership functions:μa(χ) ={0.2,0.5.,0.6,0.1,0.9}μb (χ)= {0.1,0.5,0.2,0.7,0.8}then the value of μa ∩ μb will be |
| A. | {0.2,0.5,0.6,0.7,0.9} |
| B. | {0.2, 0.5,0.2, 0.1,0.8} |
| C. | {0.1, 0.5, 0.6, 0.1,0.8} |
| D. | {0.1, 0.5, 0.2, 0.1,0.8} |
| Answer» E. | |
| 1890. |
A __________ point of a fuzzy set A is a point x ∈ X at which µA(x) = 0.5 |
| A. | Core |
| B. | Support |
| C. | Cross-over |
| D. | α - cut |
| Answer» D. α - cut | |
| 1891. |
The height h(A) of a fuzzy set A is defined ash(A) = sup A(x) |
| A. | h(A) = 0 |
| B. | h(A) <0 |
| C. | h(A)=1 |
| D. | h(A)<1 |
| Answer» D. h(A)<1 | |
| 1892. |
Consider a fuzzy set A defined on the interval X = [0, 10] of integers by the membership Junction μA(x) = x / (x+2)Then the α cut corresponding to α = 0.5 will be |
| A. | {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} |
| B. | {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} |
| C. | {2, 3, 4, 5, 6, 7, 8, 9, 10} |
| D. | None of the above |
| Answer» D. None of the above | |
| 1893. |
Let R and S be two fuzzy relations defined as follows. Then, the resulting relation, T, which relates elements of universe x to the elements of universe z using max-min composition is given by: |
| A. | (1) |
| B. | (2) |
| C. | (3) |
| D. | (4) |
| Answer» D. (4) | |
| 1894. |
Suppose the function y and a fuzzy integer number around -4 for x are given as y= (x-3)2 + 2.Around -4 = {(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f (Around -4) is given by: |
| A. | {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)} |
| B. | {(2, 0.6), (3, 1), (6, 1), (11, 0.3)} |
| C. | {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)} |
| D. | {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)} |
| Answer» D. {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)} | |
| 1895. |
Given U = {1,2,3,4,5,6,7} A = {(3, 0.7), (5, 1), (6, 0.8)} then A will be: (where ~ → complement) |
| A. | {(4, 0.7), (2,1), (1,0.8)} |
| B. | {(4, 0.3.): (5, 0), (6. 0.2) } |
| C. | {(l, 1), (2, 1), (3, 0.3), (4, 1), (6,0.2), (7, 1)} |
| D. | {(3, 0.3), (6.0.2)} |
| Answer» D. {(3, 0.3), (6.0.2)} | |
| 1896. |
Consider a fuzzy set old as defined below Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6), (60, 0.8), (70, 1), (80, 1)} Then the alpha-cut for alpha = 0.4 for the set old will be |
| A. | {(40,0.4)} |
| B. | {50, 60, 70, 80} |
| C. | {(20, 0.1), (30, 0.2)} |
| D. | {(20, 0), (30, 0), (40, 1), (50,1), (60, 1), (70, 1), (80, 1)} |
| Answer» E. | |
| 1897. |
What are the following sequence of steps taken in designing a fuzzy logic machine ? |
| A. | Fuzzification → Rule evaluation → Defuzzification |
| B. | Fuzzification → Defuzzification → Rule evaluation |
| C. | Rule evaluation → Fuzzification → Defuzzification |
| D. | Rule evaluation → Defuzzification → Fuzzification |
| Answer» B. Fuzzification → Defuzzification → Rule evaluation | |
| 1898. |
If a packet arrive with an M-bit value is '1' and a fragmentation offset value '0', then it is ______ fragment. |
| A. | First |
| B. | Middle |
| C. | Last |
| D. | All of the above |
| Answer» B. Middle | |
| 1899. |
The Mobile Application Protocol (MAP) typically runs on top of which protocol ? |
| A. | SNMP (Simple Network Management Protocol) |
| B. | SMTP (Simple Mail Transfer Protocol) |
| C. | SS7 (Signalling System 7) |
| D. | HTTP (Hyper Text Transfer Protocol) |
| Answer» D. HTTP (Hyper Text Transfer Protocol) | |
| 1900. |
The ATM cell is |
| A. | 48 bytes long |
| B. | 53 bytes long |
| C. | 64 bytes long |
| D. | 69 bytes long |
| Answer» C. 64 bytes long | |