Learn Through Technology

21 August, 2016

Data structure mcq questions

1. Which if the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above

DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers

4. Stack is also called as
A) Last in first out
B) First in last out
C) Last in last out
D) First in first out
5. Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
A) True, False
B) False, True
C) True, True
D) False, False
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
7. Which of the following is not the part of ADT description?
A) Data
B) Operations
C) Both of the above
D) None of the above
8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
A) push, pop
B) pop, push
C) insert, delete
D) delete, insert
9. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above
10. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
A) Stack
B) Queue
C) List
D) Link list
11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
12. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
13. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
A) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them
14. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees
15. Herder node is used as sentinel in …..
A) Graphs
B) Stacks
C) Binary tree
D) Queues
16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue
C) Priority queues
D) Stack
18. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph
19. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack
20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
21. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
A) Weakly connected
B) Strongly Connected
C) Tightly Connected
D) Linearly Connected
22. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
A) Depth First
B) Breadth First
C) With First
D) Depth Limited
23. State True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.
A) True, False, True
B) True, True, False
C) True, True, True
D) False, True, True
24. Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
A) a-iii, b-ii, c-i
B) a-i, b-ii, c-iii
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii
25. The number of comparisons done by sequential search is ………………
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) (N+2)/2
26. In ……………, search start at the beginning of the list and check every element in the list.
A) Linear search
B) Binary search
C) Hash Search
D) Binary Tree search
27. State True or False.
i) Binary search is used for searching in a sorted array.
ii) The time complexity of binary search is O(logn).
A) True, False
B) False, True
C) False, False
D) True, True
28. Which of the following is not the internal sort?
A) Insertion Sort
B) Bubble Sort
C) Merge Sort
D) Heap Sort
29. State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.
A) True, True
B) False, True
C) False, False
D) True, False
30. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
A) Partite
B) Bipartite
C) Rooted
D) Bisects
31. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
A) 0 and 1
B) 0 and -1
C) -1 and 0
D) 1 and 0
32. In a circular queue the value of r will be ..
A) r=r+1
B) r=(r+1)% [QUEUE_SIZE – 1]
C) r=(r+1)% QUEUE_SIZE
D) r=(r-1)% QUEUE_SIZE
33. Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
A) i-only
B) ii-only
C) Both i and ii
D) None of both
34. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
A) Lists
B) Linked Lists
C) Trees
D) Queues
35. What will be the value of top, if there is a size of stack STACK_SIZE is 5
A) 5
B) 6
C) 4
D) None
36. ………… is not the operation that can be performed on queue.
A) Insertion
B) Deletion
C) Retrieval
D) Traversal
37. There is an extra element at the head of the list called a ……….
A) Antinel
B) Sentinel
C) List header
D) List head
38. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
A) vertices, edges
B) edges, vertices
C) vertices, paths
D) graph node, edges
39. A ……….. is a graph that has weights of costs associated with its edges.
A) Network
B) Weighted graph
C) Both A and B
D) None A and B
40. In general, the binary search method needs no more than ……………. comparisons.
A) [log2n]-1
B) [logn]+1
C) [log2n]
D) [log2n]+1
41. Which of the following is not the type of queue?
A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
42. The property of binary tree is
A) The first subset is called left subtree
B) The second subtree is called right subtree
C) The root cannot contain NULL
D) The right subtree can be empty
43. State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.
A) True, True
B) True, False
C) False, True
D) False, False
44. Any node is the path from the root to the node is called
A) Successor node
B) Ancestor node
C) Internal node
D) None of the above
45. State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
B) True, False
C) False, True
D) False, False
46. ………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal
A) only a,b and c
B) only a and b
C) All of the above
D) None of the above
47. Which is/are the application(s) of stack
A) Function calls
B) Large number Arithmetic
C) Evaluation of arithmetic expressions
D) All of the above
48. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
49. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
A) Unary tree
B) Binary tree
C) Trinary tree
D) Both B and C
50. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
51. Which of the following data structures are indexed structures?
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
52. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
53. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….
A. Underflow
B. overflow
C. houseful
D. saturated
54. A data structure where elements can be added or removed at either end but not in the middle is called …
A. linked lists
B. stacks
C. queues
D. dequeue
55. Operations on a data structure may be …..
A. creation
B. destruction
C. selection
D. all of the above
56. The way in which the data item or items are logically related defines …..
A. storage structure
B. data structure
C. data relationship
D. data operation
57. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above
58. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….
A. pointers
B. linked allocation
C. stack
D. queue
59. Arrays are best data structures
A. for relatively permanent collections of data
B. for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for non of above situation
60. Which of the following statement is false?
A. Arrays are dense lists and static data structure.
B. Data elements in linked list need not be stored in adjacent space in memory
C. Pointers store the next data element of a list.
D. Linked lists are collection of the nodes that contain information part and next pointer.
Data Structures and Algorithms Multiple Choice Questions and Answers :-
61. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
62. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
63. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
64. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
65. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
66. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly changing
C) For both of above situation
D) For none of the above
67. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
68. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
69. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
70. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
71. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
72. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
73. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
74. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
75. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
76. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly changing
C) For both of above situation
D) For none of the above
77. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
78. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
79. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
80. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
91. Arrays are best data structures
A) for relatively permanent collections of data
B) for the size of the structure and the data in the structure are constantly changing
C) for both of above situation
D) for none of above situation
92. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
C) Both of the above
D) None of the above
93. The disadvantage in using a circular linked list is …………………….
A) It is possible to get into infinite loop.
B) Last node points to first node.
C) Time consuming
D) Requires more memory space
94. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List
95. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
A) circular queue
B) random of queue
C) priority
D) dequeue
96. In a priority queue, insertion and deletion takes place at ………………
A) front, rear end
B) only at rear end
C) only at front end
D) any position
97. The time complexity of quick sort is …………..
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)
98. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above
99. The data structure which is one ended is ………………
A) queue
B) stack
C) tree
D) graph
100. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
C) linked list
D) trees

1) ......... form of access is used to add and remove nodes from a queue.

A. LIFO, Last In First Out

B. FIFO, First In First Out

C. Both a and b

D. None of these

