📚 Exam by Category
▾
Objective Questions

Latest BEL Probationary Engineer Computer Science Exam Question (Objective Questions), MCQ in English

Subjects : Technical Subject (Computer Science), General Aptitude and Reasoning

Question Bank BEL Probationary Engineer (Computer Science) Exam - English
Back to Exam

Technical Subject (Computer Science)

Question 1Single Answer
When two number are added in excess-3 code and the sum is less than 9 , then in order to get the correct answer it is necessary to
  1. A
    subtract 0011 from the sum
  2. B
    add 0011 to the sum
  3. C
    subtract 0110 from the sum
  4. D
    add 0110 to the sum
Question 2Single Answer
The characteristic equation of an SR filp-flop is given by
  1. A
    Qn+1 = S+RQn          
  2. B
    Qn+1 = S n+   Qn 
  3. C
    Qn+1 =  + RQn  
  4. D
    Qn+1 = S+ Qn 
Question 3Single Answer
A graph with n vertices and n-1 edges that is not a tree , is
  1. A
    Connected 
  2. B
    disconnected
  3. C
    Euler  
  4. D
    A circuit
Question 4Single Answer
Networks that use different technologies can be connected by using
  1. A
    Packets
  2. B
    Switches
  3. C
    Bridges
  4. D
    Routers
Question 5Single Answer
A read bit can be read
  1. A
    and written by CPU
  2. B
    and written by peripheral
  3. C
    by peripheral and written by CPU
  4. D
    by CPU and written by the peripheral
Question 6Single Answer
The term ‘aging’ refers to
  1. A
    booting up the priority of the process in multi-level of queue without  feedback  .
  2. B
    gradually increasing the priority of job that wait in the system for a long  time to remedy infinite booking .
  3. C
    keeping track of the following a page has been in memory for the purpose of LRU replacement .
  4. D
    letting jobs reside in memory for a certain amount of time so that the no pages required can be estimated accurately
Question 7Single Answer
Consider a set of n tasks with known runtimes r1 ,r2………….. rn  To be run on a uni processor machine . Which of the following processer scheduling algorithms will result in the maximum throughput ?
  1. A
    Round Robin
  2. B
    Shortest job first
  3. C
    Highest response ratio first
  4. D
    First come first served
Question 8Single Answer
Consider a job scheduling program with 4 jobs J1 , J2, J3 and J4  With corresponding deadlines : (d1 , d2 , d3 , d4) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?
  1. A
    J2, J4, J1, J3       
  2. B
    J4, J1, J2, J3
  3. C
    J4, J2, J1, J3   
  4. D
    J4, J2, J3, J1
Question 9Single Answer
By using a eight bit optical encoder the degree of resolution that can be obtained is (approximately)
  1. A
    1.8o       
  2. B
    3.4 o
  3. C
    2.8 o   
  4. D
    1.4 o
Question 10Single Answer
The principal of the locality of reference justifies the use of
  1. A
    virtual memory            
  2. B
    interrupts
  3. C
    main memory    
  4. D
    cache memory
Question 11Single Answer
Consider the following pseudo-code
x ; = 1;
I ; = 1;
While (x,=1000) begin
x ; =2x;
i ; = i+1;end;
what is the value of I at the end of the pseudo-code
  1. A
    4        
  2. B
    5  
  3. C
    6             
  4. D
    7
Question 12Single Answer
The five items : A, B, C, D and E are pushed in  stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue . The two element are deleted from the queue and pushed back on the stack, Now one item is popped from the stack . The popped item is
  1. A
    A         
  2. B
    B           
  3. C
    C  
  4. D
    D
Question 13Single Answer
Round Robin schedule is essentially the pre-emptive version of
  1. A
    FIFO
  2. B
    Shortest job first
  3. C
    Shortest remaining time
  4. D
    Longest remaining time
Question 14Single Answer
The number of digit 1 present in the binary representative of 3 x 512 + 7 x 6 + 5 x 8 + 3 ? is
  1. A
    8      
  2. B
    9     
  3. C
    10          
  4. D
    12
Question 15Single Answer
Assume that each character code consists of 8 bits. The number of characters that can be transmitted per second through an synchronous serial line at 2400 baud rate, and with two stop bits is
  1. A
    109      
  2. B
    216          
  3. C
    218           
  4. D
    219
Question 16Single Answer
If the bandwidth of a single is 5 kHz and the lowest frequency is 52 kHz, what is the highest frequency
  1. A
    5 kHz  
  2. B
    10 kHz 
  3. C
    I47 kHz 
  4. D
    57 kHz
Question 17Single Answer
An Ethernet hub
  1. A
    Function as a repeater
  2. B
    Connects to a digital PBX
  3. C
    Connects to a token-ring network
  4. D
    Function as a gateway
