JB INSTITUTE OF TECHNOLOGY - JBIT - Best …: Handbook of B.Tech- CSE _III Sem 1 JB INSTITUTE OF TECHNOLOGY Approved by AICTE, Ministry of HRD, Govt. of India, Affiliated to Uttarakhand

JBIT:: Handbook of B.Tech- CSE _III Sem 1

JB INSTITUTE OF TECHNOLOGY Approved by AICTE, Ministry of HRD, Govt. of India, Affiliated to Uttarakhand Technical University

Campus: NH-72, Village Shankarpur, Chakrata Road, Dehradun (UK) Tel.: 0135-269880, 2698896

E-mail: [email protected] Website: www.jbitdoon.com

FOR B.TECH[CSE] –III SEM

Student Hand Book

http://www.jbitdoon.com/


JB INSTITUTE OF TECHNOLOGY (Master Academic Policy-Part 1 :: Release Ref No :: December/12 :: Dated 20/12/12 )

[W.e.f.: - 01/01/2013]

Academic Policy for Internal Marks, Theory & Lab Assessments,

Attendance, Projects etc:

[Clarification: All Academic rules will be strictly adhered to as per guidelines of the latest Ordinances of

Uttrakhand Technical University, In case any mismatch is observed under any clause, rules of Uttrakhand

Technical University will be final and binding to all.]

Clause (1): Internal Marks Policy: Internal marks in all Theory courses will be allotted on following

basis:- All internal marks for all theory exams first will be awarded out of 100. [Marks Out of 100 will be

awarded as follows:]

Component Total Number

in a Semester

% Marks per

component

Total % Marks

1) Attendance Above 75% 20%

2) Continuous Assessments 5 4 20%

3) Sessional Exams 2 30 60%

Grand Total 100

Appropriate scaling of marks obtained out of 100 will be done according to the corresponding study and

evaluation scheme:-

Clause (2): Attendance Marks: [20 out of 100]

Attendance Policy:

a) No Financial Fine/Penalty etc will be imposed on any student because of attendance issue at any stage.

b) It is necessary for a student to maintain at least 75% attendance in each theory and practical subject to be eligible for sitting in the internal exams/university exams.

c) Students will be debarred based on their attendance in individual Theory/Practical subject.

[Clarification- In case student is having above or equal to 75% in some subjects and less

than 75% in some subjects, he/she will be debarred only from those subjects where

attendance is less than 75%.]

d) There is no provision to consider approved leaves in calculating attendance percentage. Attendance percentage will not increase due to any kind of approved/unapproved leaves. Prior information is totally a personal issue between the student and the authority to whom he/she is informing. In case some student is informing to some authority verbal or in writing about his/her absence that will be considered as ABSENT with prior information. In no circumstances it may be considered as PRESENT.


e) Relaxations: Students in some cases may be given relaxation upto 15% in attendance requirement (by the Director) in the circumstances that were beyond the control of the Students e.g. Medical problems, Natural Disasters at home town of national etc.

f) Balance of 25% of attendance is left to the use of students unforeseen requirements, attending ceremonies at home/

g) Calculation of Attendance Duration:

1) To be eligible for First Internal Exam: From First day of Teaching of starting of the semester to last teaching days before the date of First paper of First Internal Exam.

2) To be eligible for Second Internal Exam: Attendance from first day of teaching after the First Sessional exams to last teaching days before the First paper of Second Internal Exam.

3) To be eligible for University Exam and awarding marks of attendance component: From First day of Teaching of starting of the semester to last teaching day.

[Clarification- Make up classes for Short attendance students]

For those students who are not able to maintain 75% till last teaching day, Extra make up classes

will be arranged during preparation leaves etc so that students able to achieve 75% attendance

to fulfill the university attendance criterion.

Students who will not be able to obtain 75% attendance even after make up classes will be debarred from

the university exam. Students are advised to maintain their 75% attendance till last teaching day so that