2) In liked representation of stack ....... holds the elements of the stack.

A. INFO fields

B. TOP fields

C. LINK fields

D. NULL fields

3) ........ form of access is used to add remove nodes from a stack.

A. LIFO

B. FIFO

C. Both A and B

D. None of these

4) In the linked representation of the stack ......... behaves as the top pointer variable of stack.

A. Stop pointer

B. Begin pointer

C. Start pointer

D. Avail pointer

5) New nodes are added to the ......... of the queue.

A. Front

B. Back

C. Middle

D. Both A and B

6) In linked representation of stack the null pointer of the last node in the list signals ..........

A. Beginning of the stack

B. Bottom of the stack

C. Middle of the stack

D. In between some value

7) What happens when you push a new node onto a stack?

A. The new node is placed at the front of the linked list

B. The new node is placed at the back of the linked list

C. The new node is placed at the middle of the linked list

D. No Changes happens

8) A queue is a .........

A. FIFO

B. LIFO

C. FILO

D. LOFI

9) Which of the following name does not relate to stacks?

A. FIFO lists

B. LIFO lists

C. Piles

D. Push down lists

10) The retrieval of items in a stack is ........... operation.

A. push

B. pop

C. retrieval

D. access

11) The term push and pop is related to

A. Array

B. Lists

C. Stacks

D. Trees

12) Which is the pointer associated with the stack?

A. FIRST

B. FRONT

C. TOP

D. REAR

13) The elements are removal from a stack in .......... order.

A. Reverse

B. Hierarchical

C. Alternative

D. Sequential

14) The insertion operation in the stack is called .........

A. insert

B. push

C. pop

D. top

15) ...... is the term used to insert an element into stack.

A. Push

B. Pull

C. Pop

D. Pump

16) Stack follows the strategy of ........

A. LIFO

B. FIFO

C. LRU

D. RANDOM

17) .......... is the term used to delete an element from the stack.

A. Push

B. Pull

C. Pop

D. Pump

18) Deletion operation is done using ......... in a queue.

A. front

B. rear

C. top

D. list

19) A pointer variable which contains the location at the top element of the stack is called .....

A. Top

B. Last

C. Final

D. End

20) Which of the following is an application of stack?

A. finding factorial

B. tower of Hanoi

C. infix to postfix

D. all of the above

1. Which of the following data structure is non-linear type?

A) Strings

B) Lists

C) Stacks

D) Tree

2. Which of the following data structure is linear type?

A) Array

B) Tree

C) Graphs

D) Hierarchy

3. The logical or mathematical model of a particular organization of data is called a .........

A) Data structure

B) Data arrangement

C) Data configuration

D) Data formation

4. The simplest type of data structure is ..................

A) Multidimensional array

B) Linear array

C) Two dimensional array

D) Three dimensional array

5. Linear arrays are also called ...................

A) Straight line array

B) One-dimensional array

C) Vertical array

D) Horizontal array

6. Arrays are best data structures ............

A) For relatively permanent collections of data.

B) For the size of the structure and the data in the structure are constantly changing

C) For both of above situation

D) For none of the above

7. Which of the following data structures are indexed structures?

A) Linear arrays

B) Linked lists

C) Graphs

D) Trees

8. Each node in a linked list has two pairs of .............. and ...................

A) Link field and information field

B) Link field and avail field

C) Avail field and information field

D) Address field and link field

9. A ........................ does not keep track of address of every element in the list.

A) Stack

B) String

C) Linear array

D) Queue

10. When does top value of the stack changes?

A) Before deletion

B) While checking underflow

C) At the time of deletion

D) After deletion

2. Which of the following data structure is not linear data structure?

A) Arrays

B) Linked lists

C) Both of the above

D) None of the above

3. The disadvantage in using a circular linked list is .........................

A) It is possible to get into infinite loop.

B) Last node points to first node.

C) Time consuming

D) Requires more memory space

4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

A) Singly Linked List

B) Circular Linked List

C) Doubly Linked List

D) Linear Linked List

5. A .................... is a linear list in which insertions and deletions are made to from either end of the structure.

A) circular queue

B) random of queue

C) priority

D) dequeue

6. In a priority queue, insertion and deletion takes place at ..................

A) front, rear end

B) only at rear end

C) only at front end

D) any position

7. The time complexity of quick sort is ..............

A) O(n)

B) O(n2)

C) O(n log n)

D) O(log n)

8. Which of the following is an application of stack?

A) finding factorial

B) tower of Hanoi

C) infix to postfix conversion

D) all of the above

9. The data structure which is one ended is ..................

A) queue

B) stack

C) tree

D) graph

10. A list which displays the relationship of adjacency between elements is said to be

A) linear

B) non linear

C) linked list

D) trees

1. Which of the following is not the type of queue?

A) Ordinary queue

B) Single ended queue

C) Circular queue

D) Priority queue

2. The property of binary tree is

A) The first subset is called left subtree

B) The second subtree is called right subtree

C) The root cannot contain NULL

D) The right subtree can be empty

3. State true or false.

i) The degree of root node is always zero.

ii) Nodes that are not root and not leaf are called as internal nodes.

A) True, True

B) True, False

C) False, True

D) False, False

4. Any node is the path from the root to the node is called

A) Successor node

B) Ancestor node

C) Internal node

D) None of the above

5. State true of false.

i) A node is a parent if it has successor nodes.

ii) A node is child node if out degree is one.

A) True, True

B) True, False

C) False, True

D) False, False

6. ………………. is not an operation performed on linear list

a) Insertion b) Deletion c) Retrieval d) Traversal

A) only a,b and c

B) only a and b

C) All of the above

D) None of the above

7. Which is/are the application(s) of stack

A) Function calls

B) Large number Arithmetic

C) Evaluation of arithmetic expressions

D) All of the above

8. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

A) Directed tree

B) Undirected tree

C) Dis-joint tree

D) Direction oriented tree

9. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.

A) Unary tree

B) Binary tree

C) Trinary tree

D) Both B and C

10. State true or false.

i) An empty tree is also a binary tree.

ii) In strictly binary tree, the out-degree of every node is either o or 2.

A) True, False

B) False, True

