Information Retrival Techniques Set 12

Computer Science Engineering (CSE)

Practice Mode Previous Next
On This Page

This set of Information Retrival Techniques Multiple Choice Questions & Answers (MCQs) focuses on Information Retrival Techniques Set 12

Q1 | What is FIFO algorithm?
  • first executes the job that came in last in the queue
  • first executes the job that came in first in the queue
  • first executes the job that needs minimal processor
  • first executes the job that has maximum processor needs
Answer: first executes the job that came in first in the queue
Explaination:
none.
Q2 | The strategy of making processes that are logically runnable to be temporarily suspended is called                          
  • non preemptive scheduling
  • preemptive scheduling
  • shortest job first
  • first come first served
Answer: preemptive scheduling
Explaination:
none.
Q3 | What is Scheduling?
  • allowing a job to use the processor
  • making proper use of processor
  • all of the mentioned
  • none of the mentioned
Answer: allowing a job to use the processor
Explaination:
none.
Q4 | are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
  • tq = 15ms
  • tq = 40ms
  • tq = 45ms
  • tq = 50ms
Answer: tq = 15ms
Explaination:
none.
Q5 | Orders are processed in the sequence they arrive if                rule sequences the jobs.
  • earliest due date
  • slack time remaining
  • first come, first served
  • critical ratio
Answer: first come, first served
Explaination:
none.
Q6 | Which of the following algorithms tends to minimize the process flow time?
  • first come first served
  • shortest job first
  • earliest deadline first
  • longest job first
Answer: shortest job first
Explaination:
none.
Q7 | Under multiprogramming, turnaround time for short jobs is usually                   and that for long jobs is slightly                        
  • lengthened; shortened
  • shortened; lengthened
  • shortened; shortened
  • shortened; unchanged
Answer: shortened; lengthened
Explaination:
none.
Q8 | ms of response time
  • i only
  • i and iii only
  • ii and iii only
  • i, ii and iii
Answer: i, ii and iii
Explaination:
i) shortest remaining time first scheduling is a preemptive version of shortest job scheduling. it may cause starvation as shorter processes may keep coming and a long cpu burst process never gets cpu.
Q9 | What is the other name for a postfix expression?
  • normal polish notation
  • reverse polish notation
  • warsaw notation
  • infix notation
Answer: reverse polish notation
Explaination:
reverse polish notation is the other name for a postfix expression whereas polish notation, warsaw notation are the other names for a prefix expression.
Q10 | Which of the following is an example for a postfix expression?
  • a*b(c+d)
  • abc*+de-+
  • +ab
  • a+b-c
Answer: abc*+de-+
Explaination:
abc*+de-+ is a postfix expression. +ab is a prefix expression and others are infix expressions.
Q11 | What is the time complexity of evaluation of postfix expression algorithm?
  • o (n)
  • o (n log n)
  • o (n2)
  • o (m log n)
Answer: o (n)
Explaination:
the time complexity of evaluation of infix, prefix and postfix expressions is o (n).
Q12 | Which of these operators have the highest order of precedence?
  • ‘(‘ and ‘)’
  • ‘*’ and ‘/’
  • ‘~’ and ‘^’
  • ‘+’ and ‘-‘
Answer: ‘~’ and ‘^’
Explaination:
the highest order of precedence is ~ and ^ followed by ‘*’ ,’ /’, ‘+’ ,’-‘ and then braces ‘(‘ ‘)’.
Q13 | Which of the following is not an application of stack?
  • evaluation of postfix expression
  • conversion of infix to postfix expression
  • balancing symbols
  • line at ticket counter
Answer: line at ticket counter
Explaination:
line at ticket counter is an application of queue whereas conversion of
Q14 | While evaluating a postfix expression, when an operator is encountered, what is the correct operation to be performed?
  • push it directly on to the stack
  • pop 2 operands, evaluate them and push the result on to the stack
  • pop the entire stack
  • ignore the operator
Answer: pop 2 operands, evaluate them and push the result on to the stack
Explaination:
when an operator is encountered, the first two operands are popped from the stack, they are evaluated and the result is pushed into the stack.
Q15 | Which of the following statement is incorrect?
  • postfix operators use value to their right
  • postfix operators use value to their left
  • prefix operators use value to their right
  • in postfix expression, operands are followed by operators
Answer: postfix operators use value to their right
Explaination:
all prefix operators use values to their right and all postfix operators use values to their left.
Q16 | What is the result of the given postfix expression? abc*+ where a=1, b=2, c=3.
  • 4
  • 5
  • 6
  • 7
Answer: 7
Explaination:
the infix expression is a+b*c. evaluating it, we get 1+2*3=7.
Q17 | ab*cd*+ where a=2,b=2,c=3,d=4.
  • 16
  • 12
  • 14
  • 10
Answer: 16
Explaination:
the infix expression is a*b+c*d. evaluating it, we get, 2*2+3*4=16.
Q18 | At this point, ‘*’ is encountered. What has to be done?
  • 5*4=20 is pushed into the stack
  • * is pushed into the stack
  • 2*3=6 is pushed into the stack
  • * is ignored
Answer: 5*4=20 is pushed into the stack
Explaination:
when an operator is encountered, the first two operands of the stack are popped, evaluated and the result is pushed into the stack.
Q19 | Evaluate the postfix expression ab + cd/- where a=5, b=4, c=9, d=3.
  • 23
  • 15
  • 6
  • 10
Answer: 6
Explaination:
the infix expression is (a+b)-c/d. evaluating it, (5+4)-9/3 gives 6.
Q20 | abc*+de*f+g*+ where a=1, b=2, c=3, d=4, e=5, f=6, g=2.
  • 61
  • 59
  • 60
  • 55
Answer: 59
Explaination:
the infix expression is a+b*c+ (d*e+f)*g. evaluating it, 1+2*3+(4*5+6)*2 gives 59.
Q21 | For the given expression tree, write the correct postfix expression.
  • abc*+
  • abc+*
  • ab+c*
  • a+bc*
Answer: abc*+
Explaination:
evaluating the given expression tree gives the infix expression a+b*c. converting it to postfix, we get, abc*+.
Q22 | What makes a good architecture?
  • the architecture may not be the product of a single architect or a small group
  • the architect should have the technical requirements for the system and an articulated and prioritized list of qualitative properties
  • the architecture may not be well documented
  • all of the mentioned
Answer: the architect should have the technical requirements for the system and an articulated and prioritized list of qualitative properties
Explaination:
the architecture should be the product of a single architect or a small group, the architecture should be well documented.
Q23 | What does a typical top level architecture consists of?
  • prop loss model(mopd)
  • reverb model(modr)
  • control process
  • all of the mentioned
Answer: all of the mentioned
Explaination:
a typical top level architecture consists of all the mentioned components.
Q24 | Which among the following are valid questions raised for the top level architectural model?
  • what is the nature of components?
  • what is the significance of the links?
  • what is the significance of the layout?
  • all of the mentioned
Answer: all of the mentioned
Explaination:
all of the mentioned are the valid questions.
Q25 | Which of the following are correct statements?
  • an architecture may or may not defines components
  • an architecture is not dependable on requirements
  • an architecture is foremost an abstraction of a system that suppresses details of the components that do not affect how they are used
  • all of the mentioned
Answer: an architecture is foremost an abstraction of a system that suppresses details of the components that do not affect how they are used
Explaination:
an architecture defines components, an architecture is dependable on requirements.
Previous Next