In case of Bellman Ford algorithm which is true? Find the shortest path for a graph that contains negative weight edge Detect a graph that has a negative weight Both 1&2 O None of the above Why priority queue is used instead of queue in the Dijkstra algorithm? O None of the above To reduce the number of path relaxation O To increase the number of path relaxation Priority queue is more efficient than queue in case of the insertion and deletion of element Agile Software Development is based on? Both Incremental & Iterative Development Linear Development Incremental Development Iterative Development What is the unix command to list hidden files? Is Is-f Is-a O Is-d What is the time complexity of this function? void fun(int n, int m, int o) { if (n int main() int a = 4, b 5; int c = a b; printf("%d", c); return 0; } O None is correct What is the octal value of 57 57 None is correct 0 71 39 Which one of the following is not stage of SDLC? System analysis Feasibility study Problem identification System Design What scenario will produce unexpected result? O When your recursive function call itself When your recursive function reach to the base case. O When you never invoke recursive function When your recursive function does not have a base condition. Which one is the correct Preorder Traversal? 5 3 1 4 O 5, 3, 1,4 O 1,4,3,5 O 5, 1, 4, 3 0 1,3,4,5 DFS traversal for the following graph (consider a as starting vertex)? e a d O a->f>e->->d-> O a-> -> C->b->e->f a-> C->->d->e->f O a-> -> -> C->f-> Which Algorithm is better in terms of both time and space for sorting an array of integer data? Quick Sort Heap Sort Merge Sort Insertion Sort What is the difference (most appropriate) between AVL tree and BST? It's balanced binary tree with smaller height It's just balanced binary tree There is no such difference between BST and AVL tree O it's balanced binary tree with smaller height and smaller searching time Design patterns are divided into three fundamental groups. Which option is not one of them? Behavioral Patterns Structural Patterns O MVC Patterns Creational Patterns Which sorting algorithm should be used to sort nearly sorted array? Insertion Sort Merge Sort Quick Sort Heap Sort What is the output of below code? #include void func(int n) { *n = 10; } int main() { int a = 5; func(&a); printf("%d", return 0; } a); None is correct Error O 10 Which of the following is the most important phase of SDLC? Design Requirements analysis Implementation Testing What is the unix command for printing working directory None is correct O is O cd O pwd What is the output of below code? #include void func(int n) { n = 10; } int a int main() { 5; func(a); printf("%d", a); return ; } O 5 O None is correct O 10 O Error