Combined Bank Question Solution(Updated) 25/10/2021 Assistant Hardware Engineer/ Assistant Engineer (IT)/ AHME

Stack IT Job Solution :: Combined Bank
Stack
IT
Question
Bank
|
01789741518,
01761719838
|
Buy
Book:
stackvaly.com
|
Online
Exam:
exam.stackvaly.com

Banker Selection Commettiee
Combined 3 Bank
Compiled By: Stack IT Job Solution
Post: Assistant Hardware Engineer/ Assistant
Engineer (IT)/ AHME
Exam Type: MCQ
Date: 25.10.2021 Time: 1 Hour
Exam Taker: ANZA
প্রশ্ন-১ । Consider a virtual memory system with
FIFO page replacement policy for an
arbitrary page access pattern, increasing
the number of page frames in main
memory will-
 Always decrease
the number of
page faults.
 Always increase
the number of page
faults.
 Never affect the
number of page
faults.
 Sometimes
increase the
number of page
faults.
sometimes increase the number of
page faults
During FIFO page replacement policy, due to increase
in the no. of page frames in memory should decrease
the no. of page faults since more frames can be kept
there. But due to Belady's Anomaly after certain limit
or in some page access instances no. of page faults are
high.
Hence (D) is correct option.
প্রশ্ন-২ । Which of the following technique uses
memorizations?
 Greedy
algorithms
 Dynamic
Programming
 Divide and
Conquer
approach.
 None of them
Dynamic programming approach
DP is a solution strategy which asks you to find
similar smaller subproblems so as to solve big
subproblems. It usually includes recurrence relations
and memoization.
Memoization is a technique to avoid repeated
computation on the same problems. It is special form
of caching that caches the values of a function based
on its parameters.
প্রশ্ন-৩ । Mapping to a known IP address to a
MAC layer address is done by which of
the following protocols?
 Dynamic Host
Control protocol
(DHCP)
 Open Shortest path
First(OSPF)
Protocol
 Address
Resolution
Protocol (ARP)
 Network address
Translation (NAT)
Address Resolution Protocol (ARP)
Address Resolution Protocol (ARP) The Address
Resolution Protocol is a layer 2 protocol used to map
MAC addresses to IP addresses. All hosts on a
network are located by their IP address, but NICs do
not have IP addresses, they have MAC addresses.
ARP is the protocol used to associate the IP address to
a MAC address.
প্রশ্ন-৪ । Applying the LRU page replacement to
the reference string: 1 2 4 5 2 1 2 4. The
main memory can accommodate 3 pages
and it already has page 1 and 2. Page 1
came in before page 2. How many page
faults will occur?
 3  4
 5  6
4
প্রশ্ন-৫ । A student breaks the door of a
professor’s office to obtain a copy of the
next day’s examination. Define the type
of security attack in this case
 Snooping  Repudiation
 Masquerading  Replaying
Snooping
A student breaks into a professor's office to obtain a
copy of the next day's test This is a type of
confidentiality attackbecause an unauthorized student
intrudes into the professor's room to obtain personal
information.
প্রশ্ন-৬ । Which of the following is a device that is
used to connect a number of LANs?
 Bridge  Switch
S
t
a
c
k
I
T
J
o
b
S
o
l
u
t
i
o
n
Phone: 01812603406 Whatsapp: 01789741518 Order: stackvaly.com

Stack
IT
Question
Bank
|
01789741518,
01761719838
|
Buy
Book:
stackvaly.com
|
Online
Exam:
exam.stackvaly.com

 Router  Repeater
Router
A device that is used to connect a number of LANs is
a Router.
প্রশ্ন-৭ । Which of the following registers is loaded
with the contents of the memory lacation
pointed by the PC?
 Memory address
registers
 Instruction
registers
 Memory Data
registers
 Program Counter
Instruction registers
In computing, an instruction register (IR) is the part of
a CPU's control unit that holds the instruction
currently being executed or decoded.
প্রশ্ন-৮ । Which of the following command is a
type of Data Definition language
command?
 Create  Update
 Delete  Select
Create
CREATE, ALTER, DROP, and TRUNCATE are the
most often used DDL in SQL queries.
প্রশ্ন-৯ । In binary search, what is the average
number of comparisons required for
search an element in a list is the element
number is n?
 n/2  n
 log2 n  n-1
log2 n
প্রশ্ন-১০ । Let transaction T1 has obtained a shared
mode lock S on data item Q and
Transaction T2 has obtained an exclusive
mode lock X on data item R. then which
of the following the statement is true?
 T1 can read Q
but cannot write
Q
 T1 can read and
write Q
 T2 can not read
R but can write
R
 T2 can not read
and write R
T1 can read Q but cannot write Q
A lock is a variable associated with a data item that
describes the status of the data item with respect to
possible operations that can be applied to it. They
synchronize the access by concurrent transactions to
the database items. It is required in this protocol that
all the data items must be accessed in a mutually
exclusive manner.
Shared Lock: If a transaction Ti has obtained a shared-
mode lock (denoted by S) on item Q, then Ti can read,
but cannot write, Q.
Exclusive Lock: If a transaction has obtained an
exclusive mode lock, then it can both read and write
on the item on which it in operating.
Hence Option 1 is correct
প্রশ্ন-১১ । The address bus flow in …..
 Unidirectional  Bidirectional
 Multidirectional  Circular
unidirection
Address bus is unidirectional because data flow in one
direction, from microprocessor to memory or from
microprocessor to Input/output devices (That is, Out
of Microprocessor).
প্রশ্ন-১২ । A proxy server is used as the computer-
 With external
access
 Acting as a backup
 Performing file
handling
 Accessing user
