Unit-wise IMP Questions

Unit1:[Introduction]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. Program=
A) algorithm +DataStructure
B) process +data
C) process+stack
D) array +

stackAnswer:A

2. ANon-primitivedatatypeisfurtherdividedinto
A) StackandQueue
B) LinearandNon-Linear
C) TreeandGraph
D) Non-primitive and Non-

LinearAnswer:B

3. Apointerisavariablethatstores the ofanothervariable.

A) memoryblock
B) memorycollection
C) memoryaddress
D) memory

Answer:C

FillintheBlanks –Minimum3Questions
1. Syntaxofdynamicmemoryallocation:
Answer:ptr=(cast-type*) (byte-size)

2. is a finite set of instruction for performing a particular

task.Answer:Algorithm

3. Theamountoftimerequiredbyanalgorithmtobeexecutedis called
.
Answer:timecomplexity

1- MarkQuestions–Minimum5Questions
1. SpaceComplexityofanalgorithm istotal by the algorithm with respect to
theinputsize
Answer:spacetaken
2. WhatisaLinearDataStructure?
Answer: A Linear Data Structure is a type of data structure in which the elements
arearranged in a sequential order, one after the other, such that each element is
connected toits previous and next element. In a linear data structure, all elements are
stored in a singleleveloralinearform,allowingeasytraversalthroughthedatainaspecific
direction.

3. Stackfollowswhichdatastructure?A
nswer:LIFO

4. Queue follows which data

structure?Answer:FIFO

5. A tree can be defined as finite set of data items (nodes) in which data items are
arrangedinbranches andsubbranches accordingto requirement.
Answer:TREE

2- MarksQuestions–Minimum5Questions
1. WhatisselfreferentialStructure?Explainitsusage?

2. DifferencebetweenLinearandNonLinearDataStructure.

3. DifferencebetweenPrimitiveandNonPrimitiveDataStructure.

4. DifferencebetweenStructureandUnion?

5. WhatisPrimitiveDataStructure?

3- MarksQuestions–Minimum4Questions
1. WhatarePre–definedandUserdefineddatatype?

2. WhatisaStackandQueue?Explainwithanexample.

3. ExplainTreeandGraphwiththeexample.

4. Whatis anArray?Howtodeclareanarray?Explainwithanexample.

4- MarksQuestions–Minimum5Questions
1. WhatisaStructure?Explainwithanexample.

2. What is a Primitive data structure? List any three primitive data structure. Explain
withanexample.

3. WhatisNonPrimitiveDataStructure?Explainwithanexample.

4. Whatis aPointer?Howtodefinethepointer?Explainwithanexample.

5. What is Dynamic memory allocation? List out all the dynamic memory
allocationfunctions.
6-MarksQuestions–Minimum5Questions
1. WhatisaDataStructure?ExplainclassificationofDataStructure.

2. Drawachartandexplaintheclassificationofdatastructures

3. What is dynamic memory allocation? Write down the differences between malloc
andcallocwith examples.

4. ExplainalltheoperationsofDataStructure.

5. WhatisStructureandUnion?Explainwithsyntaxandexample.

Unit2:[Stacks, RecursionandQueue]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. Whatis ADT?
A) AbstractDataType
B) ArithmeticDataType
C) AbstractDetectionTime
D) Absent Data

TypeAnswer:A

2. Insertionoperationofstackis called operation.

A) POP
B) PUSH
C) Enqueue
D) None of the

aboveAnswer:B

3. basicallycomesfromaChineseorJapanesesource.
A) Towerof London
B) memorycollection
C) TowerofHanoi
D) None of the

aboveAnswer:C

FillintheBlanks –Minimum3Questions
1. Deletionoperationofstackis called
operation.
Answer:POP

2. Prefix notation of (A+B)

is:Answer:+AB
3. Postfix notation of (A+B)
is:Answer:AB+

1- MarkQuestions–Minimum5Questions
1. Fullform ofFIFO
Answer:FirstInFirstOut

2. Fullform ofLIFO
Answer:LastInFirstOut

3. Stackfollowswhichdatastructure?A
nswer:LIFO

4. Queue follows which data

structure?Answer:FIFO

