Data Structures and Algorithms (Some Questions for You) - Tirthankar Pal - MBA from IIT Kharagpur, GATE, GMAT, IIT Written Test, Interview were a part of MBA Entrance, B.S. in Computer Science from NIELIT

Write an algorithm to find a substring in a given string. 

With the help of an example, explain how a binary tree can be represented using an array.

How can you reverse a string using stack? Give one example and show how you can reverse a given string using stack.

Write a recursive algorithm for pre-order traversal in a binary tree.

Illustrate the result of each operation in the sequence PUSH(S,4), PUSH(S,1), PUSH(S,3), POP(S), PUSH(S,8) and POP(S) on an initially empty stack S stored in array S[1..6]

Write an algorithm to insert an element into a binary search tree.

Convert the following infix expression into prefix expression (A-B/C) * (D*E-F)

Write an algorithm to evaluate a postfix expression

In a complete binary tree of depth d (complete including last level), give an expression to find the number of leaf nodes in the binary tree.

Given five memory partitions of 300Kb, 700Kb, 400Kb, 500Kb, 800Kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 412 Kb, 617 Kb, 112 Kb, and 626 Kb (in order)?

Using the selection sort algorithm, sort the input file [25, 7, 46, 11, 85].

Suppose an array contains elements {10, 13, 21, 32, 35, 44, 55}. Give the steps to find an element “35” using i) linear search ii) binary search.

Given input keys {1, 3, 23, 9, 4, 29, 19} and a hash function h(X) = X mod tablesize. The initial hash table contains 10 slots, with starting index 0. Show the resulting table after rehashing when the load factor= 0.5, using linear probing.

Write a recursive function to find the fibonacci series

Draw a circular doubly linked list. Give an advantage of a circular doubly linked list.

Check whether the following is true or not.

2n+1 is in O(2n). Give reason.

How will you represent a polynomial 3x2 +2xy2 +5y3 +7yz using singly linked list?

Explain the Big O asymptotic notation used for specifying the growth rate of functions.

Given a doubly linked list, write an algorithm that removes a node with a particular value from the list and inserts it in the front.

What is an algorithm? How is its complexity analysed?

What is the complexity of finding maximum and minimum value from an array of n values? Explain the steps of deriving complexity.

Give any three applications of linked list.

Let L1 be a singly linked list in memory. Write an algorithm

i) Finds the number of non zero elements in L1

ii) Adds a given value K to each element in L1

Tirthankar Pal

MBA from IIT Kharagpur with GATE, GMAT, IIT Kharagpur Written Test, and Interview
2 year PGDM (E-Business) from Welingkar, Mumbai
4 years of Bachelor of Science (Hons) in Computer Science from the National Institute of Electronics and Information Technology
Google and Hubspot Certification
Brain Bench Certification in C++, VC++, Data Structure and Project Management
10 years of Experience in Software Development out of that 6 years 8 months in Wipro
Selected in Six World Class UK Universities:-
King's College London, Durham University, University of Exeter, University of Sheffield, University of Newcastle, University of Leeds