BUET MSC (CSE) 2018 – Written question & solution
Questions from the BUET MSC (CSE) recruitment exam, 2018 – Written, shared by the candidates who sat it. The paper: 15 written questions. So far 15 written questions have been shared. Topics include Algorithm, Coding, Operating System, Data Structure and Computer Architecture.
Written (15)
- Draw the maximum heap structure from a given array [4,10,3,5,1]
- Write the time complexity of binary searches.
- Why left recursion has to be eliminated to build a parser?
- Draw a DFA for words ending with two a's only, that is 'aa', over the alphabet {a,b}.
- What will be the output of this following program? #include<stdio.h> #include<string.h> int main(int argc, const char *argv[]){ int…
- Find length of each string in string list without using for loop in java. String[]text ={"hello", "world", "API"};
- Why branching poses a problem for pipelining? How can you tackle this pipelining hazard?
- Write classes to keep data of employees, projects and employee info of a company.
- What are the bottlenecks of the greedy algorithm?
- Write command i) to create a directory, ii) Delete folder with all its component, iii) Find common words in two files.
- Write down the four conditions of deadlock.
- Show the class diagram of a library management system.
- Why dijkstra algorithm fails on a negative weighted graph?
- Write down the port numbers of the following protocols (HTTPS, SSH, SMTP).
- Design an ER diagram about a company having some projects, employees and departments.