preparation leaves/holidays may be used by them for self preparation.

Clause (3) Policy regarding missing classes due to preparation of technical festivals,

sports week, cultural festivals etc

Student who are helping the institute in preparing the above activities may be granted permission to

miss the classes maximum up to 6 teaching days in a semester subject to following conditions:

1) Their names are approved in advance by the competent authority.

2) They are actively participating in organization of such activities. Students those who are participating in such event in some other institutes on behalf of the institute may

also be granted permission to miss the classes maximum up to 6 teaching days subject to following

conditions:

3) Their names were approved by the competent authority well in advance.

4) They have submitted the proof of participating in such events. Attendance calculation for such students will be done after excluding their granted days from total

attendance days. This rectification will be made only at end of the semester.

Clause (4): Continuous Assessment Marks: (Based on Assignments)


a) Continuous Assessment refers to the assessment of the student based on class test & the assignments submitted by him/her through out the semester.

b) Total 5 Tests Based Assignments (i.e. one TBA per 5th portion of the syllabus) to be given to the

students in a semester. Every Assignment will be of 4 marks and thus total 4 * 5 = 20% Marks out of

100 will be for such class test/assignments.

c) Following are the guidelines for assignments, their evaluation and their secured accumulation

1. Assignment means a set of work, tasks and/or numerical problems to be given to the student, based on topics recently covered in the class as homework to be solved and submitted, before a specified date. Each assignment should require 4 – 6 hours of written work to be done by the student. The Date of Submission (DOS) will be announced on the Date of Allotment (DOA) to the student.

2. The assignment is to be submitted on or before the DOS as announced to faculty.No late submissions should be accepted.

3. TBA: The evaluation of an assignment will be done by faulty through a (TBA) test based on the assignment. The following process must be adopted for the purpose:

(a) On DOS, students will submit the assignment; faculty will randomly decide one question without telling to the students. He/She will check only that question in all assignments and will identify the students that have copied the assignments.

(b) Faculty member will clearly mention on assignment “COPIED” or “NOT COPIED”.

(c) On the DOT a test is to be conducted by the faculty member for all that have “NOT COPIED” as below:

(d) Prepare a test paper with at least three questions based on the assignment, with similar but not the same problems.

(e) Collect the TBA Sheets from HOD having following format.

(f) Write three questions on board, and allot any one question to the student, ensure that two consecutive student should not get similar question.

JBIT, Dehradun: TBA: Test Based Assignment No…….

Faculty………………………. Department……………….. School……………….

Subject Code……………….. Subject Name……………. TBA No……………..

DOA…………………………. DOS………………………. DOT…………………

Note: - Attempt only one question that is ticked in your sheet:

Question No (1)

Question No (2)

Question No (3)

-------------------------------------------------------------------------------------------------------------------------------------


The test has to be administered in the last 15 or 20 minutes of the class. Give student just sufficient

time to solve the problem assuming that they have done the assignment at home.

4. The evaluated assignments/tests are to be shown to the student and are to be retained by the instructor. All tests/assignments should be retained till the final Internal Marks are displayed to the students. These may be discarded afterwards. This is to permit randomly checking by designated authority at any instance.

5. This procedure is to be announced and explained to the students in the very first class. The importance of TIMELY SUBMISSION of assignments and NOT COPYING should be explained.

6. Copying of the assignment is an example of academic dishonesty for which student must be awarded

ZERO and should not be allowed to appear in TBA.

Clause (5): Proposed Master Pedagogy for Assignments: Assignments must be given to the

students and evaluated as per following pedagogy:-

TBA DOA DOS DOT

1 First Teaching day of the

second week of actual

teaching in that class.

First Teaching day of the

third week of actual


Last Teaching day of the

third week of actual



fourth week of actual



fifth week of actual



fifth week of actual



sixth week of actual



seventh week of actual



seventh week of actual



eight week of actual



