Chhattisgarh Swami Vivekanand Technical University, Bhilai
Scheme of teaching and examination
B.E. V Semester Computer Science & Engineering
Periods per week S. No Board of Study Subject Code Subject Name L 1 Electronics & Telecomm. 2 Comp Science & Engg 3 Comp Science & Engg 4 Comp Science & Engg 5 Electronics & Telecomm. 6 Comp Science & Engg 7 Comp Science & Engg 8 Comp Science & Engg 9 Comp Science & Engg 10 Electronics & Telecomm. 11 Humanities 12 Comp Science & Engg 328515( 28) 322512( 22 ) Microprocessor & Interfaces Analysis and Design of Algorithms 3 3 3 3 3 3 18 T 1 1 1 3 Credit Total L+(T+P) Theory / Practical Marks /2 P ESE CT TA 4 4 4 4 2 1 80 80 80 80 80 80 40 40 40 40 20 20 20 20 20 20 20
Scheme of exam
120 120 120 120 120 120 60 60 60 60 20 20 1000
3 4 4 4 3 3 2 2 2 2 1 1 31
20 20 20 20 20 20 20 20 20 20 20
322513( 22 ) Operating System 322514( 22 ) Theory of Computation Principles of Communication System Database Management 322516( 22 ) System Principles of 322521( 22 ) Communication Lab Database Management 322522( 22 ) System Lab 322515( 28 ) Software Technology Lab – 2 (Java) Microprocessor & Interfaces 322524( 28 ) Lab 322523( 22 ) 300525( 46 ) Personality Development 322526( 22) TOTAL *Practical Training Evaluation and Library
19 640 120 240
L-Lecture, T- Tutorial, P- Practical, ESE- End Semester Examination, CT- Class Test, TA- Teacher's Assessment * To be completed after IV Semester and before the commencement of V Semester
UNIT – IV Interrupts: Restart Instruction. 8255 (PPI). Multiple Interrupts and Priority Concepts: Interrupt Structure of 8085: Instructions related to interrupts: Pending Interrupts: Use of Interrupt and Handshaking Signals in Interfacing: Application of Interrupts and Illustrative Programs. PHI
. BCD to Binary. BHILAI (C. Ghosh & Sridhar.
UNIT – III Data Transfer and Device Selection: Format of Data Transfer: Modes of Data Transfer: Type of I/O Addressing: Condition of Data Transfer: Microprocessor Controlled Data Transfer: Peripheral Controlled Data Transfer: Absolute and Linear Select Decoding: Memory and I/O Interfacing: Use of Decoders Selection: Memory organization and Mapping. Generation of Control Signals: Bus Timings: Demultiplexing of address / data bus. internal register & flag register. Instructions Format: Stacks. Binary to ASCII. Wiley Eastern 2. Binary to Seven-Segment LED Display. Timing Diagram. Initialization Instruction. Pin Configuration and Function. TMH 3. 8355/8755 (ROM).G. Looping and Counting: Software Counters with Time Delays: Simple Programs using Instruction Set of 8085: Debugging: Programs Involving Subroutines. ASCII to Binary: Program for Addition Subtraction: Programs for Multiplication and Division of Unsigned Binary Numbers. PHI 2. Architecture of 8085.g. PHI. Interfacing and Simple Programmes to generate various types of signals. Arithmetic and Logical Operations. 0000 to 8085: Introduction to Microprocessor for Engineers and Scientists. S. Gaonkar.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSIT.
UNIT – V Architecture of Peripheral Interfacing Devices: Architecture. Architecture. USART (8251)
Name of Text Books: 1. Name of Reference Books: 1. Subroutine and Related Instructions. Microprocessors: Theory and Applications – Intel and Motorolla. Binary to BCD. Bose. Rafiquuzzaman. Microprocessor Architecture. Assembler Directives. Instruction Cycle. Simple programs like Initialization and I/O operations of the ports. Timer operation of 8155. Srinath. Instruction Timings and Operation Status. description and initialization of Keyboard and display interface (8279). 4. Pin Configuration. Execute Cycle. Programmable Internal Timer 8253/8254: Block Diagram. Pin Diagram and functioning of 8155/8156 (RAM). New Age International Publishers. 8085 Microprocessor Programming & Interfacing – N. Programs for Code Conversion e. Digital Computer Electronics – Malvino. Fetch Cycle. Addressing Modes. Modes.
UNIT – II Instruction Set and Programming with 8085: Instruction for Data Transfer. Hardware Implementation: Interrupt Processing. Pin diagram.)
Semester : V Subject: Microprocessor & Interfaces Total Theory Periods: 40 Total Marks in End Semester Examination: 80 Minimum number of Class tests to be conducted: 2 Branch: AEI/CS/EI/EEE/ET&T/IT Code: 328515 (28) Total Tutorial Periods: Nil
UNIT – I Microprocessor Architecture: Introduction to Microprocessors. Branching Operation: Machine Cycle Concept. Programming and Application by R. Elementary Concepts of Assemblers. Digital Systems – From Gates to Microprocessors by Sanjay K.
Growth function: Asymptotic notation. Cormen.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. Floyd-Warshall’s all pairs shortest path algorithm and its refinement for computing the transitive closure of a graph. 2. Topological sorting of nodes of an acyclic graph & applications. Reference Books: 1. different methods of solution of recurrence equations with examples. The relationship in Dijkstra’s and Prim’s algorithms. Levitin. Linear time selection algorithm. Red Black tree. clique problem. Standard notation & common functions. Backtracking & Recursive backtracking. Galgotia. Introduction to Algorithms (Second Edition). Rivert. Linear time analysis of the KMP algorithm.G. PHI. Lelserson. Text Books: 1. G. Algorithm types. Disjoint Set.Gonnet. Depth first search & Breath first search on graphs. The general string problem as a finite automata. shell & bucket sort. Binary Search tree . 2. Computation of biconnected components and strongly connected components using DFS. Shortest Path Algorithms on Graphs: Bellman-Ford algorithm. Code –322512 (22) Total Tutorial Periods: 12
UNIT-I INTRODUCTION & ANALYSIS: Analyzing algorithms. The Boyer-Moore algorithm. Hopcroft – Aho – Ullman. UNIT-II-DYNAMIC PROGRAMMING & GREEDY PARADIGM: The basic dynamic programming paradigm. UNIT-V-NP-COMPLETE PROBLEMS:Solvable problems. heaps and introduction to 2-3 trees. Handbook of Algorithms & Data Structures. The statement of Cook’s theorem and a discussion of its implications. Union to Find Algorithm & their applications. heap sort.40 Total marks in end semester exam – 80 Minimum number of class tests to be conducted – 02 Branch-Computer Science & Engineering. BHILAI (C. Greedy Paradigm: The basic greedy strategy & computing minimum spanning trees. Quick and merge sorting techniques.
. Types of problems.. Knuth Morris and Pratt algorithms. The Design & Analysis of Computer Algorithms.)
Semester – V Subject: Analysis & Design Of Algorithms Total theory periods. 3. Representation of heaps using 2 trees. Dynamic programming solution to the optimal matrix chain multiplication and the longest common subsequence problems. subset sum and Hamiltonian cycle problems are NP-complete. Sahni & Horowitz. -3 Amortized Analysis. UNIT-IV-GRAPH ALGORITHMS & STRING MATCHING ALGORITHMS: Representational issues in graphs. Applications of backtracking paradigm. Introduction to Design & Analysis of Algorithms. PE-LPE. Hamiltonian path problems etc. Recurrence relation. Use of greedy strategy in algorithms for the Knapsack problem and Huffman trees. Top down recursive algorithms. Reductions to show that the clique problem. The notion of polynomial transformation and reductions. Polynomial time non deterministic algorithms for problems like satisfiability. Other models for computations. AWL. Fundamentals of Algorithms. AWL. the basic divide and conquer algorithm for matrix multiplication.H. vertex cover. The notion of a non deterministic algorithm and its basic relationship to backtracking. Algorithms for manipulating 2-3 trees. Algorithms of Kruskal and Prim. Recurrence Equations. The definition of NP-hardness and NP-completeness. Dijkstra’s algorithm & Analysis of Dijkstra’s algorithm using heaps. UNIT-III-DIVIDE AND CONQUER & BACKTRACKING PARADIGM: Introduction to Divide and Conquer paradigm.
Case studies: Unix system. Silberscatz John Weiley & Sons 4. BHILAI (C. Prevention. Protection. Definitions of “Process”. A virtual machine operating systems Text Books: 1. Operating System concepts. inter process communication. resident Monitor. CPU scheduling: concepts. Classical problems in concurrency. Milenkovic M. Operating system concepts Galvin. Operating System Design & Implementation. File Directories. Process States.segmentation. interactive. Operating System Concept & Design.Deital Pearson Education Reference Books : 1. I/O Buffering. McGraw Hill. File sharing. paged . Operation System. UNIT-5 I/O MANAGEMENT &DISK SCHEDULING:I/O Device and the organization of the I/O function. J. combined approach. Asynchronous Concurrent Process:. Stalling William.)
Semester – V Subject: Operating System Total Theory periods-40 Total marks in end semester exam – 80 Minimum number of class tests to be conducted – 02 Branch-Computer science & engineering. 2. The Key Architecture Trend. Tanenbaum.Introduction. time sharing and real time systems. The Evolution of operating Systems. UNIT. A. Demand paging. Multiprogramming with variable partitions. Deadlock characterization. Process State Transitions . page Replacement algorithms. Multiprocessor scheduling. and scheduling Algorithms. Mutual Exclusion.
. Avoidance and Detection.The process Control Block . System structure. Allocation of frames. multiprogramming with fixed partition.M. Code –322513 (22) Total Tutorial Periods: 12
UNIT –1 INTRODUCTION: Operation System objective and function. Segmentation.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. cache memory organization impact on performance.. Silberscatz A and Peterson.G.S. Operating System Structure. Batch. performance. performance criteria.2 CONCURRENT PROCESSES:Process concept:. Maxwell MCMillan International Editions. PHI. Paging. Suspend and Resume . Parallel Computation.4 MEMORY MANAGEMENT:Base machine. operating system service. Algorithm evaluation. parallel Processing . Recovery from deadlock. File system: File Concepts – File organization and Access mechanism.LPE.Operations on Processes. 3. Disk I/O.L. semaphores. PE. Operating systems H. Implementation issues .A Control Structure for indicating parallelism. Distributed Computing. UNIT. Thrashing. UNIT. Input-Output Trends. Operating system Design issues.3 DEAD LOCKS:System model. interrupt Processing.introduction. the critical section problem. virtual Memory concepts. the Producer / Consumer problem. System Components. 2.
Initial functions. properties of context free language. (2) Introduction to Automata theory.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. Basic definitions. Properties and limitation of FSM. Relation between types of grammars. Space and time complexity.E. Halting problem of Turing Machine UNIT-5 COMPUTABILITY Introduction and Basic concepts. GRAMMARS. Turing machine model. Tamilarasi. John E. Pumping lemma for regular sets. Nath.B. Application of pumping lemma. Conversion of NFA to DFA by Arden’s method. UNIT-4. Umesh Publication. K. Deterministic finite automata. PHI. Finite automata with ? moves. Patel & P. (3) Theory of Computation. UNIT-3. Universal Turing machine and other modifications. Chomsky normal from. TMH. Non deterministic finite automata. (2) An Indtroduction and finite automata theory. Chomsky hierarchy of grammar. Two way finite automata. Examples of automata machine. New Age International Publishers. Ambiguity in grammar.L. Regular sets and Regular grammar. Bilasubramani. R. Properties of Regular Expression. REGULAR EXPRESSIONS : Regular expression. Code –322514 (22) Total Tutorial Periods: 12
UNIT-1. Simplification of context free grammar. Chandrasekran. Recursive function. My hill Nerode theorem. Finite automata as a language acceptor and translator. Finite automata and Regular expressions. Minimizing number of states of a DFA. Decision algorithm for context tree language. Partial recursive function. Regular Expression to DFA conversion & vice versa. Greibach normal form. Adesh K. Post correspondence problem. AM Natrajan.)
Semester – B. Turing computable functions.G. Recursive enumerable language and sets. Pumping lemma from context free language. Partial recursive function.
. Decision algorithm for regular sets and regular grammar. Acceptance of push down automata. Reference Books : (1) Theory of Automata and Formal Language. Pandey. computability. Narosa Publishing House. Construction of Turing machine for computation. Left most linear & right most derivation trees. Role and application areas of grammars. THE THEORY OF AUTOMATA : Introduction to automata theory. Mishra and N. V Subject: Theory of Computation Total theory periods-40 Total marks in end semester exam – 80 Minimum number of class tests to be conducted – 02 Branch-Computer Science & Engineering. PUSH DOWN AUTOMATA AND TURING MACHINE. finite automata with output (Mealy Machine. Text Books : (1) Theory of Computer Science (Automata Language & Computation). Closure properties of regular sets. Ullman. Moore machine). Church’s Hypothesis. Language and Computation. Application of finite automata.P. Definition and types of grammar. Deterministic push down automata and non deterministic push down automata. UNIT-2. Push d own automata and context free language. Hopcropt & Jeffery D. Representation of Turing Machine Construction of Turing Machine for simple problem’s. BHILAI (C. A Turing model for computation. Context free grammar.
Entropy. Fiber Optic Communication: Principles of light propagation in optical fiber. Signal Processing.C. SSB modulation and generation. Balanced Modulator. Electronic Communications by Roddy & Coolen.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY BHILAI (C. FM phasor diagram. Quantization of Signals. Average power for Sinusoidal AM. Discrete and Continuous channel. Modulation Index for Sinusoidal AM.London. PWM.M. Fiber optic communication link.PSK FSK and DEPSK. TMH Reference Books: 1. 3. Carlson . UNIT – III : Digital Communication Sampling theorem. Am plitude Modulation Index. 2.
. DM. Effect of modulation on BW. Time division multiplexing (TDM). UNIT – V : Advanced Communication Techniques Satellite Communication: Components and Block diagram of Satellite communication system. Quantization error.Taub and K. Shiling. The Square law demodulator. Channel capacity. PHI. 4. Dispersion. Electronic Communication System by Kenedy & Davis. ADM. DPCM. 2. English University Press.L. UNIT – IV : Elements of Information Theory Average Information. spectrum of FM Signal. constant BW. Narrow band F. BW of FM Signal. Amplitude Modulation.G. FDM. DSBSC Modulation. UNIT – II : Angle Modulation System Phase and frequency modulation and their relationship. PPM. Bandwidth s/N trade off.Mc -Graw Hill. Modulation and Noise-by Betts. Frequency spectrum for Sinusoidal AM. An Introduction to the Principle of Communication Theory by J. Gaussian channel. Transponders. VSB.Mc -Graw Hill. Armstrong and Parameter variation methods of FM generation and FM demodulators. Frequency deviation. Communication Channel. Communication System-by A. Losses in fibers. Effective voltage and current for sinusoidal AM. Nonsinusoidal modulation. Shannon-Hartley Theorem and its Implications. Hancock. Connectors and splices. Text Books: 1. Principles of Communication system by H. Pulse Code Modulation (PCM) and the system.B. Information Rate.)
Semester : V Subject: Principles of Communication Systems Total Theory Periods: 40 Total Marks in End Semester Examination: 80 Minimum number of Class tests to be conducted: Two Branch: CSE/IT Code: 322515 (28) Total Tutorial Periods: Nil
UNIT – I : Amplitude Modulation System Need for Modulation. Up-link and Down-link budget calculations. Pulse Modulation: PAM.
R ecord Storage and Primary File Organizations: Introduction. Different type of Recovery techniques & their comparative analysis. Locking techniques.Trees. Database system concept. Entity. Database Design Fundamentals. Integrity. Types of constraints. Pearson Education.
. Functional dependencies. Strong Entity Set. Principles of Database Systems”. Multiple index access. Fill factor. 3. 4th & 5th Normalization. UNIT-II THE RELATIONAL DATA MODEL:Relational data model concepts. 2. Multi-version techniques. Index. Relationship Types. Concurrency Control: Different type of concurrency control techniques & their comparative analysis. Fundamentals of Database Systems . C. Pearson Education. General definitions of second and third normal forms. Time. Query interpretation. Normal forms based on primary keys. Structure of a query optimizer. Rishe.G. Korth & Sudarshan. Galgotia Publications. Boyce.Codd normal form. Nested transaction. Structure of Files: Types of Single –Level ordered indexes. Levels of transaction consistency. View. Shadow paging. 2. Security. Non-procedural and procedural integrity constraints. Type of Data Models. On-line backup during database updates. Introduction to Database Systems . constraints. Specialization and –R Generalization. Defining different constraints on a table. serialbility of schedules. Attributes and Keys. MH.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. schedules and recoverability. BHILAI (C. Methods for join tables scans. Code –322516 (22) Total Tutorial Periods: Nil
UNIT-I IINTRODUCTION TO DATA BASE: Advantages of DBMS.Enhanced E Modeling. DBMS Architecture and Data Independence. Secondary Storage Devices.DCL . relational calculus.Date. problem related with normal forms & solutions. Transaction benchmarking. Check points.stamp ordering. Multilevel indexes. Ullman. Text Books: 1. Schema and instances. Dynamics Multilevel indexes using B-trees and B+. ACID property. Optimistic techniques.J. UNIT-III DATABASE DESIGN:Functional Dependencies and Normalization for Relational Databases: Informal design guidelines for relation schemes. Transaction Processing: Types of failures..DML.)
Semester – V Subject: Database Management System Total theory periods-40 Total marks in end semester exam – 80 Minimum number of class tests to be conducted – 02 Branch-Computer Science & Engineering. Table scans. relational algebra. Buffering of Blocks. Integrity constraints specifications in SQL.Relationship Model. Weak Entity set. UNIT –V CRASH RECOVERY:Failure classification. Defining & Dropping integrity constraints in the alter table command. Reference Books: 1.O. Query execution plan. Multiple granularity. 2nd Edn. Deadlocks.Tuple relational calculus SQL: DDL. PHI. Elmasri & Navathe. UNIT-IV QUERY & TRANSACTION PROCESSING:Query Processing : Query processing stages . J. Multivalued & Join Dependencies. immediate update. deferred update.
3. To generate DSB-SC signal using Balanced Modulator and to study its characteristics. 4. 12. To perform experiment with adaptive Delta modulation techniques and to study the waveforms. Power supply. To study Frequency Modulation and to trace the frequency modulated waveform on CRO using Trainer Kits. 11. Modulated Signal Generator. COMMSIM Software.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. To generate SSB-SC signal and to study its characteristics. Mithal. Transmission Line.G.
Semester – V Branch-Computer Science & Engineering. To study Frequency Demodulation using Trainer Kits. To design a ring modulator and to study its characteristics. Function Generator.50 Total marks in end semester exam – 40 Minimum number of class tests to be conducted – 02
List of Experiments to be performed 1. To study ASK Modulation and demodulation. To study FSK Modulation and Demodulation. 8. 13. 15. 2. 14. 6. 10. To design a square Law modulator using FET and to study its characteristics. To study the TDM pulse Amplitudes Modulation/Demodulation and to draw their waveforms. BHILAI (C. Recommended Books: Radio Communication By G.) List of Equipments/Machine Required: Discrete components. (Along with the above experiments. To study Demodulation on Trainer kit.K. Communication trainer kits. 5. 7. Khanna Publishers. Simulators may be used to give idea about various communication techniques. To design a square Law detector using diode and to study its V-I characteristics. Subject: Principle of Communication Lab Code – 322521 (22) Total Practical Periods. To study Signal sampling and reconstruction techniques. To perform Experiment with data modulation techniques and to study the waveforms. 9. CRO. To study Amplitude Modulation on trainer kit.
PHI. 7.Date. 6. 11. Rishe. PL/SQL (Anonymous block. 4. Filtering table data. Pearson Education. Reference Books: 1.J. Principles of Database Systems”. Renaming tables. Pearson Education.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. 14. Elmasri & Navathe. Introduction to Database Systems . 2.
. character functions) Subquieries Set operations. Viewing data from tables. 2. salary) Company (company name. Inserting data into a table from another table. Galgotia Publications. 5. 16. 10. Not Null). Manager name) 1. BHILAI (C. 3. SQL & PL/SQL. Foreign key. 12. J. street. Joins. Grouping data. 8. control structure) PL/SQL (Procedures) Triggers Cursors Branch-Computer Science & Engineering.50 Total marks in end semester exam . city) Manages (person name. Delete. Data insertion into a table. Database Design Fundamentals.. alter. Creating tables. SPD. Creating table from another table. company name. city) Works (person Name. 2. Fundamentals of Database Systems . 15. aggregate functions Oracle functions (mathematical. Ivan Bayross. Ullman.)
Semester – V Subject: Database Management System Lab Total Practical Periods. 2nd Edn. Code –322522 (22)
Text Books: 1. Data constraints(Primary key.40 Minimum number of class tests to be conducted – 02 Practical List :Schema for table creation Employee (person name. C.G. 3. and update operations. 13.O. 9.
Write a program that creates an abstract class called dimension.d means width . 13. Write a servlet program using HttpServlet class.Naughton schildt (TMH) Java programming – E Balagurusamy Java 2 Black book – Steven Holzner Java Examples in a nutshell – O’ Reilly
Reference Books: 1. Its volume is v=w*h*d and also find the surface area given by the formula s=2(wh+hd+dw). write another class (in a different file) that handles the Exception. create objects of the Mythread class and run them. 14. 9. Create a user defined Exception class which throws Exception when the user inputs the marks greater than 100.h. 3. Design a text editor which is having some of the features of notepad. Create the subclass called Rectangle which contains a method to display the length and breadth of the rectangle called showxyvalue(). Write a program in which a Mythread class is created by extending the Thread class. Include appropriate methods for both the subclass that calculate and display the area of the rectangle and triangle. 2. Develop a program to illustrate a copy constructor so that a string may be duplicated into another variable either by assignment or copying. Write a program which illustrates capturing of Mouse Events. It contains two methods getxyvalue() and showxyvalue() for accepting co-ordinates and to display the same. 4. 3. 6. Write a program to check whether a number is a Armstrong number or not. Create a base class called shape. 16. In another class. Note the output. 15.Use overriding concept. 10. Write a program which throws Arithmetic Exception.50 Total marks in end semester exam – 40 Minimum number of class tests to be conducted – 02 Branch-Computer Science & Engineering.use appropriate constructors for the above. Write a program using InetAddress class and also show the utility of URL and URL Connection classes. Write a JDBC program for Student Mark List Processing. Identify each thread by setting the name. 5. 2.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. Use Applet class for this. Write a program to perform multiplication of two matrices.height and depth. creates two subclasses. 12. 11. 4. Code –322523 (22)
List of Experiment to be performed 1. Write a program to find the volume of a box having its side w. Write a program using RMI in which a simple remote method is implemented.G. In the run method print “CSVTU” 10 times. Write a program to sort a stream of Strings. rectangle and triangle. Java complete reference . Also give the appropriate HTML file which posts data to the servlet. 8.
Semester – V Subject: Software Technology Lab-2 (Java) Total Practical Periods. BHILAI (C.
Write a program to add them up and store the result at locations starting from RESULT (Result space 7 bytes ) RST 6.
12. 7. Code: 328524 (28)
Programmes to be executed (but should not be limited to): 1.G. ( $ stands for a blank ) SIGNED BINARY ADDITION: A block of 16-signed binary numbers is residing at locations NUMBERS. 11. BHILAI (C.5: A block of 16 bytes is residing at location starting from . Write a program two add them up and store the result at location starting from RESULT (result space 11 bytes) MULTIBYTE BCD ADDTION: Two 6 digits BCD numbers are residing at location starting from DATA 1 and DATA 2 respectively. Add them up and store the result ( in signed binary ) at locations from RESULT. BINARY TO BCD: A binary number is residing at location BIN > WAP to convert the binary number in to its equivalent BCD and store the result at BCD and BCD + 1 BCD TO BINARY: A BCD number is residing at location BCD . 5.
Semester : V Subject: Microprocessor & Interfaces Lab Total Practical Periods: 50 Total Marks in End Semester Examination: 40 Branch: Computer Science & Engineering. Keep the edited string in the same locations. SORTING IN ASCENDING ORDER: A block (16 bytes are residing at locations starting from DATA: Write a program to arrange the word in the same location in ascending order BINARY ADDITION: 16 bytes are residing at location starting from DATA WAP: to add all bytes and store the result location SUM and SUM + 1 BCD ADDITION: 16 BCD NUMBER are residing at location starting from DATA WAP to add all bytes and store the result location SUM and SUM + 1 MULTIPLICATION: Two bytes are residing at location DATA 1 and DATA 2 Write a program to multiply the two bytes and store the result at location PROD 1 and PROD 2 . 2.
10. 4. 3. DATA Reverse the block and store the bytes at REVERSE whenever the RST 6.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. Write a program to convert the BCD number into its equivalent binary and store the result at BIN MULTIBYTE ADDITION: Two 10 bytes are residing at location starting from DATA 1 and DATA 2 respectively.
9. EDITING OF ASCII STRING: A string of ASCII characters is residing at locations starting from READ which contain “ I $ WILL $ BE $ AN $ ENGINEER “.5 key is pressed. REVERSING AN ARRAY: A Block of 16 bytes are residing at locations starting from BLOCK 1 WAP to transfer the block in reverse order at locations starting from BLOCK 2. 6. Product the string from further editing. Edit string in such a way that it should contain “ I $ will $ be $ Engineer “.
Convert the ASCII characters. codes for small letters into that of capital letters and codes for BCD digits into that of BCD numbers and store them at the same locations. Stop the generation of the series whenever any element of the series in BCD with the elements of the series exceeds (99). Srinath. SERIES GENERATION: Two BCD numbers a and b are residing at locations DATA 1 and DATA 2 respectively. PARITY CHECK: A block of 32 bytes is residing at DATA count the number (BCD) of times even and odd PARITY bytes are appearing consecutive memory locations. a + 4b.
15. Store the result at locations starting from RESULT. Write a program to form a series in BCD with the elements of a. MASM assembler.
ASCII CODE CONVERSION: A string of 16 ASCII characters are residing at locations starting from DATA. 8085 simulator. Keep the count at MATCH. a + 2b. The string consists of codes for capital letters. ……….
List of Equipments/Machine Required: 8085 based microprocessor kit. Recommended Books: 8085 Microprocessor Programming & Interfacing – N. a + 6b.K. PHI
.13. In such a way that the codes for capital letters be converted into corresponding codes for small letters. PCs. small letters and BCD digits ( 0-9 ) . Count the number (BCD) of elements in the series and store it at NUMBER.
Leadership: your idea. How to make a Decision. How to aim at Excellence.just by listening. How to acquire physical well-being. What do we know about group decision making ? General aids towards improving group decision making. How can one make the difference. Personality Development is essential for overall development of an individual apart from gaining technical knowledge in the subject.
. Unit – II Interpersonal Skills: Leadership: Leaders who make a difference. Two important keys to effective leadership. The words and the music. How to develop art of convincing others. How to talk to a disturbed person. How to win over FAILURE. Principles of leadership. Conflicts and cooperation.CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY. Saying a lot. What do we know about leadership? If you are serious about Excellence. How to win loneliness. Negative attitude and wining: What is FEAR and how to win it. Decision making : A question of style. Listening: Listening skills. benefits of positive attitudes. How to win friends and influence people. of Periods : 2 pds/week Tutorial Periods : NIL Total Marks in End Semester Exam. how to develop the habit of positive thinking. Unit – III Attitudinal Changes: Meaning of attitude. Factors of leadership. How to apply the cosmic laws that govern life and personality. How to win over one’s ANGER and others anger. More tips for decisions of importance. How to acquire mental well-being. How to apply the individual MOTIVATORS that make you a self-power personality. Concepts of leadership. How to overcome CRITICISM. How to get along with others. How to deal with others particularly elders. How to improve Memory. How to develop and effectively use one’s creative power.E. when ? People decisions : The key decisions. How to win over PAIN. How to formulate effective success philosophy. Listening and sometimes challenging. How to apply the character MOTIVATORS that elevate you and your personality to the top. How to listen. Unit – I Personality concepts: What is Personality – its physical and psychic aspects. the art of self motivation. Unit –IV Decision Making: How to make your own LUCK. What is stress and how to cope up with it? What is crisis and how to manage it. : NIL Teacher's Assessment : 20 Mks Minimum number of class tests to be conducted : Two Objective: The course is introduced to develop one's outer and inner personality tremendously and enrich the abilities to enable one to meet the challenges associated with different job levels. Which style. V Branch : Common to All Branches Subject : Personality Development Code : 300525 (46) No. How to plan goals/objectives and action plan to achieve them. How to develop a positive self-image. BHILAI
Semester : B. Attributes. How to develop successful learning skills. How to make RIGHT DECISION and overcome problems.
Basic Managerial skills for all by E.
. Group discussions: Purpose of GD. Prentice Hall India Pvt Ltd. How to develop a pleasing personality by Atul John Rego. 2000. The art of Speaking Forget the fear of presentation. A. Roles to be played in GD. 2. Better Yourself books. How to win friends and influence people by Dale Carnigie. Fusion Books. Stop failures by acquiring Information. 6. Symptoms of stage fear. The powerful Personality by Dr Ujjawal Patni & Dr Pratap Deshmukh. Reference Books: 1. friedman . How to develop successful study skills. Mumbai. Wheeler 2006. Better yourself books. Personality : Classic Theories & Modern Research. Great Words win Hearts by Dr Ujjwal Patni.H. 7. H McGrawth. Skills to impress in public speaking & Conversation. Use of presentation aids & media. 4. 1969. Study & Examination: How to tackle examination. How to Succed by Brain Adams. Main reason for speech failure. Pearson Education 2006.Unit – V Communication Skills: Public Speaking: Importance of Public speaking for professionals. What factors contribute to group worthiness. 2006. 3. 5. 2006. Preparation & designing of speech. 2006. Mumbai. Medident Publisher.