Unit Test Solution Of Unit One Of Computer Architecture Hey guys here you can get solution of unit

Unit Test Solution Of Unit One Of Computer Architecture  Hey guys here you can get solution of unit
Unit Test Solution Of Unit One Of Computer Architecture

DBMS notes

DBMS notes
Get Latest Notes

Notes of TOC

Notes of TOC
All notes and model question and more get here of Theory of Computation

Latest Posts

Database Management System Micro Syllabus, Notes

Study in Group

 Database Management System Micro Syllabus, Notes

Database: 

Database is a collection of inter-related data which helps in efficient retrieval, insertion and deletion of data from database and organizes the data in the form of tables, views, schemas, reports etc. For Example, university database organizes the data about students, faculty, and admin staff etc. which helps in efficient retrieval, insertion and deletion of data from it.

Database Management System: 

The software which is used to manage database is called Database Management System (DBMS). For Example, MySQL, Oracle etc. are popular commercial DBMS used in different applications.

Database Management System Micro Syllabus, Notes



Micro Syllabus




Notes by Aryan Pariyar


This note is created by aryan personally if any mistake please write in a comment i will correct it as soon as you comment in below.

Theory of Computation Notes, Micro syllabus, model Question solution ,past Question paper and more

Study in Group

Theory of Computation Notes, Micro syllabus, model Question solution ,past Question paper and more

Automata theory (also known as Theory Of Computation) is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation with respect to simple machines, referred to as automata.

Automata* enables the scientists to understand how machines compute the functions and solve problems. The main motivation behind developing Automata Theory was to develop methods to describe and analyse the dynamic behavior of discrete systems.

Automata is originated from the word “Automaton” which is closely related to “Automation”.

Theory of Computation Notes
Theory of Computation Notes

Micro Syllabus



Unit I: Basic Foundations

1.1. Review of Set Theory, Logic, Functions, Proofs

1.2. Automata, Computability and Complexity: Complexity Theory, Computability Theory,Automata Theory

1.3. Basic concepts of Automata Theory: Alphabets,Power of Alphabet, Kleene Closure Alphabet,Positive Closure of Alphabet, Strings, Empty String, Suffix, Prefix and Substring of a string,Concatenation of strings, Languages, Empty Language, Membership in Language


Unit II: Introduction to Finite Automata

2.1. Introduction to Finite Automata, Introduction of
Finite State Machine

2.2. Deterministic Finite Automata (DFA), Notations for DFA, Language of DFA, Extended Transition Function of DFA Non-Deterministic Finite Automaton (NFA), Notations for NFA,Language of NFA, Extended Transition

2.3. Equivalence of DFA and NFA, Subset-Construction

2.4. Method for reduction of NFA to DFA, Theorems for equivalence of Language accepted by DFA and NFA: For any NFA, N = (QN, ∑, N, q0, FN) accepting language L  ∑* there is a DFA D = (QD, ∑, D, q0’,FD) that also accepts L i.e. L (N) = L (D), A language L is accepted by some NFA if L is accepted by some DFA.

2.5. Finite Automaton with Epsilon Transition (ε -NFA), Notations for ε - NFA, Epsilon Closure of a State, Extended Transition Function of ε –
NFA, Removing Epsilon Transition using the concept of Epsilon Closure, Equivalence of NFA and ε –NFA, Equivalence of DFA and ε – NFA

2.6. Finite State Machines with output: Moore Machine and Mealy Machines, Illustration of the Moore and Mealy Machines




Unit III: Regular Expressions

3.1. Regular Expressions, Operators of Regular Expressions (Union, Concatenation, Kleene),Regular Languages and their applications,
Algebraic Rules for Regular Expressions

3.2. Equivalence of Regular Expression and Finite Automata, Reduction of Regular Expression to ε–NFA, Conversion of DFA to Regular
Expression, Arden’s Theorem

3.3. Properties of Regular Languages, Pumping Lemma for regular Expression, Application of Pumping Lemma, Closure Properties of Regular Languages over (Union, Intersection ,Complement), Minimization of Finite State Machines: Table Filling Algorithm

Operating System Micro Syllabus ,Notes,model Question| past year question and more

Study in Group

 Operating System 