permissions
Accessing user permissions
A proxy server is a dedicated computer or a software
system running on a computer that acts as an
intermediary between an endpoint device, such as a
computer, and another server from which a user or
client is requesting a service.
প্রশ্ন-১৩ । Which would you do first when
troubleshooting a faulty monitor?
 Check its
connections to
the computer
and power
source
 Use a meter to
check the CRT and
internal circuitry
for continuity.
 Power down the
computer, then
turn it on again
to see if that
corrects the
problem.
 Power down the
monitor, then turn
it on again to see if
that correct the
problem.
Check its connections to the
computer and power source
প্রশ্ন-১ ৪। Which one of the following commands is
used to restore the database to the last
S
t
a
c
k
I
T
J
o
b
S
o
l
u
t
i
o
n

Stack
IT
Question
Bank
|
01789741518,
01761719838
|
Buy
Book:
stackvaly.com
|
Online
Exam:
exam.stackvaly.com

committed state?
 Savepoint  Rollback
 Commit  None of the Above
Rollback
This command restores the database to last committed
state. It is also used with the SAVEPOINT command
to jump to a savepoint in an ongoing transaction.
প্রশ্ন-১৫ । A workstation has just been istalled on
an Ethernet LAN, but can not
communicate with the network. What
should you check first?
 Reinstall the
network
protocols
 Reinstall the
network interface
card driver
 Verify the ip
configuration on
the workstation
 Verify the link
status on the
computer’s
network card.
verify the link status on the
computer's network card
প্রশ্ন-১৬ । Which is correct characteristic of
selection sort?
 Time
complexity O(n)
 Should use it when
memory write is
costly
 Should use it
when memory
read is costly
 It is not in-place
sort
Should use it when memory write is
costly
selection sort is an in-place comparison sorting
algorithm. It has an O(n2
) time complexity, which
makes it inefficient on large lists, and generally
performs worse than the similar insertion sort.
Selection sort is preferable if writing to memory is
significantly more expensive than reading. Insertion
sort or selection sort are both typically faster for small
arrays (i.e., fewer than 10-20 elements).
প্রশ্ন-১৭ । Which is the correct output?
int i=4; printf(“ %d %d”, ++i, i++);
printf(“%d”, i++);
 4 5 6  5 7 8
 6 4 6  4 5 7
6 4 6
প্রশ্ন-১৮ । Which one is not the flag of the 8086
Microprocessor?
 Carry Flag  Parity Flag
 Zero Flag  State Flag
State Flag
প্রশ্ন-১৯ । To remove partial dependency from a
database, which technique you will use?
 1NF  2NF
 3NF  BCN
2NF
The normalization of 1NF relations to 2NF involves
the removal of partial dependencies. If a partial
dependency exists, we remove the partially dependent
attribute(s) from the relation by placing them in a new
relation along with a copy of their determinant
প্রশ্ন-২০ । Find the correct output: System
.out.print(‘D’ + ‘E’ + ‘F’ )
 137  DEF
 207  D E F
207
প্রশ্ন-২১ । Which one is the correct SQL statement
to find the second highest mark from
STUDENT database contains the marks
of all students?
 Select
