100+ Free ITEE FE Practice Questions

Pass your ITEE Fundamental IT Engineer Examination (FE) exam on the first try — instant access, no signup required.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately

100+ Questions

100% Free

Loading practice questions...

Same family resources

Explore More ITEE IT Engineers Examination

Continue into nearby exams from the same family. Each card keeps practice questions, study guides, flashcards, videos, and articles in one place.

ITEE IT Passport Examination (IP)

Practice Questions100 questions

2026 Statistics

Key Facts: ITEE FE Exam

80 MCQs

Morning Session

BD-ITEC

60%

Passing Score

BD-ITEC

300 min

Total Duration

BD-ITEC

BDT 1,000

Exam Fee

BD-ITEC

Level 2

ITPEC Certification

ITPEC Framework

Bi-annual

Frequency

BD-ITEC

ITEE FE includes a 150-minute morning session (80 MCQs) and a 150-minute afternoon session (practical algorithms & security). Passing requires scoring 60/100 points on both parts. Registration is BDT 1,000 administered by BD-ITEC/BCC.

Sample ITEE FE Practice Questions

Try these sample questions to test your ITEE FE exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1Which of the following represents the decimal number 149 in 8-bit binary representation?

A.10010101

B.10011001

C.10101001

D.10110101

Explanation: Converting 149 to binary yields 10010101 because 149 = 128 + 16 + 4 + 1. In terms of powers of 2, this is 2^7 + 2^4 + 2^2 + 2^0, which places 1s in the 7th, 4th, 2nd, and 0th positions of an 8-bit byte.

2What is the decimal equivalent of the fractional binary number 10.011?

A.2.375

B.2.175

C.2.625

D.2.25

Explanation: The binary number 10.011 has integer part 10 (which is 2 in decimal) and fractional part 0.011 (which is 0*2^-1 + 1*2^-2 + 1*2^-3 = 0.25 + 0.125 = 0.375). Combining these yields 2.375.

3In 8-bit two's complement representation, what is the result of adding the binary numbers 01101100 and 01010100, and does an overflow occur?

A.11000000, overflow occurs because the result represents a negative number.

B.11000000, no overflow occurs because it is within 8-bit capacity.

C.00100000, overflow occurs because a carry out of the MSB is lost.

D.00100000, no overflow occurs because the carry is preserved.

Explanation: Adding 01101100 (108) and 01010100 (84) yields 11000000. In two's complement, 11000000 represents -64. Since we added two positive numbers and got a negative result, arithmetic overflow has occurred (108 + 84 = 192, which exceeds the max 8-bit signed limit of +127).

4Which of the following logical gates outputs a high state (1) only when its two input states are different?

A.XOR gate

B.AND gate

C.OR gate

D.NAND gate

Explanation: An Exclusive OR (XOR) gate yields 1 if and only if its inputs are different (one is 1, the other is 0). If both inputs are the same (either both 0 or both 1), the output is 0.

5According to De Morgan's Laws, which logical expression is equivalent to NOT (A AND B)?

A.(NOT A) OR (NOT B)

B.(NOT A) AND (NOT B)

C.NOT A OR B

D.A OR (NOT B)

Explanation: De Morgan's Laws state that the negation of a conjunction is the disjunction of the negations. Therefore, NOT (A AND B) simplifies to (NOT A) OR (NOT B).

6Which data structure operates on a Last-In, First-Out (LIFO) access pattern?

A.Stack

B.Queue

C.Linked List

D.Binary Tree

Explanation: A Stack is a LIFO structure where the last element added is the first one retrieved. Elements are inserted (push) and removed (pop) from the same end, called the top.

7Consider a circular queue implemented using an array of size 8. The front pointer points to index 2, and the rear pointer points to index 6. If we perform 2 dequeue operations and then 3 enqueue operations, what will be the final indices of the front and rear pointers respectively?

A.front = 4, rear = 1

B.front = 4, rear = 0

C.front = 0, rear = 1

D.front = 3, rear = 0

Explanation: Initially front=2, rear=6. Each dequeue advances front: first to 3, second to 4. Each enqueue advances rear modulo 8: first to 7, second to 0, third to 1. Thus, final front=4 and rear=1.

