dsa mid term paper

• News & Events
• Current Students
• Prospective Students
• Faculty Candidates
• Industry Affiliates
• Support CSE

CSE 373 Data Structures and Algorithms, Summer 2015

This page contains topic lists for the exams and links to exams from previous quarters. Previous offerings of the course may have covered somewhat different topics, and the order may not have been quite the same. In previous quarters, there have been two midterms. Only pay attention to questions that cover material on the topics we have discussed in lecture.

In addition to old exams, you will want to review homework exercises, try additional problems from the textbook, and review lecture material.

All exams will be closed book and closed notes, and you will not be allowed to use calculators or other electronic devices.

Topics Covered

The midterm covers all the course material up through priority queues and heaps (all lectures up to and including July 10th). Topics include stacks, queues, induction, asymptotic analysis, dictionaries, binary trees, binary search trees, AVL trees, priority queues, and heaps.

Sample Midterms

• Midterm 1 From Fall 2013:   unsolved   solved
• Midterm 1 From Fall 2012:   unsolved   solved
• Midterm 1 From Winter 2012:   unsolved   solved
• Midterm 1 From Fall 2011:   unsolved   solved
• Midterm 1 From Fall 2010:   unsolved   solved
• Midterm 1 From Spring 2010:   unsolved   solved

The final exam is cumulative but more weight will be given to topics covered since the midterm. Note that our final will be 60 minutes long, while previous midterms were 50 minutes and previous finals were 2 hours, so the length will be different than previous exams. So, review all topics covered in lecture or homework assignments except a few topics clearly marked as optional (notably AVL deletion and the details of the proof for the lower bound for comparison sorting).

For advanced topics like dynamic programming, backtracking, p vs. np, np-completeness, you DO need to know the BASIC ideas about how they work. I will not ask you to write any code or do any proofs on these topics, but you SHOULD understand the main idea behind how they work.

Sample Exams

Our exam will consist of various types of short-answer questions. You may be asked to write or read Java code or pseudocode. It will be similar in style to the midterm.

Because our final exam is cumulative and the summer quarter is shorter, it makes sense to provide questions from old midterm exams. Note that we did not study B trees , leftist heaps , or skew heaps .

• Midterm 2 From Fall 2013:   unsolved   solved
• Midterm 2 From Fall 2012:   unsolved   solved
• Midterm 2 From Winter 2012:   unsolved   solved
• Midterm 2 From Fall 2011:   unsolved   solved
• Midterm 2 From Fall 2010:   unsolved   solved
• Midterm 2 From Spring 2010:   unsolved   solved
• From Fall 2013:   unsolved   solved

Some additional questions   unsolved   solved

• Calendar: Slides, Readings
• Assignments
• Grading Guidelines
• Academic Integrity
• Discussion Board
• Assignment Dropbox
• Mail List
• Installing Java from CSE 142
• Eclipse Tutorial
• Programming Lab Info
• Java Links from CSE 143

Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX

UW Privacy Policy and UW Site Use Agreement

Data structure and algorithm past paper

Data structure and algorithm all previous/ past question papers.

-Data structure and algorithm – Computer Science all subject past paper  Data structure and algorithm- Data structure and algorithm Project idea -Data structure and algorithm MCQ -Data structure and algorithm Interview Question  – Computer Science all courses -Technology – University Past Paper -Programming language – Question paper – old paper

Data structure and algorithm Final in 2021

Mid term Exam Data structure and algorithm paper in 2021

Data structure and algorithm

Write a program to convert an infix expression that includes (,), +,-,*and / to postfix and apply it on the following expressions.

• p+q*r+(s*t)

What do you know about stack? Describe the purpose of each of the following stack operations

• Push (), Pop (), Peek (), Isfull () and Isempty ()
• Convert a*(b*c) + (d*e) into its postfix form using stack operations

Let’s suppose if a queue is filled at a Rear end and there is an empty space at Front end then how can one insert new element into the queue? What do you know about queuing theory? How priority queue is better than double ended queue?

How link list is better than array? Compare the pros and cons of array and link list.

Data structure and algorithm Sessional I in 2020

Data structure and algorithm final in  2020, data structure and algorithm sessional ii in 2019.

Q1: Write a program to convert an infix expression that includes (.)- *and la positia on the following expressions.

