Ibps /sbi (i.t. officer jmgs 1) 2017

Can any one help me with any pdf or any website link where I can find sample Maths and english question paper for IBPS IT officer??

____________ is a technique, which allows to share single physical instance of an application or resource among multiple organizations or tenants.  

  • Virtualization
  • Grid Computing
  • SOA
  • Utility Computing

0 voters

 Pay-per-Use model is a feature of:

  • Utility Computing
  • Grid Computing
  • SOA
  • Virtualization

0 voters

https://youtu.be/D0Kgcy_oXBM

IBPS SO EXAM PATTERN 

 Guys what is the level of qns asked for professional knowledge asked for sbi assistant manager systems and ibps so??? is the guide books  r something enough or do we have to actually refer the text books. 

Koi online site btao IBPS SO IT ke lea Plus koi se test series Thanks in advance

Mistakes I made While Preparing for Banking Exams:http://wp.me/p6QLfH-e

 
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock : 

 ) can never occur
b) may occur
c) has to occur
d) None of these

Answer: a ) can never occur



kindly explain me the answer

 
In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is 


 ) 3.0 ns
b) 68.0 ns
c) 68.5 ns
d) 78.5 ns

Answer: c



solution


 : Time to access page in primary =0.35*10=3.5ns.
Miss ratio =(1-0.35)=0.65
Missed pages will in secondary memory.
Time to access page in secondary memory =Miss ratio*time for secondary memory
=(1-0.35)*100=65.0ns
Average time req is= Ts+Tp =65.0ns+3.5ns=68.5ns
 

  

Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page 1 having been brought earlier than page 2. (LRU algorithm is used)



how to solve

 



 Suppose DATA array contains 1000000 elements. Using the binary search algorithm, one requires only about n comparisons to find the location of an item in the DATA array, then n is  ?

How many feels good with current pattern of IT officer 

  • only professional knowledge marks count
  • No others marks should be included

0 voters

can anyone suggest me any good book about ibps it officer

any whats app group? link please.

 If you prepare for IBPS IT officer then read follwing things first (1) First go with last four-five year question paper asked in IBPS and SBI It officer. Please read explanation and each and evary technical term mentioned in question pper (2) Then make some imp notes on Unix basic, Network Topology, 7 Layers, Network devices, IP address classes and basic overview of netwoking like error control Single and Brust error, CRC, or GO with networking study material provided by Ankur gupta for Gate. (3) Go with all notes specially DBMS, Networking, OS, Data Structure, Complier Design and Software Engg Provided by ANkur Gupta for Gate. All these are things make you comfort and also help to quick study whatever needed for Exam. Goodluck

malicious software is known as

  • disasterware
  • badware
  • malware
  • maliciousware

0 voters

global view is also known as

  • external view
  • none of these
  • conceptual view
  • internal view

0 voters

IN OSI MODEL ROUTING IS PERFORMED BY

  • DATA LINKLAYER
  • NETWORK LAYER
  • TRANSPORT LAYER
  • SESSION LAYER

0 voters

ATM HEADER IS 

  • 15BYTE
  • 24 BYTE
  • 48 BYTE
  • 5 BYTE

0 voters

 

What questions are asked in Quant section , i mean what topics/syllabus in Quant?