MAX(marks)
from student
where marks not
in (select
Max(marks)
from student
 Select max(marks)
from student where
marks in (select
max(marks) from
student
 Select
max(marks)
from student
 Select max(marks)
from student where
marks not in (select
Min(marks) from
student
Select MAX(marks) from student
where marks not in (select
Max(marks) from student
প্রশ্ন-২২ । Suppose you have a complete undirected
graph with 4 nodes. What is the
maximum number of minimum spanning
Tree (MST ) you can form?
 4  8
 16  1
16
If a graph is a complete graph with n vertices, then
S
t
a
c
k
I
T
J
o
b
S
o
l
u
t
i
o
n

Stack
IT
Question
Bank
|
01789741518,
01761719838
|
Buy
Book:
stackvaly.com
|
Online
Exam:
exam.stackvaly.com

total number of spanning trees is n(n-2)
where n is the
number of nodes in the graph. In complete graph, the
task is equal to counting different labeled trees with n
nodes for which have Cayley's formula.
প্রশ্ন-২৩। URL Stands for
 Universal
Resource
Locator
 Uniform Resource
Locator
 Unique
Resource
Locator
 None
Uniform Resource Locators
প্রশ্ন-২৪। Find the outpur of the following code-
int a=10, b=15;
if((a=100)==(b=a))
System.out.print(b+a);
else System .out.print(b-a)
 100  200
 0  3
100
প্রশ্ন-২৫ । The Θ notation in asymptotic evaluation
represents
 Best case  Base case
 Average case  Wors case
Average case
প্রশ্ন-২৬। Which is correct output
int *p=&a+2; *p=22;

int a =100;
printf(“%d”,a);
100  22
 Error  Garbase Value
100
প্রশ্ন-২৭ । Assume we need to download text
documents at the rate of 10 pagess per
second. A page is an average of 20 lines
with 50 characters in each line and one
character requies 8 bits. What is the
required bit rate of the channel?
 800000 bps  80000 bps
 4000 bps  10000 bps
80000bps
required bit rate = 10 x 20 x 50 x 8 bps = 80000bps
প্রশ্ন-২৮ । Which is the disadvantage of optical
Fiber ?
 Resistance to
corrosive
materials
 Greater immunity
to tapping
 Unidirectional
light
propagation
 None of this
None of this
প্রশ্ন-২৯ । Related record of the different relations
can be stored on the same block using
which file organization technique ?
 Heap file
organization
 Sequential file
organization
 Hashing file
organization
 Multi table
Clustering file
organization
Multi table Clustering file
organization
Records of several different relations can be stored in
the same file. Related records of the different relations
are stored on the same block so that one I/O operation
fetches related records from all the relations.
প্রশ্ন-৩০ । Find the correct output: int a =10, b=20;
a^=b; b^=a; a^=b;
Printf(“%d %d”, a, b)
 20 30  10 30
 20 10  Garbage Value
20 10
প্রশ্ন-৩১ । Which is wrong statement for BIOS of a
Computer ?
 Connect
microprocessor
and I/O
 Manages data flow
 Loads the
operating
system
 Provide storage
Provide storage
BIOS (basic input/output system) is the program a
computer's microprocessor uses to start the computer
system after it is powered on. It also manages data
flow between the computer's operating system (OS)
and attached devices, such as the hard disk, video
adapter, keyboard, mouse and printer.
প্রশ্ন-৩২ । DHCP is-
 Dynamic host
control protocol
 Distributed Host
Configuration
Protocol
 Dynamic Host  Domain Host
S
t
a
c
k
I
T
J
o
b
S
o
l
u
t
i
o
n

Stack
IT
Question
Bank
|
01789741518,
01761719838
|
Buy
Book:
stackvaly.com
|
Online
Exam:
exam.stackvaly.com

Configuration
Protocol
configuration
Protocol
Dynamic Host Configuration
Protocol (DHCP)
প্রশ্ন-৩৩ । Which one is not database Transaction
Property ?
 Atomicity  Consistency
 Durability  Quality
Quality
Atomicity, Consistency, Isolation, Durability
প্রশ্ন-৩৪ । Which is correct for Merge sort-
 Time
Complexity,
O(n3)
 Time Complexity ,
O(nlogn)
 Time
Complexity,
O(logn)
 Not Stable sort
Time Complexity , O(nlogn)
The time complexity of MergeSort is O(n*Log n) in
all the 3 cases (worst, average and best) as the
mergesort always divides the array into two halves
and takes linear time to merge two halves.
প্রশ্ন-৩৫ । How many bits in IPv6?
 32  64
 128  156
128
IPv6 uses 128-bit (2128
) addresses, allowing 3.4 x 1038
unique IP addresses. This is equal to 340 trillion
trillion trillion IP addresses. IPv6 is written in
hexadecimal notation, separated into 8 groups of 16
bits by the colons, thus (8 x 16 = 128) bits in total.
প্রশ্ন-৩৬ । Which one is the loopback address?
 255.255.255.0  127.0.0.1
 255.0.0.0  127.127.127.0
127.0.0.1
The IP address 127.0. 0.1 is called a loopback address.
Packets sent to this address never reach the network
but are looped through the network interface card
only. This can be used for diagnostic purposes to
verify that the internal path through the TCP/IP
protocols is working.
প্রশ্ন-৩৭ । How can we prevent SQL injection
Attack?
 Show the  Use input
database error to
the users
validation
 Use the user
input directly
 Do not removes
potential malicious
code
Use input Validation
প্রশ্ন-৩৮ । What is postfix expression of the string, a
+(b-c)*d ?
 abc-d*+  abcd-*+
 ad*bc-  abc-d+*
abc-d*+
প্রশ্ন-৩৯ । Which one is not a layer of cloud
computing?
 Computing as
service(Caas)
 Infrastructure as a
service(Iaas)
 Platform as a
service (Paas)
 Software as a
service(SaaS)
Computing as service(Caas)
There are the following three types of cloud service
models –
Infrastructure as a Service (IaaS)
Platform as a Service (PaaS)
Software as a Service (SaaS)
প্রশ্ন-৪০ । Which of the following is not a true
statement?
 Deleted file can
be found in
recycle bin
 Deleted files in
recycle bin can be
restored
 Disk space can
be increased by
sending files
into recycle bin
 There may have
multiple recycle
bin
Disk space can be increased by
sending files into recycle bin
প্রশ্ন-৪১ । Which of the following is not a function
of a database administrator ?
  Backing up the
database

Database the
design
Query
Processing
 User Coordination
Query Processing
প্রশ্ন-৪২ । In which addressing mode, the effective
address of the operand is generated by
adding a constant value to the contents of
the register?
S
t
a
c
k
I
T
J
o
b
S
o
l
u
t
i
o
n

Stack
IT
Question
Bank
|
01789741518,
01761719838
|
Buy
Book:
stackvaly.com
|
Online
Exam:
exam.stackvaly.com

 Absolute mode  Indirect mode
 Immediate mode  Index mode
index mode
প্রশ্ন-৪৩। Most PCs give a single beep on bootup to
indicate that the hardware is ok. If you
don not get any beep, then what will be
the first thing to check?
 System board  RAM
 Power supply  Speaker
Speaker
প্রশ্ন-৪৪ । The simplified form of the Boolean
expression (A+B+AB) (A+C) is -
 A + B + C  AB + BC
 A + BC  AC + B
A + BC
প্রশ্ন-৪৫ । Suppose you have an 8-bit binary
number N. Which of the following
operations does not change its lower 4
bits?
 An exclusive
logical sum of N
with OFh
 A negative logival
product of N with
OFh
 A logical
product of N
with OFh
 A logical sum of N
with OFh
A negative logical product of N with
0Fh
প্রশ্ন-৪৬ । A system has 12 magnetic tape driver
and 3 processes P0, P1, and P2. Process
P0 requires 10 tape driver, P1 requires 4
and P2 requires 9 drivers. The current
allocation tape drives of process P0, P1,
P2 is 5, 2, 2 respectively. Which of the
following sequence is a safe sequence.
 P0, P1, P2  P1, P2, P0
 P2, P0, P1  P1, P0, P2
P1, P0, P2
প্রশ্ন-৪৭ । Consider the following relational
database
Order (OrderNumber, OrderDate,
Order (OrderNumber, ProductID,
QuantityOrdered)
Product(ProductID, Description, Price)
 One to One  One to Many
 Many to Many  Many to One
One to Many
প্রশ্ন-৪৮ । What is the network address for the
IP address 178.112.13.10/8?
 178.0.0.0  178.112.0.0
 155.0.0.0  255.255.0.0
178.0.0.0
প্রশ্ন-৪৯ । Which RAID level creates a mirror of all
disks for storing data?
 RAID Level 0  RAID Level 1
 RAID Level 2  RAID Level 3
RAID Level 1
RAID 1, or mirrored data array, creates an exact copy
(mirror) of all data on one disk on another of
“support”. In this case, redundancy is preferred to
performance Data are stored twice by writing them to
both the data drive (or set of data drives) and a mirror
drive (or set of drives)
প্রশ্ন-৫০ । NIC stands for-
 Networks
Interface card
 Network Interface
circuit
 Network
Internal Card
 Network Input
Card
Network interface card
প্রশ্ন-৫১ । In the Priority queue, insertion and
deletion take pace at-
 Front and rear  Only at the front
S
t
a
c
k
I
T
J
o
b
S
o
l
u
t
i
o
n

Stack
IT
Question
Bank
|
01789741518,
01761719838
|
Buy
Book:
stackvaly.com
|
Online
Exam:
exam.stackvaly.com

end end
 Only at the rear
end
 Any Position
any position
প্রশ্ন-৫২ । In unix operating system which system
call is used for creating a new process ?
 Exec()  CreateProcess()
 Fork()  None of them
Fork()
System call fork() is used to create processes. It takes
no arguments and returns a process ID. The purpose
of fork() is to create a new process, which becomes
the child process of the caller. After a new child
process is created, both processes will execute the
next instruction following the fork() system call.
প্রশ্ন-৫৩। Which type of JOIN operation is SQL
command is used to return row that do
not have matching values ?
 Natural Join  EQUI Join
 Outer Join  All of the above
NON-EQUI JOIN
NON-EQUI JOIN is returned those records that are
not matching in the relative tables.
প্রশ্ন-৫৪ । Consider a magnetic disk packed with 32
surfaces. Each surface is divided into 128
tracks while 256 sectors per track. IF the
size of a sector is 1024 bytes, then what is
the taotal capacity of the disk.
 2 12
bytes  213
bytes
 217
bytes  230
bytes
2 30
bytes
= 25
x 27
x 28
x 210
= 230
bytes
প্রশ্ন-৫৫ । Which is the correct definition of BUG?
 A difficult
syntax error in a
program
 A logical error in a
program
 Documenting
program
 All of the above
A logical error in a program
প্রশ্ন-৫৬ । How can you clear CMOS password?
 Changing
motherboard’s
jamper setting
 Formatting that
system
 Removing BIOS
battery
 None of the above
Changing motherboard’s jamper
setting
On the computer motherboard, locate the BIOS clear
or password jumper or DIP switch and change its
position. This jumper is often labeled CLEAR,
CLEAR CMOS, JCMOS1, CLR, CLRPWD,
PASSWD, PASSWORD, PSWD or PWD. To clear,
remove the jumper from the two pins currently
covered, and place it over the two remaining jumpers.
প্রশ্ন-৫৭ । What is the best way to protec your hard
drive data ?
 Regualr backup  Run a regular
diagnosis
 Periodically
defrag is
 Run scandisk at
least once a week
regular backups
প্রশ্ন-৫৮ । Which feature is not applicable for
memory mapped I/O ?
 Device registers
can be accessed
with any
instructions
 System memory
addresss space is
used up for ports
 New
instructions are
required to
access the
device registers.
 Arithmetic and
logical
System memory addresss space is
used up for ports
প্রশ্ন-৫৯ । Which of the following causes the
average memory access time to increase
in a memory system with cache memory?
 Reduction of
access time to
cache memory
 Decreaase in hit
ration
 Reduction of
miss penalty
 Decrease in mis
ration
Reduction of miss penalty
প্রশ্ন-৬০ । Which searching algorithm can take O(1)
time to find a data from a list?
 Tree search  Linear Searching
 Binary search  Hashing
Hashing
S
t
a
c
k
I
T
J
o
b
S
o
l
u
t
i
o
n

Stack
IT Job Solution
(A Pattern Based IT Job Solution)
Computer Science
and
Information Technology
“Work Hard in Silence and Let Success Makes the Noise”

Stack IT Job Solution
প্রকাশকাল প্রথম প্রকাশঃ আগস্ট, ২০২১
সম্পাদনায়ঃ Stack IT
Email: stackit@gmail.com
Contact: 01812603406
Group: fb.com/stackit
পরিবেশকঃ Stack IT
প্রচ্ছদঃ Engr. Md. Jamal Uddin
করম্পউটাি কবম্পাজঃ F. M Munna
Engr. Md. Jamal Uddin
ললখকঃ Engr. Md. Jamal Uddin (Rayhan)
F.M. Munna
গ্রন্থস্বত্বঃ প্রকাশক কর্তৃ ক সর্ৃস্বত্ব সংরক্ষির্।
রপ্রন্টঃ কালাি ফন্ট
কাগজঃ সাদা অফবসট কাগজ
ো
াঁ ধাইঃ গাম ও লসলাই োইরডিং
পাতাি সিংখ্াঃ ১৬৫৫
শুবেচ্ছা মূল্ঃ ৯৯০/-

Dedicated To
My Beloved Parents
Writer
Engr. Md. Jamal Uddin
B.Sc. in CSE
Dhaka University of Engineering and Technology, Gazipur (DUET)
Assistant Programmer, ICT Directorate, BREB
Working Experience
 Ex. Employee- Bangladesh Telecommunication
Regulatory Commission (BTRC)
Viva Experience
 Dhaka Electric Supply Company Limited
 Bangabandhu Sheikh Mujibur Rahman Aviation
and Aerospace University (BSMRAAU).
 West Zone Power Distribution Company Limited
 BREB (Assistant Software Engineer, Revenue)
 Bangladesh Atomic Energy Regulatory Authority
Co-Writer
F. M. Munna
M.Sc in CSE
Jahangirnagar University

Pattern Analysis
Pattern Name Unit for the Pattern Remarks
BUET Unit-
0,1,2,3,4,5,6,7,8,9,10,11,12,13,16,17
DSCO, DPDC, PGCB, DTCA,
NWPGCL, TGTDCL, DBBL
etc. (Power and Gas Field)
KUET, RUET Unit-0,1,2,3,4,7,8,9,10,11,12,13 NESCO, WZPDCL
MIST Unit-0,1,2,3,4,7,8,9,10,11,12,13 DPDC
BREB(Own) 0,1,2,3,4,7,8,9,10,11,12,13 BREB
BPSC, NTRC Unit-0,1,2,3,4,5,6,7,8,9,10,11,12,13,16,17 BPSC
Bank Unit-0,1,2,3,4,5,6,7,8,9,10,11,12,13,16,17 Combined Bank
Bangladesh Bank Unit-0,1,2,3,4,5,6,7,8,9,10,11,12,13,16,17 Bangladesh Bank
IBA Unit-0,1,2,3,4,5,6,7,8,9,10,11,12,13,16,17 Tele talk, BCIC
Telecom Sector Unit-14,15,18,19 BTCL, Tele talk
Combined with
Electrical
Unit- 14,15 BTCL, BTRC etc.
গুরুত্বপূনন পবয়ন্ট
 উপবিি প্াট
ন ানগুবলাি মবধ্ করম্পউটাি সাইবেি লেরশিোগ পিীক্ষা েুবয়ট রনবয় থাবক, লেমন-লেসবকা, রেরপরেরস, রপরজরসরে
ইত্ারদ। তাই প্রস্তুরত শুরু কিবত হবে েুবয়ট প্াট
ন াবন, আি েুবয়ট প্াট
ন াবন সেবেবয় লেরশ রেষয় লথবক প্রশ্ন কিা হয়। তাই েুবয়ট
প্াট
ন াবন প্রস্তুরত রনবলই অন্ সকল প্াট
ন ান পড়া হবয় োয়। একটা কথা েবল িাখা োবলা েুবয়ট প্াট
ন াবন লরজক্াল প্রশ্ন লেরশ কিা
হয়, অন্রদবক কুবয়ট ো রুবয়ট প্াট
ন াবন(লেমন-লনসবকা, ওবজাপারেবকা) রথওরি প্রশ্ন লেরশ কিা হয়।
 লটরলকম লসক্টবিি জবেি লক্ষবে (রেটিআিরস, রেটিরসএল, লটরলটক) পিীক্ষা লে প্াট
ন াবন লহাক না লকন লটরলকম লসক্টবিি জন্
অরতরিক্ত রকছু ইউরনট এই েইবত লদওয়া হবয়বছ লসগুবলা অেশ্ই পড়বত হবে।
 আইরেএ প্াট
ন ান অন্ সকল প্াট
ন ান লথবক তু লনামূলকোবে কঠিন হয়, তাই উরিরখত ইউরনটগুবলা োবলা কবি েুবে েুবে পড়বত
হবে।
 রপএসরস এি লক্ষবে রথওরিটিক্াল প্রশ্ন লেরশ থাবক। তাই এই কথা মাথায় লিবখ প্রস্তুরত রনবত হবে ।
 লেসকল পিীক্ষা ইবলকট্রিক্াল রকিংো ইবলকট্ররনক্স এি কম্বাইড হয় (লেমন-রেটিরসএল, রেটিআিরস) লসসকল পিীক্ষাি জন্
অরতরিক্ত রহবসবে উরলরক্ষত ইউরনটগুবলা পড়বত হবে সাবথ োিা পিীক্ষা রনবে তাবদি প্াট
ন ান অনুসিণ কিবত হবে ।
োকরি প্রস্তুরত, সাকু
ন লাি ও লেবকান রেষবয়ি আপবেট লপবত নজি িাখুন
লফসেুক গ্রুপ ও লপজঃ stack IT Job Solution
ইউটিউে ে্াবনলঃ stackit
লহায়াটসঅ্াপঃ 01789741518 .
ইরিরনয়ারিিং, োকরি প্রস্তুরত এেিং একাবেরমক েই সহ
লেবকান েই রেক্রয় ওবয়েসাইটঃ
www.stackvaly.com
লেবকান রেষবয় পিামশনবনি জন্ লহায়াটসঅ্াবপ লমবসজ করুণ, আমাি জ্ঞাবনি
মবধ্ থাকবল উত্তি লদওয়াি লেষ্টা কিবো । জে প্রস্তুরতি টিউবটারিয়াল লপবত
লোখ িাখুন ইউটিউে ে্াবনল ও োকরি রেজ্ঞরতগুবলা লপবত লোখ িাখুন লফসেুক
গ্রুবপ। Stack IT Job Solution েইসহ লেবকান োকরি প্রস্তুরতি েই রকনবত
রেরজট করুণ stackvaly.com অথো োউনবলাে করুণ stackvaly mobile
Apps.

ললখবকি কথা
লেরশ পড়াি লথবক লেরশ লকৌশন অনুসিন কবি কম পড়া উত্তম, এই কথাি মাবন হল ধরুন আপরন লনসবকা এি জন্ জে
প্রস্তুরত শুরু কিবেন তাহবল রকছু না েুবেই একটা গাইে ধবি পড়া শুরু কিবেন না। লেশ রকছু রেষয় পেনাবলােনা কবি প্রস্তুরত শুরু
কিা উরেৎ, রকছু প্রবশ্নি উত্তি খুাঁজবত হবে লেমন- প্রবশ্নি প্াট
ন ান রক, লক প্রশ্ন কিবে, কত মাবক
ন ি পিীক্ষা হবে, পিীক্ষাি ধাপগুবলা
রক রক হবে, রিবটন নারক এমরসরকউ, লকান লকান রেষয় লথবক প্রশ্ন আসাি সম্ভােনা লেরশ ইত্ারদ রেষয় গুবলা লজবন প্রস্তুরত রকোবে
রনবত হবে লসই রেষবয় রসদ্ধান্ত রনবত হবে। রেষয়গুবলা রেন্তা কবি রসবলোস অনুসাবি পরিকল্পনা কিবত হবে। পিীক্ষাি অনুমারনক
সময় রেন্তা কবি একটা রুটিন কবি পড়বত হবে।
োিা োকরি প্রস্তুরতবত নতু ন তািা সিাসরি পিীক্ষা প্াট
ন াবন না রগবয় করম্পউটাি সাইবেি লকাি সােবজক্ট গুবলা েুবে
েুবে অন্তত দুই োি রিরেশন রদবত হবে। তািপি প্াট
ন ান অনুসাবি প্রস্তুরত শুরু কিবত হবে।
অবনবক একটা প্রশ্ন ে্ািংক রকবন পড়া শুরু কবি ে্ারসক রিয়াি না কবিই। ফবল পড়াি প্ররত আগ্রবহি তু লনায় অনাগ্রহ সৃরষ্ট হয়
লেরশ। প্রথবম ে্ারসক জানবত হবে তািপি প্রশ্ন ে্ািংক সমাধান কিবত হবে রনবজ রনবজ , উত্তি লদবখ নয়। লে প্রবশ্নি উত্তি রনবজ
পািবছন না লসই প্রবশ্নি উত্তি লদবখ েুবে েুবে পড়বত হবে।
করম্পউটাি সাইবেি প্রশ্ন পূবেনি তু লনায় কঠিন হয়, আবগ লদখা লেত রকছু প্রশ্ন মুখস্ত কিবলই কমন পাওয়া লেত। এখন
লেবহতু করম্পটিশন োড়বছ লসবহতু প্রশ্ন কঠিন হবে এইটা স্বাোরেক। এখন মুখস্ত কবি পড়বল আপরন োকরি পিীক্ষায় লেরশ োবলা
কিবত পািবেন না, আপনাবক রকছু রজরনস েুবে পবড় ে্ারসক রিয়াি কিবত হবে আোি রকছু রথওরিটিক্াল রেষয় মুখস্ত কিবত
হবে। লেবহতু করম্পউটাি সাইবেি োকরিি রসবলোস অবনক েড় লসবহতু আপনাবক অেশ্ই েুবে েুবে পড়াি উপি লজাি রদবত
হবে। এত এত রেষয় মুখস্ত কবি লগবল প্রশ্ন পরিরেত মবন হবে রকন্তু উত্তি রলখবত পািবেন না। তাই মুখস্ত কিাি োইবত লকান রেষয়
জানা োবলা, আপরন মাথায় িাখবেন লে আপরন রেষয়টি সম্পবক
ন জানবতবছন, তাহবলই োকরি প্রস্তুরত সহজ হবয় োবে। তা না হবল
মবন হবে রসবলোস অবনক েড় এইটা আমাি দ্বািা সম্ভে না।
পড়াি লক্ষবে আিও একটা কাবজ আসবত পাবি লেটা আরম অনুসিণ কিতাম, েখন লে রেষয়টি পড়বেন লসটি অেশ্ই
েুবে েুবে রলখাি লেষ্টা কিবেন। রলখবল লেটা হবে আপরন ে
ু বল লগবলও আপনাি কলম অবনক সময় আপনাবক মবন করিবয় রদবে,
অথনাৎ আপনাি লেবনি সাবথ কলবমি লপ্রম ততরি হবে।
“Work Hard In Silence and Let Success Makes The Noise”
সোি জন্ শুেকামনা,
ইরিঃ লমাঃ জামাল উরিন (িায়হান)

Contents
Unit 0 (Computer Fundamentals) 1
Chapter 1: Computer Memory
Chapter 2: Storage
Chapter 3: Instruction
Unit 1 (Programming, Data Structure and Algorithms) 31
Chapter 1: Programming in C
Chapter 2: Functions
Chapter 3: Arrays, Pointers and Structures
Chapter 4: Linked Lists, Stacks and Queues
Chapter 5: Trees
Part B
Chapter 1: Asymptotic Analysis
Chapter 2: Sorting Algorithms
Chapter 3: Divide and Conquer Algorithm
Chapter 4: Greedy Approach
Chapter 5: Dynamic Programming
Unit 2 (Computer Organization and Architecture) 183
Chapter 1: Machine Instructions, Addressing Modes
Chapter 2: ALU and Data Path, CPU control Design
Chapter 3: Memory interface, I/O interface
Chapter 4 Instruction pipelining
Chapter 5: Cache and Main memory, Secondary Storage
Unit 3 (Digital Logic) 258
Chapter 1: Number System
Chapter 2: Boolean Algebra and Minimization of Functions
Chapter 3: Combinational Circuits
Chapter 4: Sequential Circuits
Unit 4 (Networks, Information System, Software Engineering and
Web Technology 339
Chapter 1: OSI Layers
Chapter 2: Routing Algorithms
Chapter 3: TCP/UDP
Chapter 4 IPv4
Chapter 5 Network Security
Chapter 6 IPv6
Chapter 7 E-Commerce
Unit 5 (Theory of Computation) 464
Chapter 1: Finite Automata and Regular Languages

Chapter 2: Context Free Languages and Push Down automata
Chapter 3: Turing Machine
Unit 6(Compiler Design) 502
Chapter 1: Lexical Analysis and Parsing
Chapter 2: Syntax Directed Translation
Chapter 3: Intermediate Code Generation
Unit 7 (Operating System) 536
Chapter 1: Process and Treads
Chapter 2: Concurrency and Synchronization
Chapter 3: Deadlock and CPU Scheduling
Chapter 4: Memory management and Virtual memory
Chapter 5: File systems, I/O systems, protection and Security
Unit 8 (Databases) 625
Chapter 1: ER Model and Relational Model
Chapter 2: Structured Query Language
Chapter 3: Normalization
Chapter 4: Transaction and Concurrency
Chapter 5: File Management
Unit 9 (Machine Learning) 723
Chapter 1: Machine Learning
Chapter 2: Artificial Intelligence
Chapter 3: Searching algorithm in AI
Chapter 4: Knowledge Base
Chapter 5: Propositional Logic
Chapter 6: First Order Logic
Chapter 7: Natural Language Processing
Chapter 8: Artificial Neural Network
Chapter 9: Robotics
Unit 10 (Cyber Security, Cloud Computing, Data Center, Storage,
Cryptography) 798
Chapter 1: Cyber Security
Chapter 2: Cloud Computing
Chapter 3: Data Center
Chapter 4: Storage
Chapter 5: Cryptography
Unit 11 (Discrete Mathematics) 856
Chapter 1: Probability Theory
Chapter 2: Set Theory
Chapter 3: Function
Chapter 4: Propositional Logic

Chapter 5: Graph Theory
Unit 12 (Object Oriented Programming) 981
Chapter 1: OOP Basics
Chapter 2: Static and Abstract Keyword
Chapter 3: Inheritance
Chapter 4: Polymorphism and Encapsulation
Chapter 5: Package and Exception Handling
Chapter 6: Applet, threading
Chapter 7: File
Chapter 8: Practice Set-1
Chapter 9: Practice Set-2
Unit 13 (Microprocessor 8085, 8086, Modern) 1065
Chapter 1: Organization of microprocessor Based system
Chapter 2: Instruction’s classifications
Chapter 3: Instruction word size
Chapter 4: Stack
Chapter 5: Subroutine
Unit 14 (Telecommunication) 1090
Chapter 1: Telecommunication Basic
Chapter 2: Mobile Communication
Chapter 3: GSM, GPRS, UMTS, LTE
Chapter 4: MANET
Chapter 5: Satellite System
Chapter 6: Digital Transmission
Chapter 7: Analog Transmission
Chapter 8: Wireless Communication
Chapter 9 5G Technology
Unit 15 (Electromagnetic Spectrum) 1125
Chapter 1: Spectrum Basics
Chapter 2: Radio Waves
Chapter 3: Frequency Band
Chapter 4: Spectrum Radiation
Unit 16 (Linux and UML) 1132
Chapter 1: Linux Overview
Chapter 2: Linux Command
Chapter 3: Shell Script
Chapter 4: UML Case Diagram
Chapter 5: UML Class Diagram
Unit 17(Difference Hub) 1170

Chapter 1: Hardware, Software
Chapter 2: Internet
Chapter 3: Database
Chapter 4: Networking, Programming
Chapter 5: Operating System
Unit 18 (Electronics) 1227
Chapter 1: Diode Circuits
Chapter 2: Bipolar Junction Transistors
Chapter 3: Field Effect Transistors
Chapter 4: Transistor Biasing
Chapter 5: Operational Amplifier(OP-AMP)
Unit 19 (Electrical) 1322
Chapter 1: Network Elements and Basic Laws
Chapter 2: Network Theorems
Chapter 3: Transient Analysis(AC and DC)
Unit 20 (Exercise Book) 1434
Chapter 1: SQL Query (90+ Query Examples)
Chapter 2: Networking (41 Networking Examples)
Chapter 3: Programming in C (200 Programs, 190+ Output Programs)
Chapter 4: Data Structure (100+ Examples)
Chapter 5: Operating System(50+ Examples)
Unit 21, 22 1597
Chapter 1: Modulation
Chapter 2: Digital Communication System
Unit 23 (Question Bank) After-1610
Chapter 1: Bangladesh Bank (7 Set)
Chapter 2: BREB (8 set)
Chapter 3: BTRC (5 Set)
Chapter 4: NESCO, WZPDCL (RUET, KUET Pattern) (4 Set)
Chapter 5: NWPGCL, DESCO, PGCB, DPDC (BUET Pattern) (27 Set)
Chapter 6: BPSC (10 Set)

Important Tips for Exam
The followings are some important tips which would be helpful for students to prepare for GATE exam
1. Go through the pattern (using previous year exam paper) and syllabus of the exam and start preparing
accordingly.
2. Preparation time for exam.
3. Make a list of books which cover complete syllabus, contains solved previous year questions and Practice tests
for practice based on latest exam pattern. Purchase these books and start your preparation.
4. Make a list of topics which needs to be studied and make priority list for study of every topic based upon the
marks for which that particular topic is asked in exam. Find out the topics which fetch more marks and give
more importance to those topics. Make a timetable for study of topics and follow the timetable strictly.
5. An effective way to brush up your knowledge about technical topics is group study with your friends. During
group study you can explore new techniques and procedures.
6. While preparing any subject highlight important points (key definitions, equations, derivations, theorems and
laws) which can be revised during last minute preparation.
7. Pay equal attention to both theory and numerical problems. Solve questions (numerical) based on latest exam
pattern as much as possible, keeping weightage of that topic in mind. Whatever topics you decide to study,
make sure that you know everything about it.
8. Try to use short-cut methods to solve problems instead of traditional lengthy and time-consuming methods.
9. Go through previous year papers (say last ten years), to check your knowledge and note the distribution of
different topics. Also analyze the topics in which you are weak and concentrate more on those topics. Always
try to solve papers in given time, to obtain an idea how many questions you are able to solve in the given time
limit.
10. Finish the detail study of topics one and a half month before your exam. During last month revise all the
topics once again and clear leftover doubts
েইটিি তেরশষ্ট
১. েুবয়ট, কুবয়ট, রুবয়ট, লটরলকম, ে্ািংক ইত্ারদ লেবকান প্াট
ন াবনি জন্ েইটি প্রবোজ্, এই একটি েই হাবত থাকবল অন্ লকান েই এি
প্রবয়াজন লনই।
২. েই নয়, েিিং প্রবত্কটি টরপক্স এি পি ৩ টি প্রশ্ন লসট লদওয়া আবছ, ো পিীক্ষা প্রস্তুরত ও রেষয়টি পবড় আপরন কতট
ু কু েুেবত লপবিবছন
লসটি োোই কিাি জন্ েবথষ্ট।
৩. লেসকল রেষয় সকল পিীক্ষাি জন্ গুরুত্বপূনন লেমনঃ লপ্রাগ্রারমিং, োটাবেজ, লনটওয়ারক
ন িং সহ ইত্ারদ রেষবয় অনুশীলবনি জন্ ওয়াক
ন েুক
নাবম রকছু প্রশ্ন ও উত্তি সিংেরলত েই সিংেুক্ত কিা হবয়বছ, ো আপনাি প্রস্তুরতবক আিও শারনত কিবে।
৪. েই এি শুরুবত পিীক্ষা প্াট
ন ান সিংেুক্ত কবি লদওয়া হবয়বছ, ো লদবখ আপরন েলবত পািবেন লকান পিীক্ষাি জন্ লকান লকান রেষয়গুবলা
গুরুত্ব রদবয় পড়বত হবে।
৫. প্ররতষ্ঠান অনুসাবি েই এি লশবষি রদবক পূবেন অনুরষ্ঠত সকল োকরি পিীক্ষাি প্রশ্ন সিংবোজন কিা হবয়বছ।
৬. জাো ও লপ্রাগারমিং রস এি আউটপুট লপ্রাগ্রামগুবলাি সাবথ ে্াখ্া প্রদান কিা হবয়বছ, লপ্রাগামগুবলা েুেবত আপনাবক সহবোরগতা কিবে।
৭. েইটিবত ৭ লসট আিইরে,৭ লসট রেটিআিরস, ২+২ লসট লনবকা এি জন্, েুবয়ট প্াট
ন ান ৩০ লসট(রপরজরসরে, রেউরে) , ১০ লসট রপএসরস, ৭
লসট োলাবদশ ে্ািংবকি প্রশ্নসহ অন্ান্ প্রশ্ন সিংবোজন কিা হবয়বছ।
৮. েইটি োিা ক্রয় কিবেন তািা প্ররতটি প্ররতবোরগতামূলক পিীক্ষাি আবগ লেবমা মবেল লটস্ট লদওয়াি সুবোগ পাবেন।
৯. পূবেনি লেবকান পিীক্ষাি প্রশ্ন পেনাবলােনা কিবল লদখা োয় লে, রেরেন্ন টরপক্স এি উপি পাথনক্ আবস, ো পিীক্ষাি জন্ খুে গুরুত্বপূনন ।
রেরেন্ন রেষবয়ি উপি পাখনক্গুবলা পড়বল উক্ত রেষবয়ি উপি স্বচ্ছ ধািনা পাওয়া োয়। তাই এই েইবত লটক রেপাবিে নাবম আলাদা একটি
অধ্ায় কিা হবয়বছ।
লেবকান প্রবয়াজবনি ললখবকি সাবথ কথা েলুন অথো ইবমইল করুণ
লমাোইলঃ ০১৭৮৯৭৪১৫১৮, ০১৭৩০৪৬৮৯৫৯
ইবমইলঃ engrjamal22@gmail.com

Combined Bank Question Solution(Updated) 25/10/2021 Assistant Hardware Engineer/ Assistant Engineer (IT)/ AHME

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Was ist angesagt?

Was ist angesagt? (20)

Ähnlich wie Combined Bank Question Solution(Updated) 25/10/2021 Assistant Hardware Engineer/ Assistant Engineer (IT)/ AHME

Ähnlich wie Combined Bank Question Solution(Updated) 25/10/2021 Assistant Hardware Engineer/ Assistant Engineer (IT)/ AHME (20)

Mehr von Engr. Md. Jamal Uddin Rayhan

Mehr von Engr. Md. Jamal Uddin Rayhan (6)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

Combined Bank Question Solution(Updated) 25/10/2021 Assistant Hardware Engineer/ Assistant Engineer (IT)/ AHME