5. Prefix notation is also known

as:Answer:Polishnotation

2- MarksQuestions–Minimum5Questions
1. Whatis aStack?Explaintheoperationsonastack.

2. Whatis aQueue?Whatare theoperations onaqueue.

3. Whatis Recursion?Listouttypesofrecursion.

4. WhatisaQueue?ExplainEnqueueandDequeue.

5. HowtoperforminsertioninaQueue?Explainwithanexample.

3- MarksQuestions–Minimum4Questions
1. WhatisaQueue?ExplaindifferenttypesofQueue.

2. DifferencebetweenStackandQueue.

3. WhatisaPriorityQueue?Explainwithanexample.

4. Explainbasicoperationsonastack.

4- MarksQuestions–Minimum5Questions
1. HowtodefineaStack?ExplainPUSHandPOPwithanexample.

2. HowtodefineaQueue?Explaininsertionanddeletioninaqueuewithanexample.

3. Explaincircularqueue? What is the main advantage of using a circular queue over

alinearqueue?
4. Convertbelownotationsintopostfix.

A+B*C /D

Answer:A BC*D/+

5. ExplainTowerofHanoiwith3rings.

6-MarksQuestions–Minimum5Questions
1. Explainbasicoperationsonastackwithanexample.

2. Howstackrepresentedusinganarrayinmemory?ExplainwithExample.

3. ConverttheInfixnotationintoPostfix:

((A+B)*C-D)/E

Answer:A B+C*D -E/

4. Convert the infix expression (A + B) * (C - D) to both prefix and postfix

notation.Explainthe stackoperationsinvolvedin theconversionprocess.

5. Evaluate the following postfix expression using a stack: 5 6 2 + * 12 4 / -

andshoweachstep ofthestackoperations.

Unit3:[LinkedList]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. Whichofthefollowingistrueaboutalinkedlist?
A) Thesizeofthelinkedlistisfixedafter declaration.
B) Eachnodecontainsadatafieldandareferencetothenextnode.
C) Elementscan beaccessedrandomly.
D) Elementsarestoredincontiguousmemorylocations
Answer:Eachnodecontainsadatafieldandareferencetothenextnode

2. Whatisthetimecomplexityforsearchinganelementinalinkedlist?
A) O(1)
B) O(n)
C) O(n^2)
D) O(log
n)Answer:O(
n)
3. Whichtypeoflinkedlisthasbothforwardandbackwardtraversal?
A) SinglyLinkedlist
B) CircularLinkedlist
C) DoublyLinkedlist
D) Header Linked
listAnswer:DoublyLinkedli
st

FillintheBlanks– Minimum3Questions
1. Thelastnodeofacircularlinkedlistpointstothe node.
Answer:First

2. Ina linked list, each node has a pointer to both the next and the
previousnode.
Answer:Doubly

3. Alinkedlistinwhichthelastnodepointsbacktotheheadnodeiscalleda
linkedlist.
Answer:Circular

1- MarkQuestions–Minimum5Questions
1. Whatistheprimaryadvantageofusingalinkedlistoveranarray?
Answer:Dynamicmemoryallocationandeaseofinsertionanddeletion.

2. Whatisacircularlinkedlist?
Answer:Alinkedlistwherethelastnodepointsbacktothefirstnode.

3. WhatisthecomplexityofinsertionatbeginninginSinglyLinkedList?Answ
er:O(1)

4. How many pointers are there in each node of a singly linked

list?Answer:One Pointer(NEXT)

5. WhatisthecomplexityofinsertionatendofSinglyLinkedList?Answ
er:O(n)

2- MarksQuestions–Minimum5Questions
1. Whatisaheaderlinkedlist?
Answer: Header Linked List is a modified version of Singly Linked List. In Header
linkedlist,wehaveaspecialnode,theHeaderNodepresentatthebeginningofthelinkedlist.

2. Whatisthedifferencebetweenasinglylinkedlistandadoublylinkedlist?
Answer: A singly linked list has nodes with a single pointer to the next node, whereas
adoubly linked list has two pointers: one pointing to the next node and the other pointing
tothepreviousnode.
3. Whyarelinkedlistspreferredoverarraysforimplementing queues?
Answer: Linked lists allow for dynamic memory allocation, and insertions or deletions
atthe beginning or end can be done in constant time O(1), whereas arrays require
shiftingelements,leadingto highertimecomplexity.

