Scribd
Upload
14 views

2016

The document outlines the BUET M.Sc. Admission Test questions for Computer Science and Engineering from May 2016, consisting of 30 questions that cover various topics such as algorithms, data structures, networking, programming, and computer architecture. Each question is worth 5 marks, and the total time allocated for the test is 1.5 hours. The questions require problem-solving, theoretical explanations, and programming tasks across multiple programming languages.

Uploaded by

1802-21Anik Biswas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

2016

The document outlines the BUET M.Sc. Admission Test questions for Computer Science and Engineering from May 2016, consisting of 30 questions that cover various topics such as algorithms, data structures, networking, programming, and computer architecture. Each question is worth 5 marks, and the total time allocated for the test is 1.5 hours. The questions require problem-solving, theoretical explanations, and programming tasks across multiple programming languages.

Uploaded by

1802-21Anik Biswas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

BUET M.Sc.

Admission Test Question (CSE)


May -2016

Instructions:
1. You have to answer each of 30 questions. Each question will carry 5 marks.
2. Total time : 1.30 hour

1. Multiply the following two 2 digit numbers with only three 1 bit multiplication.
16
x 35
--------
??
2. Implement max heap sort for the following numbers. 4, 3, 7, 1, 8, 5

3. Why Pentium is superscalar processor?

4. Write down advantages of microcontroller over microprocessor.

5. Consider the following network of routers where the numbers on the link indicate link
cost. Find out the shortest path of all routers from router A.

6. Consider the subnet as shown below where distance vector routing is used and
following vectors have just come to router C: from B(5, 0, 8, 12,6,2); from D(16, 12,6,
0,9, 10); and from E(7, 6, 3, 9, 0,4). The measured delays to B, D and E are 6,3 and 5,
(10) respectively. What is C's new routing table?

7. Draw a weighted graph using the following adjacency matrix.

8. Draw a PERT chart from the following table. Find out the critical path & projected
time.

------------------------------------------------------------------------------------------------------------
Tasks | T1 | T2 | T3 | T4 | T5 | T6 | T7 | T8 | T9 | T10 | T11 | T12
------------------------------------------------------------------------------------------------------------
Duration | 5 | 15 | 20 | 10 | 25 | 15 | 30 | 10 | 5 | 15 | 10 | 35
------------------------------------------------------------------------------------------------------------
Department | | T1 | T1 | T2 | T3,T4 | T3 | T5 | T6,T7 | T8 | T8 | T9,T10 | T11
------------------------------------------------------------------------------------------------------------
9. Write down a method to find out how many times an object has been instantiated in java.

10. Write down a method in c++ to reverse a char array. You are not permitted to use
temp array and STL lib function.

11. Write down a program in c++ using copy constructor to initialize its member variable
from another object.

12. Write down a function that will check whether a year is leap year or not.

13. In any 6 numbers, show at least 2 of them having same remainder after dividing 5.

14. Prove the following lemma by contradiction:


a^2+b^2=c^2,there exists only 1 case such that a,b,c are consecutive non
negative integers(3,4,5).

15. verify list is sorted(procedure writing)

16. defect removal efficiency

17. AI local search,Global search(exmaple application of both)

18. AI A*, RBFS

19. 2*4 decoder using only basic gates(AND,OR,NOT)

20. Kmap

21. relational algebra

22. ERD(constraint)

23. CFG(odd length pallindrome)

24. cache math

25. Implement stack using single linked list.(Write down pseudo-code only)

26. Draw process state diagram for e-commerce application.

27. Explain binary semaphore with an example


28. Write down relationships in use case diagram. Describe any of them.

29.Write down role of a linker.

30. Define types of processor for the following language: python,c/c++,java

https://www.facebook.com/groups/msc.cse.buet

You might also like