An operating system ( OS) is system software that manages computer hardware, software resources, and provides common services for computer programs . Time-sharing operating systems schedule tasks for efficient use of the system and may also include accounting software for cost allocation of processor time, mass storage, printing, and other resources




Micro Syllabus Operating Systems 



Unit One : Introduction of OS

1.1. Definition, Two views of operating system, Evolution of operating system, Types of OS.

1.2.System Call, Handling System Calls, System Programs, Operating System Structures,The Shell, Open Source Operating Systems


Unit two : Process Management

2.1. Process vs Program, Multiprogramming, Process Model, Process States, Process Control Block.

2.2. Threads, Thread vs Process, User and Kernel Space Threads.

2.3. Inter Process Communication, Race Condition, Critical Section

2.4. Implementing Mutual Exclusion: Mutual Exclusion with Busy Waiting (Disabling Interrupts, Lock Variables, Strict Alteration, Peterson’s Solution, Test and Set Lock),Sleep and Wakeup, Semaphore, Monitors, Message Passing,

2.5. Classical IPC problems: Producer Consumer, Sleeping Barber, Dining Philosopher Problem

2.6.Process Scheduling: Goals, Batch System Scheduling (First-Come First-Served, Shortest Job First, Shortest Remaining Time Next), Interactive System Scheduling (Round-Robin Scheduling, Priority Scheduling, Multiple Queues), Overview of Real Time System Scheduling



Unit three : Process Deadlock


3.1. Introduction, Deadlock Characterization, Preemptable and Non-preemptable Resources, Resource – Allocation Graph, Conditions for Deadlock

3.2.Handling Deadlocks: Ostrich Algorithm, Deadlock prevention, Deadlock Avoidance, Deadlock Detection (For Single and Multiple Resource Instances), Recovery From Deadlock (Through Preemption and Rollback)




Unit four : Memory Management


4.1. Introduction, Monoprogramming vs. Multi-programming, Modelling
Multiprogramming, Multiprogramming with fixed and variable partitions, Relocation and Protection.

4.2. Memory management (Bitmaps & Linked-list), Memory Allocation Strategies

4.3. Virtual memory: Paging, Page Table, Page Table Structure, Handling Page Faults,TLB’s

4.4. Page Replacement Algorithms: FIFO, Second Chance, LRU, Optimal, LFU, Clock, WS-Clock, Concept of Locality of Reference, Belady’s Anomaly

4.5.Segmentation: Need of Segmentation, its Drawbacks, Segmentation with
Paging(MULTICS)



Unit five : File Management


5.1. File Overview: File Naming, File Structure, File Types, File Access, File Attributes, File Operations, Single Level, two Level and Hierarchical Directory Systems, File System Layout.
5.2. Implementing Files: Contiguous allocation, Linked List Allocation, Linked List
Allocation using Table in Memory, Inodes.
5.3. Directory Operations, Path Names, Directory Implementation, Shared Files
5.4. Free Space Management: Bitmaps, Linked List




Unit six : Device Management


6.1. Classification of IO devices, Controllers, Memory Mapped IO, DMA Operation,
Interrupts

6.2. Goals of IO Software, Handling IO(Programmed IO, Interrupt Driven IO, IO using
DMA), IO Software Layers (Interrupt Handlers, Device Drivers)

6.3.Disk Structure, Disk Scheduling (FCFS, SSTF, SCAN, CSCAN, LOOK, CLOOK), Disk
Formatting (Cylinder Skew, Interleaving, Error handling), RAID



Unit Seven : Linux Case Study


7.1 History, Kernel Modules, Process Management, Scheduling, Inter-process
Communication, Memory Management, File System Management Approaches, Device Management Approaches.



Above we see all the notes of OS with chapter wise now here os the pdf format of the note which is in one.

Notes of OS





Model Question of the Operating System is Here

Model Question Sets

The model question set and it's solution is here and 10 question practice sets are also available here.



Past Question Papers/Old Question Papers







 






The Text Book 







Thanks for visiting our site you can also add your notes on this site for this please contact us at 
 -------------------------------------------------------------------------> studygroup.org@gmail.com
Visit our Facebook Page: groupstudyorganization 