ninth week of actual









tenth week of actual



tenth week of actual


DOA – Date of allotment of the assignment to students is to be decided by the faculty member within specified week. Date of Allotment of the Assignment means when one hard copy of the assignment has been given to the CR and receiving has been taken from the CR.

DOS – Date of Submission means the date on which assignment must be submitted by the student to the Faculty members.

DOT- Date of Test means the date on which faculty member is supposed to take the Test Based on the Assignment.

Specific dates are flexible and are to be decided by the respective faculty member.


Once decided, these dates must be mentioned by the respective faculty member in course file on timely basis well in advance. No deviation is permitted afterwards for any student without written permission of the HOD.

In case any student is absent on the DOT, he/she must be awarded as ZERO.

Student‟s failed to submit the assignment by DOS must be awarded ZERO.

.

Clause (6) Sessional Exams:

a) Two internal exams will be conducted by the Institute during the dates mentioned in academic

calendar. Weightage of Internal Exams will be 60% of Total Internal Marks allotted for that subject. If

internal marks in a subject is 50 & external marks is 100 in the theory, then out of 50 internal marks

(50*60%)=30 marks will be for internal Theory(divided as 15+15 for two internal test).

b) All internal exams will be third party test that means HOD has right to change the question

paper at any stage:-

i) Syllabus for specific internal exam will be specified at beginning of the semester.

ii) Ensuring Completion of that portion of the syllabus will be the responsibility of respective faculty

member, HOD and students. Extra lectures may be requested well in advance on off days in case

syllabus is lagging behind.

iii) Question papers for internal exams will usually not be set by the faculty member teaching

that subject in that class.

iv) Evaluation for internal exams will be centralized, within institute premises and time bound during

the dates specified in the academic calendar for so.

v) Scrutiny for the internal exams sheets is mandatory for the students. Students will verify the marks

and sign mentioning “SEEN” on the award sheet.

vi) Student that will miss any internal exam due to any reason will not get any chance to appear in

any kind of Make up Exams etc.

Students must understand that it is necessary to appear and pass in both internal

exams as per university rules.

Clause (7): Laboratory Assessments

(a) Internal Marks for Laboratories: Internal marks in all practical labs (except projects) will be allotted

on following basis:

All internal marks for all practical exams first will be awarded out on 100. Appropriate scaling of marks

obtained out of 100 will be done according to the corresponding study and evaluation schemes: [Marks

Out of 100 will be awarded as follows:]

At least 5 experiments will be considered for internal assessment. For each experiment faculty is

supposed to award marks based on following components:


At last of the semester average of these 5 assessments will be internal marks for practical subject.

[Clarification] In case some student is absent on the day of assessment, he/she must be awarded

ZERO for that practical. Moreover faculty is not bound to inform about the date of assessment in

practical lab. Students must attend all labs as assessment will be in almost in all labs. No makeup

can be arranged for lab assessments irrespective of the reasons/excuses.

(c) Following are the guidelines for the conduct and evaluation of practical in all courses with laboratory

components:

1. A practical is where a student is taken to a laboratory and is asked to perform a set of task on the given computer, equipment or on a setup comprising of devices or components. This includes on-the-spot conduct of an activity to derive desired results and to report the findings.

2. A student will have to maintain record of the performance done in the lab in the lab notebook as prescribed by the Institute/Department.

3. The lab notebook should be maintained in the format of a lab journal, where (in general) the aim of the experiment, the observations, calculations, results ad discussions are reported. These should not have any description like „method‟ etc, unless the method itself is the aim of the experiment.

4. Error analysis forms an essential part of the lab journal.

5. A student will be evaluated on every experiment/lab performed. The components of practical assessment as prescribed above are to be pre-defined, notified to the student and are to be strictly adhered to.

6. This policy is to be duly announced and explained to the students in the very first lab where the importance of timely submission of lab reports must be emphasized. The students are also to be informed about secure retention of Lab Records till last etc.