Question 18Single Answer
Which of the following is an illegal array definition?
Type COLONGE: (LIME, PINE, MUSK, MENTHOL):
  1. A
    var a: array (COLONGE) or REAL;
  2. B
    var a:  array [REAL] of REAL;
  3. C
    var a: array [‘A’……..’Z’] of REAL;
  4. D
    var a: array [BOOLEAN] of REAL;
Question 19Single Answer
The team phong associated with
  1. A
    Ray tracing
  2. B
    Shading
  3. C
    Hiddenline removal
  4. D
    a game
Question 20Single Answer
The Boolean expression is given by
  1. A
    A      
  2. B
    B      
  3. C
       
  4. D
    AB
Question 21Single Answer
The postfix expression AB + CD − can be evaluated using a
  1. A
    stack
  2. B
    tree
  3. C
    queue
  4. D
    linked list
Question 22Single Answer
The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal .
  1. A
    ABFCDE
  2. B
    ADBFEC
  3. C
    ABDECF
  4. D
    None of the above
Question 23Single Answer
The branch logic that provides making capabilities in the control unit is known as
  1. A
    Controlled transfer
  2. B
    Conditional transfer
  3. C
    Unconditional transfer
  4. D
    None of the above
Question 24Single Answer
The number of colour required to properly colour the vertices of every planer graph is
  1. A
    2
  2. B
    3
  3. C
    4
  4. D
    5
Question 25Single Answer
In multiuser database if two users wish update the same record at the same time, they are prevented from doing so by
  1. A
    Jamming
  2. B
    Password
  3. C
    Documentation
  4. D
    Record lock
Question 26Single Answer
A binary search tree is a binary tree :
  1. A
    All items in the left subtree are less than root
  2. B
    All items in the right subtree greater than or equal to the root
  3. C
    Each subtree is itself a binary search tree
  4. D
    All of the above
Question 27Single Answer
What deletes the entire file except the file structure ?
  1. A
    ERASE
  2. B
    DELETE
  3. C
    ZAP
  4. D
    PACK
Question 28Single Answer
Which command is the fastest among the following ?
  1. A
    COPY TO < NEW FILE >
  2. B
    COPY STRUCTURE TO < NEW FILE >
  3. C
    COPY FILE < FILE 1> < FILE 2 >
  4. D
    COPY TO MFILE-DAT DELIMITED
Question 29Single Answer
B+ tree are preferred to binary tree in Database because ?
  1. A
    Disk capacity are greater than memory
  2. B
    Disk access is much slower than memory access
  3. C
    Disk data transfer rates are much less than memory data transfer rate
  4. D
    Disks are more reliable than memory
Question 30Single Answer
A Transaction Manager is which of the following ?
  1. A
    maintains a log of transactions
  2. B
    Maintains before and after database images
  3. C
    maintains appropriate concurrency control
  4. D
    All of the above
Question 31Single Answer
Leaves of which of the following trees are at the sam level ?
  1. A
    Binary tree
  2. B
    B-tree
  3. C
    AVL-tree
  4. D
    Expression tree
Question 32Single Answer
Which of the following TCP/IP Internet protocol is diskless machine uses to obtain its IP address from a server ?
  1. A
    RAP
  2. B
    RIP
  3. C
    ARP
  4. D
    X.25
Question 33Single Answer
Decryption and encryption of data are the responsibility of which of the following later ?
  1. A
    Physical layer
  2. B
    Data Link layer
  3. C
    Presentation layer
  4. D
    Session layer
Question 34Single Answer
In which circuit switching, delivery of data is delayed because data must be stored and retrieved from RAM ?
  1. A
    Space division
  2. B
    Time division
  3. C
    Virtual
  4. D
    Packet
Question 35Single Answer
In which Routing Method do all the routers have a common database ?
  1. A
    Distance vector
  2. B
    Link state
  3. C
    Link vector
  4. D
    Dijkestra method
Question 36Single Answer
Page Shift Keying (PSK) Method is used to modulate digital signal at 9600 bps using 16 level. Find the line signals and speed (i.e. modulation rate) .
  1. A
    2400 bauds
  2. B
    1200 bauds
  3. C
    4800 bauds
  4. D
    9600 bauds
Question 37Single Answer
The station to hub distance in which it is 2000 metres .
  1. A
    100 Base - Tx
  2. B
    100 Base-Fx
  3. C
    100 Base-T4
  4. D
    100 Base-T1
Question 38Single Answer
Main aim of software engineering is to produce
  1. A
    program
  2. B
    software
  3. C
    within budget
  4. D
    software within budget in the given schedule