C) True, True

D) False, False

11. Which of the following data structures are indexed structures?

A. Linear arrays

B. Linked lists

C. Queue

D. Stack

12. Which of the following data structure store the homogeneous data elements?

A. Arrays

B. Records

C. Pointers

D. Lists

13. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ....

A. Underflow

B. overflow

C. houseful

D. saturated

14. A data structure where elements can be added or removed at either end but not in the middle is called ...

A. linked lists

B. stacks

C. queues

D. dequeue

15. Operations on a data structure may be .....

A. creation

B. destruction

C. selection

D. all of the above

16. The way in which the data item or items are logically related defines .....

A. storage structure

B. data structure

C. data relationship

D. data operation

17. Which of the following are the operations applicable an primitive data structures?

A. create

B. destroy

C. update

D. all of the above

18. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ....

A. pointers

B. linked allocation

C. stack

D. queue

19. Arrays are best data structures

A. for relatively permanent collections of data

B. for the size of the structure and the data in the structure are constantly changing

C. for both of above situation

D. for non of above situation

20. Which of the following statement is false?

A. Arrays are dense lists and static data structure.

B. Data elements in linked list need not be stored in adjacent space in memory

C. Pointers store the next data element of a list.

D. Linked lists are collection of the nodes that contain information part and next pointer.

1. Which if the following is/are the levels of implementation of data structure

A) Abstract level

B) Application level

C) Implementation level

D) All of the above

2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

A) AVL tree

B) Red-black tree

C) Lemma tree

D) None of the above

3. ……………….. level is where the model becomes compatible executable code

A) Abstract level

B) Application level

C) Implementation level

D) All of the above

4. Stack is also called as

A) Last in first out

B) First in last out

C) Last in last out

D) First in first out

5. Which of the following is true about the characteristics of abstract data types?

i) It exports a type.

ii) It exports a set of operations

A) True, False

B) False, True

C) True, True

D) False, False

6. …………… is not the component of data structure.

A) Operations

B) Storage Structures

C) Algorithms

D) None of above

7. Which of the following is not the part of ADT description?

A) Data

B) Operations

C) Both of the above

D) None of the above

8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

A) push, pop

B) pop, push

C) insert, delete

D) delete, insert

9. ……………. Is a pile in which items are added at one end and removed from the other.

A) Stack

B) Queue

C) List

D) None of the above

10. ………… is very useful in situation when data have to stored and then retrieved in reverse order.

A) Stack

B) Queue

C) List

D) Link list

11. Which data structure allows deleting data elements from and inserting at rear?

A) Stacks

B) Queues

C) Dequeues

D) Binary search tree

12. Which of the following data structure can't store the non-homogeneous data elements?

A) Arrays

B) Records

C) Pointers

D) Stacks

13. A ....... is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

A) Queue linked list

B) Stacks linked list

C) Both of them

D) Neither of them

14. Which of the following is non-liner data structure?

A) Stacks

B) List

C) Strings

D) Trees

15. Herder node is used as sentinel in .....

A) Graphs

B) Stacks

C) Binary tree

D) Queues

16. Which data structure is used in breadth first search of a graph to hold nodes?

A) Stack

B) queue

C) Tree

D) Array

17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

A) Input restricted dequeue

B) Output restricted qequeue

C) Priority queues

D) Stack

18. Which of the following data structure is non linear type?

A) Strings

B) Lists

C) Stacks

D) Graph

19. Which of the following data structure is linear type?

A) Graph

B) Trees

C) Binary tree

D) Stack

20. To represent hierarchical relationship between elements, Which data structure is suitable?

A) Dequeue

B) Priority

C) Tree

D) Graph

1) Linked lists are best suited .....

A. for relatively permanent collections of data.

B. for the size of the structure and the data in the structure are constantly changing.

C. data structure

D. for none of above situation

2) The operation of processing each element in the list is known as ......

A. sorting

B. merging

C. inserting

D. traversal

3) The situation when in a linked list START=NULL is ....

A. Underflow

B. Overflow

C. Houseful

D. Saturated

4) Each node in singly linked list has ........ fields.

A. 2

B. 3

C. 1

D. 4

5) Which of the following is two way lists?

A. Grounded header list

B. Circular header list

C. Linked list with header and trailer nodes

D. List traversed in two directions

6) Which is the pointer associated with the availability list?

A. FIRST

B. AVAIL

C. TOP

D. REAR

7) Value of first linked list index is ....

A. 0

B. 1

C. -1

D. 2

8) In linked lists there are no NULL links in

A. single linked list

B. linear doubly linked list

C. circular linked list

D. linked list

9) Each node in a linked list must contain at least .....

A. Three fields

B. Two fields

C. Four fields

D. Five fields

10) The dummy header in linked list contain .....

A. first record of the actual data

B. last record of the actual data

C. pointer to the last record of the actual data

D. middle record of the actual data

11) In a linked list the .......... field contains the address of next element in the list.

A. Link field

B. Next element field

C. Start field

D. Info field

12) LLINK is the pointer pointing to the ...

A. successor node

B. predecessor node

C. head node

D. last node

13) .......... refers to a linear collection of data items.

A. List

B. Tree

C. Graph

D. Edge

14) A run list is ......

A. small batches of records from a file

B. number of elements having same value

C. number of records

D. number of files in external storage

15) A ...... indicates the end of the list.

A. Guard

B. Sentinel

C. End pointer

D. Last pointer

16) A ........ is a linear list in which insertions and deletions are made to from either end of the structure.

A. circular queue

B. random of queue

C. priority

D. dequeue

17) Indexing the ........ element in the list is not possible in linked lists.

A. middle

B. first

C. last

D. any where in between

18) A linear list in which the pointer points only to the successive node is ......

A. singly linked list

B. circular linked list

C. doubly linked list

D. none of the above

19) .......... may take place only when there is some minimum amount(or) no space left in free storage list.

A. Memory management

B. Garbage collection

C. Recycle bin

D. Memory management

20) A linear list in which the last node points to the first node is ........

A. singly linked list

B. circular linked list

C. doubly linked list

D. none of the above

1) Finding the location of a given item in a collection of items is called ......

A. Discovering

