Q.1: Difference between Brute Force Algorithm & Greedy Algorithm ?
Q.2: What is an equivalence relation (Reflexivity,Symmetry,Transitivity) ?
Q.3: What is a Huffman coding ?
Q.4: What is a Binary Search Tree ?
Q.5: What is a Transitivity ?
CS702
0-1 knapsack problem
Brute Force Algorithm
Sorting Algorithm
Theta Notation and Big Oh notation main difference
CS704
1. Three types of Hazzards in Pipeline Architecutre
2.Describe Structure Hazzard
3.Difference between Dynamic and Static Scheduling
4. Speculation
5. Principle of Locality
CS706
Define quality
Bad fixes
Inspection
My Viva Cs701 Today:
what are Enumerator
Church Turing Thesis
time complexity
Turing Machine
VIVA for 711 29-January-2018, 02:00 PM to 03:00 PM
Q1 Benefits of iterativel approach?
Q2 Software design component??
Q3 Softwrae design?
Q4 Detailed activity?
Q5 system architectures ki layers?
CS708
Key components of SRS are
Revision History
Scope of project
Functional and non functional requirements
Usecase diagram
Usage scenarios
Adopted Methodology
Gantt chart
706 viva done exactly at 930 am,
Sir asked about software quality, then what are bad fixes. After this they asked about software reliability then define inspections and walkthroughs . After this they made a scenario for me to analyse about defect prevention and removal , then he asked about inspections are defect prevention or defect removal .Our sir is very knowledgeable that’s why he expects good assignments. I got 25 in mid term so I believe he is good instructor .
Video call, they can see you but you cannot see them Only on skype
Viva 702
binary tree or simple tree
transitive or reflexive relation
hufman coding
About Theta notation worst case or not
transitive or reflexive relation
hufman coding
About Theta notation worst case or not
706 viva
coupling and cohension which is highy or low
review its type, and inspection , black box or white box testing
review its type, and inspection , black box or white box testing
Cs 702 viva qstion. At 11:30 pm 23jan 2018
Equvelence relation
Dynamic programming
Binary tree
Simple tree
Symmetric relation
Transitive relation
Greedy algorithm
Equvelence relation
Dynamic programming
Binary tree
Simple tree
Symmetric relation
Transitive relation
Greedy algorithm
VIVA for 710 22-January-2018, 02:00 PM to 03:00 PM
Q1 pervasive computing?
Q2 key features??
Q3 native libraries of Android? name them
Q4 how many layers of symbian?
Q5 what is dalvik machine?
Q6 difference bw dalbik n java?
Q7 what are binder??
Q1 pervasive computing?
Q2 key features??
Q3 native libraries of Android? name them
Q4 how many layers of symbian?
Q5 what is dalvik machine?
Q6 difference bw dalbik n java?
Q7 what are binder??
VIVA for 712 22-January-2018, 11:30 AM to 12:30 PM
Q1 what will be dtribute in distributed database Managemnet system?
Q2 third normal form??
Q3 transitive dependency?
Q4 partial dependency?
Q5 difference between equi join and natural join?
Q1 what will be dtribute in distributed database Managemnet system?
Q2 third normal form??
Q3 transitive dependency?
Q4 partial dependency?
Q5 difference between equi join and natural join?
My cs712 Viva questions are
1) what is qurey optimization
2)disadvantages of fragmention
3)Tcp\ip layers and their names
1) what is qurey optimization
2)disadvantages of fragmention
3)Tcp\ip layers and their names
No comments:
Post a Comment
Type Your Comment Here