4. WhatisthetimecomplexityofinsertinganodeatdifferentpositionsinaSinglyLinked
List?
Answer:Insertatbeginning:O(1).

Insert at specific position:

O(n)Insertat end:O(n)

5. Why is traversing a doubly linked list more efficient than traversing a

singlylinkedlist?
Answer: In a doubly linked list, you can traverse in both directions (forward
andbackward), allowing you to easily navigate to the previous node without needing
to re-traversefromthe head.

3- MarksQuestions–Minimum4Questions
1. WriteafunctionfortraversingthroughaSinglyLinkedList.
Answer:voidtraverseList(structNode*head){st

ructNode* current=head;

while(current!=NULL){

printf("%d -> ", current-

>data);current= current->next;

}printf("NULL\n");

2. Explainhowtoinsertanodeatthebeginningofasinglylinkedlist.

3. whataretheadvantagesofusingalinkedlistoveranarrayforimplementingstacks
andqueues?

4. Whatisaheaderlinkedlist,andhowdoesitdifferfrom aregularlinkedlist?

4- MarksQuestions–Minimum5Questions
1. Whataretheadvantagesofusingaheaderlinkedlist?
2. ExplaintheimplementationofaStackusingaSinglyLinkedList.Describehow
pushandpopoperationsareperformed.
3. DescribetheimplementationofaQueueusingaSinglyLinkedList.Explainhowenque
ueanddequeueoperations work.

4. WriteafunctiontosearchadesiredelementfromSinglylinkedlist.
Answer:voidsearch(){

intvalue,pos =0;

printf("Enter value to search:

");scanf("%d",&value);

structnode*ptr=head;w

hile(ptr!=NULL){

if(ptr->data==value){

printf("Nodewithvalue%dfoundatposition%d\n",value,pos);return

pos++;

ptr=ptr->next;

printf("Nodewithvalue%dnotfound\n",value);

5. Write a function to delete a node from end of doubly linked

list.Answer:voiddelete_end(){

if(head==NULL){

printf("Linked List is empty | Nothing to delete

\n");return;

}else{
 struct node* ptr =

head;while(ptr-

>next!=NULL){

ptr=ptr->next;

if(ptr->prev!=NULL){

ptr->prev->next=NULL;

}else {

head=NULL;

free(ptr);

printf("NodeDeleted\n");

6-MarksQuestions–Minimum5Questions

1. Describethedifferencebetweensearchinginalinkedlistandanarray.

2. Whatisacircularlinkedlist,andwhatareitsbenefits?

3. Whatisalinkedlist?Explainthedifferenttypesoflinkedlists.

4. Describetheapplicationsoflinkedlists.Whatarethebenefitsofusinglinkedliststoimpl
ementstacks andqueues?

5. Explain the deletion operation in a singly linked list. Discuss how a node is
deletedfromthebeginning,fromaspecific position,andfromtheendofthelist.
Unit4:[searchingand sorting]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. Whichofthefollowingsortingalgorithmshasthebesttimecomplexityforlargedatasets?
A) SelectionSort
B) BubbleSort
C) QuickSort
D) Insertion
SortAnswer:C)QuickS
ort

2. In a bubble sort, how many comparisons are needed in the first pass if the array
contains5 elements?
A) 5
B) 4
C) 3
D) 2Answer:
B)4

3. Whatis thetimecomplexityofthe averagecasescenarioforinsertionsort?

A) O(n^2)
B) O(n)
C) O(logn)
D) O(n log
n)Answer:B)O(n^
2)

FillintheBlanks –Minimum3Questions
1. Theworst-casetimecomplexityofbubblesortis
.
Answer:O(n^2)

2. Theprimaryoperationinmergesortis theprocess of two sorted subarrays into

asinglesorted array.
Answer:Merging

3. Ina binarysearch, thearraymustbe before the search can

begin.Answer:sorted

1- MarkQuestions–Minimum5Questions
1. What is the time complexity of the average case scenario for interpolation
search?Answer:O(loglogn)