B. Finding

C. Searching

D. Mining

2) Which of the following is an external sorting?

A. Insertion Sort

B. Bubble Sort

C. Merge Sort

D. Tree Sort

3) Very slow way of sorting is ..........

A. Insertion sort

B. Heap sort

C. Bubble sort

D. Quick sort

4) Which of the following is an internal sorting?

A. Tape Sort

B. 2-way Merge Sort

C. Merge Sort

D. Tree Sort

5) Sorting a file F usually refers to sorting F with respect to a particular key called .....

A. Basic key

B. Primary key

C. Starting key

D. Index key

6) The time complexity of quick sort is ........

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

7) Selection sort first finds the .......... element in the list and put it in the first position.

A. Middle element

B. Largest element

C. Last element

D. Smallest element

8) Quick sort is also known as ........

A. merge sort

B. tree sort

C. shell sort

D. partition and exchange sort

9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....

A. Inserting

B. Mixing

C. Merging

D. Sharing

10) A tree sort is also known as ......... sort.

A. quick

B. shell

C. heap

D. selection

11) .......... sorting is good to use when alphabetizing large list of names.

A. Merge

B. Heap

C. Radix

D. Bubble

12) The easiest sorting is ........

A. quick sort

B. shell sort

C. heap sort

D. selection sort

13) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Quick sort

D. Merge sort

14) Merging k sorted tables into a single sorted table is called ......

A. k way merging

B. k th merge

C. k+1 merge

D. k-1 merge

15) The function used to modify the way of sorting the keys of records is called ........

A. Indexing function

B. Hash function

C. Addressing function

D. All of the above

16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Radix

D. Bubble

17) The total number of comparisons in a bubble sort is ....

A. O(n logn)

B. O(2n)

C. O(n2)

D. O(n)

18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Quick

D. Bubble

19) The time complexity of heap sort is ....

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

20) The complexity of selection sort is .......

A. O(n)

B. O(n2)

C. O(n logn)

D. O(logn)

1) The worst case occur in linear search algorithm when .......

A. Item is somewhere in the middle of the array

B. Item is not in the array at all

C. Item is the last element in the array

D. Item is the last element in the array or item is not there at all

2) If the number of records to be sorted is small, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Selection

D. Bubble

3) The complexity of sorting algorithm measures the ...... as a function of the number n of items to be sorter.

A. average time

B. running time

C. average-case complexity

D. case-complexity

4) Which of the following is not a limitation of binary search algorithm?

A. must use a sorted array

B. requirement of sorted array is expensive when a lot of insertion and deletions are needed

C. there must be a mechanism to access middle element directly

D. binary search algorithm is not efficient when the data elements more than 1500.

5) The Average case occurs in linear search algorithm ..........

A. when item is somewhere in the middle of the array

B. when item is not the array at all

C. when item is the last element in the array

D. Item is the last element in the array or item is not there at all

6) Binary search algorithm cannot be applied to ...

A. sorted linked list

B. sorted binary trees

C. sorted linear array

D. pointer array

7) Complexity of linear search algorithm is .........

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

8) Sorting algorithm can be characterized as ......

A. Simple algorithm which require the order of n2 comparisons to sort n items.

B. Sophisticated algorithms that require the O(nlog2n) comparisons to sort items.

C. Both of the above

D. None of the above

9) The complexity of bubble sort algorithm is .....

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

10) State True or False for internal sorting algorithms.

i) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.

ii) The time required to read or write is considered to be significant in evaluating the performance of internal sorting.

A. i-True, ii-True

B. i-True, ii-False

C. i-False, ii-True

D. i-False, ii-False

11) The complexity of merge sort algorithm is ......

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

12) .......... is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

A. Insertion

B. Extraction

C. Selection

D. Distribution

13) ............order is the best possible for array sorting algorithm which sorts n item.

A. O(n logn)

B. O(n2)

C. O(n+logn)

D. O(logn)

14) ......... is rearranging pairs of elements which are out of order, until no such pairs remain.

A. Insertion

B. Exchange

C. Selection

D. Distribution

15) ............ is the method used by card sorter.

A. Radix sort

B. Insertion

C. Heap

D. Quick

16) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Merge sort

D. Selection sort

17) ........ sorting algorithm is frequently used when n is small where n is total number of elements.

A. Heap

B. Insertion

C. Bubble

D. Quick

18) Which of the following sorting algorithm is of priority queue sorting type?

A. Bubble sort

B. Insertion sort

C. Merge sort

D. Selection sort

19) Which of the following is not the required condition for binary search algorithm?

A. The list must be sorted

B. There should be the direct access to the middle element in any sub list

C. There must be mechanism to delete and/or insert elements in list.

D. Number values should only be present

20) Partition and exchange sort is ........

A. quick sort

B. tree sort

C. heap sort

D. bubble sort

1) To insert a new node in linked list free node will be available in ........

A. Available list

B. Avail list

C. Free node list

D. Memory space lis

2) A singly linked list is also called as ........

A. linked list

B. one way chain

C. two way chain

D. right link

3) A ..... list is a header list where the node points back to the header node.

A. Circular header

B. Grounded header

C. Two way header

D. One way header

4) A doubly linked list has .......... pointers with each node.

A. 0

B. 1

C. 2

D. 3

5) Header linked lists are frequently used for maintaining ........ in memory.

A. Polynomials

B. Binomial

C. Trinomial

D. Quadratic equation

6) The pointer that points to the first node in the list is ........

A. FIRST

B. AVAIL

C. TOP

D. REAR

7) Two-way list may be maintained in memory by means of .............

A. Queues

B. Linear arrays

C. Non linear arrays

D. Stacks

8) A doubly linked list is also called as ..........

A. linked list

B. one way chain

C. two way chain

D. right link

9) The list that requires two pointer variables FIRST and LAST is called ........

A. Circular list

B. Header list

C. One way list

D. Two way list

10) If the availability list is null, then the condition is said to be .........

A. nil block

B. availability list underflow

C. availability list overflow

D. memory loss

11) The list which has its own pointer is called ........

A. pointer list

B. self pointer

C. free pool

D. own pointer

12) Which of the following is two way lists?