Question 39Single Answer
Key process area of CMM level 4 are also clasified by a process which is
  1. A
    CMM level 2
  2. B
    CMM level 3
  3. C
    CMM level 5
  4. D
    All of the above
Question 40Single Answer
Validation means -
  1. A
    are we bulding the product right
  2. B
    are we building the right product
  3. C
    Verification of fields
  4. D
    None of the above
Question 41Single Answer
If a process is under statistical control, then it is
  1. A
    Maintainable
  2. B
    Measurable
  3. C
    Predictable
  4. D
    Verifiable
Question 42Single Answer
In a function oriented design, we
  1. A
    minimize cohesion and maximize coupling
  2. B
    maximize cohesion and minimize coupling
  3. C
    maximize cohesion and maximize coupling
  4. D
    minimize cohesion and minimize coupling
Question 43Single Answer
Which of the following metric does not depend on the programming language used ?
  1. A
    Line of code
  2. B
    Function count
  3. C
    Member of token
  4. D
    All of the above
Question 44Single Answer
A/B+ tree index is to be built on the name atribute of the relation STUDENT. Asume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given the scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ tree ?
  1. A
    16
  2. B
    42
  3. C
    43
  4. D
    44
Question 45Single Answer
The inorder traversal of the tree will yield a sorted listing of elements of tree in
  1. A
    Binary tree
  2. B
    Binary search tree
  3. C
    Heaps
  4. D
    None of the above
Question 46Single Answer
Mobile IP provides two basic functions .
  1. A
    Route discovery and registration
  2. B
    Agent discovery and registration
  3. C
    IP binding and registration
  4. D
    None of the above
Question 47Single Answer
Pre-emptive scheduling is the strategy of temporarily suspending a gunning process
  1. A
    before the CPU time slice expires
  2. B
    to allow starving processes to run
  3. C
    when it requests I/O
  4. D
    to avoid collision
Question 48Single Answer
In round robin CPU scheduling as time quantum is increased the average turn around time
  1. A
    increases
  2. B
    decreases
  3. C
    remains constant
  4. D
    varies irregularly
Question 49Single Answer
Resources are allocated to the process on nonsharable basis is
  1. A
    mutual exclusion
  2. B
    hold and wait
  3. C
    no pre-emption
  4. D
    circular wait
Question 50Single Answer
Cached and interleaved memories are ways of speeding up memory access between CPU's and slower RAM. Which memory models are best suited (i.e. improves the performance most) for which programs ?
(i) Cached memory is best suited for small loops
(ii) Inteleaved memory is best suited for small loops
(iii) Interleaved memory is best suited for large sequential
(iv) Cached memory is best suited for large sequential
code :
  1. A
    (i) and (ii) are true
  2. B
    (i) and (iii) are true
  3. C
    (iv) and (ii) are true
  4. D
    (iv) and (iii) are true
Important Questions Package

BEL Probationary Engineer Computer Science Exam Online Question Bank Package

Buy BEL Probationary Engineer Computer Science Important Questions, MCQ, question answer in Hindi & English. It will help you to score high marks in BEL Probationary Engineer Computer Science question bank 2026 in Online, PDF & Print study material.

+ Free Monthly Current Affairs, GK & more PDF Download
Sr.Package NameAmount
1.BEL Probationary Engineer (Computer Science) Exam - Hindi
Description : 1000 Question with Answer
₹101 [₹500]
2.BEL Probationary Engineer (Computer Science) Exam - Hindi
Description : 2000 Question with Answer
₹151 [₹500]
3.BEL Probationary Engineer (Computer Science) Exam - Hindi
Description : 3000 Question with Answer
₹181 [₹500]
4.BEL Probationary Engineer (Computer Science) Exam - English
Description : 1000 Question with Answer
₹101 [₹500]
5.BEL Probationary Engineer (Computer Science) Exam - English
Description : 2000 Question with Answer
₹151 [₹500]
6.BEL Probationary Engineer (Computer Science) Exam - English
Description : 3000 Question with Answer
₹181 [₹500]
7.BEL Probationary Engineer (Computer Science) Exam - English
Description : 4000 Question with Answer
₹201 [₹500]
8.BEL Probationary Engineer (Computer Science) Exam - Hindi
Description : 1000 Question & Answer Download in PDF (Send by Email)
₹151 [₹450]
9.BEL Probationary Engineer (Computer Science) Exam - English
Description : 1000 Question & Answer Download in PDF (Send by Email)
₹151 [₹450]
10.BEL Probationary Engineer (Computer Science) Exam Question Bank Book - Hindi
Description : 1000 Question with Answer (Printed Material)
₹450 [₹800]
11.BEL Probationary Engineer (Computer Science) Exam Question Bank Book - English
Description : 1000 Question with Answer (Printed Material)
₹390 [₹600]
Back to Exam