CHAPTER 1

Question 1

INTRODUCTION/DEFINATION TO DATA STRUCTURE

Answer 1

• A DATA STRUCTURE IS THE LOGICAL ARRANGMENT OF DATA ELEMENT COMBINE WITH SET OF OPERATIONS THAT HELPS WITH ACCESS THE ELEMENTS
• SOME OF THE MORE COMMONLY USED DATA STRUCTURE ARE LINKLIST , ARRAY , TREE, QUEUE

Question 2

TYPES OF DATA STRUCTURE

Answer 2

PRIMITIVE AND NON PRIMITIVE

Question 3

EXAMPLE : PRIMITIVE

Answer 3

INT

FLOAT

DOUBLE

CHAR

Question 4

TYPES OF NON PRIMITIVE WITH EXAMPLES

Answer 4

LINEAR AND NONLINEAR
LINEAR : ARRAY , STACL
NONLINEAR : GRAPH , TREE

Question 5

ADVANTAGES & DISADVANTAGES OF POINTER

Answer 5

IT ALLOW YOU TO ACESS ANY MEMORY ADDRESS
- * Pointers can be used to return multiple values from a function.
- * Pointers allow C to support dynamic memory management.

• DISADVANTAGES OF POINTER
  
  • IF POINTER REFREANCE INCORRECT VALUE IT EFFECT WHOLE PROGRAM
  • POINTERS ARE SLOWER THAN NORMAL VARIABLESADVANTAGES & DISADVANTAGES OF POINTER

Question 6

COMPLEXITY

Answer 6

complexity is ameasure of the interactions of the various elements of the software

Question 7

2 TYPES OF COMPLEXITY

Answer 7

TIME COMP;EXITY , SPACE COMPLEXITY

Question 8

TIME COMPLEXITY

Answer 8

• MOUNT OF COMPUTATIONAL TIME NEED TO EXECUTE THE PROGRAM AND GET THE INTENDED RESULT
  
  • THERE ARE 3 COMPLEXITY ANALIZIES
    
    1. WORST CASE > BIG OH = O
    2. AVERAGE CASE > THETA =0( THETA)
    3. BEST CASE > OMEGA = (SIGN OF OHM )
    • WORST CASE : BIG OH USES FOR WORST CASE & RESULT GETS IN UPPER BOUND
    • AVERAGE CASE : THETA NOTATION USE FOR AVERAGE CASE AND RSULT GETS TIGHT BOUND
    • BEST CASE : OMEGA NOTATION USE FOR BEST CASE , SO ON RESULT GETS WITH LOWER BOUND

Question 9

SPACE COMPLEXITY

Answer 9

e space complexity of an algorithm or a computer program is theamount of memory space required to solve an instance of the computational problem

Question 10

Algorithm

Answer 10

is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems

Question 11

USES OF ALGORITHM (OR BENIFIT OF ANALYZE ALGORITHM )

Answer 11

• TO PREDICT REQUIRED RESOURSES
• TO PREDICT HOW FAST ALGORITHM WORK BASE ON PROBLEM SIZE
• TO KNOW COMPUTATIONAL TIME AND CPU CONSAMPTION
• TO KNOW MEMORY AND RAM CONSAMPTION
• TO PREDICT DESIGN AND CODE STRUCTRE
• TO MAKE CODE EASY TO UNDERSTAND

Question 12

WHAT IS STACK?

Answer 12

A STACK IS A LINEAR DATA STRUCTURE WHICH STORES ITS ELEMENTS IN PARTICULAR ORDER. THIS ORDER FOLLOWED BY A STACK IS KNOWN AS LIFO (Last In Frist Out )

• A EXAMPLE OF REAL LIFE IS PLATES STACKED OVER ONE ANOTHER ON A TABLE
• THE PLATE WHICH IS AT THE TOP IS THE FIRST ONE TO BE REMOVED

Question 13

PROPERTIES OF STACK

Answer 13

1. FOLLOWS LIFO , LAST ELEMENT THAT IS INSERTED IS PUSHED OUT FIRST
2. A POINTER KEEPS TRACK OF THE STACK’S TOPMOST (OR LAST) ELEMENT . THIS IS MANIPULATED ON THE BASIS OF OPERATIONS TO KEEP TRACK OF MOST RECENT ELEMENT

Question 14

STACK MANIPULATION OPERATIONS

Answer 14

• PUSH OPERATION
  
  • WHEN AN ELEMENT IS INSERTED INTO THE STACK , IT IS SAID THAT THE ELEMENT IS PUSHED INTO STACK , THE TIP POINTER IS MOVED UP TO POINT TO THE ELEMENT THAT IS INSERTED
• POP OPERATION
  
  • WHEN AN ELEMNT IS REMOVED FROM THE STACK, IT IS SAID THAT THE ELEMENT IS POOPED FROM THE STACK , THE TOP POINTER IS MOVED DOWN TO POINT TO THE ELEMENT BELOW THE REMOVED ELEMENT
• PEEK OPERATION
  
  • PEEK IS AN OPERATION THAT RETURNS THE VALUE OF THE TOPMOST ELEMENT OF THE STACK WITHOUT DELETING IT FROM STACK.