Virtual Labs

Computer Science and Engineering Problem Solving Lab Experiments

Aim

Theory

Objective

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Objective

Pretest

Procedure

Simulation

Posttest

References

Feedback

Sequences

Choose difficulty:

Beginner

Intermediate

Advanced

1. Which of the following is a decreasing sequence?

a: 2, 2, 2, 2, 2 Explanation

Explanation

b: 1, 3, 5, 7, 9 Explanation

Explanation

c: 5, 4, 3, 2, 1 Explanation

Explanation

d: 1, 2, 3, 4, 5 Explanation

Explanation

2. What is the length of the longest increasing subsequence in 1, 3, 2, 10, 4, 5?

a: 5 Explanation

Explanation

b: 2 Explanation

Explanation

c: 3 Explanation

Explanation

d: 4 Explanation

Explanation

3. Which algorithmic technique is most efficient for finding the longest increasing subsequence in large sequences?

a: Backtracking Explanation

Explanation

b: Dynamic Programming Explanation

Explanation

c: Brute force Explanation

Explanation

d: Greedy Algorithm Explanation

Explanation

4. Which of the following statements about subsequences is TRUE?

a: A subsequence must include all elements. Explanation

Explanation

b: A subsequence can skip elements but maintain order. Explanation

Explanation

c: A subsequence is always the same as a substring. Explanation

Explanation

d: A subsequence must be contiguous. Explanation

Explanation

5. Which of the following statements about sequences is TRUE?

a: Sequences must be increasing. Explanation

Explanation

b: Sequences must be decreasing. Explanation

Explanation

c: All sequences are finite. Explanation

Explanation

d: Sequences can be finite or infinite. Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)