Code No: 07A5EC07 Set No. 1
COMPUTER ORGANIZATION
Keys
I. Choose the correct alternative:
1. c
2. c
3. a
4. a
5. c
6. d
7. b
8. b
9. a
10. c
II. Fill in the Blanks:
11. branch target buffer
12. pipelining
13. write through
14. 4
15. rendezvous
16. instruction stream
17. coherence
18. optimal replacement
19. baud rate
20. time slice
-oOo-
Code No: 07A3EC15 Set No. 1
ADVANCED DATA STRUCTURES
I. Choose the correct alternative:
1. b
2. b
3. d
4. b
5. d
6. c
7. c
8. a
9. a
10. b
II Fill in the blanks:
11. radix sort
12. 14
13. bf(x) = hLS(x) – hRS(x)
14. log m(N+1) to n
15. O (n+m)
16. LR
17. O(|E|+|V|)
18. N(N-1)/4
19. O(m+n)
20. O(h)
-oOo-
Code No: 07A50505 Set No. 1
OBJECT ORIENTED PROGRAMMING Keys
I. Choose the correct alternative:
1. B
2. C
3. A
4. A
5. A
6. A
7. D
8. B
9. C
10. A
II. Fill in the Blanks:
11. Action
12. Html
13. join()
14. Uniform Resource Locator
15. AWT
16. thread class
17. Try
18. Socket
19. checked exceptions
20. Proxy Server
-oOo-
Code No: 07A5EC21 Set No. 1
OPERATING SYSTEMS
KEY
I Choose the correct alternative:
1. C
2. A
3. D
4. C
5. C
6. B
7. A
8. A
9. C
10. B
II Fill in the blamks:
11. logical collection of data
12. asignment edge
13. the current directory
14. ONE PROCESS WAITING FOR ANOTHER PROCESS.
15. TRANSFER RATE.
16. NETWORK BASED
17. SAFE
18. DISK I/O
19. P+Q REDUNDANCY SCHEME
20. THREAT
-o0o-
Code No: 07A50504 Set No. 1
UNIX PROGRAMMING
KEY
I Choose the correct alternative:
1. B
2. A
3. C
4. B
5. A
6. A
7. B
8. C
9. A
10. C
II Fill in the Blanks:
11. 2(two)
12. environment
13. 1(one)
14. pause
15. msgsnd
16. 10K
17. raise
18. 0(Zero)
19. 266 KB
20. 5(five)
-o0o-
Code No: 07A50503 Set No. 1
DISTRIBUTED DATABASES
KEY
I Choose the correct alternative:
1. D
2. C
3. D
4. A
5. C
6. A
7. A
8. A
9. A
10. B
II Fill in the Blanks:
11. Synchronous
12. Callback-Read Locking
13. Control site
14. Pseudo LOID
15. Either Hash tables or B+ Trees
16. State
17. Watch
18. Key
19. Natural
20. Failure
-o0o-
Code No: 07A3BS04 Set No. 1
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE
I. Choose the correct alternative:
1. c
2. c
3. b
4. a
5. c
6. a
7. c
8. d
9. d
10. d
II Fill in the blanks:
11. = 35
12. = 128
13. = +, n>2, =0, =1
14. Minimum spanning tree
15. isomorphic
16. 4 (four)
17. 4
18. n
19. tree
20. two
-oOo-
Code No: 07A3EC17 Set No. 1
UNIX & SHELL PROGRAMMING
I Choose the correct alternative:
1. c
2. b
3. d
4. c
5. d
6. a
7. c
8. c
9. d
10. b
II Fill in the Blanks:
11. lseek( )
12. Alfred Weinberger Kernigham(3 authors)
13. record
14. status
15. an expression
16. input field separator
17. field
18. $0
19. Command Substitution
20. Command line arguments
-oOo-
Code No: 07A3EC20 Set No. 1
ADVANCED DATA STRUCTURES AND ALGORITHMS
I. Choose the correct alternative:
1. b
2. d
3. d
4. b
5. c
6. a
7. b
8. a
9. a
10. a
II Fill in the blanks:
11. O(n3)
12. O(n2.81)
13. biconnected
14. length(P) <= 2*length(Q)
15. Splay trees
16. log n
17. external sorting
18. B-tree
19. {(P,W) | (P – pi , W – wi ) ∈ Si}
20. Dynamic programming
-oOo-
Code No: 07A5EC20 Set No. 1
AUTOMATA AND COMPILER DESIGN
Keys
I. Choose the correct alternative:
1. a
2. a
3. b
4. a
5. a
6. b
7. a
8. c
9. b
10. b
II. Fill in the Blanks:
11. Coercious
12. data and program area
13. compile time
14. activation tree
15. constant floding
16. frames
17. local
18. control flow and data flow analysis
19. reduction in strength
20. data area
-oOo-
Code No: 07A50501 Set No. 1
FORMAL LANGUAGES AND AUTOMATA THEORY
Keys
I. Choose the correct alternative:
1. a
2. c
3. b
4. d
5. b
6. d
7. d
8. c
9. b
10. c
II. Fill in the blanks:
11. parsing.
12. Linear Bounded automaton
13. finite procedures
14. Push down automata
15. turing machine
16. ambigious
17. NP
18. Linear Bounded automata (LBA)
19. Yielding
20. Useless
-oOo-
Sunday, November 22, 2009
advanced data structures and algorithms online bits
Code No: 07A3EC20 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct / Nov. – 2009
ADVANCED DATA STRUCTURES AND ALGORITHMS
I. Choose the correct alternative:
1. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
2. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
3. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
4. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
5. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
6. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
7. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
8. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
9. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
10. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
Cont….2
A
Code No: 07A3EC20 :2: Set No. 1
II Fill in the blanks:
11. The computing time of OBST is______
12. The time complexity of Strassen’s matrix multiplication is _______
13. A graph G is ________ if and only if it contains no articulation points.
14. If P and Q are two root-to-external-node paths is a red-black tree, then ____
15. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
16. Time complexity to delete an element from max heap is _______
17. _______ sorting algorithms are designed to handle very large inputs.
18. A ____ of order m is an m-way search tree.
19. The formula for S1i in 0 / 1 knapsack problem is ______ .
20. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
-oOo-
Code No: 07A3EC20 Set No. 2
I. Choose the correct alternative:
1. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
2. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
3. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
4. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
5. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
6. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
7. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
8. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
9. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
10. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
Cont….2
A
Code No: 07A3EC20 :2: Set No. 2
II Fill in the blanks:
11. If P and Q are two root-to-external-node paths is a red-black tree, then ____
12. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
13. Time complexity to delete an element from max heap is _______
14. _______ sorting algorithms are designed to handle very large inputs.
15. A ____ of order m is an m-way search tree.
16. The formula for S1i in 0 / 1 knapsack problem is ______ .
17. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
18. The computing time of OBST is______
19. The time complexity of Strassen’s matrix multiplication is _______
20. A graph G is ________ if and only if it contains no articulation points.
-oOo-
Code No: 07A3EC20 Set No. 3
I. Choose the correct alternative:
1. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
2. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
3. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
4. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
5. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
6. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
7. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
8. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
9. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
10. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
Cont….2
A
Code No: 07A3EC20 :2: Set No. 3
II Fill in the blanks:
11. Time complexity to delete an element from max heap is _______
12. _______ sorting algorithms are designed to handle very large inputs.
13. A ____ of order m is an m-way search tree.
14. The formula for S1i in 0 / 1 knapsack problem is ______ .
15. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
16. The computing time of OBST is______
17. The time complexity of Strassen’s matrix multiplication is _______
18. A graph G is ________ if and only if it contains no articulation points.
19. If P and Q are two root-to-external-node paths is a red-black tree, then ____
20. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
-oOo-
Code No: 07A3EC20 Set No. 4
I. Choose the correct alternative:
1. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
2. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
3. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
4. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
5. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
6. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
7. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
8. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
9. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
10. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
Cont….2
A
Code No: 07A3EC20 :2: Set No. 4
II Fill in the blanks:
11. A ____ of order m is an m-way search tree.
12. The formula for S1i in 0 / 1 knapsack problem is ______ .
13. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
14. The computing time of OBST is______
15. The time complexity of Strassen’s matrix multiplication is _______
16. A graph G is ________ if and only if it contains no articulation points.
17. If P and Q are two root-to-external-node paths is a red-black tree, then ____
18. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
19. Time complexity to delete an element from max heap is _______
20. _______ sorting algorithms are designed to handle very large inputs.
-oOo-
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct / Nov. – 2009
ADVANCED DATA STRUCTURES AND ALGORITHMS
I. Choose the correct alternative:
1. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
2. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
3. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
4. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
5. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
6. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
7. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
8. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
9. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
10. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
Cont….2
A
Code No: 07A3EC20 :2: Set No. 1
II Fill in the blanks:
11. The computing time of OBST is______
12. The time complexity of Strassen’s matrix multiplication is _______
13. A graph G is ________ if and only if it contains no articulation points.
14. If P and Q are two root-to-external-node paths is a red-black tree, then ____
15. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
16. Time complexity to delete an element from max heap is _______
17. _______ sorting algorithms are designed to handle very large inputs.
18. A ____ of order m is an m-way search tree.
19. The formula for S1i in 0 / 1 knapsack problem is ______ .
20. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
-oOo-
Code No: 07A3EC20 Set No. 2
I. Choose the correct alternative:
1. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
2. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
3. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
4. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
5. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
6. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
7. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
8. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
9. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
10. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
Cont….2
A
Code No: 07A3EC20 :2: Set No. 2
II Fill in the blanks:
11. If P and Q are two root-to-external-node paths is a red-black tree, then ____
12. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
13. Time complexity to delete an element from max heap is _______
14. _______ sorting algorithms are designed to handle very large inputs.
15. A ____ of order m is an m-way search tree.
16. The formula for S1i in 0 / 1 knapsack problem is ______ .
17. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
18. The computing time of OBST is______
19. The time complexity of Strassen’s matrix multiplication is _______
20. A graph G is ________ if and only if it contains no articulation points.
-oOo-
Code No: 07A3EC20 Set No. 3
I. Choose the correct alternative:
1. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
2. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
3. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
4. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
5. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
6. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
7. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
8. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
9. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
10. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
Cont….2
A
Code No: 07A3EC20 :2: Set No. 3
II Fill in the blanks:
11. Time complexity to delete an element from max heap is _______
12. _______ sorting algorithms are designed to handle very large inputs.
13. A ____ of order m is an m-way search tree.
14. The formula for S1i in 0 / 1 knapsack problem is ______ .
15. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
16. The computing time of OBST is______
17. The time complexity of Strassen’s matrix multiplication is _______
18. A graph G is ________ if and only if it contains no articulation points.
19. If P and Q are two root-to-external-node paths is a red-black tree, then ____
20. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
-oOo-
Code No: 07A3EC20 Set No. 4
I. Choose the correct alternative:
1. Which of the following sorting algorithm has the worst time complexity of n log n? [ ]
a) merge sort b) quick sort c) insertion sort d) selection sort
2. The height of an AVL tree with n elements/nodes is [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
3. The number of passes required using k-way merging is [ ]
a) log k (N/M) b) log k (N/K) c) log k (K/M) d) log k (N)
4. A max heap (min heap) is a max (min) tree that is also a ______ binary tree. [ ]
a) Full b) Complete c) Extendible d) Skewed
5. Permissible balance factors are [ ]
a) –1, 0, 2 b) 0, 1, 2 c) –2, -1, 0 d) –1, 0, 1
6. Given 2 sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be [ ]
a) mn b) max (m,n) c) min (m, n) d) m + n – 1
7. The _______ suggests that one can devise an algorithm that works in stages, considering one input at a time. [ ]
a) divide and conquer method b) greedy method c) backtracking approach d) heuristic search
8. The number of spanning trees in an n vertex graph can be greater than ______ [ ]
a) 2n-1 –1 b) 2n –2 c) 2n-1 –2 d) 2n-1
9. The height of the binary search tree is _____ on the average. [ ]
a) O(log n) b) O(n) c) O(n log n) d) O(n2)
10. Which of the following traversal technique lists the nodes o a binary search tree in ascending order?
[ ]
a) Post-order b) In-order c) Pre-order d) None
Cont….2
A
Code No: 07A3EC20 :2: Set No. 4
II Fill in the blanks:
11. A ____ of order m is an m-way search tree.
12. The formula for S1i in 0 / 1 knapsack problem is ______ .
13. _______ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions.
14. The computing time of OBST is______
15. The time complexity of Strassen’s matrix multiplication is _______
16. A graph G is ________ if and only if it contains no articulation points.
17. If P and Q are two root-to-external-node paths is a red-black tree, then ____
18. Experimental studies indicate that for random sequences of dictionary operations, ______ are actually faster than AVL trees and red-black trees are.
19. Time complexity to delete an element from max heap is _______
20. _______ sorting algorithms are designed to handle very large inputs.
-oOo-
ADVANCED DATA STRUCTURES ONLINE BITS
Code No: 07A3EC15 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct / Nov. – 2009
ADVANCED DATA STRUCTURES
Marks: 20.
I. Choose the correct alternative:
1. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
2. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
3. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
4. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
5. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
6. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
7. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
8. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
9. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
10. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
Cont…2
A
Code No: 07A3EC15 :2: Set No. 1
II Fill in the blanks:
11. The upward movement by means of swaps is conventionally called _________
12. The number of possible binary trees with 4 nodes is ____________
13. For an AVL tree, the balance factor is ________
14. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
15. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
16. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
17. The total time complexity of depth-first search traversal is ________
18. The average number at inversions in an array of N distinct elements is ________
19. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
20. The time complexity of indexed search method is ________
-oOo-
Code No: 07A3EC15 Set No. 2
I. Choose the correct alternative:
1. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
2. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
3. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
4. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
5. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
6. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
7. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
8. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
9. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
10. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
Cont…2
A
Code No: 07A3EC15 :2: Set No. 2
II Fill in the blanks:
11. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
12. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
13. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
14. The total time complexity of depth-first search traversal is ________
15. The average number at inversions in an array of N distinct elements is ________
16. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
17. The time complexity of indexed search method is ________
18. The upward movement by means of swaps is conventionally called _________
19. The number of possible binary trees with 4 nodes is ____________
20. For an AVL tree, the balance factor is ________
-oOo-
Code No: 07A3EC15 Set No. 3
I. Choose the correct alternative:
1. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
2. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
3. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
4. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
5. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
6. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
7. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
8. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
9. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
10. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
Cont…2
A
Code No: 07A3EC15 :2: Set No. 3
II Fill in the blanks:
11. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
12. The total time complexity of depth-first search traversal is ________
13. The average number at inversions in an array of N distinct elements is ________
14. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
15. The time complexity of indexed search method is ________
16. The upward movement by means of swaps is conventionally called _________
17. The number of possible binary trees with 4 nodes is ____________
18. For an AVL tree, the balance factor is ________
19. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
20. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
-oOo-
Code No: 07A3EC15 Set No. 4
I. Choose the correct alternative:
1. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
2. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
3. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
4. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
5. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
6. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
7. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
8. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
9. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
10. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
Cont…2
A
Code No: 07A3EC15 :2: Set No. 4
II Fill in the blanks:
11. The average number at inversions in an array of N distinct elements is ________
12. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
13. The time complexity of indexed search method is ________
14. The upward movement by means of swaps is conventionally called _________
15. The number of possible binary trees with 4 nodes is ____________
16. For an AVL tree, the balance factor is ________
17. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
18. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
19. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
20. The total time complexity of depth-first search traversal is ________
-oOo-
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct / Nov. – 2009
ADVANCED DATA STRUCTURES
Marks: 20.
I. Choose the correct alternative:
1. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
2. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
3. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
4. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
5. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
6. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
7. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
8. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
9. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
10. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
Cont…2
A
Code No: 07A3EC15 :2: Set No. 1
II Fill in the blanks:
11. The upward movement by means of swaps is conventionally called _________
12. The number of possible binary trees with 4 nodes is ____________
13. For an AVL tree, the balance factor is ________
14. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
15. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
16. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
17. The total time complexity of depth-first search traversal is ________
18. The average number at inversions in an array of N distinct elements is ________
19. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
20. The time complexity of indexed search method is ________
-oOo-
Code No: 07A3EC15 Set No. 2
I. Choose the correct alternative:
1. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
2. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
3. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
4. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
5. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
6. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
7. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
8. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
9. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
10. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
Cont…2
A
Code No: 07A3EC15 :2: Set No. 2
II Fill in the blanks:
11. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
12. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
13. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
14. The total time complexity of depth-first search traversal is ________
15. The average number at inversions in an array of N distinct elements is ________
16. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
17. The time complexity of indexed search method is ________
18. The upward movement by means of swaps is conventionally called _________
19. The number of possible binary trees with 4 nodes is ____________
20. For an AVL tree, the balance factor is ________
-oOo-
Code No: 07A3EC15 Set No. 3
I. Choose the correct alternative:
1. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
2. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
3. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
4. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
5. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
6. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
7. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
8. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
9. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
10. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
Cont…2
A
Code No: 07A3EC15 :2: Set No. 3
II Fill in the blanks:
11. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
12. The total time complexity of depth-first search traversal is ________
13. The average number at inversions in an array of N distinct elements is ________
14. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
15. The time complexity of indexed search method is ________
16. The upward movement by means of swaps is conventionally called _________
17. The number of possible binary trees with 4 nodes is ____________
18. For an AVL tree, the balance factor is ________
19. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
20. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
-oOo-
Code No: 07A3EC15 Set No. 4
I. Choose the correct alternative:
1. The transformation done to remedy ________ imbalance is casual due in insect rum in as AVL tree often called single rotation [ ]
A. LL & RR B. LL & LR C. LR & RL D. RR & Rl
2. Which of the following pattern matching algorithm does not reavires pre-processing on text or pattern [ ]
A. brute force B. Robin karp C. bayer D. knuth morris pratt
3. In boyer more algorithm, in which heuristic mismatch occurs [ ]
A. looking glass heuristic B. character jump heuristic C. basic heuristic D. boyer heuristic
4. The process of accessing data stored in a tape is similar to manipulating data on a [ ]
A. stack B. queue C.list D. Heap
5. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves [ ]
A. cannot have more than 19 nodes B. has exactly 19nodes
C. has exactly 17 nodes D. cannot have more than 17 nodes.
6. The order of binary search algorithm is [ ]
A. n B.n2 C. nlogn D.logn
7. The height of an AVL tree is [ ]
A. logn B. o(logn) C.toglogn D.o(n)
8. What are the actions that are performed on red Black trees with the same time complexity[ ]
A. size B. find C. insert D. both b and c
9. LLb imbalance performs [ ]
A. colour change B. rotation C. both D. none
10. AVL tree is a ____________ binary tree. [ ]
A. complete B. full C. Height balanced D. skewed
Cont…2
A
Code No: 07A3EC15 :2: Set No. 4
II Fill in the blanks:
11. The average number at inversions in an array of N distinct elements is ________
12. For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires ______ no.of comparsions.
13. The time complexity of indexed search method is ________
14. The upward movement by means of swaps is conventionally called _________
15. The number of possible binary trees with 4 nodes is ____________
16. For an AVL tree, the balance factor is ________
17. The height of an m-way search tree of heigh ‘n’ with ‘n’ elements ranges from a low of ______ to a high of _______
18. The KMP algorithm, achieves a running time of _______ which is optimal in worst case.
19. In AVL tree the transformation for m ________ imbalance can be viewed as an RR rotation followed by an LL rotation.
20. The total time complexity of depth-first search traversal is ________
-oOo-
USP ONLINE BITS
Code No: 07A3EC17 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
UNIX & SHELL PROGRAMMING
Objective Exam
I. Choose the correct alternative:
1. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
2. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
3. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
4. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
5. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
6. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
7. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
8. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
9. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
10. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 1
II Fill in the Blanks:
11. __________ function is used to change the current file offset to a different value.
12. awk stands for _____________.
13. Collection of fields treated as a unit is called ___________
14. In C shell the exit status of a command is stored in a shell variable called ___________
15. The sequence of operators and operands that reduces to a single value is called ___________
16. The –F option in awk specifies __________
17. A unit of data that has informational content is called a ________
18. The record buffer is designated as __________
19. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
20. The positional parameters receives their values from the ___________
-oOo-
Code No: 07A3EC17 Set No. 2
I. Choose the correct alternative:
1. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
2. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
3. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
4. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
5. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
6. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
7. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
8. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
9. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
10. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 2
II Fill in the Blanks:
11. In C shell the exit status of a command is stored in a shell variable called ___________
12. The sequence of operators and operands that reduces to a single value is called ___________
13. The –F option in awk specifies __________
14. A unit of data that has informational content is called a ________
15. The record buffer is designated as __________
16. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
27. The positional parameters receives their values from the ___________
18. __________ function is used to change the current file offset to a different value.
19. awk stands for _____________.
20. Collection of fields treated as a unit is called ___________
-oOo-
Code No: 07A3EC17 Set No. 3
I. Choose the correct alternative:
1. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
2. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
3. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
4. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
5. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
6. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
7. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
8. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
9. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
10. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 3
II Fill in the Blanks:
11. The –F option in awk specifies __________
12. A unit of data that has informational content is called a ________
13. The record buffer is designated as __________
14. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
15. The positional parameters receives their values from the ___________
16. __________ function is used to change the current file offset to a different value.
17. awk stands for _____________.
18. Collection of fields treated as a unit is called ___________
19. In C shell the exit status of a command is stored in a shell variable called ___________
20. The sequence of operators and operands that reduces to a single value is called ___________
-oOo-
Code No: 07A3EC17 Set No. 4
I. Choose the correct alternative:
1. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
2. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
3. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
4. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
5. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
6. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
7. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
8. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
9. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
10. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 4
II Fill in the Blanks:
11. The record buffer is designated as __________
12. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
13. The positional parameters receives their values from the ___________
14. __________ function is used to change the current file offset to a different value.
15. awk stands for _____________.
16. Collection of fields treated as a unit is called ___________
17. In C shell the exit status of a command is stored in a shell variable called ___________
18. The sequence of operators and operands that reduces to a single value is called ___________
19. The –F option in awk specifies __________
20. A unit of data that has informational content is called a ________
-oOo-
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
UNIX & SHELL PROGRAMMING
Objective Exam
I. Choose the correct alternative:
1. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
2. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
3. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
4. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
5. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
6. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
7. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
8. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
9. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
10. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 1
II Fill in the Blanks:
11. __________ function is used to change the current file offset to a different value.
12. awk stands for _____________.
13. Collection of fields treated as a unit is called ___________
14. In C shell the exit status of a command is stored in a shell variable called ___________
15. The sequence of operators and operands that reduces to a single value is called ___________
16. The –F option in awk specifies __________
17. A unit of data that has informational content is called a ________
18. The record buffer is designated as __________
19. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
20. The positional parameters receives their values from the ___________
-oOo-
Code No: 07A3EC17 Set No. 2
I. Choose the correct alternative:
1. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
2. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
3. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
4. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
5. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
6. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
7. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
8. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
9. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
10. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 2
II Fill in the Blanks:
11. In C shell the exit status of a command is stored in a shell variable called ___________
12. The sequence of operators and operands that reduces to a single value is called ___________
13. The –F option in awk specifies __________
14. A unit of data that has informational content is called a ________
15. The record buffer is designated as __________
16. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
27. The positional parameters receives their values from the ___________
18. __________ function is used to change the current file offset to a different value.
19. awk stands for _____________.
20. Collection of fields treated as a unit is called ___________
-oOo-
Code No: 07A3EC17 Set No. 3
I. Choose the correct alternative:
1. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
2. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
3. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
4. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
5. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
6. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
7. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
8. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
9. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
10. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 3
II Fill in the Blanks:
11. The –F option in awk specifies __________
12. A unit of data that has informational content is called a ________
13. The record buffer is designated as __________
14. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
15. The positional parameters receives their values from the ___________
16. __________ function is used to change the current file offset to a different value.
17. awk stands for _____________.
18. Collection of fields treated as a unit is called ___________
19. In C shell the exit status of a command is stored in a shell variable called ___________
20. The sequence of operators and operands that reduces to a single value is called ___________
-oOo-
Code No: 07A3EC17 Set No. 4
I. Choose the correct alternative:
1. All loops except the ___________ can be executed in the background. [ ]
a) while b) until c) select d) for-in
2. The input statement in C shell is the _________ construct. [ ]
a) &* b) &$ c) &> d) &<
3. The system call that is used to position the file offset pointer at a desired location is _____[ ]
a) set b) lseek c) offset d) lstat
4. Korn shell is most comfortable with __________ shell. [ ]
a) csh b) bsh c) bash d)tsh
5. ls –l | awk`{print $2, substr($1, 5, 3)}` command prints _________ [ ]
a) the filename, its owner and the permission for the group
b) number of links, the permission for owner
c) the filename, number of links and the permission for group
d) only file name
6. The Korn Shell implements multiway selection with the _________statement. [ ]
a) if b) if-then-else c) Nested if d) case
7. The positional parameters can be changed within a script only by using the _________ command
[ ]
a) test b) get c) set d) change
8. The ___________ command is used to evaluate integral mathematical expressions. [ ]
a) eval b) expr c) test d) let
9. Which of the following awk system variable is used for input record separator? [ ]
a) RS b)IRS c) ORS d)ARS
10. Which of the following awk statement terminates the processing of the current record and begins processing of the next record? [ ]
a) exit b) skip c) next d) nextline
Cont……2
A
:2:
Code No: 07A3EC17 Set No. 4
II Fill in the Blanks:
11. The record buffer is designated as __________
12. ________ is used to convert a command’s output to a string that can be stored in another string or a variable.
13. The positional parameters receives their values from the ___________
14. __________ function is used to change the current file offset to a different value.
15. awk stands for _____________.
16. Collection of fields treated as a unit is called ___________
17. In C shell the exit status of a command is stored in a shell variable called ___________
18. The sequence of operators and operands that reduces to a single value is called ___________
19. The –F option in awk specifies __________
20. A unit of data that has informational content is called a ________
-oOo-
Friday, November 20, 2009
COMPUTER GRAPHICS ONLINE BITS
Code No: 05221201 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
COMPUTER GRAPHICS
Objective Exam
I. Choose the correct alternative:
1. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
2. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
3. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
4. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
5. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
6. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
7. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
8. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
9. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
10. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
Cont…2
A
Code No: 05221201 -2- Set No. 1
II. Fill in the blanks:
11. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
12. Top orthographic projection is called a ________________.
13. ___________________ defines the direction for the project lines.
14. _______ indicates the general shape of the curve.
15. _______ help to reduce computational effort.
16. The ______ is obtained by aligning the projection vector with cube diagonal.
17. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
18. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
19. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
20. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
-oOo-
Code No: 05221201 Set No. 2
I. Choose the correct alternative:
1. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
2. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
3. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
4. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
5. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
6. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
7. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
8. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
9. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
10. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
Cont…2
A
Code No: 05221201 -2- Set No. 2
II. Fill in the blanks:
11. _______ indicates the general shape of the curve.
12. _______ help to reduce computational effort.
13. The ______ is obtained by aligning the projection vector with cube diagonal.
14. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
15. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
16. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
17. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
18. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
19. Top orthographic projection is called a ________________.
20. ___________________ defines the direction for the project lines.
-oOo-
Code No: 05221201 Set No. 3
I. Choose the correct alternative:
1. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
2. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
3. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
4. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
5. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
6. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
7. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
8. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
9. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
10. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
Cont…2
A
Code No: 05221201 -2- Set No. 3
II. Fill in the blanks:
11. The ______ is obtained by aligning the projection vector with cube diagonal.
12. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
13. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
14. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
15. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
16. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
17. Top orthographic projection is called a ________________.
18. ___________________ defines the direction for the project lines.
19. _______ indicates the general shape of the curve.
20. _______ help to reduce computational effort.
-oOo-
Code No: 05221201 Set No. 4
I. Choose the correct alternative:
1. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
2. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
3. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
4. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
5. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
6. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
7. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
8. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
9. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
10. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
Cont…2
A
Code No: 05221201 -2- Set No. 4
II. Fill in the blanks:
11. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
12. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
13. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
14. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
15. Top orthographic projection is called a ________________.
16. ___________________ defines the direction for the project lines.
17. _______ indicates the general shape of the curve.
18. _______ help to reduce computational effort.
19. The ______ is obtained by aligning the projection vector with cube diagonal.
20. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
-oOo-
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
COMPUTER GRAPHICS
Objective Exam
I. Choose the correct alternative:
1. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
2. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
3. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
4. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
5. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
6. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
7. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
8. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
9. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
10. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
Cont…2
A
Code No: 05221201 -2- Set No. 1
II. Fill in the blanks:
11. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
12. Top orthographic projection is called a ________________.
13. ___________________ defines the direction for the project lines.
14. _______ indicates the general shape of the curve.
15. _______ help to reduce computational effort.
16. The ______ is obtained by aligning the projection vector with cube diagonal.
17. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
18. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
19. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
20. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
-oOo-
Code No: 05221201 Set No. 2
I. Choose the correct alternative:
1. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
2. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
3. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
4. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
5. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
6. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
7. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
8. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
9. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
10. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
Cont…2
A
Code No: 05221201 -2- Set No. 2
II. Fill in the blanks:
11. _______ indicates the general shape of the curve.
12. _______ help to reduce computational effort.
13. The ______ is obtained by aligning the projection vector with cube diagonal.
14. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
15. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
16. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
17. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
18. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
19. Top orthographic projection is called a ________________.
20. ___________________ defines the direction for the project lines.
-oOo-
Code No: 05221201 Set No. 3
I. Choose the correct alternative:
1. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
2. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
3. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
4. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
5. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
6. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
7. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
8. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
9. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
10. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
Cont…2
A
Code No: 05221201 -2- Set No. 3
II. Fill in the blanks:
11. The ______ is obtained by aligning the projection vector with cube diagonal.
12. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
13. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
14. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
15. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
16. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
17. Top orthographic projection is called a ________________.
18. ___________________ defines the direction for the project lines.
19. _______ indicates the general shape of the curve.
20. _______ help to reduce computational effort.
-oOo-
Code No: 05221201 Set No. 4
I. Choose the correct alternative:
1. ______________ systems are animation languages designed to generate the in- betweens from the user
specified key frames. [ ]
A. Parameterized systems B. Key frame systems
C. Action specification D. Scripting systems
2. The interpolation curve is mathematical representation of [ ]
A. cubic spline B. ellipsoid C. beizer curves D. Bspline curve
3. An alternate method for joining two successive curve sections is to specify condition for [ ]
A. geometric continuity B. blending functions C. parametric continuity D. all
4. Engineering architectural drawing commonly one of the following projection [ ]
A. orthographic projection B. axometric projection C. isometric projection D. parallel
5. Total number of objects that can be handled by z- buffer algorithm is [ ]
A. Fixed B. arbitrary C. only one D. zero
6. Transformation of objects from one form to another is called [ ]
A. Meta morphosis B. key frame system
C. celluloid transparencies D. physically based modeling
7. The painters algorithm sorts polygons by [ ]
A. Width B. length C. depth D. color
8. The scaling factor s>1 denotes the scaling of object as [ ]
A. magnification B. reduction C. canonical D. A and B
9. To establish the viewing coordinate reference frame a world coordination position is picked up called
[ ]
A. view reference point B. view plane C. twist angle D. view up vector
10. Startup and slowdown portions of an animation path can be modeled with [ ]
A. Line functions B. spline or trigonometric functions
C. Parabolic and cubic functions D. all the above
Cont…2
A
Code No: 05221201 -2- Set No. 4
II. Fill in the blanks:
11. __________ method can be applied by dividing the total viewing area into smaller and smaller
rectangles until each small area in the projection of part of a single visible surface or no surface at all.
12. ___________ allows object motion characteristics to be specified as adjustable parameters such as
degrees of freedom, motion limitations and allowable shape changes.
13. ________ method compares objects and parts of objects to each other with in the scene definition to
determine which surfaces to be labeled as visible.
14. When rotation applied in 3d along X-axis in 3D along x-axis then , the following is the representation
in matrix for ____________________________________ .
15. Top orthographic projection is called a ________________.
16. ___________________ defines the direction for the project lines.
17. _______ indicates the general shape of the curve.
18. _______ help to reduce computational effort.
19. The ______ is obtained by aligning the projection vector with cube diagonal.
20. In ______________ the system is responsible for determining the velocity and acceleration using
initial and final position of an object at any specified time.
-oOo-
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE ONLINE BITS
Code No: 07A3BS04 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct / Nov. – 2009
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE
Objective Exam
I. Choose the correct alternative:
1. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
2. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
3. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
4. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
5. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
6. The number of edges in graph is ____ [ ]
A. m*n B. m+n C. m+n-1 D. m*n-m-n
7. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
8. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
9. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
10. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
Cont….2
A
Code No: 07A3BS04 :2: Set No. 1
II Fill in the blanks:
11. The coefficient of in is _____
12. The number of binary strings of length 7 is _______
13. The recurrence relation representing Fibonacci sequence is _____
14. Prim’s algorithm is used to find __________ of a graph
15. If the adjacency matrixes of two graphs are same, then the graphs are ______
16. Any planar graph G is _____ colorable
17. The number of spanning trees of a simple graph is ______
18. The chromatic number of a simple graph, i.e. is _____
19. Any connected graph with V vertices and E edges and V + 1 = E is a ______
20. A graph is bipartite iff it is colored with _____ colors
-oOo-
Code No: 07A3BS04 Set No. 2
I. Choose the correct alternative:
1. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
2. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
3. The number of edges in graph is ____ [ ]
A.m*n B.m+n C.m+n-1 D.m*n-m-n
4. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
5. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
6. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
7. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
8. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
9. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
10. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
Cont….2
A
Code No: 07A3BS04 :2: Set No. 2
II Fill in the blanks:
11. Prim’s algorithm is used to find __________ of a graph
12. If the adjacency matrixes of two graphs are same, then the graphs are ______
13. Any planar graph G is _____ colorable
14. The number of spanning trees of a simple graph is ______
15. The chromatic number of a simple graph, i.e. is _____
16. Any connected graph with V vertices and E edges and V + 1 = E is a ______
17. A graph is bipartite iff it is colored with _____ colors
18. The coefficient of in is _____
19. The number of binary strings of length 7 is _______
20. The recurrence relation representing Fibonacci sequence is _____
-oOo-
Code No: 07A3BS04 Set No. 3
I. Choose the correct alternative:
1. The number of edges in graph is ____ [ ]
A.m*n B.m+n C.m+n-1 D.m*n-m-n
2. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
3. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
4. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
5. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
6. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
7. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
8. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
9. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
10. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
Cont….2
A
Code No: 07A3BS04 :2: Set No. 3
II Fill in the blanks:
11. Any planar graph G is _____ colorable
12. The number of spanning trees of a simple graph is ______
13. The chromatic number of a simple graph, i.e. is _____
14. Any connected graph with V vertices and E edges and V + 1 = E is a ______
15. A graph is bipartite iff it is colored with _____ colors
16. The coefficient of in is _____
17. The number of binary strings of length 7 is _______
18. The recurrence relation representing Fibonacci sequence is _____
19. Prim’s algorithm is used to find __________ of a graph
20. If the adjacency matrixes of two graphs are same, then the graphs are ______
-oOo-
Code No: 07A3BS04 Set No. 4
I. Choose the correct alternative:
1. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
2. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
3. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
4. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
5. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
6. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
7. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
8. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
9. The number of edges in graph is ____ [ ]
A.m*n B.m+n C.m+n-1 D.m*n-m-n
10. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
Cont….2
A
Code No: 07A3BS04 :2: Set No. 4
II Fill in the blanks:
11. The chromatic number of a simple graph, i.e. is _____
12. Any connected graph with V vertices and E edges and V + 1 = E is a ______
13. A graph is bipartite iff it is colored with _____ colors
14. The coefficient of in is _____
15. The number of binary strings of length 7 is _______
16. The recurrence relation representing Fibonacci sequence is _____
17. Prim’s algorithm is used to find __________ of a graph
18. If the adjacency matrixes of two graphs are same, then the graphs are ______
19. Any planar graph G is _____ colorable
20. The number of spanning trees of a simple graph is ______
-oOo-
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II B.Tech. I Sem., II Mid-Term Examinations, Oct / Nov. – 2009
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE
Objective Exam
I. Choose the correct alternative:
1. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
2. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
3. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
4. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
5. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
6. The number of edges in graph is ____ [ ]
A. m*n B. m+n C. m+n-1 D. m*n-m-n
7. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
8. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
9. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
10. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
Cont….2
A
Code No: 07A3BS04 :2: Set No. 1
II Fill in the blanks:
11. The coefficient of in is _____
12. The number of binary strings of length 7 is _______
13. The recurrence relation representing Fibonacci sequence is _____
14. Prim’s algorithm is used to find __________ of a graph
15. If the adjacency matrixes of two graphs are same, then the graphs are ______
16. Any planar graph G is _____ colorable
17. The number of spanning trees of a simple graph is ______
18. The chromatic number of a simple graph, i.e. is _____
19. Any connected graph with V vertices and E edges and V + 1 = E is a ______
20. A graph is bipartite iff it is colored with _____ colors
-oOo-
Code No: 07A3BS04 Set No. 2
I. Choose the correct alternative:
1. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
2. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
3. The number of edges in graph is ____ [ ]
A.m*n B.m+n C.m+n-1 D.m*n-m-n
4. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
5. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
6. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
7. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
8. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
9. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
10. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
Cont….2
A
Code No: 07A3BS04 :2: Set No. 2
II Fill in the blanks:
11. Prim’s algorithm is used to find __________ of a graph
12. If the adjacency matrixes of two graphs are same, then the graphs are ______
13. Any planar graph G is _____ colorable
14. The number of spanning trees of a simple graph is ______
15. The chromatic number of a simple graph, i.e. is _____
16. Any connected graph with V vertices and E edges and V + 1 = E is a ______
17. A graph is bipartite iff it is colored with _____ colors
18. The coefficient of in is _____
19. The number of binary strings of length 7 is _______
20. The recurrence relation representing Fibonacci sequence is _____
-oOo-
Code No: 07A3BS04 Set No. 3
I. Choose the correct alternative:
1. The number of edges in graph is ____ [ ]
A.m*n B.m+n C.m+n-1 D.m*n-m-n
2. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
3. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
4. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
5. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
6. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
7. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
8. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
9. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
10. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
Cont….2
A
Code No: 07A3BS04 :2: Set No. 3
II Fill in the blanks:
11. Any planar graph G is _____ colorable
12. The number of spanning trees of a simple graph is ______
13. The chromatic number of a simple graph, i.e. is _____
14. Any connected graph with V vertices and E edges and V + 1 = E is a ______
15. A graph is bipartite iff it is colored with _____ colors
16. The coefficient of in is _____
17. The number of binary strings of length 7 is _______
18. The recurrence relation representing Fibonacci sequence is _____
19. Prim’s algorithm is used to find __________ of a graph
20. If the adjacency matrixes of two graphs are same, then the graphs are ______
-oOo-
Code No: 07A3BS04 Set No. 4
I. Choose the correct alternative:
1. A vertex with degree zero is called as ___ [ ]
A. source B. sink C. cut D. isolated
2. If a connected planar graph G has n vertices, e edges, and regions then which of the following formula holds true [ ]
A. n-e-r = 2 B. n+e+r = 2 C. n+e-r = 2 D. n-e+r = 2
3. The recurrence relation with constant coefficients = 2 is _____ [ ]
A. Linear only B. Linear but not homogeneous C. linear and homogeneous D. non-linear
4. The recurrence relation representing towers of Hanoi problem is _____ [ ]
A. = +1, n>1, =1 B. = +2, n>0, =1
C. = 2+1, n>1, =1 D. = n, n>1, =1
5. In how many ways 3 letters are posted in 6 letter boxes [ ]
A. B. C. D.
6. The numeric function corresponding to the generating function is ___ [ ]
A. = , n>0, = 1 B. = , n>0, = 0
C. = , n>0, = 1 D. = , n>0, = 0
7. If is an Euler graph then _____ [ ]
A. Both m and n are even B. Both m and n are odd
C. m is even and n is odd D. m is even and n is odd
8. Maximum number of edges possible in a planar graph with 4 vertices is __ [ ]
A. 4 B. 5 C. 6 D. 7
9. The number of edges in graph is ____ [ ]
A.m*n B.m+n C.m+n-1 D.m*n-m-n
10. The maximum number of edges in a complete bipartite graph of n vertices is ____ [ ]
A. B. C. D.
Cont….2
A
Code No: 07A3BS04 :2: Set No. 4
II Fill in the blanks:
11. The chromatic number of a simple graph, i.e. is _____
12. Any connected graph with V vertices and E edges and V + 1 = E is a ______
13. A graph is bipartite iff it is colored with _____ colors
14. The coefficient of in is _____
15. The number of binary strings of length 7 is _______
16. The recurrence relation representing Fibonacci sequence is _____
17. Prim’s algorithm is used to find __________ of a graph
18. If the adjacency matrixes of two graphs are same, then the graphs are ______
19. Any planar graph G is _____ colorable
20. The number of spanning trees of a simple graph is ______
-oOo-
VIRTUAL REALITY ONLINE BITS
Code No: 05411202 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
VIRTUAL REALITY
Objective Exam
I. Choose the correct alternative:
1. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
2. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
3. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
4. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
5. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
6. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
7. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
8. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
9. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
10. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
Cont…2
A
: 2 :
Code No: 05411202 Set No. 1
II. Fill in the Blanks:
11. ____________ is used to detect malignancies in the prostate.
12. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
13. Learning activities are _______________ and constructionist.
14. ______________ examination is performed on men to determine the state of their prostate.
15. ___________ Surgery is used for performing abdominal, knee, or nasal.
16. The summative evaluation of dragon involved the study of _______ parameter.
17. Educational theories classify learning activity into ______ no.of classes.
18. Learning activities are constructivist and ________
19. Digital rectal examination is performed on men to determine the state of their _____
20. Constructive learning involves exploration of pre built _____________
-oOo-
Code No: 05411202 Set No. 2
I. Choose the correct alternative:
1. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
2. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
3. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
4. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
5. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
6. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
7. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
8. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
9. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
10. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
Cont…2
A
: 2 :
Code No: 05411202 Set No. 2
II. Fill in the Blanks:
11. ______________ examination is performed on men to determine the state of their prostate.
12. ___________ Surgery is used for performing abdominal, knee, or nasal.
13. The summative evaluation of dragon involved the study of _______ parameter.
14. Educational theories classify learning activity into ______ no.of classes.
15. Learning activities are constructivist and ________
16. Digital rectal examination is performed on men to determine the state of their _____
17. Constructive learning involves exploration of pre built _____________
18. ____________ is used to detect malignancies in the prostate.
19. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
20. Learning activities are _______________ and constructionist.
-oOo-
Code No: 05411202 Set No. 3
I. Choose the correct alternative:
1. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
2. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
3. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
4. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
5. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
6. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
7. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
8. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
9. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
10. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
Cont…2
A
: 2 :
Code No: 05411202 Set No. 3
II. Fill in the Blanks:
11. The summative evaluation of dragon involved the study of _______ parameter.
12. Educational theories classify learning activity into ______ no.of classes.
13. Learning activities are constructivist and ________
14. Digital rectal examination is performed on men to determine the state of their _____
15. Constructive learning involves exploration of pre built _____________
16. ____________ is used to detect malignancies in the prostate.
17. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
18. Learning activities are _______________ and constructionist.
19. ______________ examination is performed on men to determine the state of their prostate.
20. ___________ Surgery is used for performing abdominal, knee, or nasal.
-oOo-
Code No: 05411202 Set No. 4
I. Choose the correct alternative:
1. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
2. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
3. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
4. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
5. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
6. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
7. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
8. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
9. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
10. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
Cont…2
A
: 2 :
Code No: 05411202 Set No. 4
II. Fill in the Blanks:
11. Learning activities are constructivist and ________
12. Digital rectal examination is performed on men to determine the state of their _____
13. Constructive learning involves exploration of pre built _____________
14. ____________ is used to detect malignancies in the prostate.
15. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
16. Learning activities are _______________ and constructionist.
17. ______________ examination is performed on men to determine the state of their prostate.
18. ___________ Surgery is used for performing abdominal, knee, or nasal.
19. The summative evaluation of dragon involved the study of _______ parameter.
20. Educational theories classify learning activity into ______ no.of classes.
-oOo-
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
VIRTUAL REALITY
Objective Exam
I. Choose the correct alternative:
1. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
2. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
3. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
4. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
5. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
6. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
7. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
8. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
9. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
10. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
Cont…2
A
: 2 :
Code No: 05411202 Set No. 1
II. Fill in the Blanks:
11. ____________ is used to detect malignancies in the prostate.
12. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
13. Learning activities are _______________ and constructionist.
14. ______________ examination is performed on men to determine the state of their prostate.
15. ___________ Surgery is used for performing abdominal, knee, or nasal.
16. The summative evaluation of dragon involved the study of _______ parameter.
17. Educational theories classify learning activity into ______ no.of classes.
18. Learning activities are constructivist and ________
19. Digital rectal examination is performed on men to determine the state of their _____
20. Constructive learning involves exploration of pre built _____________
-oOo-
Code No: 05411202 Set No. 2
I. Choose the correct alternative:
1. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
2. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
3. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
4. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
5. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
6. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
7. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
8. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
9. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
10. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
Cont…2
A
: 2 :
Code No: 05411202 Set No. 2
II. Fill in the Blanks:
11. ______________ examination is performed on men to determine the state of their prostate.
12. ___________ Surgery is used for performing abdominal, knee, or nasal.
13. The summative evaluation of dragon involved the study of _______ parameter.
14. Educational theories classify learning activity into ______ no.of classes.
15. Learning activities are constructivist and ________
16. Digital rectal examination is performed on men to determine the state of their _____
17. Constructive learning involves exploration of pre built _____________
18. ____________ is used to detect malignancies in the prostate.
19. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
20. Learning activities are _______________ and constructionist.
-oOo-
Code No: 05411202 Set No. 3
I. Choose the correct alternative:
1. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
2. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
3. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
4. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
5. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
6. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
7. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
8. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
9. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
10. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
Cont…2
A
: 2 :
Code No: 05411202 Set No. 3
II. Fill in the Blanks:
11. The summative evaluation of dragon involved the study of _______ parameter.
12. Educational theories classify learning activity into ______ no.of classes.
13. Learning activities are constructivist and ________
14. Digital rectal examination is performed on men to determine the state of their _____
15. Constructive learning involves exploration of pre built _____________
16. ____________ is used to detect malignancies in the prostate.
17. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
18. Learning activities are _______________ and constructionist.
19. ______________ examination is performed on men to determine the state of their prostate.
20. ___________ Surgery is used for performing abdominal, knee, or nasal.
-oOo-
Code No: 05411202 Set No. 4
I. Choose the correct alternative:
1. Which of the following is the direct effect of VR simulation on the user [ ]
(A) Hazardous (B) Neurological ( C) Psychological (D) Sociological
2. Which of the following study is conduct to understand simulation sickness [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
3. Which of the rehabilation is performed for injured parts of the body [ ]
(A) minimal Invasive (B) Orthopedic (C) Prostate (D) none
4. Human factors research can be classified into _____ no. of studies [ ]
(A) 2 (B) 3 (C) 4 (D) 5
5. Which of the study is used to measure factors related to effects of VR on society? [ ]
(A) Usability (B) user performance (C) User safety (D) Sociological
6. Which of the evaluation method aimed at interactivity assessing and improving product usability
[ ]
(A) Formality (B) Dragon expert (C) Summative (D) none
7. Which of the following is the direct effective of VR simulations on the user [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
8. Which of the following is not a indirect effect of VR system [ ]
(A) Energy transfer at tissue level (B) Neurological
( C) Psychological (D) Sociological
9. Most injure part of the body is [ ]
(A) Abdominal (B) Knee (C) Ankle (D) Nasal
10. Which evaluations are performed at the end of the product development cycle [ ]
(A) formality Usability (B)Summative (C) dragon expert evaluation (D) None
Cont…2
A
: 2 :
Code No: 05411202 Set No. 4
II. Fill in the Blanks:
11. Learning activities are constructivist and ________
12. Digital rectal examination is performed on men to determine the state of their _____
13. Constructive learning involves exploration of pre built _____________
14. ____________ is used to detect malignancies in the prostate.
15. ___________ rehabilitation follows a fracture, ligament sprain or hand or knee surgery.
16. Learning activities are _______________ and constructionist.
17. ______________ examination is performed on men to determine the state of their prostate.
18. ___________ Surgery is used for performing abdominal, knee, or nasal.
19. The summative evaluation of dragon involved the study of _______ parameter.
20. Educational theories classify learning activity into ______ no.of classes.
-oOo-
Subscribe to:
Posts (Atom)