## Monday, 24 August 2020

### MTH601-Operations Research Quiz MCQs Lecture 23-45 Finalterm Objective Questions | SUPERSTARWEBTECH

MTH601-Operations Research Quiz MCQS #Objective #Questions #FinalTerm

1. The North-West Corner Rule
• is based on the concept of minimizing opportunity cost
• is used to find optimal solution
• is used to find an initial feasible solution
• None
2. In the initial iteration of Big M-method, the artificial variables appear in ___
• Basis
• Non-basic variables set
3. In the Simplex method to solve an LP problem, Gauss Jordan Elimination method demands that all the key column's entries should be ___
• strictly positive
• strictly negative
• maximum or minimum
• zero
4. In North West Corner method, in the first row and first column, avilable resource and sink contain '5' and '7' units respectively; then which of the following amount 'x11' will be allocated in the cell(1, 1)?
• Average(5,7) = 6
• Max(5,7) = 7
• Min(5,7) = 5
• Min(5,7-5) = 2
5. In M-method, which of the following is true about the coefficient (M) of artificial variable (A) in the objective function?
• M-->Zero
• M-->+infinity
• M-->-infinity
• M-->optimal solution
6. If a variable in the Primal is unrestricted in sign, then the corresponding constraint in the dual will be of ___ type and vice versa.
• >=
• <=
• =
• None
7. In Simplex Standard table to solve an LP problem, if the ratio by taking the RHS of each row and dividing by the corresponding element of the key column is {2/3, 1/3, -1/2}, then which of the following variable will be leaving?
• Variable corresponding to '2/3'
• Variable corresponding to '5'
• Variable corresponding to '1/3'
• Variable corresponding to '-1/2'
8. While facing degeneracy in solving an LP problem, then the further iterations always assure the non-negative optimal solution.
• True
• False
9. The dual of the dual of a Linear Programming problem is itself the ___ problem.
• Primal
• dual
• assignment
• transportation
10. In two phase method process, first phase ___ the sum of artificial variabes.
• minimize
• maximize
• maximize or minimize depending on the situation
• None

### CS501-Advanced Computer Architecture Quiz MCQs Lecture 23-45 Finalterm Objective Questions | SUPERSTARWEBTECH

CS501-Advanced Computer Architecture Quiz MCQS #Objective #Questions #FinalTerm

1. In which one of the following methods, does the CPU poll to identify the interrupting module and branches to an interrupt service routine on detecting an interrupt?
• Daisy Chain
• Software Poll ✔
• Multiple interrupt lines
• All of the given
2. Human works with base 10 and computers work with base ___
• 8
• 10
• 2 ✔
• 16
3. ___ is an electrical pathway through which processor communicates with the internal and external devices attached to the computer.
• Computer Bus ✔
• Hazard
• Memory
• Disk
4. An interface that can be used to connect the microcomputer bus to ___ is called an I/O Port.
• Flip Flops
• Memory
• Peripheral devices ✔
• Multiplexers
5. Which is the last instruction of the ISR that is to be executed when the ISR terminates?
• IRET ✔
• IRQ
• INT
• NMI
6. ___ is the simplest form for representing a signed number
• Biased Representation
• Sign Magnitude Form ✔
• None
7. Raid Level ___ is not a true member of the RAID family
• 0 ✔
• 2
• 3
• 4
8. Which I/O technique will be used by a sound card that may need to access data stored in the computer's RAM?
• Programmed I/O
• Interrupt driven I/O
• Direct memory access (DMA) ✔
• Polling
9. Where does the processor store the address of the first instruction of the ISR?
• Interrupt vector ✔
• Interrupt request
• Interrupt handler
• All of the given
10. When a particular sector is found, the data is transferred to ___
• RAM
• I/O module ✔
• Cache memory
• Instruction register
11. ___ is the time needed by the CPU to recognize (not service) an interrupt request.
• Interrupt Latency ✔
• Timer delay
• Throughput
12. The ___ is w-bit wide and contains a data word, directly connected to the data bus which is b-bit wide memory address register (MAR).
• memory buffer register (MBR) ✔
• Program Counter (PC)
• Instruction Register (IR)
13. Adding an address pin to a memory chip increases the capacity of memory by a factor of ___
• 1.5
• 2 ✔
• 2.5
• 3
14. The main issue/s in error control is/are ___
• Detection of Error
• Correction of Error
• Both Detection of Error and Correction of Error ✔
• Avoidance of Error
15. Along with information bits, we add up another bit, which is called?
• Start bit
• Parity bit ✔
• Stop bit
16. The conversion of numbers from a representation in one base to another is known as ___
• Number Representation
• Decimal Representation
17. Why DMA is faster than Programmed I/O technique because?
• DMA transfers data directly using CPU
• DMA transfers data directly without using CPU ✔
• DMA uses buffers with CPU
• DMA uses interrupted driven I/O
18. Multiple copies of the same data can exist in memory hierarchy simultaneously. The Cache needs updating mechanishm to prevent old data values from being used. This is the problem of ___
• Cache Miss
• Dirty Bit
• Cache Coherence ✔
• Write Allocate
19. ___ is the simplest form for representing a signed number
• Biased Representatin
• Sign Magnitude Form ✔
• None
20. ___depends upon the present position of the head and the position of the required sector.
• Direct Memory Access ✔
• Execution Time
• Throughput
• Seektime
21. In which technique does the hardware directly access host memory for reading or writing independent of CPU?
• Direct Memory Access (DMA) ✔
• Programmed I/O
• Interrupt driven I/O
• Polling

### CS508-Modern Programming Languages Quiz MCQs Lecture 23-45 Finalterm Objective Questions | SUPERSTARWEBTECH

