Hello and welcome to exampundit. Here is a set of Professional Knowledge Quiz for IBPS SO IT Officer on mixed problems.
- The range of the numbers that can be stored in 8 bits, if negative number are stored in 2’s complement form, is
1) –128 to + 128
2) –128 to 127
3) –127 to +128
4) –127 to + 127
5) None of these
- Choose the most appropriate definition of plane graph
1) A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
2) A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two non-empty disjoint subsets X and Y in such a way that each edge of G has one end in X and one end in Y
3) A simple graph which is isomorphic to a Hamiltonian graph
4) All of the above
5) None of these
- Boolean algebra
1) An algebraic system defined by Boolean lattice is known as a boolean algebra
2) For boolean lagebra (x + y)’ = x’ . y’
3) For boolean algebra (x . y)’= x’ + y’
4) All of the above
5) None of these
4 ………… is a function that is expanded in line when it is invoked. That is, the compiler replaces
the function call with the corresponding function code.
1) Memory allocation function 2) Member function
3) Inline function 4) Default function
5) None of these
- A demand paging system with page table held in registers, takes 5 ms to service a page fault, if empty page is available or if the page is to replaced is not dirty. It takes 15 ms if the replaced page is dirty. Memory access time is 1,µs. Assume we want an effective access time 23, µs and that the page to be replaced is dirty 60% of the time. What is the approximate page fault rate to meet this access time requirement?
1) 0.1%
2) 1.0%
3) 2.5%
4) 0.01%
5) None of these
- Packets are related to which layer
1) Data link layer
2) Physical layer
3) Network layer
4) Presentation layer
5) None of these
- Feedback queue
1) are very easy to implement
2) dispatch tasks according to execution characteristics
3) are used to favour real-time tasks
4) require manual intervention to implement properly
5) None of these
- The main advantages of CMOS as compared to TTL
1) lower consumption and better noise margins
2) lower power consumption with low fan-out
3) higher speed operation with low power consumption
4) higher power consumption with high fan-out
5) None of these
- Rohan has an e-card that he uses to access different parts of his company’s R&D offices.
What type of card is he using?
1) Credit card
2) Purchase card
3) Smart card
4) Contact card
5) None of these
- Which of the following might be output as result of using a CASE tool?
1) Programmable Code
2) Flowcharts and data flow diagrams
3) Prototypes and Cost/benefit analysis
4) All of the above
5) None of these
- The process of macro-expanion is completely segregated from the process of assembly program.
The translator which performs macro-expansions is called
1) Macro Interpreter
2) Macro Pre-Processor
3) Macro Table
4) All of the above
5) None of these
- What is the output of the following C program?
main ()
{
int a[5] = {2,3};
printf(“\n%d%d%d”,a[2], a[3],a[4]);
1) Garbage Values
2) 2 3 3
3) 3 2 2
4) 0 0 0
5) None of these
- Which one is not logical
1) ORI
2) ORA
3) XRA
4) OVI
5) None of these
- RISC processor have
1) Relatively few instruction and addressing modes
2) All operations done within the register and CPU
3) Single cycle instruction execution
4) All of these
5) None of these
- TCP means
1) transmission content protocol
2) transfer control protocol
3) transmission control protocol
4) all of the above
5) None of these
- How many bit can accommodate instruction register
1) 8 bit
2) 16 bit
3) 32 bit
4) 4 bit
5) None of these
- Let A = {l, 2, 3}, B = {a, b} and R= {(1, a), (1, b), (3, a), (2, b)} be a relation from A to B.
The inverse relation R is
1) R–1 = {(a, l), (b, l), (a, 3), (b, 2)]}
2) R–1 = {(2, b), (3, a), (l, b), (l, a)}
3) R1 = {(b, 2), (a, 3), (b, l), (a, l)}
4) All of the above
5) None of these
- Yacc source program has 3 parts. Which of the following are Yacc source program parts?
1) Terminal symbol, non-terminal symbol, production rule
2) Declaration, translation rules, user routines
3) Declaration, Translation rules, C programs
4) All of the above
5) None of these
- A loading scheme in which loading and linking of external and references are postponed until execution time
1) Direct linking loader
2) Dynamic loading
3) Dynamic linking
4) Relocating loader
5) None of these
- Back tracking problem is seen in
1) predirective parser
2) LR parsar
3) recursive-descent parser
4) All of the above
5) None of these
Regards
Team EP