7. However no marks will be awarded in practical based on attendance, yet student is required to maintain at least 75% attendance in each practical lab to be eligible for external assessment of the practical. Moreover student must understand that assessment in going in each lab, absence means award of ZERO for the lab assessment on that day.

Clause (8) Evaluation of Projects:

(a) Internal Evaluation of projects where the duration is one or more semesters will be governed

by following policy:-

In each semester of a project there shall be three formal evaluations by a group of three

examiners selected from a panel of examiners constituted by the HOD for the purpose. As far as

possible, the set of examiners for each evaluation should be different

1. Each panel will consist of at least three persons (examiners).

Component % 100

Conduct/Performance/Execution 50

Written Record

a. Observations b. Analysis c. Error Analysis d. Results and Discussions

20

Viva – Voce 30


2. The following shall be the break-up of weightage amongst the evaluations:

First evaluation (during 3rd

week) 20%

Second evaluation (during 7thth week) 30%

Final Evaluation(during 10th week) 50%

3. In each of these evaluations, each examiner will allot marks independently on the following components:

4. The record of marks allotted by each examiner on each component to for each student will be maintained (with signatures of each examiner). A photocopy of the same will be deposited with the HoD, and the original retained by the teacher-in-charge of the course.

5. These original records are to be submitted with the final award list of internal assessment at the end of the Semester.

Each student will prepare an allotted topic, submit a write-up along with project work, and make a

presentation in the class of about 6 minutes, to be followed by about 3 minutes of questions and

answers. The topics and dates of presentation should be assigned right in the beginning of a

semester. It is also mandatory to maintain at least 75% attendance in project labs to be eligible for

external assessment.

Clause (9) Evaluation of General Proficiency & Discipline Marks:

Students will be awarded marks in General Proficiency and Discipline by the departments based on

following parameters:

1) His/Her attendance during the Department level activities as mentioned in the academic calendar. [5 Point per event]

2) His/Her attendance during the Department wise National Level Technical/Management Festivals. [10 Point per event]

3) His/Her participation in Department level activities as mentioned in academic calendar. [20 Point per event]

4) His/Her participation in the Department wise National Level Technical/Management Festivals. [10 Point per event]

5) His/Her involvement in various recognised student event committees formed by various organizing committees of various cultural/technical/sports festivals. [15 Points per involvement]

6) Assignment of profile of CR and impartial working done as a CR in the current semester. [25 Points per Semester]

7) Student‟s Special Achievement: [5 to 25 points per achievement to be decided by the HOD].

Amount of work done 5

Quality of work done 10

Quality of written report/presentation 20

Responses to the questions asked 15


Negative awards for G.P. (For every act of in disciplinary behavior/act):-

1) For every occurrence of not wearing proper uniform: [ - 5 Points ]

2) For every late entry in the lecture: [ - 5 Points ]

3) For every late entry in the lab: [ - 5 Points ]

4) For every semesterwise late registration: [ - 5 Points ]

5) For every suspension due to any reason: [ (- 5*Number of suspension days) Points ]

G.P. Marks will be calculated based on the following formula: = (Total Points earned by the

students – negative points) * (Total Marks specified for G.P.)

/ (Maximum Points earned by the any student in that class)

Clause (10) Course File Content: Every Faculty members will maintain the course file for

subjects teaching that must contain the following:

1) Time Table

2) Academic Calendar

3) Syllabus

4) Lecture Plan

5) Previous 3-Years Question Papers

6) Unit-wise Question Banks/Assignments.

7) Fortnightly course completion review formats.

8) Any other material as instructed by HOD/Director.

Clause (11) Lab Manuals:

Every faculty taking labs will ensure availability of updated lab manuals that must clearly

explain the following details for following.

1) University Syllabus of that Lab

2) List of Experiments to be conducted in that lab during current semester.

3) Objective of that each practical.