P+q*r+(s*t)

Q2: What do you know about stack? Describe the purpose of each of the following stack operations (I) Push () (II) Pop () (III) Peek () (iv) Isfull ( ) (v) Isempty () (in Convert a* (b*e) + (d*e) into its postfix form using stack operations.

Q3: Lets suppose if a queue is tilled at Rear end and there is an empty space at Front end then how can one insert new element into the queue? What do you know about queuing theory? How priority queue ? better than double ended queue?

Q3: How Tint list is better than Array? Compare the pros and cons of array and link list.

#Data structure and algorithm # Computer Science all subject past paper   #Data structure and algorithm- #Data structure and algorithm Project idea #Data structure and algorithm MCQ #Data structure and algorithm Interview Question  # Computer Science all courses #Technology # University Past Paper #Programming language # Question paper # old paper

Important Pages

© Copyright Cuitutorial All Rights Reserved

R13 - I Mid - Term Examinations, September - 2014 

R13 - ii mid - term examinations, november - 2014 .

• Data Science
• Trending Now
• Data Structures
• System Design
• Foundational Courses
• Practice Problem
• Machine Learning
• Data Science Using Python
• Web Development
• Web Browser
• Design Patterns
• Software Development
• Product Management
• Programming

Top 50 Data Structures MCQs with Answers

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

Insertion Sort

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS 2002)

log(2*n) -1

Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best known algorithm to delete the node Q from the list?

What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order ?

Consider the following conditions:

 (a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints. 

(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns. 

(c)All the positive allocations must be in independent positions. 

The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies: Codes:

(a) and (b) only

(a) and (c) only

(b) and (c) only

(a), (b) and (c)

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.
• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.
• Both of the above
• None of the above
• Managing function calls
• The stock span problem
• Arithmetic expression evaluation
• All of the above

Question 10

There are 50 questions to complete.

Get the Reddit app

Welcome to the **[National University of Singapore](http://www.nus.edu.sg/)** subreddit! Put the word out for any redditors you know out there. Posts should be related to NUS. Exchange students/visitors are more than welcome! Any suggestions or feedback for information to go onto the sidebar are welcome as well! --- **Good to Know** * **[NUS Calendar of Events](https://myaces.nus.edu.sg/CoE/)** * [NUS EZLink Concession Information](http://

DSA1101 Midterm Exam

Good day to all, does anyone know if there are past year papers for DSA1101 midterm exams? I went to the past year paper depository and there are only final exam papers :( Really appreciate if someone could share some past year papers for practice!

By continuing, you agree to our User Agreement and acknowledge that you understand the Privacy Policy .

Enter the 6-digit code from your authenticator app

You’ve set up two-factor authentication for this account.

Enter a 6-digit backup code

Create your username and password.

Reddit is anonymous, so your username is what you’ll go by here. Choose wisely—because once you get a name, you can’t change it.

Reset your password

Enter your email address or username and we’ll send you a link to reset your password

Check your inbox

An email with a link to reset your password was sent to the email address associated with your account

Choose a Reddit account to continue

Provide details on what you need help with along with a budget and time limit. Questions are posted anonymously and can be made 100% private.

Studypool matches you to the best tutor to help you with your question. Our tutors are highly qualified and vetted.

Your matched tutor provides personalized help according to your question details. Payment is made only after you have completed your 1-on-1 session and are satisfied with your session.

• Homework Q&A
• Become a Tutor

All Subjects

Mathematics

Programming

Health & Medical

Engineering

Computer Science

Foreign Languages

Access over 35 million academic & study documents

Dsa mid term question paper.

Sign up to view the full document!

24/7 Study Help

Stuck on a study question? Our verified tutors can answer all questions, from basic  math  to advanced rocket science !

Similar Documents

working on a study question?

Studypool is powered by Microtutoring TM

Copyright © 2024. Studypool Inc.

Studypool is not sponsored or endorsed by any college or university.

Ongoing Conversations

Access over 35 million study documents through the notebank

Get on-demand Q&A study help from verified tutors

Read 1000s of rich book guides covering popular titles

Sign up with Google

Sign up with Facebook

Already have an account? Login

Login with Google

Login with Facebook

Don't have an account? Sign Up