A. Grounded header list

B. Circular header list

C. Linked list with header and trailer nodes

D. None of the above

13) A .......... is a header list where the last node contains the null pointer.

A. grounded header list

B. bottom header list

C. down header list

D. dropped header list

14) RLINK is the pointer pointing to the ...

A. successor node

B. predecessor node

C. head node

D. last node

15) A ............. is a header list where the last node points back to the header node.

A. rounded header list

B. circular header list

C. common header list

D. forward header list

16) In a linked list, insertion can be done as .........

A. beginning

B. end

C. middle

D. all of the above

17) In a two-way lists each node is divided into .......parts.

A. 1

B. 2

C. 3

D. 4

18) The disadvantage in using a circular linked list is .......

A. it is possible to get into infinite loop

B. last node points to fist node.

C. time consuming

D. requires more memory space.

19) Which of the following conditions checks available free space in avail list?

A. Avail=Null

B. Null=Avail

C. Avail=Max stack

D. Avail=Top

20) A linear list in which each node has point to the predecessor and successors nodes is called ........

A. singly linked list

B. circular linked list

C. doubly linked list

D. linear linked list

05 August, 2016

Previous IT Questions

Previous IT Questions

1. The primary job of the operating system of a computer is to- Manage resources.
2. Porteble program means- Independent of platform.
3. Which language is more suited to a structured program- PASCAL.
4. Bridge works in which layer of the OSI model- Datalink layer.
5. Mechanical devices in the computer are called- Hardware.
6. Storage device in the computer- DVD.
7. Largest unit of storage in computers- Tera byte.
8. Which software is more useful in preparing a report with statistical & accountin
analysis?- MS Excel.
9. IPV4 address is- 32 bit.
10. The last address of IP address represents- Broadcast address.
11. Css in an acronym for- Cascading System Style.
12. The machine readable form a program is called as- Object code.
13. The use of form in HTML is- to collect user input.
14. A computer port is used to- communicate with other computer perepherals.
15. SQL stands for- Structured Query Language.
16. CD stands for- Compact Disc.
17. The protocol is used for the Internet access- TCP/IP.
18. Color monitor consist of three colors- Red, Green, Blue.
19. When a disc is formated – everything will be lost.
20. Blutooth operations use- Radio Technology.
21. Difference between LAN & WAN- Distance covered.
22. Open source operating system- Redhat Linux.
23. Storage capacity of 500 GB- 500 * 2^30 bytes.
24. When a computer start then which component works first- Bios.
25. A CD- Rom drive is labeled with 52*. Here 52* is a measurement of- Revolution per
minute.
26. Maximum number of rows in an excel sheet- 65536.
27. McAfee is an- Utility Software.
28. A hard disk is divided into tracks which are sub divided into- sectors.
29. Commands is given to reboot the computer- Ctrl+Alt+Del.
30. MPEG extension refers to- Video file.
31. VOIP extension refers to- Voice Over Internet Protocol.
32. CTRL+C will result in- Saving the document.
33. BAK extension refers to- Backup file.
34. MPG extension refers to- Animation/ movie file.
35. INI extension usually refers to- System file.
36. Who developed Yahoo- David Filo & Jerry Yang.
37. DB refers to- Data Base.
38. OS refers to- Operating System.
39.Docsis refers to- Data Over Cable Service Interface Specification.
40. Which of the following are you probably using if you are viewing windows & Icons-
Graphical User Interface.
41. CTRL+ E will result in- Centre Alignment.
42. BMP & GIF refers to- Graphics file.
43. CD Rom is an- Optical Memory.
44. Terabyte consist of- 1024 Gigabyte.
45. Windows media player in an- application software.
46. RAM is located in- Motherboard.
47. Linux is a- Operating System.
48. The base of 16 number system is – Hexadecimal.
49. Icon is a- Pictorial representation of an operation.
50. Scanner used in banking industry- MICR.
51. Access time is- made up of data transfer time.
52. Laser printers are known as- page printers.
53. F7 refers to- spell checking.
54. The terms refers to the sharpness of image- resolution.
55. The computer which is called midrange computer- Mini computer.
56. If a computer on the network share resources for others to use, is called- Server.
57. CTRL+ end key- to move to the bottom of the document.
58. MICR stands for- Magnetic Inc Character Reader/ Recognition.
59. ASCII stands for- American Standard Code for Information Interchange.
60. One mega byte is equal to- 1024 kilo byte.
61. The output quality of a printer is measured by- Dot per inch.
62. JPG extension refers to- Image file.
63. Another word for the CPU- Microprocessor.
64. ORACLE is a- Database Software.
65. Secondary Storage devise- ROM.
66. VSAT stands for- Very Small Aperture Terminal.
67. Common keyboard arrangement is called- QWERTY.
68. Which types of interface allow connect, control musical instrumentto computer-
MIDI (Musical Instrument Digital Interface).
69. Every web page has a unique address called- Uniform Resource Locator.
70. LOTUS is an- Application pacage.
71. In data communication which device convertsdigital data to analog signal- Modem.
72. Which type of ROM is used in Pen Drive- EEP ROM.
73. IP is a- Layer 3 Protocol.
74. F1 stands for- Help.
75. Elaboration of VIRUS- Vital Information Resource Under Seize.
76. In a flowchart a diamond generally stands for- Decision.
77. EXE generally refers to- Executable file.
78. The type of internet connection might be caompared to a regelar telephone call in
terms of its duration-dial up.
79. SCSI stands for- Small Computer System Interface.
80. Which must do the return compressed files to their original state- Extract.
81. The function of Gateway is- to connect two disimilar networks.
82. The ASCII Code of A is- 65.
83. URL means- Uniform Resources Locator.
84. RAM is-Volatile.
85. OSI model has- 7 Layer.
86. A record is a- collection of bytes.
87. OMR means- Optical Mark Reader.
88. Firmwareis buit using- ROM.
89. Control unit- directs the movement of electrical signals.
90. Flash memory is- non volatile.
91. The most frequently used instructions are kept in the- Cache Memory.
92. PCMCIA representents a standard for- Notebook.
93. Which is essential component of a LAN- NIC.
94. In simplex transmission- data cotrovel is only one direction at all times.
95. Bandwith means- Bit per inch.
96. Blutooth is the popular name for the- Wireless networking standard.
97. CPU is combination of- Arithmatic logic & control unit.
98. MSI stands for- Medium Scale Integrated Circuits.
99. The name of the first Computer- ENIAC.
100. A computer connected with server is called- work station.
101. INTI extension refers to- System file.
102. 1 nibble is equal to- 4 bites.
103. LED stands for- Light Emitting Diode.
104. DOS is a-Disk Operating System.
105. BIOS is stored in a computer in its- ROM.
106. BIOS is a- Software/ firmware.
107. PDF stands for- Portable Document format.
108. Cookie is a- Internet Information file.
109. An electrical pathway within a computer is called- Bus.
110. To open a new window- Ctrl+N.
111. For launching slide Show- F5.
112. Which number is used to store data in computer- Binary.
113. Ctrl+C indicates- Copy.
114. Predecessor of modern internet- ARPANET.
115. Fastest data transmission media- Fiber optic cable.
116. Full form of RAID- Redundent Array of Independent Disks.
117. Which is most commonly used in HTTP methods- GET & POST.
118. Internet is an example of- Packet switched network.
119. Which memory application policy allocate the largest hole to the process- Worst fit.
120. Which disk format can access by MS Dos 6.0?- FAT.
121. Which memory needs refresh- DRAM.
122. The most commonly used encoding standard of unicode- UTF 8.
123. What is the full form of AT in the IBM PC AT- Advance Technology.
124. Inwhich mode windows starts with only the core drivers & services- Safe mode.
125. Physical connection between micprocessor memory & other parts is called- Address
bus.
126. Which language that computer can understand & execute- Machine language.
127. Chips are made up of millions of tiny parts known as- Transistors.
128. What is the unit of measurement for drive access time- miliseconds.
129. Which word in a web page when clicked, opens another document in the site-
Hyperlink.
130. Which key is to be pressed in a computer for moving to the begining of a text-
Home.
131. The local antenna for satellite connection is called- VSAT.
132. F12 indicates- Save as.
133. ISP stands for- Internet Service Provider.
134. What does a computer stands for storing programs & data for access by the user-
Hard Drive.
135. The term dot per inch refers to- Resolution.
136. Printer is an- offline device.
137. Computer terminals usualy have- keyboard only.
138. A unit of unicode comprise-16 bits.
139. Disk storage is a special type of- memory.
140. Small circuit board on which the main memory DRAM is physically pacaged is
called- DIMM.
141. A destination for data going outside the sytem is called- Sink.
142. The task of debug programm is to look into all programms to- locate & correct
errors.
143. What does the computer process into information- data.
144. Which is the most common type of storage device- Magnetic.
145. What is the name of the structure where dta move through a network- packets.
146. The place value in a string of decimal digites are expressed by- powers of 10.
147. The logic gate NOT has- one input & one output
148. LCD stands for- Liquid Crystal Display.
149. The topology connects all computers in a network by a single cable with a terminal
at each is called- ring.
150. PROM chips- Permanently stores information without programm.
151. The wheel of mouse can make it easier to do what ?- Scroll through documents.
152. Which of the following measures the speed of a dot matrix printer- CPS.
153. Floopy disk is a- storage device.
154. The hexadecimal number 9 is equal to- decimal 9.
155. A complete microcomputer system consits of- Microprocessor.
156. The computer stores its programm & data in its- Memory.
157. What kind of secondary storage is provided by magnetic disks- Slow speed high
capacity.
158. The brain of a computer within the CPU is- ALU.
159. Which menu includes the command find- Format.
160. Permanent memory of a computer- ROM.
161. CRT stands for- Cathod Ray Tube.
162. Magnetized bits on a disk surface are arranged along concentric rings known as-
Tracks.
163. 1 kilo byte is equal to-2^10 byte.
164. Encryption of data means- Data is encoded so it cannot be read without decoding
software.
165. When a computer first turened on or retarted, a special type of absolute loader is
executed, called- bootstrap loader.
166. Each IP packets contain- Source & destination address.
167. Whta does router do in a network- Determines on which outgoing link packet is to
be forwarded.
168. In a client/ server model, a client programm- asks for information.
169. Which is used to transfer file- FTP.
170. Which organization defines the web standards- World Wide Web consortium.
171. The computer that has no hard disk storage but sends input & receives output from
the server is known as- Thin client.
172. The main circuit board in a PC is called- Motherboard.
173. A network used for sharing data, software & hardware among the several users
owning microcomputers is called-SAN.
174. WWW stands for- World Wide Web.
175. If electrical power is disrupted, data & programms are lost in-RAM.
176. UNIX is an- Operating System.
177. WAN stands for- Wide Area Network.
178. Windows is an- Operating system.
179. MS Access is a- database software.
180. Generally D drive is considerd for- hard disk drive.
181. USB stands for- Universal Serial Bus.
182. The computer use use in operation what kind of mathemetics-Boolean.
183. GSM stands for- Global system for mobile.
184. The utility programm could improve the speed of disk- Defragmentation.
185. One milisecond is equal to- 1000th of a second.
186. Properly arranged data is called- Information.
187. A byte have- 8 bits.
188. The process of starting computer is- Boot.
189. EBCDIC stands for-Extended Binary Coded Decimal Interchange Code.
190. What is the brain of a computer- CPU.
191. What is the another name of Floppy Disk- Diskette.
192. Which American computer company is called big blue- IBM.
193. An integrated circuit is- Fabricated on a tiny silicon chip.
194. What is the most important advantage of an integrated circuit- Extremly high
reliability.
195. What are two main components of a CPU- Control unit & ALU.
196. Ctrl+I – Applies Italic.
197. The intersections of a row & colum is called- a cell.
198. Ctrl+B- Bold.
199. ATM stands for- Automated Teller machine.
200. RAM stands for- Random Access Memory.
201. Supercomputers are those which- can perform billions of calculations per second.
202. The decimal equivalent of (101.110)2 is- 5.75.