4) Methods/Steps to be used.

5) Instruments required and their description (if required as per syllabus)


6) Observations to be carried out.

7) Any Remarks etc .

8) Any thing special according to specialization as decided by HOD.

Clause (12) Role of Lab Assistants and Faculty in the Lab:

Role of Lab Assistants/Technicians:

1) To ensure availability of the required equipments before any experiment.

2) To display all the list of experiments and Time scheduling that must be updated.

3) To ensure proper recording of students entry in lab usage Registers.

4) To ensure stock registers updated and monthly audited by Admin Officer.

5) To maintain proper discipline in the labs.

6) To ensure proper safety, security and cleanliness of the instruments and labs.

7) To ensure regular maintenance of the equipments, all equipments must work all the time.

8) To help the students in performing the experiments after demonstration by the faculty

members

Role of Teacher in the Lab:

1) To maintain attendance of the students. And informing to HOD/HR-Section/Director

about the students that are absent/irregular in labs.

2) To keep updating own knowledge about the prescribed syllabus, experiment objective,

methods etc.

3) To verify display of all the lists of experiments and Time scheduling that must be updated.

4) Demonstration of the practical in detail before bringing students in the lab.

5) Leading smooth conduction of the practical in the lab.

6) Take help of lab assistants after demonstration to some groups of students if teacher is

busy with some group.

7) Ensure handle with care for all instruments.

8) Generating interest of the students in lab by explaining importance and use in real life.

9) Developing innovative environment among the students by discussing latest market

trends related to that practical.

10) Ensuring availability of updated lab manuals all the time.


S.No. Subject

Code

Subject Name Faculty

1. TCS-301 Discrete Structures


2. TCS-302 Computer Based Numerical &

Statistical

Techniques

3. TCS-303 Data Structures

4. TEC-301 Digital Electronics & Design Aspect

5. TCS-304 Object Oriented Programming

6. THU-301 Engineering Economics & Costing

7. PCS-302 Computer Based Numerical &

Statistical

Techniques Lab

8. PCS-303 Data Structure Lab

9. PEC-350 Digital Electronics

10. PCS-304 Object oriented programming using

Java/

C++


Uttrakhand Technical University

STUDY AND EVALUATION SCHEME(B.TECH II YEAR) IV SEMESTER

B.Tech. Computer Science and Engineering

(Effective from the session: 2012-2013)



TCS-301 Discrete Structures

TCS-301 DISCRETE STRUCTURES L T P 3 1 0 Unit-I (10L) Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, equivalence relation, partial ordering relation. Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions. Theorem proving Techniques: mathematical induction (simple and strong), pigeonhole principle, prove by contradiction. Unit-II (8L) Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results. Unit-III (8L) Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded I and complemented lattices.


Unit-IV (8L) Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Universal and existential quantifiers. Unit-V (6L) Combinatorics & Graphs: Recurrence Relation, Generating function., Permutation & Combination, Probabilistic Permutation & Combination Reference Book: 1. Y N Singh, “Discrete Mathematical Structures”, Wiley India 2. Liptschutz, Seymour, “ Discrete Mathematics”, McGraw Hill. 3rd edition 3. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill, Reprint 2010

TCS-302 COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES

