Scribd
Upload
45 views2 pages

Fundamental Algorithm

The document is an examination paper for a computer science course titled 'Fundamentals of Algorithms' at Sir Isaac Newton Arts & Science College. It includes multiple-choice questions, fill-in-the-blank questions, and detailed questions on topics such as algorithms, pseudo code, sorting methods, and graph traversals. The exam is scheduled for November 9, 2024, and consists of various parts requiring answers to both theoretical and practical aspects of algorithms.

Uploaded by

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

Fundamental Algorithm

The document is an examination paper for a computer science course titled 'Fundamentals of Algorithms' at Sir Isaac Newton Arts & Science College. It includes multiple-choice questions, fill-in-the-blank questions, and detailed questions on topics such as algorithms, pseudo code, sorting methods, and graph traversals. The exam is scheduled for November 9, 2024, and consists of various parts requiring answers to both theoretical and practical aspects of algorithms.

Uploaded by

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

(C) (Answer ALL the Questions) (5x2=10)

1. What is algorithms?
2. Define the pseudo code.
SIR ISSAC NEWTON ARTS & SCIENCE COLLEGE
DEPARTMENT OF COMPUTER SCIENCE 3. What is heap sort?
MODEL EXAMINATION – ODD SEMESTER (NOV 2024) 4. What is the merge sort ?
Exam Date:09.11.2024 Class: III-CS 5. Define the graph traversals.
Subject Name: fundamentals of algorithms Marks: 75
Subject Code: 22SCCCS5 PART – B (Answer ALL the Questions) 5 X 5 = 25
PART – A (Answer ALL the Questions)
(A) Multiple Choice Questions (5x1=5) 1. (a) Explain the space and time complexity
(OR)
1.This characteristic often draws the line between what is feasible and what is (b)Explain the spanning tree.
impossible.
2. (a) Describe the priority queues
a) Performanceb) System Evaluationc) Modularityd) Reliability
or
(b)Explain binary search
2.In computer science, algorithm refers to a special method usable by a computer for
the solution to a problem. 3. (a) Explain about randomized algorithms
a) Trueb) False Or
(b)finding minimum and maximum
3.The time that depends on the input: an already sorted sequence that is easier to sort.
4. (a) Explain aboutheap sort and quick sort
a) Processb) Evaluationc) Runningd) Input or
(b)Explain performance analysis
4.Which of the following is incorrect?Algorithms can be represented:
a) as pseudo codesb) as syntaxc) as programsd) as flowcharts 5. (a) what is connected networks?
or
5.When an algorithm is written in the form of a programming language, it becomes a (b) Explain optimal merge patterns
_________
PART – C (Answer any THREE Questions) 3 X 10 = 30
a) Flowchartb) Programc) Pseudo coded) Syntax
1. Explain about asymptotic notation.
(B) Fill in the blanks (5x1=5) 2. Explain about topological sort and critical path.
1. A system wherein items are added from one and removed from the other 3. Birefly about priority queue.
end_______. 4. Explain the general greedy method.
5. Explain about 8-queue problem
2. Which of the following algorithms are used to find the shortest path from a
source node to all other nodes in a weighted graph_______?
3. What is the time complexity of the binary search algorithm________?
4. Which of the following is a Divide and Conquer algorithm______?

5. Worst-case time complexity to access an element in a BST can be_____?

You might also like