2. Howdoesbinarysearchimprovetheefficiencyofsearchingcomparedtolinearsearch?
3. Whatisthebasicoperationofselectionsort?
4. Whichalgorithmis mostefficientwhenthearrayis alreadysortedornearlysorted?
5. Whatistheaverage-casetimecomplexityofquicksort?

2- MarksQuestions–Minimum5Questions
1. Explainthebasic ideabehindmergesort.
2. Howdoes bubblesortwork?
3. Explainthebestcasescenario ofinterpolationsearch.?

4. Whatis themaindisadvantageofselectionsort?

5. WhatistheadvantageofInterpolationsearchoverbinarysearch?

3- MarksQuestions–Minimum4Questions
1. Describethestepsinvolvedintheselectionsortalgorithm.
2. Compareandcontrastmergesortandquicksort.
3. Explainthekeydifferencebetweeninsertionsortandbubblesort.
4. Explainthecomplexityofinterpolationsearchinthebest,average,andworstcases.

4- MarksQuestions–Minimum5Questions
1. Howdoesmergesortmaintainstability?
2. Describetheadvantagesanddisadvantagesofquicksort.
3. Explaintheconceptofpartitioninginquicksort.
4. Howdoes theinsertionsortalgorithm
work?Provideasimpleexampleofsortingthearray[5, 2,9, 1]usinginsertionsort.

5. Whatisinterpolationsearch,andhowdoesitdifferfrombinarysearch?

6-MarksQuestions–Minimum5Questions
1. Explainthestep-by-stepprocessofthemergesortalgorithm.
2. Provideadetailedcomparisonofselectionsort,bubblesort, andinsertionsort.
3. Howisquicksortimplemented,andwhatarethecriticalfactorsinitsperformance?
4. Describehowinsertionsortworkswithanexample.
5. ExplainInterpolationSearchwithanexample.

Unit5:[Trees]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. Whichofthefollowingisapropertyofabinarysearchtree (BST)?
A) Everynodehasatleasttwo children
B) Leftsubtreenodesaresmallerthantheroot
 C) Rightsubtreenodesaresmallerthantheroot
D) Allinternalnodeshavetwochildren
Answer:B)Leftsubtreenodesaresmallerthantheroot

2. Whichtraversalmethod
visitstheleftsubtree,thentheroot,andfinallytherightsubtree?
A) Pre-order
B) In-order
C) Post-order
D) Level-
orderAnswer:B)In-
order

3. Whichtraversalmethodprocessestherootnodeafteritssubtrees?
A) Pre-order
B) In-order
C) Post-order
D) Level-
orderAnswer:C)Post-
order

FillintheBlanks –Minimum3Questions
1. A binarytreeisabinarytreeinwhicheverynodehaseitherzero
ortwochildren.
Answer:Full

2. Inabinarysearchtree,searchingfor anelementhasatimecomplexityof
intheworstcase.
Answer:O(n)

3. The of a node is the number of edges from the node to the

root.Answer: depth

1- MarkQuestions–Minimum5Questions
1. Whatisthedegreeofaleafnodeinabinarytree?Answ
er: 0/Zero

2. What istheheightof atree?

Answer:Thenumberof edgesonthe longestpath fromtheroottoaleaf.

3. Defineabinarysearchtree.
Answer:Abinarysearch tree isabinarytreein whicheachnode'sleftsubtree
containsvalueslessthanthenode,andtherightsubtreecontainsvaluesgreaterthanthenod
e.

4. Howisaskewedbinarytreedefined?
Answer: A skewed binary tree is a tree in which all nodes are either left-leaning
orright-leaning.

5. Whatisthetimecomplexityforsearchinganelementinabalancedbinarysearchtree?
Answer:O(logn)

2- MarksQuestions–Minimum5Questions
1. Explaintheconceptofabinarysearchtree.
2. Whatisthedifferencebetweenafullbinarytreeand acompletebinarytree?
3. DescribehowanAVLtreemaintainsbalance.
4. Whatisaninternalnodeinatree?
5. Whatisacompletebinarytree?