25 July, 2016

Install Laravel with an Nginx Web Server on Ubuntu 14.04

Hello guys,today we have to learn about installing Laravel and Nginx on Ubuntu14.04. It's
very important to install it easy way because easy way optimize your time and it's easy
to memorize.Let's play with it. For Laravel you need to install composer,let's install
composer first.open your terminal (login your server by terminal) then just run

cd ~
curl -sS https://getcomposer.org/installer | php

This will create a file called composer.phar in your home directory. This is a PHP
archive, and it can be run from the command line.We want to install it in a globally
accessible location though. Also, we want to change the name to composer (without the
file extension). We can do this in one step by typing:
sudo mv composer.phar /usr/local/bin/composer
Now you can check composer by typing:
composer
It will show composer details.

The second step,installs Laravel globally on your system by typing:
composer global require "laravel/installer"
Make sure to place the ~/.composer/vendor/bin directory (or the equivalent directory for
your OS) in your PATH so the laravel executable can be located by your system.Type:
export PATH="~/.composer/vendor/bin/"
When you run this command restart your terminal. Now the laravel executable on your
system.
Now make a project by typing:
laravel new /var/www/laravel
Let's install the backend components that means install Nginx.First, we need to update
our local package and make sure you have a fresh list of the available packages. Then we
can install the necessary components:

