1. Suggest a network topology that is more suitable small local area networksa. Ring b. Star c. Bus d. Mesh

2. Number of layers in the internet protocol suitsa. 2 b. 3. c. 4. d. 5

3. What is the current version of IP version that is in usage today?a. IPV4 b. IPV6

4. The process of forwarding packets over a number of networks until it reaching the destination is called _____________a. Routing b. Mailing c. Switching d. None

5. Expant ISP. 6. Name the four types of problems. 7. In a problem solving process, listing out all possible ideas to solve the problem

without being judgmental is called ______a. Analysis b. Brainstrom c. Blackbox

8. _________mainly deals with formal systems of logic. These are specially built systems for carrying out evidences, where the languages and rules of reasoning are carefully and precisely defined.a. Formal logic b. Informal logic

9. If the compound statement has a combination of T's and F's in its truth table columns, it is called a _________

10. Two statements are consistent if and only if their conjunction is not a__________11. An ________is a well-ordered sequence of unambiguous and effectively computable

instructions that when executed produces a result and halts in a finite amount of time.a. Flowchart b. algorithm c. Program d. Logic

12. The algorithm technique that aims for local optimization at each step is _______a. Greedy b. Divide-and-conquer c. Dynamic programming

13. Given that the weights and profits of products, suggest the combinations of products and weights to be carried in the bag to maximize the profit according to Greedy approach. Bag weight limitation is 25. Profits( 27,21,34,17), Weights( 17, 20,19,22).

14. The strategy of dividing problems into smaller sub-problems and solving them individually and latter combining them together is called ______a. Greedy b. Divide and conquer c. Backtracking

15. Dynamic programming reduces the number of decision sequences by avoiding some decision sequences that cannot possibly be an optimal by applying____

16. Solution for eight queens problem could be found by applying _____ strategy17. A ____is a data structure that stores a number of elements of same kind in a specific

order18. Elements of an array are accessed using and integer value which is called as____19. A statck is a _______ structure.

a. FIFO b. LIFO20. Name the two operations performed on a stack21. Elements can be removed from a stack only at the _______

a. Bottom b. Top c. Rear d. Front

22. The condition to be ensured before attempting to remove element from a stack_____

23. Inserting new elements into a queue could take place only at the ___a. Front b. Rear c. Top d. Anywhere

24. A ___ is a data structure in which there is no restriction on the number elements to be added.a. Linked list b. Array c. Stack d. Queue

25. The two complexities that are used to analyses the performance on an algorithm are________