Page 76 - 1_8(1)

graph
solving.
Pakistan.
Elements
semi-groups.
of
theory,
KHUZDAR
UET
BALOCHISTAN
circles,
proof
Pakistan Studies 2 (2+0)
Discreate Structures 3 (3+0)
Geometric
techniques,
Third Semester
solids
techniques, advance graphics techniques.
basics
Objective Oriented Programming 4 (3+1)
of
Computer Aided Engineering Drawing 3 (0+3)
Constructing
counting,

Procedural versus object oriented programming languages, UML
discrete
triangles,
programming languages, object oriented design strategy and problem
line, arc tangent to two arcs, ellipses, parabolas, hyperbolas, spirals,
Problems. Multiview sketching, Dimension and projection, preparation
probability, propositional calculus, mathematical induction, recurrence
introduction to group theory, analysis and complexity of algorithms,
methods, introducing 3D drawing, Freehand sketing and visualization
Land of Pakistan: Land and people-strategic importance, natural
of assembly drawing, constructing 2D shapes, coordinate entry
from point , arc tangent to two lines, arc tangent to an arc and a
from a point to point, Arc tangent to an arc , arctangent to a line
Constructing polygon, Hexagons, Octagons, Pentagons, Parallel lines
Points and tangency, Line tangent to an arc, Arc tangent to a line
resources. A brief historical background of creation of Pakistan,
theory with application in grammar and languages, basic logic,
relation, loop invariants, relations, introduction to combinatorics,
Introduction to the role of the computer in engineering drawing,
Boolean algebra, functions with applications in coding theory; set
Operator Overloading, Recursion, Procedural versus object oriented
Data Abstraction, Inheritance and Composition, polymorphism,
inclusion-exclusion principle and binomial methods, counting and
partitions, pigeon hole principle, algebraic structures, group and
government and politics in Pakistan, languages and cultures of
drawing, Introduction, Angles, Triangles, Quadrilaterals, Polygons,
introduction of software tools (ie; auto CAD) for computer aided
power
Programming.
amplifiers,
Electronics 4 (3+1)
Diffrential Equations 3 (3+0)
Communication Skills 3 (3+0)
Software Engineerring 4 (3+1)
differential
Fourth Semester
Date Structure and Algorithms 4 (3+1)
binary search, depth first / breath first search).
amplifiers,
operational
amplifiers
and

01
applications.
of a function of two variables, examples illustrating application to computer engineering.
students interact with representatives from the Industry and get hands on practice and feedback.
This is an advanced course which is designed to equip students with professional skills of
technical report writing and communication skill in work place. The course provides intensive
Fundamental data structures, data types, abstract data types, user defined data types, algorithms
applications to small errors; differentiation of implicit functions; chain rule, maxima and minima
modeling, object oriented design strategy and problem solving, objects and classes, member
practice in developing technical reports/proposals according to the IEEE format. The course also
polymorphism, operator overloading, stream class, practical design through Object Oriented
focuses on the interview and presentation skills by arranging seminars and workshops where
functions, public and private members, dynamic memory management, constructors and
destructors, templates, object encapsulation, derived classes, class hierarchies, inheritance and
priority queues, tree, binary tree, binary search tree, traversals, threaded trees, heap, general
FET biasing, design of common source, common drain and common gate amplifiers. Hybrid
polish notation, recursion, towers of Hanoi, recursive implementation of stacks and queues,
stability. Design and analysis of common emitter, common base and common collector amplifiers.
sorting, insertion sort, selection sort, merge sort, radix sort), hashing, searching: (liner serach,
Introduction to diodes and their applications (rectifiers, clippers and clampers). BJT biasing, bias
trees, graphs, depth-first/breadth first traversal, adjacency matrix, shortest distance algorthams,
circular lists, two way lists, sequential (array) and linked implementation of stacks and queues,
equations. Systems of linear differential equations. Partial differentiation; functions of two or
and their complexity, time-space trade off, arrays, records and pointers, matrices, linked lists,
parameters, ac gain and frequency analysis of single/multistage amplifiers. Classes of amplifiers,
Introduction to Differential Equations, ODE of First order and first degree, ODEs of second and
higher orders. Complementary function and particular integral, Non-homogeneous linear differential
more variables; partial derivatives; higher order partial derivatives; total differentials and their