sudo apt-get update
sudo apt-get install nginx php5-fpm php5-cli php5-mcrypt git

Now configure Nginx and the web root.Open the default server block configuration file
with sudo privileges and set our document root:
sudo nano /etc/nginx/sites-available/default
for laravel document root:

server {
listen 80 default_server;
listen [::]:80 default_server ipv6only=on;

root /var/www/laravel/public;
index index.php index.html index.htm;

server_name localhost;

location / {
try_files $uri $uri/ =404;
}
}

Because we modified the default server block file, which is already enabled, we simply
need to restart Nginx for our configuration changes to be picked up:
sudo service nginx restart
Now, the files are all installed within our /var/www/laravel directory, but they are
entirely owned by our root account. The web user needs partial ownership and permissions
in order to correctly serve the content.

We can give group ownership of our Laravel directory structure to the web group by
typing:
sudo chown -R :www-data /var/www/laravel
Next, we can change the permissions of the /var/www/laravel/app/storage directory to
allow the web group write permissions. This is necessary for the application to function
correctly:
sudo chmod -R 775 /var/www/laravel/storage
Thank's for reading......

Install Laravel with an Nginx Web Server on Ubuntu 14.04

 cd ~

                                    curl -sS https://getcomposer.org/installer | php

sudo apt-get update

                                sudo apt-get install nginx php5-fpm php5-cli php5-mcrypt git

server {

                                    listen 80 default_server;

                                    listen [::]:80 default_server ipv6only=on;



                                    root /var/www/laravel/public;

                                    index index.php index.html index.htm;



                                    server_name localhost;



                                    location / {

                                    try_files $uri $uri/ =404;

                                    }

                                    }

29 June, 2016

SDLC

There are various software development approaches defined and designed which are used/employed during development process of software, these approaches are also referred as “Software Development Process Models” (e.g. Waterfall model, incremental model, V-model, iterative model, RAD model, Agile model, Spiral model, Prototype model etc.). Each process model follows a particular life cycle in order to ensure success in process of software development.

Software life cycle models describe phases of the software cycle and the order in which those phases are executed. Each phase produces deliverables required by the next phase in the life cycle. Requirements are translated into design. Code is produced according to the design which is called development phase. After coding and development the testing verifies the deliverable of the implementation phase against requirements. The testing team follows Software Testing Life Cycle (STLC) which is similar to the development cycle followed by the development team.

There are following six phases in every Software development life cycle model:

Requirement gathering and analysis
Design
Implementation or coding
Testing
Deployment
Maintenance

1) Requirement gathering and analysis: Business requirements are gathered in this phase. This phase is the main focus of the project managers and stake holders. Meetings with managers, stake holders and users are held in order to determine the requirements like; Who is going to use the system? How will they use the system? What data should be input into the system? What data should be output by the system? These are general questions that get answered during a requirements gathering phase. After requirement gathering these requirements are analyzed for their validity and the possibility of incorporating the requirements in the system to be development is also studied.

Finally, a Requirement Specification document is created which serves the purpose of guideline for the next phase of the model. The testing team follows the Software Testing Life Cycle and starts the Test Planning phase after the requirements analysis is completed.

2) Design: In this phase the system and software design is prepared from the requirement specifications which were studied in the first phase. System Design helps in specifying hardware and system requirements and also helps in defining overall system architecture. The system design specifications serve as input for the next phase of the model.

In this phase the testers comes up with the Test strategy, where they mention what to test, how to test.

3) Implementation / Coding: On receiving system design documents, the work is divided in modules/units and actual coding is started. Since, in this phase the code is produced so it is the main focus for the developer. This is the longest phase of the software development life cycle.

4) Testing: After the code is developed it is tested against the requirements to make sure that the product is actually solving the needs addressed and gathered during the requirements phase. During this phase all types of functional testing like unit testing, integration testing, system testing, acceptance testing are done as well as non-functional testing are also done.

5) Deployment: After successful testing the product is delivered / deployed to the customer for their use.

As soon as the product is given to the customers they will first do the beta testing. If any changes are required or if any bugs are caught, then they will report it to the engineering team. Once those changes are made or the bugsare fixed then the final deployment will happen.

6) Maintenance: Once when the customers starts using the developed system then the actual problems comes up and needs to be solved from time to time. This process where the care is taken for the developed product is known as maintenance.

12 May, 2016

PRIME NUMBERS WITH IN THE GIVEN RANGE

#include<iostream>
#include<iomanip>
using namespace std;

int main(){
    int num,i,count,n;
    cout << "Enter max range: ";
    cin >> n;
    for(num = 1;num<=n;num++){
         count = 0;
         for(i=2;i<=num/2;i++){
             if(num%i==0){
                 count++;
                 break;
             }
        }
       
         if(count==0 && num!= 1)
              cout << num << setw(3);
    }
 system("pause");
   return 0;
}

Sort Elements in Lexicographical Order