3- MarksQuestions–Minimum4Questions
1. Comparepre-orderandpost-ordertreetraversal.
2. Explainhowtheinsertionoperationworksinabinarysearchtree.

3. Describethein-ordertraversalmethodforbinarysearchtrees.

4. Explaintheconceptofthreadedbinarytree.

4- MarksQuestions–Minimum5Questions
1. Whataretheadvantagesanddisadvantagesofthreadedbinarytrees?

2. Howdoes deletionworkinabinarysearchtreewhenthenodehastwochildren?

3. Explainthestructureofacompletebinarytree withanexample.

4. Writedownthealgorithmforin-ordertraversal.

5. What are the key properties of a Binary Search Tree (BST), and how do they
enhancesearchefficiency?

6-MarksQuestions–Minimum5Questions
1. Discussthepropertiesandusecasesofbinarysearchtrees(BSTs).

2. Explainthearrayrepresentationsofbinarytreeswithanexample.
3. How do binary tree traversals (pre-order, in-order, post-order) differ, and what are
theirtypicalusecases?

4. WhatisThreadedbinarytree?ExplainwithanExample.

5. Explain the process of constructing a binary search tree (BST) from the
followingvalues:10, 3, 15,22, 6, 45, 65,23, 78, 34, 5.

Unit6:[RedBlackTreeandAVLTree]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. WhichofthefollowingistrueaboutAVLtrees?

A) AVLtreesareweight-unbalanced
B) EveryAVLtreeisabinarysearch tree
C) AVLtrees requiremorespace thanRed-Blacktrees
D) AVLtreesallowduplicatevaluesA
nswer:B

2. In an AVL tree, if a node becomes unbalanced after insertion in its right subtree's
leftchild,which rotationisapplied?

A) LeftRotation
B) RightRotation
C) Left-RightRotation
D) Right-
LeftRotationAnswer:D)Right-
LeftRotation

3. InaRed-BlackTree,whichofthefollowingpropertiesiscorrect?

A) Therootnodemustalways bered
B) Every path from a node to its descendant NIL nodes must have the same number of
rednodes
C) Rednodes cannothaveredchildren
D) All leaves must be
redAnswer:C

FillintheBlanks –Minimum3Questions
1. Anode inanAVLtreeiscalled if the longest path in its right subtree is longer
thantheleftsubtree byone.

Answer:right-heavy

2. Red-BlackTrees areatypeof binarysearchtree.

Answer:self-balancing

3. WhendeletinganodeinanAVLtree, thedeletednode isreplacedbyits if the

rightsubtreeisnot empty.

Answer:in-ordersuccessor

1- MarkQuestions–Minimum5Questions
1. Define anAVLtree.
Answer: An AVL tree is a height-balanced binary search tree where the heights of two
childsubtrees of anynode differbyatmostone.

2. Whatis thecolorpropertyofaRed-BlackTree?
Answer:EachnodeinaRed-BlackTreeis eitherredorblack

3. Whatis abalancednodeinanAVLtree?
Answer:Anodewheretheheightdifferencebetweentheleftandrightsubtreesiszero.

4. State the root property of a Red-Black

Tree.Answer:TherootofaRed-BlackTreeis
alwaysblack.

5. What is the worst-case time complexity for searching in an AVL

tree?Answer:O(logn)

2- MarksQuestions–Minimum5Questions
1. Explaintheconceptofaheight-balancedtree.
2. Describea singlerightrotationinanAVLtree.
3. Howis aRed-BlackTreedifferentfrom anAVLtreeinterms ofbalancing?
4. WhatistheprimaryobjectiveofRed-BlackTrees?
5. DefinetheblackpropertyofaRed-BlackTree.

3- MarksQuestions–Minimum4Questions
1. Whatarethesteps involvedinfixingviolationsafterinsertinganodeinaRed-BlackTree?
2. ExplaintheprocessofaLeft-Right rotationinanAVLtree.
3. Whatis theRedPropertyinRed-BlackTrees,andwhyisitimportant?
4. When is a double black condition encountered in a Red-Black Tree deletion, and how is
itresolved?

