Name: CRASH COURSE-SEM 3 ( CE/AIML/AIDS/CYB. etc.)
Brand: MathsInDepth
SKU: 6522e83ee4b0c1ae0c401e12
Price: 400 INR
Availability: InStock
Rating: 4.8 (25 reviews)

CRASH COURSE-SEM 3 ( CE/AIML/AIDS/CYB. etc.)

4.8 (25 ratings)

Instructor: MathsInDepth

Language: English/Hindi

Validity Period: 30 days

₹10000 96% OFF

This course will give you all expected questions, paper sets, and solutions for them.

This course is common for

 Computer Engineering
 Artificial Intelligence and Data Science
 Artificial Intelligence and Machine Learning
 Cyber Security
 Internet of Things (IoT)
 Data Engineering
 Computer Science and Engineering (Data Science)
 Computer Science and Engineering (Artificial

Intelligence and Machine Learning)
 Computer Science and Engineering (Internet of

Things and Cyber Security Including Block Chain Technology)

Reviews

4.8

25 total


5		19
4		6
3		0
2		0
1		0

Load More Reviews

Other Courses


	🛑NOTE: Sharing content in any form is not allowed, if found then it will lead permanent deletion of ur account.
	NOTE:
		1) read description of this course for details. WhatsApp us at 9049091373 for any query
		2) Do not call directly, whatsapp your query first through text or voice messages
		3) Paper sets for each subjects will be provided with answers, by doing only paper set you can easily attempt almost 90% of questions in exam
	DSGT CHAPTER WISE SOLUTION PDFS
		🛑NOTE: Sharing content in any form is not allowed, if found then it will lead permanent deletion of ur account.
		Logic
		PDF L1: 5 Marks Question On Mathematical Induction (6 pages)
		PDF L2: 4 OR 6 Marks Questions on Logic (10 pages)
		Relations and Functions
		PDF R1: 8 Marks Question on Warshall's Algorithm (9 pages)
		PDF R2: 4 or 8 marks questions on relation (12 pages)
		PDF R3: 5 Marks Questions on Function (6 pages)
		Posets and Lattice
		PDF P1: 8 Marks Question on Hasse Diagram & Poset (8 pages)
		PDF P2: 4 OR 8 Marks Questions on Lattices (13 pages)
		Counting
		PDF C1: 8 Marks Questions on Exclusion-Inclusion (13 pages)
		PDF C2: Recurrence relations 6 OR 8 MARKS (8 pages)
		PDF C3: Pigeonhole principle 4 or 5 Marks Questions (4 pages)
		Algebraic Structures
		PDF A1: 5 MARKS QUESTIONS (6 pages)
		PDF A2: 8 MARKS QUESTIONS ON GROUP, RING (14 pages)
		PDF A3: 8 MARKS CODING THEORY QUESTIONS (7 pages)
		Graph Theory
		PDF G1: 8 Marks Questions on Homomorphism and Isomorphism (6 pages)
		PDF G2: 8 or 5 Marks Quesrtion On Euler and Hamiltonian circuit path (5 pages)
		PDF G3: 5 Marks Question on Graph (2 pages)
		NOTE: Marks distribution in DSGT is very dynamic so it might be slightly different from paper sets but questions will be similar so solve them carefully because this time paper will be very tough
		MID DSGT PAPER SET 1 (7 pages)
		MID DSGT PAPER SET 2 (6 pages)
	DSGT PYQs
		UNIT 1 LOGIC (3 pages)
		UNIT 2 RELATIONS AND FUNCTIONS (3 pages)
		UNIT 3 POSETS AND LATTICE (2 pages)
		CHAPTER 4 COUNTING (3 pages)
		UNIT 5 Algebraic Structure (4 pages)
		UNIT 6 GRAPH THEORY (3 pages)
	M3 PAPER SETS
		M3 Paper Set 1 (6 pages)
		M3 Paper Set 2 (6 pages)
	M3 CHAPTER WISE SOLUTION PDFS
		🛑For any Typo Mistakes in solution part , send ur query at 9049091373
		LAPLACE TRANSFORM :
		LAPLACE 5 Marks Questions solutions (6 pages)
		LAPLACE 6 Marks Questions solutions (6 pages)
		LAPLACE 8 MARKS QUESTIONS-SOLUTIONS (7 pages)
		COMPLEX VARIABLE
		5 MARKS COMPLEX VARIABLE QUESTION (8 pages)
		6 MARKS COMPLEX VARIABLE QUESTION : PART 1 (6 pages)
		6 MARKS CMP PART 2 (8 pages)
		INVERSE LAPLACE TRANSFORM
		5 MARKS INVERSE LAPLACE QUESTIONS (8 pages)
		INVERSE LAPLACE CONVOLUTION: 6 MARKS QUESTIONS (8 pages)
		INVERSE LAPLACE TRANSFORM 6 MARKS QUESTIONS PARTIAL FRACTION BASED (4 pages)
		FOURIER SERIES
		Fourier Series 6 Marks Questions (9 pages)
		8 Marks Questions Fourier Series on half range series (9 pages)
		Fourier Series 8 MARKS Questions (17 pages)
		STATISTICAL TECHNIQUES
		8 Marks Questions Fitting of parabola & straight line (8 pages)
		6 MARKS QUESTION ON LINE OF REGRESSION (8 pages)
		5 MARKS QUESTIONS ON CORRELATION COEFFICIENT (8 pages)
		PROBABILITY
		6 MARKS BASED QUESTIONS ON PROBABILITY DISTRIBUTION (8 pages)
		6 MARKS QUESTION ON GENERATING FUNCTION (3 pages)
		6 MARKS QUESTIONS ON EXPECTATION AND BAYES (8 pages)
	ENGINEERING MATHEMATICS 3 ( PYQ )
		LAPLACE TRANSFORM (2 pages)
		INVERSE LAPLACE TRANSFORM (2 pages)
		FOURIER SERIES (1 pages)
		COMPLEX VARIABLE (1 pages)
		STATISTICAL TECHNIQUES (1 pages)
		PROBABILITY (2 pages)
	DS PYQ's
		CHAPTER 1: INTRODUCTION TO DATA STRUCTURES (1 pages)
		CHAPTER 2: STACK & QUEUES (2 pages)
		CHAPTER 3: LINKED LIST (2 pages)
		CHAPTER 4: TREES (2 pages)
		CHAPTER 5: GRAPHS (1 pages)
		CHAPTER 6: SEARCHING TECHNIQUES (1 pages)
	CG
		UNIT 1: Introduction and Overview of Graphics System (1 pages)
		UNIT 2: Output Primitives (1 pages)
		UNIT 3:Two Dimensional Geometric Transformations (1 pages)
		UNIT 4:Two-Dimensional Viewing and Clipping (1 pages)
		UNIT 5: Three Dimensional Geometric Transformations, Curves and Fractal Generation (1 pages)
		UNIT 6: Visible Surface Detection and Animation (1 pages)
	DLCA
		UNIT 1 COMPUTER FUNDAMENTALS (2 pages)
		UNIT 2 DATA REPRESENTATION AND ARITHMETIC ALGORITHMS (1 pages)
		UNIT 3 PROCESSOR ORGANIZATION AND ARCHITECTURE (2 pages)
		UNIT 4 Control Unit Design (1 pages)
		UNIT 5: Memory Organization (1 pages)
		UNIT 6: Principles of Advanced Processor and Buses (1 pages)
	Model paper & Paper Sets
		🛑NOTE: Sharing content in any form is not allowed, if found then it will lead permanent deletion of ur account.
		DS Model Paper (1 pages)
		M3 Model Paper( common for all) (1 pages)
		DLCA Model Paper (2 pages)
		CG Model Paper (2 pages)
		DSGT Model Paper (2 pages)
		Solutions will be uploaded from today.
	Data Structures Paper Sets & Solutions
		UNIT 6: SEARCHING TECHNIQUES
		Hashing 5 OR 10 marks CS (12 pages)
		Linear & Binary Search 5 or 10 Marks (11 pages)
		UNIT 5: GRAPHS
		GRAPH THEORY DFS BFS PART 1 (7 pages)
		Graph Part 2 (4 pages)
		UNIT 4: TREES
		Tree Theory : PART 1 (42 pages)
		UNIT 3: LINKED LIST
		Write a program in ' C ' to implement QUEUE ADT using Linked-List. (2 pages)
		Write a program in ' C ' to implement Stack using Linked-List (2 pages)
		Write a program to implement Circular Linked List (3 pages)
		Write a program to implement Doubly Linked List. (4 pages)
		Write a C program for polynomial addition using a Linked-list. (3 pages)
		Write a program to implement Singly Linked List (4 pages)
		UNIT 2: STACK & QUEUES
		Write a program in ' C ' to check for balanced parenthesis in an expression using stack (1 pages)
		Write a C program to convert infix expression to postifix expression (2 pages)
		Write a program to evaluate postfix expression using stack data structure. (1 pages)
		Write a c program to implement stack using array. (2 pages)
		Write a program in ' C ' to implement Queue using array. (2 pages)
		Write a program in ' C ' to implement Circular queue using arrays. (2 pages)
		Write a C program to implement priority queue using arrays. (2 pages)
		Write a C program to implement priority queue using linked list (2 pages)
		Write a C program to implement¯Double Ended Queue. (3 pages)
		All Important programs have been uploaded.
		DS MODEL PAPER SET 1 (3 pages)
		DS MODEL PAPER SET 2 (2 pages)
	DLCA Paper Sets & Solutions
		DLCA PAPER SET 1 (2 pages)
		DLCA PAPER SET 2 (2 pages)
		MODULE 6: Principles of Advanced Processor and Buses
		Explain Flynn Classification: 10 Marks (3 pages)
		Draw and explain 4 stage instruction pipelining (2 pages)
		With respect to pipeline performance define following: 10 Marks (2 pages)
		Explain different types of pipeline hazards (6 pages)
		Explain delayed branching & branch prediction techniques for hazard handling (7 pages)
		What is bus arbitration ( centralised and distributed bus arbitration) (3 pages)
		Write short notes on PCI (2 pages)
		Write Short notes USB and ISA (3 pages)
		MODULE 4: Control Unit Design
		what is control unit (2 pages)
		Microinstruction Example: 10 Marks (3 pages)
		Differentiate between Hardwired control unit and Micro programmed control unit, vertical & horizontal micro programmed (3 pages)
		Explain State Table Method & Delay Element Method for hardwired control unit design. (5 pages)
		Complete concept of mivcroprogrammed control unit from willian stalling (8 pages)
		MODULE 5: Memory Organization
		Memory hierarchy, its characteristics , types of ROM & RAM (3 pages)
		List & Explain the Characteristics of Memory. (2 pages)
		List down characteristics of 2 level memory. (3 pages)
		SRAM VS DRAM (1 pages)
		Cache and Mapping Techniques Complete notes (66 pages)
		Cache Coherence & write policies (4 pages)
		Interleaved memory (3 pages)
		Associative Memory (2 pages)
		MODULE 3: Processor Organization and Architecture
		Half and Full Adder (4 pages)
		Decoder and design of 3:8 decoder (4 pages)
		Write a short note on Encoder and design octal to binary encoder (3 pages)
		Priority Encoder (2 pages)
		Addressing modes & its application (7 pages)
		Explain the instruction cycle with the help of a neat state diagram. (2 pages)
		Types of registers and instructions (11 pages)
		SR, JK, T & D Flip flops (3 pages)
		Multiplexer & Demultiplexer short notes (9 pages)
		As chapter 1 and 2 contains numerical, we are uploading local pdf which is sharable, go through only MU Questions
		number system (26 pages)
		data reperesntation and arithmatic (25 pages)
		flowcharts for booths algorithm , restoring and non restoring devision methods are important
	Computer Graphics Paper Sets & Solutions
		CG Paper Set 1 (2 pages)
		CG Paper Set 2 (2 pages)
		MODULE 1: Introduction and Overview of Graphics System:
		What is computer graphics. Enlist representative uses of it. (2 pages)
		Compare Raster Scan and Random Scan displays. (1 pages)
		Raster techniques & Random scan (short note) (3 pages)
		Architecture of raster scan processor (2 pages)
		architecture of random scan (1 pages)
		Explain rasterization and rendering, define aspect ratio & resolution (2 pages)
		Scan Conversion Definition (1 pages)
		MODULE 6: Visible Surface Detection and Animation
		Classification of Visible Surface Detection algorithm (1 pages)
		Explain Back Surface detection method in detail with an example (2 pages)
		Explain Area Subdivision method (2 pages)
		Write short note on Depth buffer algorithm (3 pages)
		Describe various principles of traditional animation (4 pages)
		Traditional animation techniques (1 pages)
		finish above two modules today
		MODULE 2: Output Primitives
		Bresenham Line Drawing Algorithm (4 pages)
		Explain DDA Algorithm OR What are the disadvantages of DDA algorithm (7 pages)
		Compare DDA and BRESENHAM line drawing algorithm. (2 pages)
		Explain midpoint circle algorithm. Use the same to plot the circle, whose radius is 10 units. (7 pages)
		Midpoint Ellipse Algorithm (2 pages)
		Explain flood fill algorithm in detail (2 pages)
		Explain inside outside test used in filling algorithm (3 pages)
		Explain Scan line polygon filling algorithm (4 pages)
		What is aliasing Explain any two anti-aliasing techniques. (2 pages)
		MODULE 3: Two Dimensional Geometric Transformations
		With neat diagram explain Composite transformation (3 pages)
		Describe what is Homogeneous coordinates (2 pages)
		Prove that two successive rotations are additive (1 pages)
		Prove that 2D rotation and scaling commute (1 pages)
		Reflection about any arbitrary line y=mx+b (1 pages)
		Explain the steps used in rotation of 2D object about an arbitrary axis and hence derive the matrix for the same (2 pages)
		Derive the matrix for 2D rotation about an arbitrary point (2 pages)
		Short notes on Reflection (3 pages)
		Explain 2D Shearing with example (4 pages)
		2D Scaling in Computer Graphics (3 pages)
		2D Translation in Computer Graphics (4 pages)
		2D Rotation in Computer Graphics (5 pages)
		Examples on rotations (3 pages)
		MODULE 5: Three Dimensional Geometric Transformations, Curves and Fractal Generation
		Bezier Curve with solved example (6 pages)
		Explain Construction of Koch curve (3 pages)
		Write short note on Fractals (2 pages)
		Properties and applications of fractal, dimension of koch curve (1 pages)
		Explain what is meant by B Spline curve? State the various properties of B Spline curve. (3 pages)
		Write matrix to perform 3D reflection about xy,yz and xz planes. (4 pages)
		What are Parallel and Perspective projections (4 pages)
		Deriving matrix for Parallel & perspective Projection Transformations (3 pages)
		Difference Between Parallel Projection And Perspective Projection (1 pages)
		Short note on 3D Translation (2 pages)
		Short note on 3D Rotation (3 pages)
		Short note on 3D Scaling (2 pages)
		MODULE 4:Two-Dimensional Viewing and Clipping
		Liang-Barsky line clipping algorithm (2 pages)
		Cohen Sutherland Subdivision line clipping algorithm (3 pages)
		difference between Cohen Sutherland algorithms & Liang-Barsky Algorithm (1 pages)
		Sutherland-Hodgeman Polygon Clipping Algorithm (3 pages)
		Explain Weiler-Atherton polygon clipping algorithm in detail. (2 pages)
		Explain point clipping algorithm (1 pages)
		Define window and viewport. Derive window to viewport transformation. (3 pages)
		Short note on: The Viewing Transformation Pipeline (1 pages)
		We have uploaded All Important pdfs. Thank You

Sign Up Complete your profile

Log In

You may also be interested in

CRASH COURSE-SEM 3 ( CE/AIML/AIDS/CYB. etc.)

₹400