L T P 2 0 0 Unit-I (6L) Introduction: Numbers and their accuracy, Computer Arithmetic, Mathematical preliminaries, Errors and their Computation, General error formula, Error in a series approximation. Solution of Algebraic and Transcendental Equation: Bisection Method, Iteration method, Method of false position, Newton-Raphson method, Methods of finding complex roots, Muller‟s method, Rate of convergence of Iterative methods, Polynomial Equations. Unit-II (6L) Interpolation: Finite Differences, Difference tables Polynomial Interpolation: Newton‟s forward and backward formula Central Difference Formulae: Gauss forward and backward formula, Stirling‟s, Bessel‟s, Everett‟s formula. Interpolation with unequal intervals: Langrange‟s Interpolation, Newton Divided difference formula, Hermite‟s Interpolation Unit-III( (6L) Numerical Integration and Differentiation: Introduction, Numerical differentiation Numerical Integration: Trapezoidal rule, Simpson‟s 1/3 and 3/8 rule, Boole‟s rule, Waddle‟s rule. Solution of differential Equations: Picard‟s Method, Euler‟s Method, Taylor‟s Method, Runge-Kutta Methods, Predictor Corrector Methods, Automatic Error Monitoring and Stability of solution. Unit-IV (6L) Statistical Computation: Frequency chart, Curve fitting by method of least squares, fitting of straight lines, polynomials, exponential curves etc, Data fitting with Cubic splines, Regression Analysis, Linear and Non linear Regression, Multiple regression, Statistical Quality Control methods. References: 1. Yang, “Applied Numerical Methods using MATLAB”, Wiley India 2. Pradip Niyogi, “Numerical Analysis and Algorithms”, TMH, 1st Edition. 3. Gerald & Whealey, “Applied Numerical Analyses”, AW 4. Grewal B S, “Numerical methods in Engineering and Science”, Khanna Publishers, Delhi. 5. Numerical Method Principles, analysis and algorithms ,Srimamta Pal (Oxford Higher ed) 6. Rajaraman V, “Computer Oriented Numerical Methods”, PHI, 3rd edition.

TCS 303


DATA STRUCTURES L T P 3 1 0 UNIT – I (10L) Introduction: Basic Terminology, Elementary Data Organization, Structure operations, Algorithm Complexity and Time-Space trade-off Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation, application of arrays, Character String in C, Character string operation, Array as Parameters, Ordered List, Sparse Matrices and Vectors. Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack, Linked Representation of Stack, Operations Associated with Stacks, Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack. Recursion: Recursive definition and processes, recursion, example of recursion, Tower of Hanoi Problem, simulating recursion, Backtracking, recursive algorithms. UNIT – II (8L) Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, D-queues and Priority Queues. Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation and addition, Garbage Collection and Compaction. UNIT –III (8L) Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, path length algorithm. Huffman Algorithm. Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm. UNIT –IV (8L) Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. Sorting: Insertion Sort, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on Different Keys. UNIT – V (6L) File Structures: Physical Storage Media File Organization, Organization of records into Blocks, Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Tree index Files, Indexing and Hashing Comparisons. Reference books: 1. Shukla, “Data Structures using C and C++”, Wiley India 2. A M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt. Ltd., New 3. Delhi.(2 nd ed). 4. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education Asia, 5. Delhi-2002. Reprint 2010. 6. Keogh, “Data Structures: Principles and Fundamentals”, Wiley India

TEC-301 DIGITAL ELECTRONICS & AND DESIGN ASPECT

L T P 3 1 0

Unit-I : Introduction (8L) Characteristics of digital system, Types of Digital circuits, Number system: Direct conversion between bases Negative numbers & BCD and their arithmetic‟s, Boolean algebra, Minimization of Boolean Functions: K Map upto 6 variable and multiple output circuits error detection & correcting codes, Hamming & cyclic codes quine mcclusky method


Unit-II : Combinational Logic Circuits (8L) Design Procedure, adders, subtractiors & code conversion, Multiplexers/Demultiplexers, encoder/decoders, decimal adders & amplitude comparators, ROM as decoder, PLA & PAL. DRC, RDC.

Unit-III : Sequential Logic Circuits (8L) Flip-Flops and their conversions, analysis and synthesis of synchronous sequential circuit, excitation table, state table & diagram. Design of synchronous counters, shift registers and theie applications.

Unit-IV : Logic Families (8L) Diode, BJT & MOS as a switching element concept of transfer characteristics, Input characteristics and output characteristics of logic gates, TTL, IIL,ECL,NMOS,CMOS Tri-state logic, open collector output, Interfacing between logic families, packing density, power consumption & gate delay.

Unit-V : Hazard ,Fault Detection &Memories (8L) Hazard and Fault Detection: Static and dynamic Hazard: Gate delay, Generation of spikes, Determination of hazard in combinational circuits, Fault detection methods: Fault Table & Path sensitizing methods. Memories: Sequential, Random Access, NMOS & CMOS Static and Dynamic Memory elements, one and multi-dimensional selection arrangement, Read-only memories, Formation of memory banks, internal & External address decoding Reference books: 1. Maini, “Digital Electronics: Principles and Integrated Circuits”, Wiley India 2. Digital Systems: Principles and Design, Raj Kamal, Pearson 3. Balbanian, Digital logic design, Wiley India 4. M. Morris Mano and M. D. Ciletti, Digital Design, M. Morris Mano and M. D. Ciletti, 4th Edition, pearson

6. Switching Circuit & Logic Design, Hill & Peterson, Wiley

TCS -304 OBJECT ORIENTED PROGRAMMING

L T P 3 1 0

Unit I (8L) Object Modeling: Objects and classes, links and association, generalization and inheritance, aggregation, abstract class, multiple inheritance, meta data, candidate keys, constraints.Dynamic Modeling: Events and states, operations, nested state diagrams and concurrency, advanced dynamic modeling concepts, a sample dynamic model.

Unit II (8L) Functional Modeling: Data flow diagram, specifying operations, constraints, a sample functional model.OMT (object modeling techniques) methodologies, examples and case studies to demonstrate methodologies, comparisons of methodologies, SA/SD, JSD.

Unit III (8L) Java Programming: Introduction, Operator, Data types, Variables, Methods & Classes, Multithread Programming, I/O, Java Applet.

Unit IV (8L) Java Library: String Handling, Input/Output exploring Java.io, Networking, Exception Handling, Event Handling, Introduction to AWT, Working with window, Graphics, AWT Controls, Layout Manager and Menus, Images.

Unit V (8L) Software Development using Java: Java Swing, Migrating from C++ to java, Application of java, JDBC. Reference books: 1. Horstmann, Big Java, Wiley India


2. Herbert Schieldt, “The Complete Reference: Java”, TMH, 7th Edition. 3. Nino,” An Introduction to Programming and Object Oriented Design using Java, w/CD”, Wiley India 4. James Rumbaugh etal, “Object Oriented Modeling and Design”, PHI 5. Bjarne Stroustrup, “C++ Programming Language”, Addison Wesley, 3rd Edition.

THU-301 ENGINEERING ECONOMICS AND COSTING

L T P 2 0 0 Unit I (6L) Time value of money : Simple and compound interest, Time value equivalence, Compound interest factors, Cash flow diagrams, Calculation, Calculation of time –value equivalences. Present worth comparisons, Comparisons of assets with equal, unequal and infite lives, comparison of deferred investments, Future worth comparison, pay back period comparison. Unit II (6L) Use and situations for equivalent annual worth comparison, Comparison of assets of equal and unequal life. Rate of return, Internal rate of return, comparison of IIR with other methods, IRR misconceptions. Unit III (6L) Analysis of public Projects: Benefit/ Cost analysis, quantification of project, cost and benefits, benefit/ cost applications, Cost –effectiveness analysis. Unit IV (6L) Depreciation, computing depreciation charges, after tax economic comparison, Break-even analysis; linear and non-linear models. Product and Process Costing, Standard Costing, cost estimation, Relevant Cost for decision making, Cost control and Cost reduction techniques. Reference books: 1. White, Engineering Economics, Wiley India 2. Horn green, C.T., Cost Accounting, Prentice Hall of India 3. Riggs, J.L., Dedworth, Bedworth, D.B, Randhawa, S.U. Engineering Economics, McGrawHill International Edition, 1996

PCS- 302 : Computer Based Numerical Techniques Lab Write Programs in ‘C’ Language: 1. To deduce error envolved in polynomial equation. 2. To Find out the root of the Algebraic and Transcendental equations using 3. To implement Newton‟s Forward and Backward Interpolation formula. L T P 0 0 2 4. To implement Gauss Forward and Backward, Bessel‟s, Sterling‟s and Evertt‟s Interpolation formula. 5. To implement Newton‟s Divided Difference and Langranges Interpolation formula. 6. To implement Numerical Differentiations. 7. To implement Numerical Integration using Trapezoidal, Simpson 1/3 and Simpson 3/8 rule. 8. To implement Least Square Method for curve fitting. 9. To draw frequency chart like histogram, frequency curve and pie-chart etc. 10. To estimate regression equation from sampled data and evaluate values of standard deviation, t-statistics, regression coefficient, value of R2 for atleast two independent variables.

PCS- 303 : Data Structure Lab


Write Program in C or C++ for following. 1. Program for Stack 2. Program Queue, Circular Queue 3. Program demonstrating Stack operation 4. Program for Stack Using Linked List 5. Program for Queue Using Linked List 6. Traversing of Tree Using Linked List 7. Queue Using Array 8. Program for Tree Structure, Binary Tree, Binary Search Tree 9. Program for Heap Sort 10. Program for Quick Sort 11. Graph Implementation BFS,DFS 12. Deletion in BST 13. Insertion in BST L T P

PEC-350 DIGITAL ELECTRONICS LAB

1. Bread-board implementation of various flip-flops. 2. Bread-board implementation of counters & shift registers. 3. Determination of Delay time and NAND, NOR, Ex-OR, AND & OR Gates. 4. Bread Board Implementation of Flip-Flops. 5. Experiments with clocked Flip-Flop. 6. Design of Counters. 7. Bread Board implementation of counters & shift registers. 8. Implementation of Arithmetic algorithms. 9. Bread Board implementation of Adder/Subtractor (Half, Full) 10. Transfer characteristics of TTL inverters & TTL Schmitt Trigger inverter. 11. Transfer characteristics of CMOS inverters series and CD40 series and 12. estimation of Gate delay of CD40 series CMOS inverter. 13. Monoshot multivibrators using 74121 and 74123. 14. Clock circuit realization using 555 and CMOS inverter and quartz crystal. 15. Adder/ subtractor operation using IC7483 4 bit/ 8 bit. 16. Demultiplexer / Decoder operation using IC-74138.

PCS- 304 : Object Oriented Programming Using Java

L T P 0 0 2 L T P 0 0 2 1. To become familiar with classes that represent entities that can interact with the user. 2. To successfully write simple programs that involve if statements. 3. To gain practice in the use of Boolean operators like && and ||. 4. To construct a class that represents a simple ATM (automatic teller machine). 5. Write a new program called Options.java that will request that the user enter an integer and then will display the message .positive,. .negative,. or zero. if the value that was entered was greater than zero, less than zero, or equal to zero, respectively. 6. Write a simple program called RandomGeneration.java that will request N, the number of values desired, and then generate a list of N random double values. Use a ViewFrame for input and output. 7. Write program for Java Applets. 8. Use Java Servlets for proxy server.


PREVIOUS YEAR

QUESTION

PAPERS

Discrete Structure 2008-09




Discrete Structure 2010-11


Discrete Structure2011-12



Discrete Structure2012-13



Computer Based Numerical Techniques2008-09







Data Structure2007-08












Digital Electronics & Design Aspects2010-11








Object Oriented Programming2010-11







Engg Economics & Costing2010-11









Engineering Economics & Costing2011-12


Documents

JB INSTITUTE OF TECHNOLOGY - JBIT - Best …: Handbook of B.Tech- CSE _III Sem 1 JB INSTITUTE OF TECHNOLOGY Approved by AICTE, Ministry of HRD, Govt. of India, Affiliated to Uttarakhand