#include<iostream>
#include <cstring>
using namespace std;
int main(){
    int i,j;
    char str[10][50],temp[50];
    cout << "Enter 10 words: " << endl;
    for(i=0;i<10;++i)
        cin.getline(str[i], 50);
    for(i=0;i<9;++i)
       for(j=i+1;j<10 ;++j){
          if(strcmp(str[i],str[j])>0)
          {
            strcpy(temp,str[i]);
            strcpy(str[i],str[j]);
            strcpy(str[j],temp);
          }
    }
    cout << "In lexicographical order: " << endl;
    for(i=0;i<10;++i){
       cout << str[i] << endl;
    }
return 0;
}

Enter 10 words:
fortran
java
perl
python
php
javascript
c 
cpp
ruby
csharp

In lexicographical order:
c
cpp
csharp
fortran
java
javascript
perl
php
python
ruby

11 May, 2016

Cache memory

A Cache (Pronounced as “cash”) is a small and very fast temporary storage memory. It is designed to speed up the transfer of data and instructions. It is located inside or close to the CPU chip. It is faster than RAM and the data/instructions that are most recently or most frequently used by CPU are stored in cache.

The data and instructions are retrieved from RAM when CPU uses them for the first time. A copy of that data or instructions is stored in cache. The next time the CPU needs that data or instructions, it first looks in cache. If the required data is found there, it is retrieved from cache memory instead of main memory. It speeds up the working of CP

26 April, 2016

Important programming concept for exam

C++ virtual function:
http://www.learncpp.com/cpp-tutorial/122-virtual-functions/

26 March, 2016

BB Question 2012

Q. Q. Draw a binary Tree for the expression : A * B – (C + D) * (P / Q)

What is DNS, why it is important and how it works

The Domain Name System (aka DNS) is used to resolve human-readable hostnames like www.Dyn.com into machine-readable IP addresses like 204.13.248.115. DNS also provides other information about domain names, such as mail services.

But why is DNS important? How does it work? What else should you know?

Why is DNS important?

DNS is like a phone book for the Internet. If you know a person’s name but don’t know their telephone number, you can simply look it up in a phone book. DNS provides this same service to the Internet.
When you visit http://dyn.com in a browser, your computer uses DNS to retrieve the website’s IP address of 204.13.248.115. Without DNS, you would only be able to visit our website (or any website) by visiting its IP address directly, such as http://204.13.248.115.

How does DNS work?

When you visit a domain such as dyn.com, your computer follows a series of steps to turn the human-readable web address into a machine-readable IP address. This happens every time you use a domain name, whether you are viewing websites, sending email or listening to Internet radio stations like Pandora.
Step 1: Request information
The process begins when you ask your computer to resolve a hostname, such as visiting http://dyn.com. The first place your computer looks is its local DNS cache, which stores information that your computer has recently retrieved.
If your computer doesn’t already know the answer, it needs to perform a DNS query to find out.
Step 2: Ask the recursive DNS servers
If the information is not stored locally, your computer queries (contacts) your ISP’s recursive DNS servers. These specialized computers perform the legwork of a DNS query on your behalf. Recursive servers have their own caches, so the process usually ends here and the information is returned to the user.
Step 3: Ask the root nameservers
If the recursive servers don’t have the answer, they query the root nameservers. A nameserver is a computer that answers questions about domain names, such as IP addresses. The thirteen root nameservers act as a kind of telephone switchboard for DNS. They don’t know the answer, but they can direct our query to someone that knows where to find it.
Step 4: Ask the TLD nameservers
The root nameservers will look at the first part of our request, reading from right to left — www.dyn.com — and direct our query to the Top-Level Domain (TLD) nameservers for .com. Each TLD, such as .com, .org, and .us, have their own set of nameservers, which act like a receptionist for each TLD. These servers don’t have the information we need, but they can refer us directly to the servers that do have the information.
Step 5: Ask the authoritative DNS servers
The TLD nameservers review the next part of our request — www.dyn.com — and direct our query to the nameservers responsible for this specific domain. These authoritative nameservers are responsible for knowing all the information about a specific domain, which are stored in DNS records. There are many types of records, which each contain a different kind of information. In this example, we want to know the IP address for www.dyndns.com, so we ask the authoritative nameserver for the Address Record (A).
Step 6: Retrieve the record
The recursive server retrieves the A record for dyn.com from the authoritative nameservers and stores the record in its local cache. If anyone else requests the host record for dyn.com, the recursive servers will already have the answer and will not need to go through the lookup process again. All records have a time-to-live value, which is like an expiration date. After a while, the recursive server will need to ask for a new copy of the record to make sure the information doesn’t become out-of-date.
Step 7: Receive the answer
Armed with the answer, recursive server returns the A record back to your computer. Your computer stores the record in its cache, reads the IP address from the record, then passes this information to your browser. The browser then opens a connection to the webserver and receives the website.

This entire process, from start to finish, takes only milliseconds to complete.

21 March, 2016

Type of Algorithms

Divide and conquer algorithms

Binary Search
Quick Sort
Merge Sort
Integer Multiplication
Matrix Multiplication (Strassen's algorithm)
Maximal Subsequence

Dynamic Programming
• String Reconstruction
• Longest Common Subsequence
• Edit Distance
• Subset Sum

Greedy Algorithm

Kruskal’s Minimum Spanning Tree (MST):

Prim’s Minimum Spanning Tree

Dijkstra’s Shortest Path

Huffman Coding

Learn Through Technology

Search

21 August, 2016

Data structure mcq questions

05 August, 2016

Previous IT Questions

25 July, 2016

Install Laravel with an Nginx Web Server on Ubuntu 14.04

Install Laravel with an Nginx Web Server on Ubuntu 14.04

29 June, 2016

SDLC

12 May, 2016

PRIME NUMBERS WITH IN THE GIVEN RANGE

Sort Elements in Lexicographical Order

11 May, 2016

Cache memory

26 April, 2016

Important programming concept for exam

26 March, 2016

BB Question 2012

Q.

Q. Draw a binary Tree for the expression : A * B – (C + D) * (P / Q)

What is DNS, why it is important and how it works

Why is DNS important?

How does DNS work?

21 March, 2016

Type of Algorithms

Contact me

Contributors