M.Sc. in CSE admission test (April 2017 session)
Time: 1 hour 30 minute
Total 30 question Marks 10×30=300
Questions:
1. Why intermediate code generator is required between syntax analysis and semantic analysis?
2. What are the advantages of IDE algorithm?
3. Draw a logic diagram of MOD-12 Up counter using only T FF?
4. Draw a B+ tree using the indexes- 12,14,19,30,21,22,13,34,18,23,38,40 where n=5?
5. A student can be identified by ID who has attributes name, Address, Grade. A Course can be identified by C_ID and its attributes are C_Name, Credit etc. A student can Enroll in multiple course similarly a course can be enrolled by many students. Draw an E-R diagram showing the relationship between Student and course with full and partial participation. Create database table for student and Course entity.
6. What is superscalar microprocessor explain briefly?
7. Write the regular expression which takes one or more alphanumeric character followed by even number of digits?
8. What is the problem of using small page size in memory? What are its advantages?
9. Write a pseudo code for heapsort algorithm using stack? You do not need to implement stack.
10. Write a pseudo code to identify a given sequence is palindrome or not using stack and queue. You do not need to write code to implement stack and queue?
11. Write a function that takes an integer number and separate each digit. You must have to use recursion.
12. Tables of 4 destination IP addresses are given associated with each interface. Another table was given with 4 different IP address with the blank field of interface. Fill the interfaces column for each destination IP using 1st table.
13. Consider an IP address (for ex 223.16.37.0/29). Find the subnet address and the last address for this network. If we want 12 addresses in the subnet than what will be the value of the subnet mask?
14. What are the differences between microprocessor and micro-controller?
15. Explain First order predicate logic?
16. Explain briefly the waterfall model?
17. Explain Super-scalar in Java?
18. Pre order and in order sequence are given for a binary tree. Draw the binary tree?
19. Find the canonical sum of product of a function using K-Map? [ Function look like this A{w,x,y,z)=Summation of F{9,6,7,8}+M{3,4,5,6}]
20. Explanation of Hazard in computer Architecture.
21. One diagram in hazard in computer architecture.
22. C++ related some 5 MCQ(Protected, private, inheritance etc.)
23. Pipe lining in computer architecture related 4 fill in the blanks.
24. Design independent on software components with each of the team of project ( 5 statement True /false identification)
25. Prove that the value of n always the sum of value greater than 8 and 9 for n>=14 (similar question but I can’t remind exactly)
26. Proof of Another Discrete math problem for a given function
27. Define multitasking, multi programming, and multi threading?
Comments (0)
No comments yet. Be the first to comment!
Leave a Comment