Scribd
Upload
9 views9 pages

Data Structure and Application (BCS304) Quiz 2024-2025: Thanks For Filling in

Dsa pdf

Uploaded by

abhinehalove71
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views9 pages

Data Structure and Application (BCS304) Quiz 2024-2025: Thanks For Filling in

Dsa pdf

Uploaded by

abhinehalove71
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Data Structure and Application(BCS304) Quiz 2024-2025

1 message

Google Forms <[email protected]> Tue, Dec 24, 2024 at 12:09 PM


To: [email protected]

Thanks for filling in Data Structure and Application(BCS304) Quiz


2024-2025
Here's what was received.

Data Structure and Application(BCS304)


Quiz 2024-2025
Your email address ([email protected]) was recorded when you submitted this
form.

Which of the following is the Value at Address operator?

&

-->

Which of the following header files must necessarily be included to use dynamic
memory allocation functions?

stdlib.h

stdio.h

memory.h
dos.h

Which statement correctly defines a structure named "Person" with members


"name" and "age" of type char* and int respectively?

struct Person { char* name; int age; }

struct Person { name, age; }

struct { name; age; } Person;

struct { char* name, int age; } Person;

What is the value of the postfix expression 6 3 2 4 + – *?

40

74

-18

A normal queue, if implemented using an array of size MAX_SIZE, gets full when?

Front = rear + 1

Front = (rear + 1)mod MAX_SIZE

Rear = MAX_SIZE – 1

Rear = front

A Queue follows __________

Ordered array

FIFO (First In First Out) principle

Linear tree

LIFO (Last In First Out) principle


What does the following function do in a Singly Linked List?

node* FUNCT(node* START, char data){

node* NEW;

NEW = (node*)malloc(sizeof(node));

NEW --> info = data;

NEW --> link = START;

START = NEW;

return START;

Traversal

Insertion after a Node

Insertion at the End

Insertion at the Beginning


What is the logic followed to implement Insertion and Deletion operation in Linked
Queues?

Front Insertion & Front Deletion

Front Insertion & Back Deletion

Back Insertion & Front Deletion

Back Insertion & Back Deletion

What does the following function do in a Doubly Linked List?

node* FUNCT(node *start, int


data){

node *new, *temp;

new = (node *)malloc(sizeof(node));

new -> info = data;

new -> llink = NULL;

new -> rlink = NULL;

temp = start;
while(temp -> rlink
!= NULL)

temp = temp -> rlink;

temp
-> rlink = new;

new->
llink = temp;

return
start;

Front Insertion

Front Deletion

Back Insertion

Back Deletion

Which of the following is false about a doubly linked list?

We can navigate in both the directions

It requires more space than a singly linked list

The insertion and deletion of a node take a bit longer

Implementing a doubly linked list is easier than singly linked list


The maximum number of nodes in a
binary tree of depth K is _______________

2^K – 1

2^(K-1)

2^K+1

2^K

What operation on a Binary Tree does the following code represent?

void FUNCT( treepointer *ptr){

if(ptr != NULL){

FUNCT(ptr ->leftchild);

FUNCT(ptr ->rightchild);

printf(“%d”, ptr
->data);

INORDER TRAVERSAL
PREORDER TRAVERSAL

POSTORDER TRAVERSAL

LEVEL ORDER TRAVERSAL

What is the speciality about the Inorder traversal of a binary search tree?

It traverses in a non increasing order

It traverses in an increasing order

It traverses in a random fashion

It traverses based on priority of the node

Construct a binary tree by using Postorder and Inorder sequences given below.
Inorder: N, M, P, O, Q
Postorder: N, P, Q, O, M

Option 1 Option 2

Option 3 Option 4
The maximum number of edges in any n-vertex
Directed Graph
is _____________________

n(n-1)

n(n-1)/2

(n-1)/2

n(n-1)(n-2)

What data structure is used to perform DFS on a graph?

Queue

Stack

Heap

Array

What is the hash function used in the division method?

h(k) = k/m

h(k) = k mod m

h(k) = m/k

h(k) = m mod k

Which scheme uses a randomization approach?

hashing by division

hashing by multiplication

universal hashing

open addressing
With what data structure can a priority queue be implemented?

Array

List

Heap

Tree

Which of the following is not an application of priority queue?

Huffman codes

Interrupt handling in operating system

Undo operation in text editors

Bayesian spam filter

Create your own Google Form


Does this form look suspicious? Report

You might also like