Text and reference books of B.Sc.CSIT third sem

Study in Group

Text and reference books of B.Sc.CSIT third sem: -
The Group Study Organization provides many and more content related to the B.Sc.CSIT sems and many test papers also today here is the text books and reference books are here, now you can read and download these books in your pc or mobile.
The Group Study Organization  always with you to grow your and own knowledge and share the things with student specially for the B.Sc.CSIT students ,keep reading ,keep growing best up luck to all .

Text  and reference books of all subjects are below: -
  Data Structure Algorithm book :-
principles-of-data-structures-using-c-and-c-v-das-new-age-2008-
Numerical Method Book: -
  1. Numerical_MathematicsandComputing_(Sixth_Edition)
2. Numerical method_ Nepali Writer's
3.Numerical Mathematics and Computing (Sixth Edition)_2
4.Numerical Mathematics and Computing (Sixth Edition)

Computer Graphics Book: -
Computer Graphics 

Computer Architecture : -
1. Computer Organisation and Architecture-8th ed by William Stallings
2.Advanced computer architecture and parallel processing

Statistics II Book: -
1.Advanced Calculus with Applications in Statistics ( PDFDrive.com )

2.Modern Mathematical Statistics with Applications ( PDFDrive.com )

3.probability_and_statistics_for_engineers_and_scientisst

4.probability_and_statistics_for_engineers_and_scientisst_2

Above are the text book and reference book of BSc.CSIT third sem which are provided by Group Study Organization




Unit Test Paper of Numerical Method of unit one and two

Study in Group

Unit Test Paper of Numerical Method of unit one and two: -
Hey guys we have done the unit tests of the Computer Architecture and Computer Graphics today  we are going to take our test of Numerical Method of B.Sc.CSIT third sem subject and the following is the Question Paper of the subject of B.Sc.CSIT third sem's Numerical Method is as :-
Unit Test Paper of Numerical Method of unit one and two
Unit Test Paper of Numerical Method of unit one and two
                              
  Unit 1 test paper of numerical method:-
   
 1.     Find the root by using Newton Raphson method of 2x3-3x-6=0.
2.    Find the root by using Bisection Method COSX +2sinx +x2 with error precision 0.01.
3. Define error and list the types of error in numerical calculations. Derive the formula for secant method and illustrate the method by figure.

Unit 2 test paper of numerical method:-
1.      Derive the equation for Lagrange's interpolating polynomial and find the value of f(x) at X=1 for following.
X
-1
-2
2
4
F(x)
-1
-9
11
69
2.      Estimate F(3) from the following data using Cubic-Spline Interpolation
X
1
2.5
4
5.7
F(X)
-2.0
4.2
14.4
31.2
3.      Fit a straight line that best fits the following set of data by using linear regression.
X
1
2
3
4
5
F(x)
3
5
7
10
12
4.      Fit the curve y=aebx through the data below.
X
-4
-2
0
1
2
4
Y=F(x)
0/57
1.32
4.12
6.65
11
30.3

Hey here is the PDF  file of the above document

Unit One Solution of Computer Graphics Unit-test paper

Study in Group

Unit One Solution of Computer Graphics Unit-test paper: -
Hello and welcome friend to our blog Group study organization .The following is the unit test solution of the unit one of computer graphics.
Unit One Solution of Computer Graphics Unit-test paper
Unit One Solution of Computer Graphics Unit-test paper



