Bangladesh University of Engineering & Technology (BUET) M.Sc. in CSE admission test (October 2017 session)
Time: 1 hour 30 minute
Total 30 question Marks 10×30=300
Questions:
1. A strange question stating that if an algorithm needs 21 steps for a 7×7 matrix multiplication, how many steps would it need for a nxn matrix multiplication
2. Explain the algorithm of how computers perform division
3. Bottlenecks of greedy AI algorithms
4. why are AI algorithms designed after goal not after problem 5.
5 short questions related to pointer arithmetic of C, this included multidimensional array.
6. Using pointer insert a number in a sorted list, it was forbidden to use array notation like array[] , all should be done by pointer notation
7.Rewrite a java swing code by lambda expressions
8.Thread in C++ , calculate factorial ( not pthread)
9.ER diagram
10.A huge SQL DDL code including constraints
11.Fill the blanks from computer architecture
12. short question from cache , functional position of cache in computer architecture , write through and write back cache , merits and demerits
13. What is super-scalar processor , why pentium is a super-scalar processor but 80386 is not
14. Advantages of AVR-XXXX (forgot the number) over 80386
15. Implement a queue by linked list , write the procedures of enqueue and dequeue and determine time complexity
16. How can you search a number in O(1) average complexity
17. A math from Operating System , page size and ….
18. Deadlock conditions
19. A very easy K Map with don’t cares
20. Convert a 100 MHz clock to 50 MHz and 25 MHz by only using D flip-flops
21. Waterfall model of software engineering , advantages disadvantages
22. Use case diagram of a e-commerce service
23. Context Free Grammar of Even length non empty palindromes comprising of { a , b , c }
24. Meaning and usefulness of three operand operations, which data structures should be used for them
25. A lengthy logic question, two villagers one is liar one is truthful, they say something about direction , which one is telling the truth
26. Prove that in a group of 50 students of different height there is a increasing sub-sequence of height of length at least 8 27. Some question about PAT , NAT
28. Should we compress before encrypting or encrypt after compressing, why ?
29. A Information System Design question
30. Another Information System Design question
Comments (0)
No comments yet. Be the first to comment!
Leave a Comment