Data Structures

Introduction of C

100

?:

Conditional operator

structures and arrays

100

array name

Address of the first element

200

1. #include <stdio.h>

2.     void main()

3.     {

4.         int ch;

5.         printf("enter a value btw 1 to 2:");

6.         scanf("%d", &ch);

7.         switch (ch)

8.         {

9.         case 1:

10.             printf("1\n");

11.             break;

12.             printf("Hi");

13.         default:

14.             printf("2\n");

15.         }

16.     }

2

stack and Ques

100

FIFO

Q Follows what ?

200

In a stack, if a user tries to remove an element from empty stack it is called _________

underflow

Linked List

100

 info part

which part of the  node contain da

tree and Graph

100

stack

The Data structure used in standard implementation of Breadth First Search is?