Data

Question 1

1. Data is classified into ? Sych as?
2. This has domain of allowed valued n set of OPERATION has categ of PRINITIVE N ADT

Answer 1

1. Data is classified into DATA TYPES , as char, float, int
2. Data Types

Question 2

1. Primitive is aka as ?
2. ?? How data can be stored in diff STRUCTURES
3. ?? Helps us how to solve diff problems by searching thru n manipulating data , provides step by step instructions to achieve goal

Answer 2

1. simple or Atomic data types
2. Data Structures
3. Algorithmns

Question 3

1. A data struc by prog lang to repre single values ( INT, FLOAT CHAR BOOLEANS)
2. A data struc BUILT USING PRIMITIVE DATA TYPES N MORE COMPLex ( linked list, stacks, trees)
3. Way of organizing data pra efficiently
4. Measure of amt of time an algo takes to run,
5. Measure of d amt of MEMORY an algo uses

Answer 3

1.Primitive Data types
2. Abstract Data Type
3. Data structures
4. Time complexity
5. Space Cimplexity

Question 4

1. where a funct call itself
2. a mathe. nota. describ. the limiting behavior of a function’
3. A methpd of solving complex prob by BREAKING THEM in smaller sub-problems
4. simple and straight forward way an algorithm can work by simply trying all possible solutions and then choosing the best one.

Answer 4

1.Recursion
2.2. Big O
3.divide n Conquer
4.4. brute force

Question 5

1. fibonacci numbers r always named after an ??? in a ???? century
2. how to find the nth fibo numer using recursion?

Answer 5

1. italian, 13th
2. n = F(n-1)+f(n-2)

Question 6

1. a data struct to STORE MULTIPLE elements
2. You cannot resize an
   array. t?F
3. Multidimensional arrays are implemented
   as arrays of arrays
   4.Algorithms are expressed in pseudo-code

Answer 6

1. Array
2. T
3. t
4. T

Question 7

1/ recursion has 2 parts
2. What is a smaller identical problem(s)?
3. 2. ow are the answers to smaller problems combined to
form the answer to the larger problem
3 the smallest problem that can be solved easily
(without further decomposition)?

Answer 7

1.1 Base case// stopping condition
1.2 Recursive call// call itself w diff arguments, reduces complexity of the problem
2. Decomposition
3. Compositioin
4. base case

Question 8

1. a** linear data struc** insertions n deletions r allowed ONLY AT THE END , LIFO
2. this adds an element to the top of the stack
3. Removes top elemen from stakc
4. Checks if stack is empty
5. ReTURNS THE TOP ELE WITHOUT REMOVING
6. check is stack is full

Answer 8

1. Stack
2. Push
3. Pop
4. isEmpty
5. Peek
6. IfFull

Question 9

1.The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.
2.s used to return the count of elements that are present inside the stack.
3.Block Delimiters are example 3

Answer 9

2. .size
3. 3. begin/end, parenthesis, braces

Question 10

1.a linear data structure that follows the First-In-First-Out (FIFO) principle. It operates like a line where elements are added at one end (rear) and removed from the other end (front).
2.adds an elem in end/rear of queue
3. removes and returns the element

4.

Answer 10

1. queu (ex one way exits
   Queue of ticket
   Printing queue
   )
2. enqueu(insert
3. dequeu (delete)

Question 11

appplication of stacks, notation

1. a + B , between operand
2. before operand, +AB
3. after operand, AB+
4. after all charc from infix exper, POP any remaining OPERATORYS in the stack to the postfix operators

Answer 11

1. INFIX NNOTATION
2. PREFIX NOTATION
3. postfix notation

Question 12

1 linear data structure that consists of a series of nodes connected by pointers
2. collect of node contains a** data field and a reference** (link) to the
next node in the sequence.
● Navigation is forward only

3. this holds actual value /data w the node
4. Stores the memory address of the next node
5. ead and Tail: The linked list is accessed through the head node, which points to the first node in the list. The last node in the list points to NULL or nullptr, indicating the end of the list. This node is known as the tail node.
   we. prefer linked list over arrays is due to ease of insertion and deletion in linked list

Answer 12

1. Linke dlist
2. Single linked list
3. Node
4. Next Pointer/reference

Question 13

1. here we discuss the amount of resources that an algorithm needs to execute, or more precisely, its efficiency.
2. Input case, best case sa una (1-99=1)
3. input case, most common
4. overall anyslis

Answer 13

1. Comutational Complexity
3. worst case (kuha dulo, 99
4. Average anyslis, in between or /2

Question 14

1. this notation is used 2 repre complexities of algo
2. Bid O is also?
3. this identifies the data being requested by the user list
4. this is the most basic algorithm & 2
6. list beging n continues untol d iterm is found/searched

Answer 14

1. asymptotic notation
2. Big Order, 1-this drops constant facorts, 2 lower orderterns

3/ Search key
4. Sequential Seach / linearsearch