cezadr, Blm 70(4) 2. cmle. Herhangi bir sre
boyunca servisin tutuldu gzaltnda tarafndan bir
kamu yetkilisi, bylece seilmiti. (3) Eer cezadr,
ask, blm 56a ve blmler 56c, 56e, mutatis
mutandis uygulanacaktr. alma sresi, uzun bir
sre hapis cezasna veya barko
UMAER BASHA INSTITUTE OF TECHNOLOGY(UBIT)
DEPRTMENT OF COMPUTER SCIENCE
ASSIGNMENT 1
NAME:
UNSA JAWAID
CLASS:
BSCS-II
SEAT NO:
B12101135
SUBJECT:
OBJECT ORIENTED
PROGRAMMING
COURSE CODE: 413
LECTURER:
MS. SHAISTA RAIS
OBJECT : WRITE A
PROGRAM
TO ASSIGN VA
CSE317 Design & Analysis of Algorithms
Problem Set #8
Spring16
Divide & Conquer, Weighted Interval Scheduling
1. You are a given a unimodal array of n distinct elements, meaning that its entries
are in increasing order up until its maximum element, after
CSE317 Design & Analysis of Algorithms
Spring16
Problem Set #10
Network Flows
1. Following figure shows a flow network on which an s-t flow has been computed. The
capacity of each edge appears as a label next to the edge, and the numbers in boxes
give the
CSE317 Design & Analysis of Algorithms
Quiz 1 Spring16
Max Marks: 10
Time Allowed: 10 minutes
Answer the questions in the spaces provided on the question sheets.
Name:
ERP:
1. [4 marks] For each pair of expressions (A, B) below, indicate whether A is O, ,
CSE317 Design & Analysis of Algorithms
Spring16
Problem Set #3
Breadth/Depth First Search
1. For the following graph G:
(a) Draw an adjacency list representation and an adjacency matrix representation
of the graph G.
(b) Report the order of the vertices e
CSE317 Design & Analysis of Algorithms
Problem Set #5
Spring16
Topological Ordering, Greedy Algorithms
1. Run the topological ordering algorithm on the following graph. Whenever you have
a choice of vertices to explore, always pick the one that is alphabe
CSE317 Design & Analysis of Algorithms
Spring16
Problem Set #2
Asymptotic Analysis
1. For each pair of expressions T (n) and f (n) below, indicate whether T (n) is O, , or
of f (n).
2. For each of the following functions f find a simple function g such t
CSE317 Design & Analysis of Algorithms
Spring16
Problem Set #6
Shortness Paths, Minimizing Lateness
1. Shortest path in a grid. Given an N -by-N matrix of positive integers, find the shortest
path from the (0, 0) entry to the (N 1, N 1) entry, where the l
CSE317 Design & Analysis of Algorithms
Spring16
Problem Set #4
Connectivity in Graphs
1. In an undirected graph, the degree deg(u) of a vertex u is the number of neighbors
u has, or equivalently, the number of edges incident upon it. In a directed graph,
CSE317 Design & Analysis of Algorithms
Spring16
Problem Set #7
Minimum Spanning Trees
1. Suppose we want to find the minimum spanning tree (MST) of the following graph.
(a) Run Prims algorithm; whenever there is a choice of nodes, always use alphabetic
or