4- MarksQuestions–Minimum5Questions
1. Describethesteps forinsertinganewnodeintoanAVLtree.
2. ExplaintheinsertionprocessinaRed-BlackTreeandhowitmaintains balance.
3. WhatarethefourpossiblerotationcasesinanAVLtreeinsertion?
4. DiscusshowRed-BlackTrees handlethedeletionofablacknode.
5. Whatis theroleofin-ordersuccessorduringdeletioninanAVLtree?
6-MarksQuestions–Minimum5Questions
1. ExplaintheconceptofanAVLtreeandthebalancingtechniques usedinit.

2. Describe the properties of Red-Black Trees and explain how they ensure balanced
treestructureduringinsertion.

3. ConstructanAVLtree fromthefollowingvalues:64,1, 44,26, 13, 110,98, 85.

4. Explain the process of deletion in Red-Black Trees and how the tree maintains its
balanceafterdeletion.

5. DiscusshowtheheightbalanceofanAVLtreeaffectsitsefficiencyinsearch,insertion,anddel
etionoperations.

Unit7:[Hashing]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. Whatis themaingoalofahashfunction?
A) Toreducememoryusage
B) Tomapdatatoa fixed-sizevalue
C) To encryptdata
D) Tocompress data
Answer:B

2. Whathappenswhen twokeyshashtothesameindexinahashtable?
A) The secondkeyisignored.
B) Thefirstkeyisremoved
C) Resizetable
D) Acollisionoccurs
Answer:D

3. Whichofthefollowingbestdescribesdynamichashing?
A) Hashtablesizeremainsfixed
B) Hashtablesizegrowsorshrinksdynamicallybasedonusage
C) Ituses linearprobingtohandlecollisions
D) It reliesonopen addressing foroverflow
Answer:B
FillintheBlanks –Minimum3Questions

1. Themethodof
resolvingcollisionsbystoringmultiplevaluesateachindexiscalled .
Answer:Chaining.
2. Statichashinghasa table size, while dynamic hashing allows the
tablesizeto change.
Answer:fixed
3. A is a data structure that stores key-value pairs for efficient
dataretrieval.
Answer:hashtable

1- MarkQuestions–Minimum5Questions

1. Whatis ahashtable?
Answer: A hash table is a data structure that maps keys to values using a
hashfunction to compute an index into an array of buckets or slots, where the
desiredvaluecanbe found.
2. Whatisthemaindifferencebetweenstaticanddynamichashing?
Answer: The main difference is that static hashing has a fixed table size,
whiledynamichashingallowsthetablesizetogroworshrinkdynamicallyasneeded.
3. Nameonetypeofcollisionresolutiontechnique.
Answer:Onecollisionresolutiontechniqueischaining,whereeachbucketinthehashta
blepointsto a linkedlistof entries thatshare thesameindex.
4. Whatis thepurposeofahashingfunction?
Answer: The purpose of a hashing function is to transform the input (key) into
afixed-size hash code, which is then used to determine the index where the
key'sassociatedvalueisstoredinthe hashtable.
5. Whatismeantbythe term 'bucket'inahashtable?
Answer: A 'bucket' in a hash table is a slot or location where one or more
entries(key-value pairs) can be stored, typically in case of collisions when
multiple keyshashtothesame index.

2- MarksQuestions–Minimum5Questions

1. Whatisstatichashing,andwhereisitused?

2. Explainthepurposeofdynamichashing.

3. Whatistheloadfactorinahashtable,andwhyisitimportant?

4. Defineseparatechaininginthecontextofhashtables.
 5. Whatisrehashing,andwhyisitnecessaryindynamichashing?

3- MarksQuestions–Minimum4Questions

1. Comparestaticanddynamichashing.

2. Explaintheconceptofdoublehashing.

3. Howdoesdynamichashinghandlethegrowthofthehashtable?

4. Whatarehashfunctions,andwhatcharacteristicsmakeagoodhashfunct
ion?

4- MarksQuestions–Minimum5Questions

1. Describe the process of open addressing and its variations in

collisionresolution.

2. Explaindivision,mid-squareandfoldingmethodsinhashing.

3. Explaindynamichashingwithexample.

4. Explainthestepsinvolvedinrehashingindynamichashtables.

5. Discussthebenefitsanddrawbacksofusingseparatechainingforcollisionresol
ution.

