Instructions:
1. You have to answer each of 30 questions. Each question will carry 5 marks.
2. Total time: 1.30 hour
Questions:
1. What is over fitting? How to avoid it?
2. Why pumping lemma is only used for negative proofing?
3. How DHCP attack works
4. Networking question: Derive subnet, host range, network ip
5. Scripting code, output derive (Quick sort)
6. Output: Unsign int i = 10; if(i>-1) cout <<“Yes”; else cout<<“No”;
7. DBMS Query: Number of topic select count(*) group by name 4 more queries
8. What is functional Interface in java.example?
9. Predictive parsing cell entry in A ->∞ and A->∈. Describe it in terms of First and Follow.
10. Algorithm for checking loop in singly linked list
11. Explain length of 1st Run and 2nd Run with 1 with probability with P and O with probability Q.
12. Define P and NP classes. Differentiate between approximation and heuristic algorithm.
13. Build XOR with 2 to 4 decoder and NOR gate
14. Strategy pattern has 3 algorithm and they are: insertion sort, selection sort and quick sort. Describe something about the system.
15. Why is A* optimal? Give condition when it is optimal.
16. Main reason of failure in SW project.
Courtesy and thanks to Khadija for sharing the questions.
Comments (0)
No comments yet. Be the first to comment!
Leave a Comment