CS508-Modern Programming Languages Quiz MCQS #Objective #Questions #FinalTerm

1. In ___ for final fields and methods the value is assigned later but in ___ you assign the value during declaration.
• Java, C++
• C++, C#
• Java, C#
• C++, Java
2. The concept of C# jagged array is similar in function to ___
• C++ rectangular Array
• Java Array of Array
• Java pointer Array
• C# Array
3. ___ in PROLOG are loosely typed
• Variables
• Constants
• Atoms
• Both constants and variables
4. ___ is used to initialize values of arrays in C++ and Java
• []
• {}
• ()
• ""
5. How many kinds of "type conversion" of primitive types are there in Java?
• Two
• Three
• Four
• Five
6. In java, explicit conversion of primitive type is done by ___
• aliasing
• boxing
• casting
7. The interference mechanism of PROLOG is based upon ___
• Forward chaining
• Propositional logic
• Back tracking
• Recursion
8. Dealing with unsafe/unmanaged code in ___ we have to compromise on the type safety.
• C#
• Java
• C++
9. There are no ___ types in java.
• arrays
• classes
• enum
• boolean
10. In Prolog, a "member(X, T)" predicate is used to check the membership of X in ___
• class
• symbol
• list
• both class and symbol
11. Unlike C/C++, arrays in PHP are ___
• Maps
• Templates
• Records
• Both Templates and Records
12. Classes and objects of PHP are similar to ___
• Classes and objects of Java
• Classes and objects of C++
• Classes and objects of Basic
• Classes and Objects of C
13. The ___ operator in C# is used to test if the operator is of a certain type.
• 'IN'
• 'AS'
• 'IS'
• 'OUT'
14. ___ compile initially to an intermediate. Which can be run by interpretation or just in time compilation or an appropriate virtual machine?
• C++ and C#
• C# and Java
• Java and C++
15. In ___ Boolean expression is convertible into integer type.
• C#
• C++
• Java
16. Managed or safe code in ___ is executed under the control of common language runtime (CLR) with automatic garbage collection, no explicit memory allocation and no explicit destructor.
• C++
• Java
• C#
17. In C#, Managed code is executed under the control of
• CLR
• CRL
• JVM
• Neither CLR or JVM
18. For event driven mechanism in C# we use ___ just like ___ in C++
• Event handler, Visual C++
• Event Buttons, Graphics code
• delegates, function pointer
• function pointer, delegates
19. C# code when compiled is converted into ___ code.
• MSIL
• MISL
• Bytecode
• machine native code
20. In C# to convert ___ into ___ and vice versa we use the concept of boxing.
• Object type, Primitive type
• Primitive type, reference type
• reference type, value type
• value type, reference type

## Thursday, 13 August 2020

### CS607-Artificial Intelligence Quiz MCQs Lecture 23-45 Finalterm Objective Questions | SUPERSTARWEBTECH

CS607-Artificial Intelligence Quiz MCQS #Objective #Questions #FinalTerm

1. Inductive Learning is based on the knowledge that if something happens a lot it is likely to be generally ___
• True ✔
• False
• Ambiguous
• None
2. If the antecedent is only partially true, then the output fuzzy set is truncated according to the ___ method.
• Intrinsic
• Implication ✔
• Boolean
• None
3. The input of aggregation process is the list of truncated output functions returned by the ___ process for each rule.
• Truncation
• Implication ✔
• Aggregation
• None
4. ___ learning works on existing facts and knowledge and deduces new knowledge from the old.
• Deductive ✔
• Inductive
• Application
• None
5. Machine learning typically follows ___ phases according to Finlay.
• Two
• Three ✔
• Four
• Five
6. Which one is NOT the phase of machine learning:
• Training
• Application
• Validation
• None ✔
7. In theoretical computer science there are two main branches of problems.
• Tractable and Intractable ✔
• Intractable and Induction
• Tractable and Induction
• None
8. ___ is the process by which the fuzzy sets that represent the outputs of each rule are combined into a single fuzzy set.
• Aggregation ✔
• Fuzzification
• Implication
• None
9. Outputs of learning are determined by the ___
• Application ✔
• Validation
• Training
• None
10. ___ is the process of formulating the mapping from a given input to an output using Fuzzy logic.
• FIZ
• FIS ✔
• FOS
• None
11. The brain is a collection of about 100 ___ interconnected neurons.
• Million
• Billion ✔
• Trillion
• None
12. A single Perceptron simply draws a line, which is a hyper plane when the data is ___ than/to two (2) dimensional.
• More ✔
• Less
• Equal
• None
13. In Candidate-Elimination algorithm version space is represented by two sets named:
• G and S ✔
• G and F
• S and F
• H and S
14. The first step of FIND-S is to initialize h to the most specific hypothesis in ___ : h<>
• H ✔
• I
• J
• K
15. Decision trees give us disjunctions of conjunctions, that is, they have the form: (A AND B) ___ (C AND D)
• OR ✔
• AND
• XOR
• None
16. Interactive Dichotomizer uses a special function ___, to evaluate the gain information of each attribute.
• GAIN ✔
• GET
• FIND
• EVAL
17. Measure of the effectiveness of an attribute in classifying the training data is called
• Information Gain ✔
• Measure Gain
• Information Goal
• None
18. Artificial Neural Networks is a new learning paradigm which takes its roots from ___ inspired approach to learning.
• Chemistry
• Physics
• Biology ✔
• Mathematics
19. Which one is NOT the advantage of Neural Network
• Excellent for pattern recognition
• Excellent classifiers
• Handles noisy data well
• None ✔
20. In all calculations involving Entropy we define ___ to be ___
• 0 log 0, 0 ✔
• 0 log 10, 1
• 0 log 0, 1
• 1 log 1, 1