ViijayScript: 06/23/17

Hello Netizens, This Game is based on "Data Structure" which is a subject of the Stream "Computer Science and Engineering" in B.Tech.The rule of the Game is if you choose the right answer your score increases by 10 and if you choose the wrong answer your life is decreased by 10 % and your initial life is 100 %.Your target is to score 200 or more than 150 to win the game.I hope you will enjoy while playing this game.......

Score :
Life : %
Level : 1
1. What is the systematic way to organize data in order to use it efficiently called ?
a> Algorithm
b> Data Structure
c> Automata
d> Computer Organization

2. Which option can be called as Characterstics of Data Structure ?
a> Space Complexity
b> Time Complexity
c> Correctness
d> All of these above options

3. Which one of these is NOT a Built-in Data Type ?
a> Integers
b> Boolean
c> Array
d> Character

4. Which one of these is NOT a Derived Data Type ?
a> String
b> Stack
c> Queue
d> Tree

5. Which option can be called as Operations of Data Structure ?
a> Traversing or Searching
b> Insertion or Deletion
c> Sorting or Merging
d> All of these above options

6. Which option follows LIFO(Last In First Out) Data Structure ?
a> Queue
b> Linked List
c> Stack
d> Tree

7. What are the basic operations performed in a Stack ?
a> Push
b> Pop
c> Both options 'a' and 'b'
d> None of these above options
8. Identify this function XXXX......Implemented in C Programming Language ?

void XXXX(int data)
{
if(top!=MAX)
{
top = top + 1;
stack[top] = data;
}
else
{
printf("Could not insert data, Stack is full.\n");
}
}

a> pop()
b> push()
c> isEmpty()
d> isFull()

9. Identify this algorithm.........?
Step 1. Start
Step2. if stack is empty
return null
end if
Step 3. data = stack[top]
Step 4. top = top - 1
Step 5. return data
Step 6. Stop

a> Algorithm of Push operation
b> Algorithm of Pop operation
c> Algorithm to check whether stack is full
d> Algorithm to check whether stack is empty

10. Which option follows FIFO(First In First Out) Data Structure ?
a> Stack
b> Linked List
c> Queue
d> Tree

11. A sequence of data structures which are connected together via links ?
a> Stack
b> Queue
c> Tree
d> Linked List

12. Which one of these is NOT a type of Linked List ?
a> Single Linked List
b> Double Linked List
c> Triple Linked List
d> Circular Linked List

13. We are inserting a node Y (NewNode), between X (LeftNode) and Z (RightNode)......and the Algorithm is

Step 1. Start
Step 2. NewNode.next -> RightNode
Step 3. LeftNode.next -> NewNode
Step 4. Stop
State whether the Algorithm is 'True' or 'False'.....

a> True
b> False

14. Identify this function XXXX......Implemented in C Programming Language ?

void XXXX(struct node** head_ref)
{
struct node* prev = NULL;
struct node* current = *head_ref;
struct node* next;
while (current != NULL)
{
next = current->next;
current->next = prev;
prev = current;
current = next;
}
*head_ref = prev;
}

a> Insert()
b> Delete()
c> Print()
d> Reverse()

15. A variation of Linked list in which navigation is possible in both ways either forward and backward easily as compared to Single Linked List ?
a> Single Linked List
b> Triple Linked List
c> Double Linked List
d> Circular Linked List

16. A variation of Linked list in which first element points to last element and last element points to first element is called ?
a> Single Linked List
b> Triple Linked List
c> Circular Linked List
d> Double Linked List

17. "The way to write arithmetic expression is known as Depth First Traversal"....Identify this statement is 'True' or 'False'?
a> False
b> True

18. Which one of these is NOT a in Notation used in Expression Parsing ?

a> Infix Notation
b> Outfix Notation
c> Prefix Notation
d> Postfix Notation

19. Identify whether Both Statement are 'True' OR 'False' ?

Statement 1: "Prefix notation is also known as Polish Notation"
Statement 2: "Postfix notation style is known as Reversed Polish Notation"

a> Statement 1 is True
b> Statement 2 is True
c> Both Statement 1 and Statement 2 are True
d> Both Statement 1 and Statement 2 are False

20. Identify the Algorithm on how to evaluate XXXX notation ?

Step 1. scan the expression from left to right
Step 2. if it is an operand push it to stack
Step 3. if it is an operator pull operand from stack and perform operation
Step 4. store the output of step 3, back to stack
Step 5. scan the expression until all operands are consumed
Step 6. pop the stack and perform operation

a> Infix Notation
b> Postfix Notation
c> Prefix Notation
d> Outfix Notation