6- MarksQuestions–Minimum5Questions

1. Explain dynamic hashing with an example. What are the advantages

ofdynamichashing?

2. Explaintheprocessofseparatechaininganditsapplicationinhashtables.

3. Describethestructureandworking ofahashtable.

4. Explain linear probing and its drawbacks. How can these drawbacks
beovercomewithquadratic probing?

5. Comparetheeffectivenessoflinearprobingandquadraticprobinginopenaddr
essing. Andexplainthedrawbackofquadraticprobing.
Unit8:[Graph]

MultipleChoiceQuestions(MCQs)–Minimum3Questions
1. Whatisanadjacencymatrixinthecontext ofsimplegraphs?
A) Amatrixrepresentingedgesbetweennodes
B) Amatrixrepresentingdistancesbetweennodes
C) Alist ofadjacentnodes
D) Alist ofnon-adjacent nodes
Answer:A

2. InBFS, whichdatastructureiscommonlyused?
A) Stack
B) Queue
C) Heap
D) Tree
Answer:B

3. InDFS, whichdatastructureiscommonlyused?
A) Stack
B) Queue
C) Heap
D) Tree
Answer:A

FillintheBlanks –Minimum3Questions
1. The representation of a graph uses a two-dimensional array to
representedges.
Answer:Matrix

2. The of a graph refers to the number of edges connected to a

vertex.Answer:degree

3. Agraph is saidtobe ifitcontainsatleastonecycle.

Answer:cyclic

1- MarkQuestions–Minimum5Questions
1. Whatisagraph?
A graph is a collection of vertices (or nodes) and edges (or arcs) that
connectpairsofvertices,
representingrelationshipsorconnectionsbetweenthem.
2. Whatistheadjacencylistrepresentationofagraph?
Theadjacencylistrepresentationofagraphusesliststostoretheneighboringverticesfor
eachvertex.

3. WhatisthedifferencebetweenBFSandDFS?
BFS explores all vertices at the present level before moving to the next, while
DFSexploresasfaraspossiblealongeach branchbeforebacktracking.

4. Whatisanundirectedgraph?
An undirected graph is a graph where the edges have no direction, meaning
theconnectionbetweenanytwovertices is bidirectional.

5. Defineadirectedgraph.
A directed graph is a graph where edges have a direction, indicating
therelationshipgoes fromone vertex toanother inaspecific order.

2- MarksQuestions–Minimum5Questions
1. Whatistheadjacencymatrixrepresentationofagraph?

2. ExplainthedifferencebetweenBFSandDFStraversalmethods.

3. Defineandgive anexampleofacompletegraph.
Whatisthedifferencebetweenasparsegraphandadensegraph?

4. Describehowtorepresentagraphusinganadjacencymatrix.

3- MarksQuestions–Minimum4Questions

1. ExplaintheprocessofDepthFirstSearch(DFS)traversal.

2. WhatisBreadthFirstSearch(BFS),andhowdoesitwork?

3. Compareadjacencylistandadjacencymatrixrepresentationsofgraphs.

4. Describeelementarygraphoperationslikeadding/removingavertexoranedge.

4- MarksQuestions–Minimum5Questions

1. Explainweightedanddirectedgraphswiththehelpofexamples.

2. Whatisthemeaningoftraversal?Explaingraphtraversals

3. Define the following terms in the context of graph theory: vertex, edge, path
anddegree?

4. Giveanexampleofhowtouseanadjacencylisttorepresentaweightedgraph.
5. Discussthreereal-
worldapplicationsofgraphtheoryandhowtheyareimplementedindifferentf
ields.

6-MarksQuestions–Minimum5Questions
1. ExplainindetailtheworkingofBreadthFirstSearch(BFS)withanexample.

2. DiscussDepthFirstSearch(DFS)algorithmwithitsrecursiveimplementation.

3. Compare and contrast adjacency list and adjacency matrix representations

ofgraphs.

4. Explainelementarygraphoperations(adding/removingverticesandedges)withexa
mples.

5. Explain how graph theory is utilized in route optimization for

transportationnetworks. What algorithms are commonly used to find the
shortest path in suchgraphs?