Unit ONE                      SOLUTION OF COMPUTER GRAPHICS                       
1.    What do you mean by Computer Graphics? Explain its application.
Ans: -The process of transforming and representing object or information in visual form is called Computer Graphics. It is the creation of pictures with the help of a computer. Computer Graphics may be a business graph, drawing like, circle, or any other space animation etc.
In today`s life computer graphics has now become a common element in uses interface, TV commercial motion pictures etc. In computer graphics, two- or three-dimensional pictures can be created that are used for research. It is also used in various fields like engineering, mathematical model etc.
                                Computer graphics deals with creation manipulation and storage different types of images and object. Some of the application of computer graphics are as follows: -
v  Computer Art: -
Using computer graphics, we can create fine and commercial art which include animation packages, paint package. These packages provide facilities for designing object, space and specifying object motion cartoon, drawing, painting, logo design can also be done.
v  Computer Aided Drawing: -
                                                                Designing of building, automobile, aircraft is done with the help of computer aided drawing. This help in providing minute details to the drawing and producing more accurate and sharp drawings with better specification.
v  Presentation Graphics: -
                                                        For the presentation of reports or summarising the financial statistical, mathematical, scientific, economic data for research reports managerial reports, moreover creation of bar graphs, pie charts, time charts can be done using the tool present in the computer graphics. 
v  Entertainment: -
                                                        Computer graphics find a major part of its utility in the movie industry and game industry. Used for creating motion pictures, music video, television shows, cartoon animation films.
v  Education: -
                                                        Computer generated models are useful for teaching huge numbers of concepts in an easy to understand and learn manner. Using computer graphics many educational models can be created through which more interest can be generated among the students regarding the subjects.
v  Training: -
                                                        Specialized system for training like simulators can be used for training the candidates in a way that can be grasped in a short span of time with better understanding.

v  Visualization: -
                                                        Data visualization helps in finding insights of the data, to check and study the behaviour of processes around us we need appropriate visualization which can be achieved through proper usage of computer graphics.
v  Image processing: -
                                                        Various kinds of photographs or images require editing in order to be used in different places processing of existing images into refined ones for better interpretation is one of the many applications of computer graphics.
v  Graphical User Interface (GUI): -
                                                        The uses of pictures, images, icon, pop-up menus, graphical objects help in creating a user-friendly environment where working is easy and pleasant, using computer graphics we can create such an atmosphere where everything can be automated and anyone can get the desired action performed in an easy fashion.


Unit One Solution of Computer Graphics Unit-test paper
Unit One Solution of Computer Graphics Unit-test paper







2.     What is CRT? Explain its types.
Ans: -
Unit One Solution of Computer Graphics Unit-test paper

The CRT stands for Cathode Ray Tube. The electron gun emits a beam of electrons called cathode ray. The electron beam passes through focusing and deflection systems that direct it towards specified positions on the phosphor-coated screen. When the beam hits the screen, the phosphor emits a small spot of light at each position contacted by the electron beam. It redraws the picture by directing the electron beam back over the same screen points quickly.
                The two basic techniques for producing colour displays with a CRT are the beam-penetration method and the shadow-mask method. These use three colours, Red, Green and blue (RGB) and their combinations.
Types of CRT’s
Ø Raster-Scan Display: -
                                             In a raster scan system, the electron beam is swept across the screen, one row at a time from top to bottom. As the electron beam moves across each row the beam intensity is turned on and off to create a pattern of illuminated spots. Picture definition is stored in memory. Stored intensity values are painted on the screen one row at a time as shown below.
Unit One Solution of Computer Graphics Unit-test paper

Refreshing on Raster-Scan display is carried out at the rate of 60 or higher frames per second. Most of display devices are based on this technology. For e.g. CRT colour CRT, LCD and LED etc.
                Horizontal retrace/Vertical retrace: -
                                                                                                Returning of electron beam from right end to left end after refreshing each scan line is horizontal retrace. At the end of each frame, the electron beam returns to the top left corner to being next frame called vertical retrace.
Unit One Solution of Computer Graphics Unit-test paper
Raster-Scan system consists of several processing units. CPU is the main processing unit of computer system. Architecture of Raster-Scan consist of system bus that helps to access peripheral devices. It consists of video controller which is used to control the operation of display devices. A fixed area of system memory is reserved for the frame buffer. The content of frame buffers are used to control the CRT beam’s intensity or colour.
Advantages: -
*      Shows Realistic pictures.
*      Millions unique hues can be performed.
*      Shadow scenes are conceivable. (i.e. Capable of being imagined)
Hues = Colour.
                Disadvantages: -
*      Low resolution.
*      Electron beam co-ordinated to whole screen not exclusively to those parts of screen where picture is drawn so long when drawn picture is longer then whole screen.
*      Expensive.
Ø  Random-Scan (Vector) Display System: -
In this technique, the electron beam is directed only to the part of the screen where the picture is to be drawn rather than scanning from left to right and top to bottom as in raster scan. It is also called vector display ore calligraphic display. Picture definition is stored as a set of line-drawing commands in an area of memory referred to as the refresh display file. Random-scan display are designed to draw all the component line of a picture 30 to 60 times each second.
Unit One Solution of Computer Graphics Unit-test paper
      The refresh rate of vector display depends upon the number of lines to be displayed for drawing all component lines 30 to 60 times per second. Plotter is the best example of this system.
Unit One Solution of Computer Graphics Unit-test paper
                   Random display system consists of additional processing unit along with CPU which is called the display processor. Picture definition is stored as a set of line drawing commands in an area of memory called display list. This display list is then accessed by the display processor to create an image.
Advantages: -
*      High resolution.
*      Produced smooth line drawing.
Disadvantages: -
*      Expensive.
*      Just does wire frame.
*      Complex scene cause-visible flicker.
3.   What is Random scan system? Draw it’s block diagram and explain it in detail.
Ans: - Random-Scan (Vector) Display System: -
In this technique, the electron beam is directed only to the part of the screen where the picture is to be drawn rather than scanning from left to right and top to bottom as in raster scan. It is also called vector display ore calligraphic display. Picture definition is stored as a set of line-drawing commands in an area of memory referred to as the refresh display file. Random-scan display are designed to draw all the component line of a picture 30 to 60 times each second.
Unit One Solution of Computer Graphics Unit-test paper
      The refresh rate of vector display depends upon the number of lines to be displayed for drawing all component lines 30 to 60 times per second. Plotter is the best example of this system.
Unit One Solution of Computer Graphics Unit-test paper
                   Random display system consists of additional processing unit along with CPU which is called the display processor. Picture definition is stored as a set of line drawing commands in an area of memory called display list. This display list is then accessed by the display processor to create an image.
Advantages: -
*      High resolution.
*      Produced smooth line drawing.
Disadvantages: -
*      Expensive.
*      Just does wire frame.
*      Complex scene cause-visible flicker.


Unit One Solution of Computer Graphics Unit-test paper


4.       What is Raster scan system, explain it in detail?
Ø Ans: - Raster-Scan Display: -
                                             In a raster scan system, the electron beam is swept across the screen, one row at a time from top to bottom. As the electron beam moves across each row the beam intensity is turned on and off to create a pattern of illuminated spots. Picture definition is stored in memory. Stored intensity values are painted on the screen one row at a time as shown below.
Unit One Solution of Computer Graphics Unit-test paper

Refreshing on Raster-Scan display is carried out at the rate of 60 or higher frames per second. Most of display devices are based on this technology. For e.g. CRT colour CRT, LCD and LED etc.
                Horizontal retrace/Vertical retrace: -
                                                                                                Returning of electron beam from right end to left end after refreshing each scan line is horizontal retrace. At the end of each frame, the electron beam returns to the top left corner to being next frame called vertical retrace.
Unit One Solution of Computer Graphics Unit-test paper
Raster-Scan system consists of several processing units. CPU is the main processing unit of computer system. Architecture of Raster-Scan consist of system bus that helps to access peripheral devices. It consists of video controller which is used to control the operation of display devices. A fixed area of system memory is reserved for the frame buffer. The content of frame buffers are used to control the CRT beam’s intensity or colour.
Advantages: -
*      Shows Realistic pictures.
*      Millions unique hues can be performed.
*      Shadow scenes are conceivable. (i.e. Capable of being imagined)
Hues = Colour.
                Disadvantages: -
*      Low resolution.
*      Electron beam co-ordinated to whole screen not exclusively to those parts of screen where picture is drawn so long when drawn picture is longer then whole screen.
*      Expensive.

Hey friends following is the PDF file of the above documents of solution of unit one unit test of computer graphics for this please click the download button of the below.





Our Team

  • Aryan Pariyar Bachelor/ Computer/CSIT /SIDDHANATH SCIENCE CAMPUS
  • Renu AyerBachelor/Computers/CSIT/ SIDDHANATH SCIENCE CAMPUS
  • Dev BudaBachelor/CSIT/Computers/ SIDDHANATH SCIENCE CAMPUS
  • Prem DhamiBachelor/Computers/CSIT/ SIDDHANATH SCIENCE CAMPUS