8Which traversal of a Binary Search Tree (BST) visits the nodes in ascending order of their key values?

A.In-order traversal

B.Pre-order traversal

C.Post-order traversal

D.Level-order traversal

Explanation: In-order traversal of a BST visits the left subtree, the root, and then the right subtree. Because of the BST property (left child < root < right child), this traversal process processes nodes in ascending order.

9What is the worst-case time complexity of searching for an element in a sorted array using binary search?

A.O(log n)

B.O(n)

C.O(n log n)

D.O(1)

Explanation: Binary search repeatedly divides the search space in half. In the worst-case scenario, the search space is divided until it contains only one element, taking O(log n) steps.

10Which of the following sorting algorithms has a worst-case time complexity of O(n^2) but is highly efficient for small or nearly sorted datasets?

A.Insertion Sort

B.Merge Sort

C.Heap Sort

D.Quick Sort

Explanation: Insertion Sort has O(n^2) worst-case complexity but runs in O(n) time for nearly sorted data. It is often preferred for small arrays or as a base case in hybrid algorithms like Timsort.

About the ITEE FE Exam

The Fundamental Information Technology Engineer Examination (FE) in Bangladesh certifies foundational IT knowledge. Guided by the ITPEC framework, it covers software engineering, databases, networking, cybersecurity, project management, and business strategy.

Questions

80 scored questions

Time Limit

300 minutes total

Passing Score

60% (60/100 points) per session

Exam Fee

BDT 1,000 (BD-ITEC / Bangladesh Computer Council (BCC))

ITEE FE Exam Content Outline

60%

Technology Domain

Fundamental hardware, software, networking, security, databases, data structures, algorithms, and pseudo-code programming concepts.

20%

Management Domain

Software development lifecycle management, project management methodologies, IT service management (ITSM) principles, and system audits.

20%

Strategy Domain

Corporate activities, legal aspects (e.g. intellectual property rights, labor laws), business strategy, and system planning.

How to Pass the ITEE FE Exam

What You Need to Know

Passing score: 60% (60/100 points) per session
Exam length: 80 questions
Time limit: 300 minutes total
Exam fee: BDT 1,000

Keys to Passing

Complete 500+ practice questions
Score 80%+ consistently before scheduling
Focus on highest-weighted sections
Use our AI tutor for tough concepts

ITEE FE Study Tips from Top Performers

1Focus heavily on the Morning session topics first, as it covers 80 diverse computer science and business strategy concepts.

2Practice reading and writing pseudo-code and trace tables. Afternoon session questions require tracing variable values in algorithms.

3Understand core cybersecurity principles: public-key cryptography, firewalls, threat models, and digital signatures.

4Study basic management metrics: CPM/PERT diagrams, project scheduling, and software lifecycle stages.

5Learn key legal concepts: intellectual property, copyrighted material in software, and basic corporate governance.

Frequently Asked Questions

What is the ITEE Fundamental IT Engineer Exam?

The ITEE Fundamental IT Engineer (FE) exam is a national certification in Bangladesh administered by BD-ITEC under the Bangladesh Computer Council (BCC). It follows the ITPEC standard, aligning with IT certifications in Japan and other Asian countries.

How is the ITEE FE exam structured?

The exam consists of two parts: a morning session of 150 minutes with 80 multiple-choice questions focusing on theoretical knowledge, and an afternoon session of 150 minutes testing practical algorithms, software design, and security skills.

What is the passing score for the ITEE FE exam?

Candidates must achieve at least 60% (60 out of 100 points) in both the morning and afternoon sessions. Failing either session requires retaking the entire exam, unless you qualify as a certified half-passer.

How much does the ITEE FE registration cost in Bangladesh?

The registration fee is BDT 1,000 for the full exam. For candidates who have already passed one session and are retaking only the other, the fee is BDT 500.

Who is eligible to take the ITEE FE exam?

There are no formal eligibility restrictions. However, the exam is highly recommended for CSE/IT graduates, professionals, and 4th-year university students in technology domains.