Scribd
Upload
7K views2 pages

BUET M.Sc. Admission Test Question (CSE) May - 2019

1. The document provides 30 sample questions that may appear on the BUET M.Sc. Admission Test for Computer Science and Engineering (CSE). The questions cover topics like data structures, algorithms, databases, software engineering, computer networks, and more. 2. Test takers have 1.5 hours to answer all 30 questions. Each question is worth 5 marks. 3. Additional resources for preparation include a Facebook group for M.Sc. CSE students at BUET.

Uploaded by

Sabab Aosaf
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
7K views2 pages

BUET M.Sc. Admission Test Question (CSE) May - 2019

1. The document provides 30 sample questions that may appear on the BUET M.Sc. Admission Test for Computer Science and Engineering (CSE). The questions cover topics like data structures, algorithms, databases, software engineering, computer networks, and more. 2. Test takers have 1.5 hours to answer all 30 questions. Each question is worth 5 marks. 3. Additional resources for preparation include a Facebook group for M.Sc. CSE students at BUET.

Uploaded by

Sabab Aosaf
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/ 2

BUET M.Sc.

Admission Test Question (CSE)


May -2019

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

1. F1=A+B and F2=AB. (a) Use the minimum NAND gate for F1 and F2 and (b) Use
the minimum NOR gate for F1 and F2.
2. For a graph representation where vertices are 100 edges are more than 300
which will be preferred?
3. java code find output. [ public static void main(string args[]) { String s = new
String(“hello”);String ss = “hello”;String sp= “hello”;print(s.compareTo(ss);
print(s==ss);print(s==sp);print(s==sp)}]
4. Bellman-Ford Algorithm with negative weight...
5. Enqueue and Dequeue using single linked list in O(1) time.
6. Write assembly code for Push and Pop using given instructions [ mov a,b add a,b
add a,k].
7. Creating object of Inner class.
8. Update sql. Update the price i) rise cost by 10% when cost <500 ; i) less cost by
10% when cost>1000
9. Fill in the gaps with Trigger sql.
10. Construct NFA that accepts binary strings having odd number of 1’s or even
number of 0’s.
11. Class diagram of an online shopping website.
12. State diagram for the above website.
13. Software Maintenance life cycle.
14. software testing [ unit test, acceptance test,... ]
15. Draw a state space explaining when IDDFS performs worse than DFS.
16. Given a C code using pointers. Explain if there is any problem with this code. If
not then what is the output. [
17. Draw relationship diagram for P, NP, NP hard and Np complete.
18. Write a function to reverse a string without using global variable.
19. Elimination of left recursion.
20. Given an assembly code, what is its limitations? [beq a,b,c neq x,y,z]
21. Given a Java code using strings, what is the output?
22. 5 short questions of 1 mark each from networking.[1) which topology will
be if each devices connected with each other 2) ]
23.Given a network address and 512 subnets needed. What should be the subnet
mask?
24. Compute the sum of palindrome numbers between 100 and 999( like, 101,
313 etc.).
25. Pigeonhole problem ( An auditorium has a seating capacity of 800. How many
seats must be occupied to guarantee that at least two people seated in the
auditorium have the same first and last initials? )
26. Page size 4KB deya chilo, memory calculation related ekta question chilo.
27. Bank memory related ekta question chilo.

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

You might also like