[Link] [Link].
RRASE COLLEGE OF ENGINEERING RRASE COLLEGE OF ENGINEERING
MODEL EXAM MODEL EXAM
[Link]/Name:CS25CO4/DATA STRUCTURES AND [Link]/Name:CS25CO4/DATA STRUCTURES AND
ALGORITHMS ALGORITHMS
Year/Sem/Dept: I/II/EEE Duration: 3 hours Max. Marks: 100 Year/Sem/Dept: I/II/EEE Duration: 3 hours Max. Marks: 100
PART–A (10×1=10 marks) Answer ALL questions PART–A (10×1=10 marks) Answer ALL questions
[Link] python,what is the correct way to define a class?
[Link] python,what is the correct way to define a class?
A).define class className: B).class className():
A).define class className: B).class className():
C).class className: D).new class className:
C).class className: D).new class className:
[Link] of the following is NOT a characteristic of Object-Oriented
[Link] of the following is NOT a characteristic of Object-Oriented
programming?
programming?
A).Inheritance B).Encapsulation
A).Inheritance B).Encapsulation
C).procedural execution D).polymorphism
C).procedural execution D).polymorphism
[Link] is the time complexity of accessing an element at a specific index in an
[Link] is the time complexity of accessing an element at a specific index in an
array-based list
array-based list
implementation?
implementation?
A).O(1) B).O(log n) C).O(n) D).O(n2)
A).O(1) B).O(log n) C).O(n) D).O(n2)
[Link] is the primary characteristic of a stack ADT?
[Link] is the primary characteristic of a stack ADT?
A).First- In-First-Out(FIFO) B).Last –in-First-Out(LIFO)
A).First- In-First-Out(FIFO) B).Last –in-First-Out(LIFO)
C).Random access to elements D).Sorted elements
C).Random access to elements D).Sorted elements
[Link] a binary search tree,where would you find the smallest element?
[Link] a binary search tree,where would you find the smallest element?
A).At the root B).At the leftmost node
A).At the root B).At the leftmost node
C).At the rightmost node D).At the deepest level
C).At the rightmost node D).At the deepest level
[Link] is the recurrence relation for the time complexity of the binary search
[Link] is the recurrence relation for the time complexity of the binary search
algorithm?
algorithm?
A).T(n)=T(n/2)+0(1) B).T(n)=2T(n/2)+0(n)
A).T(n)=T(n/2)+0(1) B).T(n)=2T(n/2)+0(n)
C).T(n)=T(n-1)=0(1) D).T(n)=T(n/2)+T(n/2)+T(n/2)+0(1)
C).T(n)=T(n-1)=0(1) D).T(n)=T(n/2)+T(n/2)+T(n/2)+0(1)
[Link] of the following is NOT a common representation of a graph?
[Link] of the following is NOT a common representation of a graph?
A).Adjacency matrix B).Adjacency list
A).Adjacency matrix B).Adjacency list
C).Incidence matrix D).Binary tree
C).Incidence matrix D).Binary tree
[Link] algorithm is used to find the minimum spanning tree of a
[Link] algorithm is used to find the minimum spanning tree of a
connected,undirected graph?
connected,undirected graph?
A).Dijkstra’s algorithm B). Bellman-ford algorithm
A).Dijkstra’s algorithm B). Bellman-ford algorithm
C).kruskal’s algorithm D).Floyd-Warshall algorithm
C).kruskal’s algorithm D).Floyd-Warshall algorithm
[Link] sort is based on which algorithmic paradigm?
[Link] sort is based on which algorithmic paradigm?
A).Greedy algorithm B).Dynamic programming
A).Greedy algorithm B).Dynamic programming
C).Divide and conquer D).Backtracking
C).Divide and conquer D).Backtracking
[Link] of the followingis NOT an in-place sorting algorithm?
[Link] of the followingis NOT an in-place sorting algorithm?
A).Bubble sort B).Selection sort
A).Bubble sort B).Selection sort
C).Merge sort D).Quick sort
C).Merge sort D).Quick sort
PART–A(10×3=30 marks) Answer ALL questions PART–A(10×3=30 marks) Answer ALL questions
[Link] is an Abstract Data Type(ADT)? [Link] is an Abstract Data Type(ADT)?
[Link] is object-oriented programming (OOP)? [Link] is object-oriented programming (OOP)?
[Link] is the primary characteristic of a stack ADT? [Link] is the primary characteristic of a stack ADT?
[Link] is time complexity of inserting an element at the beginning of a singly [Link] is time complexity of inserting an element at the beginning of a singly
linked list? linked list?
[Link] is Tree Traversal? [Link] is Tree Traversal?
[Link] is a Binary Tree? [Link] is a Binary Tree?
[Link] is a Graph ADT? [Link] is a Graph ADT?
[Link] is a Greedy Algoritham? [Link] is a Greedy Algoritham?
[Link] Sorting Algorithms(Analysis) [Link] Sorting Algorithms(Analysis)
[Link] is Merge sort? [Link] is Merge sort?
PART–C(5×12=60 marks) Answer ALL questions PART–C(5×12=60 marks) Answer ALL questions
21.(A).Explain Abstract Data type (ADT) with Examples. 21.(A).Explain Abstract Data type (ADT) with Examples.
(OR) (OR)
(B).What is object oriented programming?explain its features. (B).What is object oriented programming?explain its features.
22.(A).Explain array based implimentation of Basic operation in 22.(A).Explain array based implimentation of Basic operation in
python. python.
(OR) (OR)
(B).Explain in linked list and its types with Diagram. (B).Explain in linked list and its types with Diagram.
23.(A).Define the introduction of Tree data structures with basic 23.(A).Define the introduction of Tree data structures with basic
terminology. terminology.
(OR) (OR)
(B).Explain Binary search Tree(BST) as Abstract Data type with (B).Explain Binary search Tree(BST) as Abstract Data type with
operations. operations.
24.(A).Explain the introduction to graph Data structure with basic 24.(A).Explain the introduction to graph Data structure with basic
teminology. teminology.
(OR) (OR)
(B).Explain graph traversal techniques:BFS and DFS with example. (B).Explain graph traversal techniques:BFS and DFS with example.
25.(A).Explain Bubble sort algarithm with example. 25.(A).Explain Bubble sort algarithm with example.
(OR) (OR)
(B).Selection sort algoritham with example. (B).Selection sort algoritham with example.