Department ofComputer Science and Engineering Student Hand Book II Year B Tech – I Semester 2015-2016 Guru Nanak Institute of Technology Name Roll Number Class/Section Ibrahimpatnam, Ranga Reddy District – 501 506 (Telangana) TIME TABLE (To be filled by the student with graphite pencil only) Day / Period 1 09.20 2 10.15 3 11.05 4 11.55 5 01.30 TUESDAY WEDNESDA Y THURSDAY FRIDAY SATURDAY GURU NANAK INSTITUTE OF TECHNOLOGY 12.45 – 01.30BREAK MONDAY 6 02.20 7 03.10 CONTENTS S. NO. Particulars Page No. PART A I GENERAL INFORMATION 01 II ACADEMICS 03 III MONITORING AND GUIDANCE 05 IV PROGRAM OBJECTIVES AND OUTCOMES 09 PART B 2 MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE DATA STRUCTURES 16 3 DIGITAL LOGIC DESIGN 20 4 ELECTRONIC DEVICES AND CIRCUITS 28 5 BASIC ELECTRICAL ENGINEERING 33 6 PROBABILTY & STATISTICS 38 7 DATA STRUCTURES (L) 44 8 BASIC ELECTRICAL ENGINEERING (L) 46 1 PART A I. GENERAL INFORMATION 1. About the College GURU NANAK INSTITUTE OF TECHNOLOGY 11 Guru Nanak Institute of Technology is sponsored by Barahmoula Educational Society, which have been founded to educate, enrich and empower the youth who in turn will play a decisive role in shaping the destiny of the nation. The endeavor at the Institution stretches beyond just offering degrees to the building of character and personality of the young professionals transforming them into complete professionals equipped with technological competence and social consciousness. JSN College of Engineering & Technology was established in the year 1999 with the sole objective of providing a perfect platform to students in the field of Technology and Management to invent applications for their academic and overall personality development. In year 2008 the name was changed as Guru Nanak Institute of Technology. Within a span of 14 years, GNIT has come a long way to become one of the Premiere Engineering Colleges in the state with an overall intake of more than 720 students in various Undergraduate and Post Graduate Courses including B.Tech.,M.Tech., and M.B.A.GNIT has state-of-the-art laboratories, highly qualified and dedicated teaching professionals and a sprawling lush green campus with a congenial atmosphere for learning. The campus has a rich tradition of soaring high with academic excellence and overall personal growth of the students. This is achieved by providing to them excellent academic environment, state-of-the-art infrastructure and dedicated and highly qualified faculty members with decades of teaching and industrial experience. Highlights: Teaching methodology involves technical case studies, creative exercises, online assignments & descriptive tests. E-class rooms Industry focused knowledge is imparted by R & D and Industry peer members. Tie up with MNC companies and foreign Universities State of art laboratories, sophisticated equipment and advanced software Library is equipped with National and International Journals, 50000 volumes and more than 7500 titles of books, NPTEL, SONET CDs and internet lab for students and staff. IEEE online journals and IEL online journals through AICTE INDEST CONSORTIUM GURU NANAK INSTITUTE OF TECHNOLOGY Wi-Fi campus with 12 Mbps bandwidth. Oracle, Microsoft Development suite, Microsoft academic license for Microsoft Software Products, MAT LAB, PSPICE, VHDL, TINAPRO and DSP software’s are available State of art English Language lab and 800 computers connected with dedicated high-end servers. Scholarship and free books for meritorious students. Book Bank Scheme facility to the students. A new and unique Laptop lab with latest configuration Most of the classrooms are fixed with LCDs and screens. All major professional societies’ student chapters like ISTE, CSI, IETE and IEEE etc. Training & Placement: Modern training department is established as per the corporate standards. College has JKC training centre and special training is providing in the area of soft skills and technical skills for students which is a part of their regular timeTable. Large Number of students placed with Microsoft Inc, Infosys, Mahendra Satyam Ltd, Infosys, IBM, TCS, ADP, Wipro, Sutherland Technologies, CMC, SEMANTIC SPACE, and InfoTech Enterprises. Industry experts are invited for guest lectures, seminars and student presentations to maintain a strong Industry and Institution Interaction. Also, industrial visits are arranged for students to enrich their knowledge. Contact Information Principal Dr. S. Sreenatha Reddy 8096609821 Vice Principal Dr. M. Narendra Kumar 8096609840 HOD CSE & IT Prof. Sandeep Singh Rawat HOD ECE Prof. Kedarnath 80966 09829 HOD MECH Prof. B. Vijay Kumar 8096609836 GURU NANAK INSTITUTE OF TECHNOLOGY 8096609826 HOD CIVIL Prof. Students of our department actively participate in National-level Student Paper Contests being organized at IIT's. Involve the faculty in the development of laboratories and to take an active interest in counseling the students. Department Strengths GURU NANAK INSTITUTE OF TECHNOLOGY .with 4 supporting staff members. ACADEMICS 1 Department Profile The CSE Department of GNIT was started in the year 2008 with an intake of 60 students. Developed expertise for consultative activities by providing opportunities for industry – institute interaction. Train the students to meet the challenges of advancement in technology. Madan Mohan 8096609827 HOD EEE Mr. which is a continuous process. A good number of Students are well placed in reputed organizations.G. Some of them have also been awarded in these paper contests. Computer Technology and Software Engineering etc. Infuse confidence in the minds of students and to develop them as entrepreneurs.Srinivas 8096195678 General Manager Mr. Enrich the Academic activities through continual improvement in the teaching and learning processes. Col (Retd) Rajesh Kumar 8096611000 Administrative officer Mr. JNTU and various other Engineering Colleges. Antony 8297975251 Transport Officer Md. S.Tech) in computer science and engineering with an intake of 18. NITSs. S. The department has highly competent faculty members with masters specialization in Computer science and engineering. Constantly upgrading the technical expertise for producing competent professionals to cater to the needs of society and to meet the global challenges.Tech) in Computer science and engineering with an intake of 180 students and post graduate program(M. Kuldeep Singh 8498056996 HOD H & S Dr. Department of CSE is committed to Impart Technical and Research based quality education and to develop innovative skills among the students.Hussain 8499071144 II. Currently the Department offers an under-graduate program (B. • The Department has highly qualified and well experienced faculty. Tech qualifications. • To encourage students to serve social causes by Application of their specialized knowledge paving way to better life for humanity. Faculty Strength The faculty in the department consists of Senior and well experienced Associate Professors and Assistant Professors with M. • Students and lecturers are co-ordinated and work as a team. Tech and B. • Enrollment of high caliber students • Students are very disciplined and cultured • Active involvement in extra-curricular and co-curricular activities • Strong encouragement from management to improve qualification • Good infrastructure • Excellent training for students Objectives: • To propagate and disseminate knowledge in Computer Science and Engineering discipline to the society through the student and faculty. An experienced System Administrator and well-qualified Lab staff support the conduct of Laboratories. 2. FACULTY LIST S. • To promote the concept of lifelong learning among faculty members.N 1 2 Name of Faculty Dr.Sandeep Singh Rawat Prof. Anirudha Batta Charjya GURU NANAK INSTITUTE OF TECHNOLOGY Designation (Prof & HOD) Professor . Professor Asst.Professor Asst.VENKATARAMANA GURU NANAK INSTITUTE OF TECHNOLOGY Designation SYSTEM ADMINISTRATOR PROGRAMMER PROGRAMMER PROGRAMMER PROGRAMMER OFFICE ASSISTANT .Suresh Mr.Professor Asst.Y. Deepika Mr.Professor Asst.D.Professor Asst.Madhu Sudhana Mr.Swetha Mr.L.NARESH SHEKHAR Ms. C.Sudhakar Mr. SURESH Mr.Prasunna Mr. Phani Raja Mrs..Professor Asst.N.Vinay Sagar Mr.Srinivas Assoc Professor Assoc Professor Assoc Professor Assoc Professor Asst.Professor Asst.Seema Rai Ms.Professor Asst.Professor Asst.Professor Asst.Satish Mr.Professor Asst.D.professor NON TEACHING FACULTY LIST Name Mr SUDHEER Mr D.K.Professor Asst. K.Suresh Mr. B.Prashanth Mr.K.Laxmi Mr.Professor Asst.professor Asst.3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 Mr.M. Sangeetha Mrs.A.Professor Asst. P. Shoban Mr.Imran Qureshi Mr.S.Nusrath Khan Ms. P.Deviprasad Mishra Mr.K.Professor Asst.B.Kethan Harish Mrs. Narasimha Ms.Professor Asst.SWAPNA KARTHIK SHARMA Mr. S. Sreeja Ms. Labs can be used in free time / lunch hours by the students with prior permission from the lab in-charge.No 1 2 3 4 5 EVENT Duration Procedures for Laboratories a b c d e III. they are advised to discuss it with the concerned Teacher /The Class Teacher/Counselor/HOD/ Principal. Any damage caused is punishable. 1 2 3 4 Year II B. Tech CSE-A II B. Tech-CSE-C III B.No .Course Calendar for the Semester ( to be filled by the candidate) S.ANNAPURNA GURU NANAK INSTITUTE OF TECHNOLOGY Phone Number 8500000076 9704209701 . Students are supposed to occupy the experiment setup allotted to them and maintain discipline in the lab. Principal/HOD will discuss the student to solve the problems. 1 Equipment in the lab for the use of student community. Class Teacher: S. Tech CSE-A Name of the faculty SANGEETHA PHANI RAJA K. 15 marks are awarded for continuous evaluation in the laboratory.SHOBAN K. If required. Students must use the equipment with care. Necessary action will be taken by the concerned authorities. Lab records need to be submitted on or before date of submission MONITORING AND GUIDANCE Student Feedback In case the students’ find it difficult to cope up / understand a particular subject. Students can use the suggestion boxes for communicating their problems. Students should carry their observation book along with the record book with completed exercises/ calculations while attending the lab. Tech CSE-B II B. Tech CSE-C III B Tech CSE-A III B Tech CSE-B IV B Tech CSE-A 13831A0548 13831A0559 13831A05B3 13831A05B5 12831A0520 GURU NANAK INSTITUTE OF TECHNOLOGY K.VISHAL . I-Semester Class Representatives are: Class / Section Roll No Name of the Student II B.5 6 7 III B.V. Counselors will interact with the students once in a fortnight and discuss the progress. Students can directly discuss their college related or personal problems related to academics with them.NITHISHA YASH DALMIA C.SUDHAKAR 8019995450 9160608630 9291617654 Counselor: One counselor is assigned to a group of 30students. Coordinating academic events and co-curricular activities.SAI AMAR S. Tech CSE-B II B. Communicating the Problems faced by the students and also communicating the suggestions for improvement. whenever they are free from class / lab work. Responsibilities of the Class Representatives: Communicating the departmental / college directives & information to the students. Tech CSE-A II B.SATISH A. VINAY SAGAR B. Tech CSE-B IV B Tech CSE -A IV B Tech CSE-B P. The Counselors are accessible to the students and they can talk to them. Encourage students to interact for better studies& sharing the knowledge and information.THARUNI REDDY M. Class Representatives and their role: Two students from each class are selected as Class representatives from the department based on their academic performance and discipline. If required the teacher will guide the student in the subject. attendance of Remedial classes etc. special test marks. 3 Remedial classes: Remedial classes will be conducted for students who are academically weak and who do not perform well in their internal examinations and special class tests. Role of the Counselors Talk to the student at least once in a fortnight Updating the counseling book Problems of the student may be discussed with the concerned faculty/mentor/HOD Identify the strengths .IV B Tech CSE-B 12831A0509 12831A05A1 12831A0574 B. remedial classes for slow learners Communicating the student’s attendance.DEEKSHA Role of a class Teacher: Ensuring the conduct of classes Monitoring the students attendance SMS.S. Mid marks. If any student is not performed. he/she will be asked to attend the re-exam to ensure the understanding of the subject.V.KIRAN KUMAR REDDY V.N.MURTHY P. 2 Special Tests: Two Special tests will be conducted for students before the Mid exams to improve their performance in the mid examinations. weakness and motivate the student Counselors will evaluate the student individually for the following: a Less marks in Internal exams b Continuous Absence (3 days) c Not understanding the subject d Students from Telugu medium e Assistance for back log subjects etc.V. 4 Backlog Management GURU NANAK INSTITUTE OF TECHNOLOGY . phone calls to the parents and interacting with parents Class Discipline Arranging extra classes for coverage of syllabus Ensuring the conduct of special tests. as part of promote curricular and extracurricular activities. innovation and Product development by collaboration with reputed foreign universities. group discussions etc.)Academic Calendar (2015-2016) S NO 1 2 3 4 5 6 7 8 9 EVENT Date & Day Duration The vision of the GNIT To be a world –class educational and research institution in the service of humanity by promoting high quality Engineering. M3: Maintain high academic standards and teaching quality that promotes the analytical thinking and independent judgment. 5 Correspondence with Parents Parents will be informed about the performance of their ward from time to time during the course period. seminar. The Mission GNIT (in pursuance of its vision) M2: Develop the faculty to reach the international standards. however parents are advised to contact class Teacher / Department Head periodically. M5: Offer collaborative industry programs in emerging areas and spirit of enterprise. II B Tech – I Semester (Reg. GURU NANAK INSTITUTE OF TECHNOLOGY M4: Promote research. NIT’S and IIIT’S 7 CSI activities The department regularly organizes technical quiz.The Class Teacher maintains a complete record of Examination results of each student and they counsel and guide them in preparing for backlogs. Management and Pharmacy education. Students are provided with material and important questions are discussed. . M1: Imbibe soft skills and technical skills. 6 NPTEL Classes Department conducts NPTEL classes with Technical DVD’s as virtual/visual classes through faculties from IIT’S. 2.gradation. Program Outcomes (PO’s) GURU NANAK INSTITUTE OF TECHNOLOGY . Nurture young individuals into knowledgeable. Nurture the faculty to expose them to world-class infrastructure. research. Develop Industry-Interaction for innovation and product development. product development and handle realistic problems.Vision of the Computer Science and Engineering Department To be a premier department of Computer Science and Engineering in the region. skillful and ethical professionals in their pursuit of Computer Science and Engineering. 4. 5. knowledge of contemporary issues for successful professional career. Mission of the Computer Science and Engineering Department 1. PEO-2: Graduates shall maintain ethical conduct. leadership qualities. employability. research and innovations. PEO-3: Graduates shall possess academic excellence with innovative insight. Sustain high performance by excellence in teaching. managerial skills. soft skills. Program Educational Objectives (PEO’s) PEO-1: Graduates shall have the ability to apply knowledge and technical skills in emerging areas of Computer Science and Engineering for higher studies. Extensive partnerships and collaborations with foreign universities for technology up. 3. sense of responsibility to serve the society and protect the environment. An ability to apply knowledge of mathematics. An ability to use the techniques.A. An ability to design a system. environmental. social. An ability to identify. An ability to function on multidisciplinary teams E. component or process to meet desired needs within realistic constraints such as economic. health and safety. manufacturability and sustainability D. and an ability to engage in lifelong learning J. An ability to design and conduct experiments. The broad education necessary to understand the impact of engineering solutions in global economic environmental and societal context I. A recognition of the need for. An understanding of professional and ethical responsibility G. A knowledge of contemporary issues K. skills and modern engineering tools necessary for engineering practice PEO’s Program Outcomes A I B C II III D E F H GURU NANAK INSTITUTE OF TECHNOLOGY J K I G . An ability to communicate effectively H. as well as to analyze and interpret data C. political ethical. science and engineering B. formulate and solve engineering problems F. PART – B MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE A.LESSON PLAN GURU NANAK INSTITUTE OF TECHNOLOGY . Kandel. P. Text Books (Text books (to be acquired by the Students) Book 1 Book 2 Book 3 Book 4 Unit I II III IV V Discrete and combinational Mathematics – An applied Introduction . SYLLABUS GURU NANAK INSTITUTE OF TECHNOLOGY .MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE Faculty Mrs. Mott. L. Tata McGraw Hill J. Asst. R. Ross. Grimaldi. Prentice Hall. 2 1 --- 6 1 2 --- 6 2 3 --- 7 2 4 --- 7 6 5 --- 6 Mathematical Logic and Predicates Relations and Algebraic structures Elementary Combinatory Recurrence Relation Graph Theory and Applications Contact classes for syllabus coverage 65 Lectures beyond the syllabus 3 Special descriptive tests 2 Tutorial classes & Remedial classes 5 Total Classes 75 B. Second Education. T. Second Edition Reference Books Kolman. A. Pearson Education. Pearson education.Prof. Third Edition Topic Chapters No of Classes Book 1 Book 2 Book 3 1. Annapurna. Tremblay.5 th edition Ralph.P. Discrete Mathematics for Computer Scientists and Mathematics. Baker. J. Discrete Mathematical Structures with Applications to Computer Science. Busby. Manohar. Discrete Mathematical Structures.P. Quantifiers. Functions: Inverse Function. Multi graphs and Euler circuits. Relations: Properties of binary Relations.II UNIT. Isomorphism.III UNIT. Spanning Trees. proof of contradiction. Connectives. compatibility and partial ordering relations. Constrained repetitions. Characteristics roots solution of In homogeneous Recurrence Relation. Recurrence relations. Consistency. Graph Theory : Representation of Graph. Semi groups and monads. Well formed formulas. Hamiltonian graphs. recursive Functions.V Mathematical Foundations of Computer Science (MFCS) (53022) Syllabus Mathematical Logic: Statements and notations. Hasse diagram. transitive closure. Chromatic Numbers GURU NANAK INSTITUTE OF TECHNOLOGY . Graph Theory and Applications: Basic Concepts Isomorphism and Sub graphs. Function of Sequences Calculating Coefficient of generating function. Normal forms. Composition of functions. Solving recurrence relation by substitution and Generating funds. Combinations & Permutations. with repetitions. Elementary Combinatorics: Basis of counting. groups sub groups’ homomorphism. tautology. Binomial Multinomial theorems.I UNIT. Lattice. Free & Bound variables.UNIT. BFS. Predicates: Predicative logic. Binomial Coefficients. Automatic Theorem Proving. the principles of Inclusion – Exclusion.IV UNIT. Rules of inference. Pigeon hole principles and its application. planar Graphs. universal quantifiers. equivalence. DFS. Truth Tables. Recurrence Relation: Generating Functions. equivalence implication. Lattice and its Properties. Algebraic structures: Algebraic systems Examples and general properties. 4. and also find principle conjunctive normal form. pΛq ii). q Λt 10. Prove that √2 is not a rational numbers 1. 4-place. 3. What is predicate calculus? What is its significance? Give examples for 3-place. 2. p Λs . 6. What the properties of binary relations explain with suitable examples. Find principal disjunctive normal form for (PΛQ) V(¬PVQVR).I Unit-II 1. Explain different rules of inference. Explain the terms given belowi) Tautology ii)Contrapositive iii)Universal valid formulae iv)Contradiction 5. 7. 5-place predicates. Determine the truth values of the following. What id symmetric and anti.What is an algebraic structure? Explain with examples of binary operations with * and +. What is relation and function.Show that r is valid conclusion from the premises (pq)r . qp v) ¬q¬p.symmetric relation? Explain with examples. What is irreflexive? Explain with suitable examples? 4. Explain semi-group and monoids? Give examples. Let p ab=nd q be primitive statements for which pq id flase. 7..C. Operators and its properties. explain clearly with suitable examples. Obtain principal conjunctive normal forms of the following formulas (pq)r ii) (pq)(q¬ r) 6. GURU NANAK INSTITUTE OF TECHNOLOGY . 8. Explain about the properties associated with multiplication with examples 8. 5. (((p(qs)) Λ(¬rVp)))q 9. ASSIGNMENT QUESTIONS Mathematical Foundations of Computer Science Assignment Questions Unit. ¬pVq iii). Show the following statement for equivalence (AΛ (¬AVB))V(BΛ¬(AΛB))↔B. 2. Show that rs can be derived from the premises. 3. Explain equivalence relation with suitable examples. i). un+ 5un-1 + 6un-2 = 42(4)n 5. *) where S indicates a set of integers. Suppose that 200 faculty members can speak French. 50 can speak Russian.V 5. 100 that speak Spanish. n≥2. How many faculty members can speak either French or Russian.3 iv)W6 7. 2. 60 that speak French and Spanish. Russian and Spanish. Complete Graph ii). In how many way can we distribute 10 white balls. a3=80 4. i)Cycle and Circuit ii) Hamiltanian graph and Euler’s graph 9. Explain the following different graphs with examples. un -2un-1 – 3un-2 = 5n. 35 that speak Russian and Spanish. Solve the recurrence relations. 3. What is cycle graph explain with example. Solve recurrence relations . 6. Regular Graph iii). Solve recurrence relations. 3 . Explain adjacency and incident matrices. 2. given that a2=6. i). Explain the properties of algebraic system (S.5) and C(6. Multi Graph ii). And u0=1. What is a graph and give detailed explanation.UnitIII UnitIV 1. 8. What binary tree. Explain the following different graphs with examples.If there are 200 faculty members that speak French. an – 8an-1 +16an-2 = 0. Planar Graph 3. 20 that French and Russian. General Graph iii). Compute p(8. Define graph? Give examples. 50 can speak Russian which 20 can speak both French and Russian. Find subgrapah of G which is isomorphic to k3. complete binary tree and full binary tree and explain with examples. n≥1. While only10 speak French. and its advantages with suitable examples Unit. Distinguish between following terms. u1=1 1. Find chromatic number of Kn GURU NANAK INSTITUTE OF TECHNOLOGY .3)? 1. Mixed Graph 4.3. +. 5. How many speak either French or Russian or Spanish. 10. i). 10 blue balls into 6 different boxez( any box can be left empty). 4. Compute a simple expression for the power series given below∞ ∑ (n+1)(n+1)(n) xn n=1 2. Solve recurrence relation un= un-1 + n(n+1)/2. 10 red balls. Draw the following graphs i)C5 ii) K5 iii)K3. + and * are binary operations of multiplication and addition respectively. and combinations. inclusion and exclusion principles. i) ii) iii) iv) v) Course Outcomes: Ability to illustrate by examples on the basic terminology of sets functions. or relations. principles of permutations. function. relations and functions. d) To relate practical examples to appropriate set. f) To use graph theory for solving problems and relate its applications to real world problems. Ability to represent and apply graph theory in solving computer science problems and other related problems. Ability to demonstrate knowledge on operations associated with sets. PROGRAM EDUCATIONAL OBJECTIVES: Course Educational Objectives: a) To explain with examples the basic technology of functions. relations and predicate logic. function or relation model and interpret the associated operations and terminology in context. Ability to demonstrate in practical applications the use of basic counting. Ability to solve the problems those involve the concept of recursion and recursively defined structures. GURU NANAK INSTITUTE OF TECHNOLOGY .D. relations and sets b) To describe the importance and limitations of predicate logic. c) To performs operations associated with set. e) To relate the ideas of mathematical induction to recursion and recursively defined structures. DATA STRUCTURES A. LESSON PLAN GURU NANAK INSTITUTE OF TECHNOLOGY . Assoc.Kushwaha andA. DatastructuresA ProgrammingApproachwithC.Prof. Text Books (to be acquired by the Students) Book 1 Book 2 FundamentalsofData structuresinC.Horowitz.Sahni andSusan Anderson-Freed.UniversitiesPress.DATA STRUCTURES Faculty Mr.Misra. Syllabus GURU NANAK INSTITUTE OF TECHNOLOGY 04 65 . Unit Topic Chapters No of Classes Book 1 Book 2 1&4 1&2 14 3 3 12 I Basicconcepts II StackADT III Trees & Graphs 5&6 - 14 IV Searching & Sorting 7&8 - 12 V SearchTrees & Patternmatchingalgorith m 10 & 11 - 13 Contact classes for syllabus coverage 59 Special descriptive tests 02 Tutorial classes Total Classes B.S.D.PHI. P Satish.S.K.2 nd Edition.E. two dimensional arrays. AVL Trees. Heap Sort. Insertion into an AVL Tree. Graph Traversals. Selection Sort. Sorting-Insertion Sort. Comparison of Search Trees. definition and operations. Patternmatchingalgorithm-TheKnuth-Morris-Prattalgorithm. Deque(Double ended queue)ADT. GURU NANAK INSTITUTE OF TECHNOLOGY . Properties of Binary Trees. Representation of Trees.definition. Circularly linked lists. hash functions.time complexity and space complexity.Definition. Singly Linked Lists-Operations-Insertion. Deletion. array and linked implementations in C. Representation of single. Overflow Handling. Insertion into a Max Heap.Introduction to Red-Black and Splay Trees(Elementary treatment-only Definitions and Examples). Definition. hash tables.Tries(examplesonly). Quick sort.arrayandlinkedimplementationsinC. Introduction to Linear and Non Linear data structures. Concatenating singly linked lists. operations-Insertion and Searching .Recursivealgorithms.applicationsinfix to postfix conversion. recursion implementation. Graph ADT.Adjacency matrix. SearchTrees-BinarySearchTrees. Static Hashing-Introduction. Binary tree ADT.operations. Graph Representations. Comparison of Sorting methods. Radix Sort. Doubly Linked ListsOperations-Insertion.Definition and Examples. Definition. Deletion from a Max Heap. array and linked Implementations in C. B-Tree of order m. Unit – III Trees – Terminology.Operations for Circularly linked lists.DataAbstractionPerformance analysis.Operations-Searching. Threaded binary trees. Unit – II StackADT. Graphs – Introduction. spar sematrices-array and linked representations. Adjacency lists.DFS and BFS.Insertionand Deletion.DATA STRUCTURES Unit – I Basic concepts-Algorithm SpecificationIntroduction. Binary Tree traversals. Circular queues-Insertion and deletion operations. Omega and Theta notations. Binary Search. Queue ADT. Asymptotic Notation-BigO. Deletion. BTrees. Binary Tree Representations-array and linked representations. Terminology. Max Priority Queue ADTimplementation-Max Heap-Definition. Unit – IV Unit – V Searching-Linear Search. Postfix expression evaluation. 70.C. 60.9 2) Write and explain Knuth-Morris-Pratt pattern matching algorithm? GURU NANAK INSTITUTE OF TECHNOLOGY . 50. 30. 35. 10. 12. Preorder: bdachgef Week – 6 4) Explain the properties of Binary Tree and explain the Binary Tree representation using Arrays and Linked representation. 17. 80. 35. 75} Week .4 2) Explain Infix to Postfix conversions with examples? 3) Explain Queue ADT and Write a C program to implement Queue ADT using Linked List? 4) Write about Double Ended Queues with some possible operations? Unit – 3 1) Explain Graph Traversal methods using suitable examples? Week – 5 2) What is Heap and differentiate MIN heap and MAX heap? 3) Explain how to construct Binary Tree given the In order and Preorder sequences? In order: abcdefgh .7 2) Write a C program to sort the given list of integers in Ascending Order by using Quick Sort 3) Explain about Double Hashing and Extendable Hashing? Week .1 Week . 30. Unit – 5 1) Construct AVL Tree for the list {25.3 Week . 1}. 55. 4) Explain Sparse matrix and Circular Linked List with an example? Unit – 2 1) Write about Stack ADT? Write a C program to implement Stack ATD using array? Week . 40. 2. 65. Unit – 4 1) Write a C program to sort the given list of integers in Ascending Order by using Insertion Sort Week .8 4) Write Heap Sort algorithm and Sort the list of numbers {20.Assignment Questions DS Assignments Week .2 Unit – 1 1) What is mean by performance measurements? Write the recursive factorial algorithm and count the number of steps to compute the complexity? 2) Distinguish between Big ‘O’ & little ‘o’? 3) Explain the advantages of one over the other between Double Linked List and Singly Linked List with illustrative examples. 3) Define B-Tree? Generate a B-Tree of order 3 for the following key values 25. searchtrees. D. 39.trees. Syntax and logics. Tounderstandthebehaviorofdatastructuressuchasstacks. Week-10 4) Write a program to create a Binary Search tree and Recursive Traversal methods for Inorder. 10. Linear and Non Linear Data structures. PROGRAM EDUCATIONAL OBJECTIVES: COURSE OBJECTIVES: To understand the basic concepts such as Abstract Data Types.queues. Preorder and Postorder traversals. queues. linked lists. Evaluation of various possible technical solutions. Graphs and their representations. 53. stacks.hashtables. GURU NANAK INSTITUTE OF TECHNOLOGY . To choose the appropriate data structure for a specified application. Implementation of these solutions in language. Program Structure. 15. trees. hash tables. search trees. To write programs in C to solve problems using data structures such as arrays. 64. Program Execution. 12. COURSE OUTCOMES: Students will be able to The analysis and design of programs based on requirements and performance considerations. To understand the notations used to analyze the Performance of algorithms. To understand and analyze various searching and sorting algorithms. graphs. Cell No:9490943660 vasantisambu16@gmail. Tata McGraw Hill. S Rao. Unit Topic Chapters in Book 1 2(R) 3(R) √ √ √ I Digital Systems II Gate–Level Minimization √ III Combinational Circuits (CC) √ IV Synchronous Sequential Circuits √ V Memory √ Total classes for syllabus coverage Lectures beyond syllabus Special Descriptive Tests Tutorial classes GURU NANAK INSTITUTE OF TECHNOLOGY No 4(R) 5(R) √ √ Classes 12 09 √ 11 √ 11 √ of 10 53 2 2 5 . Rafiquzzaman John Wiley. 3rd Edition. Book 1 Reference Books Book-2.com Text Books (to be acquired by the Students) Digital Design – Morris Mano. Book-5. Kohavi.DIGITAL LOGIC DESIGN A. Book-3. Givone. Fundamentals of Digital Logic and Micro Computer Design. 2006. Switching and finite automata theory by Zvi. PHI.LESSON PLAN Subject DIGITAL LOGIC DESIGN (A30401) Faculty S. Tata McGraw Hill. Pearson Education. 5th edition M. Switching and Logic Design C.Vasanti. Digital Principles and design Donald D. V. Book-4. digital logic gates(AND. binary codes. Registers. Sequential Memory. Up-down counters. types of ROM. Four Variable. Number base conversions. Combinational circuit for different code converters and other problems. Three Variable. subtractor. Magnitude Comparator.Gaps in syllabus Total No. Multiplier. address and data bus. Boolean functions. UNIT IV UNIT V Synchronous Sequential Circuits: Latches. Octal. Memory decoding. UNIT II Gate –Level Minimization and combination circuits . Binary Adder. NAND. complements. basic theorems and properties. The K-Maps Methods. Demultiplexers.NOR. canonical and standard forms. Ripple counters . signed binary numbers. error detecting and correcting codes. Hexa Decimal and other base numbers. Five Variable . Ex-OR. Boolean algebra . Asynchronous Sequential Circuits: Reduction of state and follow tables. analysis of clocked sequential circuits. GURU NANAK INSTITUTE OF TECHNOLOGY . Floating point number representation. Programmable Logic Arrays. product of sums Simplification. Shift registers. Encoders. Syllabus UNIT I Digital Systems: Binary Numbers. Memory: Random Access memory. sum of products . NAND and NOR implementation and other two level implantation.OR. Decoders. Role free Conditions. memory Hierarchy in terms of capacity and access time. UNIT III Combinational Circuits (CC): Design Procedure. design of counters. of classes 2 64 B. Multiplexers. Ex-NOR). Don’t care conditions . Flip-flops. Cache Memory. Synchronous Counters. With left most bit selected to produce even parity 4 Give the 8 bit data word 01011011 to generate the 12 bit composite word for the hamming code to correct and detect the signal even 5 Perform the subtraction with the following unsigned binary number by taking 2’s complement 1. 1010100-1010100 GURU NANAK INSTITUTE OF TECHNOLOGY . 65738 to base 10 2.Assignment questions Unit-I Convert the following numbers 1 1.C. 95. 11011-1101 3.01012 to base 4 and base 8 3. 100-110000 4.14/2=5 2. 00111101. 11011-10010 2.24+17=40 Encode the word STLD in ASCII using 8 bit code 3 1.With left most bit always zero 2. 54/4=13 3.7510 to base 2 Determine the base of the number in each case for the following operations to be correct 2 1. D)=∑m(0. A. A.1=A GURU NANAK INSTITUTE OF TECHNOLOGY .9.B)’=A’+B’ 2.8.12) Express the following function in standard SOP form 8 F=AB+C’D+AB’C (b) Convert the given expression in standard POS form F=(A+C)(B+D)(A+B) Verify the foll0wing boolean alzebric manipulation justify each step with a reference to a postulate 9 1. (A’+C)(A’+C’)(A+B+CD) to four literals 5. A.A’=0 3.AND 7 2. (X’+Y’+Z’)’+XY+WZ 3. PROVE THAT (A+B)(A’+C)(B+C)=(A+B)(A’+C) (a) State duality theorem list Boolean laws and their duals (b) Write the dual of the following 10 1. AND-NOR 3.B=B. 11-1011 Simplify the following Boolean expressions to the indicated number of literals 1.5. (A.3.4.2. (X+Y’+XY)(X+Y’)X’Y=0 2.1. NOR-OR F(A. ABCD+A’BD+ABC’D+A’D Implement the function F with the following two level forms 1.C.B. (AB+C+D)(C’+D)(C’+D+E)=ABC’+D B. OR-NAND 4. A’C’+ABC+AC’+AB’ to two literals 6 2. NAND. A’B(D’+CD)+B(A+A’CD) to one literal 4.A 4. 16.4.5).2.9.30)+d(3.E)=∑m(0.2.4) F2==∑m(1.28.10.9) using PLA 4 Illustrate how a PLA can be used for combinational logic design waith reference to the functions F1=∑m(0.7) 2 F2=∑m(0.7.4.24.6.9.7) Implement the circuit using PLA having 3 inputs.6.2.7.12) 2 Minimize the following Boolean functions using F(A.31) 3 Using k map obtain minimal sop and minimal pos forms of the function F=∑(1.8.3.9.5.26.3.12.2.29.31) 6 Design a combinational circuit with three inputs whose output is equal to 1 if the number of inputs has more 1’s than 0 .11) F2=∑(0.6.B.15.10.8.6.4.3.8.27.11.12) Unit-III Implement the following functions using PROM 1 F1=∑(1.18.10.5.12.15) F2=∑(0.15) A combinational circuit is defined by the functions f1=∑m(3.1.20.11.9.19.8.2.1. Realise the same assuming that a PLA is available GURU NANAK INSTITUTE OF TECHNOLOGY .15) 8 Show how a 16 to 1 mux can be realized using a tree type network of 4 to 1 muxes 9 Implement full subtractor using de multiplexers 10 k map Give hazard free realization for the following Boolean function F=∑m(0.D.15.24.7.6. 4 product terms and 2 outputs Implement the following functions 3 F1=∑(0.13) 4 Design a odd parity generator using gates for the decimal digits 0 to 9 represented in 8421 BCD to the necessary truth table and draw the logic diagram and explain 5 Simplify the following 5 variable Boolean expression using Quine Mccluskey method F=∑m(0.2.8.7.22.3.4.3.2.3.11.1.4.5.6.14.1.C.1.23.Unit-II (a) Design a logic circuit to produce an output when any two or three or four switches are closed 1 (b) Minimize the following Boolean functions using k map F=∏(2.8.9.30)+d(8.7.Realize using Nand gates 7 Implement the following Boolean function using 8 to 1 mux f=∑m(0.13.8. 2.6) D==∑m(1.O For the machine given below find the equivalence partition and a corresponding reduced machine in standard form PS NS.0 D. Hold time 6 2.Z X=0 X=1 A B.2.3. Propagation delay time 7 Give the comparison between synchronous and asynchronous sequential circuits 8 Convert SR Flip flop to JK flip flop 9 Construct a JK flip flop using a D flip flop. Also Explain excitation tables of all these flip flops Unit-IV 1 Explain capabilities and limitations of finite state state machine Find the equivalence Partition for the given machine and a standard form of the corresponding reduced machine PS 2 3 NS.0 E B.Z X=0 X=1 GURU NANAK INSTITUTE OF TECHNOLOGY . D and T type flip flops.1.1 E. Set up time 3.6) 5 B==∑m(0.5.SR.0 C D.7) C==∑m(2.6.7) Define the following terms of a flip flop 1.4.1 A. a 2*1 Multiplexer and inverter 10 Obtain the characteristic equations of JK.0 B E.0 D C.0 D.0 E.Tabulate the PLA programmable table for the four Boolean functions listed below A==∑m(1. 1 F D.1 Find the equivalence partition for the machine shown below.1 B G.0 A.1 H B.1 F E.1 H C.1 C.1 F.1 D C.0 D C.0 F.0 C.0 B.1 G E.1 G C.1 B F.1 D.1 C.1 E.1 B F.1 G.0 A.1 A.0 H.Z X=0 X=1 A F.1 Find the equivalence partition for the machine shown below PS 4 5 NS.1 D C.1 E C.1 E.1 E.1 D.1 E D.1 D.1 F C.1 G D.Show a standard form of the corresponding reduced machine PS NS.1 E D.A D.0 A.1 C B.0 F.0 B.0 E.1 GURU NANAK INSTITUTE OF TECHNOLOGY .1 C D.Z X=0 X=1 A B.1 H.1 C D.1 D. 3. PROGRAM EDUCATIONAL OBJECTIVES: COURSE OUTCOMES: 1. A(x.3. 5 Write a notes on a) ROM b) RAM c) PLA d) PAL D.z) = ∑m(0.draw and explain 128 * 8 ROM using 32 * 8 ROM. 2 I . B(x.z) = ∑m(1.6) III. Draw and explain its truth table and logic diagram. Students could able to design sequential circuits. Students could able to design combinational circuits.3.y. 4 Using PLA logic. GURU NANAK INSTITUTE OF TECHNOLOGY .4. 2. C(x. 4) 3 Design . What is PLA ? 1 B. 4.y.y.2. Students could able to understand the number systems.Unit-V A. What are the different types of ROM ? Tabulate the PLA programming table for the following Boolean functions.7) II.z) = ∑m(1. They should in a position to continue with computer organization. implement a BCD to excess -3 code converter. 4. To understand the Boolean algebra and minimization logic. 2. To understand basic number systems codes and logical gates. 3.LESSON PLAN Subject ELECTRONICS DEVICES AND CIRCUITS Faculty GURU NANAK INSTITUTE OF TECHNOLOGY . ELECTRONIC DEVICES AND CIRCUITS A. To understand the basics of various memories.COURSE EDUCATIONAL OBJECTIVES: 1. sequential circuits. To understand the design of combinational. L. 5 Ed. 2013. Singh. 1998. Bell. Millman. Ltd. Pearson.C. 2 Ed..Text Books (to be acquired by the Students) Millman’s Electronic Devices and Circuits – J. Halkias and Book 1 SatyabrataJit.. VarshaAgarwal.Vallavaraj. 2006. Electronic Devices and Circuits – Anil K. TMH Electronic Devices and Circuits – R.. 2008.Salivahanan. 2 Ed. 2Ed. Millman and Christos C. Halkias.Suresh Kumar. C. 1991 ed. Rekha Singh.. A. TMH. PEI/PHI. Oxford Book 3 Reference Books Book 1 Book 2 Book 3 Book 4 Book 5 Book 6 Unit Integrated Electronics – J. P. Boylestad and Louis Nashelsky. Chapters in Book No of Classes Topic B1 B2 B3 B4 B5 I P-N Junction Diode II Rectifiers and Filters III Bipolar Junction Transistor and UJT Transistor Biasing and Stabilization Field Effect Transistor and FET Amplifiers\ IV V 1.SYLLABUS GURU NANAK INSTITUTE OF TECHNOLOGY 12 56 2 2 2 2 64 . 2008. Wiley India Pvt. Lal Kishore. 2013 Electronic Devices and Circuits – David A.. Maini. 2005.. Electronic Devices and Circuits – B. 1 Ed. 5 4 2 6 3 8 7 3 12 8 12 9 12 Contact classes for syllabus coverage Lectures beyond syllabus Special Descriptive Tests Tutorial classes Remedial classes Total No. CengageLearing. Electronic Devices and Circuits . of classes B. 9 Ed. 2009. Electronic Devices and Circuits – S. 2ed. N. Book 2 Electronic Devices and Circuits – Mohammad Rashid. BSP. TMH.K. Stabilization Factors. principle of operation. Collector Feedback Bias. Diode Equation. Common Emitter and Common Collector Configurations. L. Limits of Operation . BJT Symbol. BJT Operation. The JFET Small Signal Model. Diode Equivalent Circuits. and CC Amplifier Configurations. Full wave Rectifier. Transition and Diffusion Capacitances. π.Volt-Ampere characteristics. GURU NANAK INSTITUTE OF TECHNOLOGY . MOSFET (Construction. MOSFET Characteristics in Enhancement and Depletion modes.Unit – I P-N Junction Diode: Qualitative Theory of P-N Junction. Capacitor Filters. Common Base. BJT Hybrid Model. Bias Stability. P-N Junction as a Diode. CE. Breakdown Mechanisms in Semiconductor Diodes. Comparison of Filters. FET Amplifiers: FET Common Source Amplifier. symbol). SCR and Semiconductor Photo Diode. Comparison of CB. Emitter Feedback Bias. Unit – II Rectifiers and Filters : The P-N junction as a Rectifier.Section Filters. Generalized FET Amplifier. Analysis of a Transistor Amplifier Circuit using h-Parameters. Transistor Current Components. Bridge Rectifier. Unit – III Bipolar Junction Transistor and UJT: The Junction Transistor. symbol) –Pinch-off Voltage . Transistor as an Amplifier. Special Purpose Electronic Devices: Principle of Operation and Characteristics of Tunnel Diode (with the help of Energy Band Diagram). Inductor Filters. BJT Specifications. Temperature dependence of VI characteristic. Varactor Diode. Unit – V Field Effect Transistor and FET Amplifiers Field Effect Transistor: The Junction Field Effect Transistor (Construction. FET as Voltage Variable Resistor. Need for Biasing. Bias Compensation using Diodes and Transistors. Stabilization against variations in VBE and β. Fixed Bias. UJT and Characteristics. Thermal Runaway. The DC and AC Load lines. principle of operation. Ideal versus Practical – Resistance levels (Static and Dynamic). Load Line Analysis. Collector . Unit – IV Transistor Biasing and Stabilization: Operating Point. Zener Diode Characteristics. Thermal Stability. Voltage Divider Bias. Voltage Regulation using Zener Diode. Common Drain Amplifier. Volt-Ampere Characteristics. Biasing FET. Half wave Rectifier. Transistor Construction. Harmonic components in a Rectifier Circuit.Section Filters. Comparison of BJT and FET. Determination of h-parameters from Transistor Characteristics.Emitter Feedback Bias. Draw the band diagram of pn junction under open circuit conditions and explain.Section filters Derive the following expression for (a) Ripple in a π . CB. (c) Ripple factor in a full wave rectifier using an inductor filter. (d) D. i. or average value of current. RMS current iv. R. L-section and Π section filters Compare half wave. PIV ii. Average dc.C. electric field intensity and potential energy biased for electrons and holes. (b) The ripple factor of half wave rectifier and full wave rectifier. Ripple factor. value of current and Average voltage across the load for a half wave rectifier.C.S. active region and saturation region of a transistor output characteristic. Define α.section filter when used with a half wave rectifier. Explain the mechanism of current flow in a PNP and NPN Transistor Draw neat sketches and explain the cut off region.NO. and CC configurations with regions of operation and explain What is meant by base width modulation? Explain how input characteristics can be affected due to this effect. GURU NANAK INSTITUTE OF TECHNOLOGY . ASSIGNMENT QUESTIONS S. (ii) Diffusion capacitance and transition capacitance Explain the term Transition capacitance CT of a PN junction diode Explain the process of breakdown of a p-n junction diode due to (i) Avalanche effect (ii) Zener effect UNIT-II 6 7 8 9 10 UNIT-III 11 12 13 14 15 Define the terms as referred to Full wave rectifier circuit. L-Section and p . Distinguish between (i) Drift current and diffusion current. Full wave and Bridge rectifier Compare the performance of series inductor. of a transistor show have they are related to each other Draw the input and output characteristics of transistor in CE. Compare the performance of inductive. Sketch charge density.M. Voltage iii. UNIT-I 1 2 3 4 5 QUESTIONS Explain the principle with necessary equations how do you determine whether a given semiconductor is p-type or n-type. ß. UNIT-IV 16 17 18 19 20 21 22 23 24 25 UNIT-V 26 27 28 29 30 31 32 33 34 35 Write down the need for bias stabilization Write down the requirements of a biasing circuit Explain briefly about the simplest biasing circuit Explain thermal instability Draw a BJT fixed bias circuit and derives the expression for the stability factor’s’ Draw the h-Parameters equivalent circuit of CC. CE configuration and what are the typical values of h-Parameters for a transistor in CE and CB configuration Draw the circuit diagram of small signal CE amplifier circuit and give its equivalent hybrid model. AV. Draw the circuit diagram of a saw tooth wave form generator using UJT and explain its operation Discuss why transistor is considered as current control device and why FET is considered as voltage controlled device Draw the circuit diagram of common drain amplifier and derive expressions for voltage gain and input resistance GURU NANAK INSTITUTE OF TECHNOLOGY . input resistance RI and out resistance RO Mention the advantages of and disadvantages of graphical analysis of the operation of transistor as an amplifier Draw a low frequency equivalent circuit for a CC amplifier and derive the relations for the current gain. Sketch the depletion region before and after pinchoff Draw and explain the VI characteristics of JFET Define Tran conductance gm. Compare transistor amplifier configurations related to AI. and Amplification factor µ of an FET Draw and explain the drain characteristics and transfer curve of Enhancement MOSFET Explain the biasing of JFET Study thoroughly and list out different types of uni-polar and bi polar devices and compare their salient features xplain the working principle of UJT with its characteristics. voltage gain and input resistance in terms of h-parameters How does the FET behave for the small and large values of | VDS | Define pinch –off voltage Vp. Drain resistance rd. 4. Introducing the theory of bipolar transistor by this.D. The objective is to enable students to analyze simple but important applications of these devices in electronic circuits COURSE OUTCOMES: Upon successful completion of this course. Ability to know and to understand the categories in the field of solid state materials and get to know about the importance of semiconductors. Know the complete internal structure of PN junction including types of bias. Introducing the theory of channel effect transistors. Application of diode in power supply circuits by rectifiers. 2. students should be able to: 1. computation and control. Consequently view the nature of electronics compromising 4 C’s components. PROGRAM EDUCATIONAL OBJECTIVES: COURSE OBJECTIVES: This course aims to provide students with the basic concepts behind the design and operation of common semiconductor devices and electronic circuits. to know about the operation. Know the property of semiconductor materials by projecting the view of energy bands and analyzing the characteristics of semiconductor components like diode. biasing effects and stabilization of factors. 3. 6. by analyzing then to introduce the GURU NANAK INSTITUTE OF TECHNOLOGY . 7. communication. introducing the hybrid models to know how to block the large capacitive values and to know about how small signal models are needed in various configurations to determine frequency response and phase operations of voltage gain and application of configurations in hardware implementations. filters and by regulation using zener diode. 5. Basic Electrical Engineering –By T.2. And get to apply the concept of charge inversion on MOSFET.SudittaNath Principles of Electrical Engineering – By V. 10. Idea of digital electronics.Chand Publications.P.PHI Basic Electrical Engineering -By D.S.By S. Sukhija Oxford University Press Fundamentals of electrical engineering –By RajendraPrasad.K Mehta. LESSION PLAN Subject BASIC ELECTRICAL ENGINEERING Faculty Book 1 Text Books (to be acquired by the Students) Basic Concepts of Electrical Engineering – By P.concept of MOS transistor and to know the operation of MOS transistor. Scope to introduce digital circuits.S.2 1. 8.Nagasarkar and M.Subramanyam Book 2 Basic Electrical Engineering . 9. 2 1.Kothari& I.J. Further to know the knowledge in the field of solid or integrated circuit technology and its trends. S.Singh Book 3 Book 4 Book 5 Book 6 Book 7 Unit I Reference Books Basic Electrical engineering – By .K.3 1.Chandrakumarchanda.McGraw Hill Chapters in Book No of Topic Classes 1 2 3 4 1. Gain the idea of MOSFET later to know the structure CMOS by considering the factors in application of determining digital circuits.2 17 INTRODUCTION TO ELECTRICAL ENGINEERING GURU NANAK INSTITUTE OF TECHNOLOGY .Tata-McGraw Hill AbijitCharbartha. BASIC ELECTRICAL ENGINEERING A. Nagrath .N. 7 6 8 09 9. types of elements . the J operator and phasor algebra. resistive networks.8 7. inductive networks. form factor and peak factor. Simple problems. types of sources. Kirchhoff’s laws. star delta and delta star transformation . Thevenins’s. 5 3. capacitive networks.II ALTERNATING QUANTITIES III IV V TRANSFORMER DC & AC MACHINES BASIC INSTRUMENTS 4.4 4 5 12 6 6. waveforms and basic definitions. UNIT-2 Principle of ac voltages . Network AnalysisBasic definitions. analysis of dc networks and simple problems. series parallel circuits. root mean square and average values of alternating currents and voltage. phasor representation of alternating quantities.10 10 9 11 Contact classes for syllabus coverage Lectures beyond syllabus Special Descriptive Tests Tutorial classes Remedial classes Total No.10 7. analysis of ac circuits with single basic network element. single phase series circuits GURU NANAK INSTITUTE OF TECHNOLOGY .8 8 15 10 9. SYLLABUS BASIC ELECTRICAL ENGINEERING SYLLABUS UNIT-1 Ohm’s law. Network theorems-Superposition. of classes 64 2 2 4 2 74 B. basic circuit components. Transformer Tests. Moving Iron of Ammeters and Voltmeters(Elementary Treatment only) C. GURU NANAK INSTITUTE OF TECHNOLOGY . Efficiency and Regulation calculations(All the above topics are only elementary treatment and simple problems) UNIT-5 Basic Instruments : Introduction. Efficiency and Regulation calculations(All the above topics are only elementary treatment and simple problems) UNIT-4 Principles of operation. ASSIGNMENT QUESTIONS UNIT – I 1 Explain the terms a) voltage b) current c) power d) energy . 2 Explain the Ohm’s law? Explain the Kirchhoff’s Laws? . Ideal transformer and practical Transformer. classification of instruments.UNIT-3 Principles of operation. Losses. 3 Explain the Thevenin’s theorem? 4 Derive the expression for star-to-delta transformation? 5 Explain KVL & KCL. essential features of measuring instruments. Moving coil permanent magnet (PMMC) instruments. Constructional Details. Transformer Tests. operating principles. Ideal transformer and practical Transformer. Losses. Constructional Details. 700watts from supply with o.c on 1 secondary sc.C.02 Wb.5 e-6 faradas and 8 applied voltage E=230v and angular frequency is 320 radians. primary takes I1=10A at 160v & 1000w. Machine with a help of a neat sketch. 1 o. C=0. The motor current is 10A and the flux per pole is 0. 808w 5 calculate parameters of HV side 16 17 18 Unit-IV a) Explain the constructional features of a D.c test LV side . Series (ii) D.50hz. b) Name the main parts of a D.C.C.595kw. explain torque-speed characteristics of he following D. find the voltage across elements and draw the phasor diagram ? 9 Explain behavior of voltage and current in pure resistive circuit? 10 Derive the expression for power in capacitive circuit? UNIT: III 1 Explain the Working principle of transformers? 1 1 Derive the expression for EMF equation of transformer? 2 1 Derive the expression for condition of maximum efficiency of a practical 3 transformer? A 1-Ø transformer 600kv. 100v.110v. Explain the working principle of a dc motor and derive the expression for the torque developed in armature? (a)With the help of neat sketches. Motors (i) D.09ohm and the flux per pole is 30 mwb . Determine ‘efficiency’ 4 at p. it takes 32 A from the supply mains and develops o/p power of 5. 200/110 v .6000w. L=10xe3 henries.the field winding takes 1 A . Machine and state the materials of which each part is made.5a.calculate(i)the speed(ii)the torque developed in Newton-meter? GURU NANAK INSTITUTE OF TECHNOLOGY .C. 10a.UNIT – II 6 Explain the terms a) cycle b) frequency c) tie period d) peak value 7 Compare the series and parallel circuits? For RLC series circuit. R=200 ohms. 20.8 & find secondary Il at which maximum efficiency is occurred? A 50kva. 400w SC test HV side – 90v.C. transformer has full test results .220 V shunt motor has 540 lap wound conductor. Shunt (b)Find the torque in N-m exerted by a 4-pole series motor whose armature has 1200 conductors connected up in a 2-circuit winding.f=0. c)A 4-pole .the armature resistance is 0. 250 V d. GURU NANAK INSTITUTE OF TECHNOLOGY . To introduce the concepts of Electrical Engineering and basic Circuits. Determine the total armature power developed when working (i) as generator delivering 20 kw output and (ii) as a motor taking 20 kw input.04and 200 respectively. What modifications must be made to the instrument to convert it to (i) an ammeter reading of 15 A (ii) an volt meter reading of 15 V Explain the steps involved in the extension range of voltmeters. The coil of a moving coil meter has a resistance of 5 ohms and given full scale deflection When a current of 15mA passes through it.c. 3. 20 Unit-V 21 22 23 24 25 What is the essential torques in an electrical instrument? (a) Explain principle and operation of PMMC with a neat sketch (b) The coil of a moving coil meter has a resistance of 5 ohms and given full scale deflection when a current of 15A passes through it. Explain the construction and working principle of 3-phase induction motor. shunt generator has armature and field resistances of 0. . To introduce the Electrical Transformers.19 ( a)What are all the various losses in a D.C. Machine? (b) Derive an expression for efficiency of a D. To clearly understand fundamentals of Alternating Quantities.What modification must be made to the instrument to convert it in to i)an ammeter reading to 15A ii) an voltmeter reading to 15V Describe different methods to produce control torque. COURSE EDUCATIONAL OBJECTIVES (CEO’S): 1. (c) A 20 kw. Machine.C. 2. i) Able to design the AC and DC measuring instruments GURU NANAK INSTITUTE OF TECHNOLOGY . h) Understand the classifications of instruments.4. To design the basic Measuring Instruments COURSE OUTCOMES (CO’S): On successful completion of the module students will be able to: a) Understand the basic concepts of Electrical quantities and its characteristics. To introduce the design of DC & AC Machines 5. e) Understand the DC Generator and its characteristics. g) Understand the concept AC Machines and is characteristics. f) Understand the DC Motor with different loads. d) Able to understand the ideal and practical Transformers. b) Able to design different electrical circuits c) Understand the concept of AC quantities and its waveforms. Datta and M. Sarma. Tutorial : 03 Total Classes 65 GURU NANAK INSTITUTE OF TECHNOLOGY .Cengage Publications Book 5 2.D.2 II Multiple Random variables.K. Mathematics for Engineers by K.Iyengar&B.Krishna Gandhi Et Unit Topic Chapters in the Books 1 2 1 No of Classes 3 I Single Random variables and probability distributions 1.Ross. Khanna Publishers 2) Probability and Statistics for Engineers and Scientists by Sheldon M. Reference Books Book 4 .Srinivas. LESSON PLAN Subject Probability & Statistics Faculty Text Books (to be acquired by the Students) Book 1 Book 2 1) Higher Engineering Mathematics by Dr.PROBABILITY & STATISTICS A. Grewal.2 2 15 IV Queuing Theory: 3 V Stochastic processes 3 15 4 10 3 10 Contact classes for syllabus coverage 60 Contact classes for syllabus coverage: 60 Unit test:02. Correlation & Regression 1. Academic Press Book 3 3) Operations Research by S.B. B.2 2 10 III Sampling Distributions and Testing of Hypothesis 1. Probability and Statistics by T.S.V.A S. Unit – II Multiple Random variables. Parameter estimations – likelihood estimate. confidence interval. Arrival and service processes.Pure Birth-Death process Deterministic queuing models. mass function/ density function of a probability distribution. Probability distributions. Level of significance. equal and unequal variances) (ii) Tests of significance of difference between sample S. parameter. Correlation -Coefficient of correlation. sampling distribution. Types of sampling. M/M/1 model of finite queue . Standard error. statistic.M/M/1 Model of infinite queue. Poisson & normal distributions and their properties. GURU NANAK INSTITUTE OF TECHNOLOGY .Regression Coefficient.Joint probability mass /density function. Transient and steady states. interval estimations Testing of hypothesis: Null hypothesis. Correlation & Regression: Joint probability distributions. two sided test. Marginal probability mass / density functions. Mathematical Expectation Moment about origin.distribution and its properties. its properties. Regression. One sided test. The rank correlation. Binomial.D. Sampling Distributions and Testing of Hypothesis Sampling: Definitions of population. generating function of probability distribution Central moments Moment.D and population S. type I. and hence finding the mean and variance. Test of significance difference between sample mean and population mean. The lines of regression and multiple correlation & regression. difference between means of two small samples Seducer’s F. Unit – IV Queuing Theory: Structure of a queuing system. its properties. Expected values of Sample mean and variance. Sampling distribution of means and sampling distribution of variance. Covariance of two random variables. Test of equality of two population variances Chi-square distribution. Small sample tests: Student t-distribution. sampling. Alternate hypothesis.B. (iii) Tests of significance difference between sample proportion and population proportion & difference between two sample proportions. Operating Characteristics of queuing system. & type II errors – critical region. Chi-square test of goodness of fit. Terminology of Queuing systems. SYLLABUS Unit – I Single Random variables and probability distributions: Random variables – Discrete and continuous. Moment generating functions of the above threedistributions. Large sample tests: Unit – III (i) Test of Equality of means of two samples equality of sample mean and population mean (cases of known variance & unknown variance. 6 }. In a sample of 1000 cases.8. Assuming the distribution to be normal. Calculate karlpearson’s correlation co-efficient for the following data X 28 41 40 38 35 33 40 32 36 33 Y 23 34 33 34 30 26 28 31 36 38 2. Markov chain. of accidents are a) at least one b) at most one 5. Classification of Random processes. C. find how many students will have 1) Score between 12 and 15? 2) Above 18? 6. Out of 800 families with 5 children each. Stable Unstable Total GURU NANAK INSTITUTE OF TECHNOLOGY .b) in S the maximum of its numbers i. Methods of description of random processes.5. the mean of a certain test is 14 and S. Fit a Poisson distribution for the following data. Stationary and non-stationary random process.Also find the mean and variance of the distribution.Unit – V Stochastic processes: Introduction to Stochastic Processes –Classification of Random processes. Determine the probability that the no.ASSIGNMENT PROBLEMS UNIT – I 1. Average no of accidents on any day on a national highway is 1.D is 2. classification of states –Examples of Markov Chains.38 91.Find the probability distribution.85 31.5. The following table gives the classification of 100 works according to sex and nature of work. 3.e..b) .3.4. 2. Stochastic Matrix.29 5. By the method of least squares fit a parabola of the form y= a+ bx +cx2 for the following data X 2 4 6 8 10 Y 3. X is a random variable with X(s) = { 1.07 12.2. Find the two regression lines from the following data? X 78 77 85 88 87 82 81 77 76 83 97 93 Y 84 82 82 85 89 90 88 92 83 89 98 99 4.Let X assigns to each point (a. From the following data calculate the rank correlation co-efficient after making adjustment for tied ranks? X 48 33 40 9 16 16 65 24 16 57 Y 13 13 24 6 15 4 20 9 16 19. If x is a Poisson variate such that 3p(x=4)=1/2 p(x=2)+p(x=0). X(a.b) = max (a.47 57. Test whether the nature of work is independent of the sex of the worker. UNIT – II 1. x:0 1 2 3 4 f : 109 65 22 3 1 4. how many would you expect to have a) 3 boys b) 5 girls c) either 2 or 3 boys d) at least 1 boy? Assume equal probabilities for boys and girls. Two dice are thrown . Methods of description of random processes Markov process. find a) the mean of x b) p(x≤2) 3. Level of significance v.06 with at least 95% confidence. 5.12. It is estimated that 20 customers will arrive each hour on average. the time of completing payment follows an exponential distribution with GURU NANAK INSTITUTE OF TECHNOLOGY .05 with v1 = 7 and v2 = 15 b) F0. Critical region. A bank plans to open a single sever drive-in banking facility at a certain centre . 3. b).8.5 and the standard deviation s = 8. iv. Also calculate 95% confidence interval for the population. 2.find a) F0.D is 10.Queue or Waiting line. Statistical hypothesis and it’s types. 4. 2.95 with v1 = 19 and v2 = 24 c ) F0. Types of errors. Test whether the sample has come from a population with mean 38.5 ? 6. Define a).Male Female Total 40 10 50 20 30 50 60 40 100 6. UNIT . b. a . A random sample of size 25 from a normal population has the mean x = 47.III 1 . 3. Does this information tend to support or refuse the claim that the mean of the population is µ = 42. The mean of the sample is 40. Consider all samples of size two which can be drawn without replacement from this population. A toll gate is operated on a freeway where cars arrive according to a Poisson distribution with mean frequency of 1. Queue discipline.99 with v1 = 28 and v2 = 12 UNIT – IV 1.20. For an F-distributin . Show that the maximum value of rank correlation coefficient is 1. Find a) the population mean b) The population standard deviation c) The mean of the sampling distribution of means d) The standard deviation of sampling distribution of means. A sample of 400 items is taken from a population whose S.01 with v1 = 24 and v2 = 19 c ) F0. What is the size of the small required to estimate an unknown proportion to within a maximum error of 0. determine a) the proportion of time that the system will be idle b) On average .4 . how large a sample be needed so that one will be able to assert with 90% confidence that the sample mean is off by most 10 hours. if on average .16.2 cars per min. iii. it requires 2 minutes to process a customer’s transaction. ii. A population consists of six numbers 4. It is desired to estimate the mean number of hours of continuous use of a certain computer will first require repairs. how long a customer will have to wait before reaching the sever c) The fraction of customers who will have to wait.24. Define i. If it can be assumed that σ = 48 hours. 6.Define a). iii. b). The idle time of the counter. vi.5 0 0. A always throws the ball to B and B always GURU NANAK INSTITUTE OF TECHNOLOGY .5 . Consider a box office ticker window being managed by a single server . Where would you require more time waiting included to complete a hair cut. Customers arrive in his shop at an average rate of one every 30 min. Customer arrive to purchase tickets according to poisson input process with mean rate of 30 per hour. b). 5. 1 / 2 c). ii. The probability that a car spends more than 30 sec. Assuming that the service time distribution is exponential.B and C are throwing a ball to each other . Barber a takes 15 min.7 0 0.He stops playing if he loosesRs. Which of the following matrices are stochastic? 0 1 0 1 / 2 1 / 4 1 / 4 0 1 / 3 2 / 3 4 / 3 1 0 1 0 1 1/ 2 a). in the system.Where would you expect a bigger queue? b). Find i. Define stochastic process and its types. 1 at a time and wins Rs. Stochastic matrix.8 4.2 0. to complete one hair cut. 2. b) The average number of customers queuing for service. Markov chain. UNIT – V 1. Patients arrive at a clinic in poisson manner at an average rate of 6 per hour . A gambler has Rs. find a) Average number of patients waiting in queue b) Average time spent by a patient in the clinic. 1 / 2 1 / 2 5. v. The transition probability matrix of a Markov chain is given by 0. iv. The Arrival processes are Poisson and the service times follow an exponential distribution. He bets Rs. a) What is the Transition probability matrix of the related markov chain ? b) What is the probability that he has lost his money at the end of 5 plays ? 6.mean of 20 sec. and Customers arrive in his shop at an average rate of one every 50 min. 3. a). The time required to sever a customer has an exponential distribution with mean a mean of 910 seconds. Determine a) Fraction of the time the server is busy. 1 with probability 0. Three boys A. to complete one hair cut. Average no of cars in the queue. Average no of cars in the system.6 0. Average time that a car spends in the queue. Average time that a car spends in the system. 2 or wins Rs. Barber B takes 25 min. 4. The doctor on average can attend to 8 patients per hour. 2 .1 0. 4.4 0. Show that the process is Markovian. General knowledge of methodological approaches in econometrics (e. maximum likelihood. COURSE OUTCOMES: GURU NANAK INSTITUTE OF TECHNOLOGY . and analysis of data. simulation and Monte Carlo techniques). Do all the states are ergodic ? D. least squares. necessary skills may include knowledge of advanced statistical concepts. design of experiments.Find the transition matrix and classify the states.g. collection of data. PROGRAM EDUCATIONAL OBJECTIVES: COURSE OBJECTIVES: These graduates will develop the statistical skills needed for their own research programs. non-parametric models. Depending on particular graduate needs. general method of moments.throws the ball to C but c is just as likely to throw the ball to B as to A.. Understand linear algebra and mathematical statistics that are the foundation for econometric analysis. Apply concepts and skills to solve problems that arise in other disciplines. Be proficient with statistical software packages appropriate for needed data analysis. Be proficient with multiple statistical software packages and use appropriate statistical software for data analysis.: Demonstrate proficiency in analyzing data using methods embedded in their courses. GURU NANAK INSTITUTE OF TECHNOLOGY . Demonstrate understanding of statistical concepts embedded in their courses. Week1: Write a C program that uses functions to perform the following: a) Create a singly linked list of integers. graphs. Implement the stack using an array. b) Delete a given integer from the above linked list. trees. queues. b) Delete a given integer from the above doubly linked list. c) Display the contents of the above list after deletion. To write and execute write programs in C to implement various sorting and searching methods. b) Traverse the above Binary search tree recursively in Post order. b) Traverse the above Binary search tree non recursively in inorder. linked lists. Week7: Write C program for implementing the following sorting methods to arrange a list of integers in Ascending order: GURU NANAK INSTITUTE OF TECHNOLOGY .DATA STRUCTURES LAB Objectives: To write and execute programs in C to solve problems using data structures such as arrays. Week3:Write a C program that uses stack operations to convert a given infix expression into its postfix Equivalent. Week2: Write a C program that uses functions to perform the following: a) Create a doubly linked list of integers. c) Display the contents of the above list after deletion. Recommended Systems/Software Requirements: Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM and 100MB free disk space. C compiler. Week5: Write a C program that uses functions to perform the following: a) Create a binary search tree of characters. Week6: Write a C program that uses functions to perform the following: a) Create a binary search tree of integers. Week4:Write C program to implement a double ended queue ADT using i)array and ii)doubly linked list respectively. stacks. hash tables and search trees. 2.S. Data Structures using C.B.Sharma. C and Data Structures. C and Data Structures. Prof. Week12: Write C programs for implementing the following graph traversal algorithms: a)Depth first traversal b)Breadth first traversal TEXT BOOKS: 1. 4. debuggers and trouble shooting. Week11: Write a C programforimplementingKnuth-Morris- Prattpatternmatchingalgorithm.K. 2ndedition. Graduate able to design and analyze the time and space complexity of algorithm or program. Outcomes: 1. P. Hi-Tech Publishers. N. ii)Write a C program for implementing Heap sort algorithm for sorting a given list of integers in ascending order.Padmanabham. Data structures using C. 2.Radha Krishna. P. 5.Deshpande and Prof. R. C Programming and Data Structures.S. Oxford University Press. BS Publications. Third Edition. Pearson. 3. C and Data Structures. P.a) Insertion sort Week8: Write C b) Merge sort programs for implementing the following sorting methods to arrange a list of integers in ascending order: a) Quick sort b) Selection sort Week9:i)Write a C program to perform the following operation: a)Insertion in to a B-tree. Ability to effectively use compilers includes library functions.Venkateswarlu and E.G.Prasad. A. GURU NANAK INSTITUTE OF TECHNOLOGY .V. Kakde. Ability to identify the appropriate data structure for given problem. O. 3. 6.Chand. Dreamtech Press.Thareja. Week10: Write a C program to implement all the functions of a dictionary (ADT) using hashing. 5. Brake test on three phase induction motor (performance characteristics). 4. Brake test on DC shunt motor. Magnetisation characteristics of DC shunt generator. Experimental determination of Theremin’s theorem. Verification of maximum power transfer theorem. 7.8 BASIC ELECTRICAL ENGINEERING LAB PART-A 1. PART-B GURU NANAK INSTITUTE OF TECHNOLOGY . Verification of super position and reciprocity theorems. Determination of the performance characteristics. 3. 7. 2. OC&SC Test on single phase transformer(predetermination of efficiency and regulation at given power factors). verification on DC with resistive load. Swinburne’s test on DC shunt machine(Pre-Determination of efficiency of a given DC shunt machine working as motor and generator). 6. Zener diode characteristics.5. 4. Reverse bias) 2. Rectifier without filters (full wave and half wave). Transistor CE Characteristics (input and output). Rectifier with filters (full wave and half wave). P N Junction diode characteristics (Forward bias. GURU NANAK INSTITUTE OF TECHNOLOGY . 3. 1.