Goog Plus

बहुत हुई महंगाई की मार भाड़ में जाए फेंकु सरकार,,,

https://www.youtube.com/channel/UCBh3uEuv8pEGMHO-hVW7zaQ/videos

alpha beeta Repository of Free Video Lectures in Sciences,Commerce and Humanities with regular additions of lectures. Lectures are specifically useful for IIT(JEE),P.M.T...

https://www.youtube.com/watch?v=xtrIayrOT1Y

Moment of Inertia - Engineering Mechanics

https://www.youtube.com/playlist?list=PLXVjll7-2kRmpnXxL5QIZBZdRQys6ZHZC

Compiler Design (COMPUTER SCIENCE) Video Lecture for GATE Preparation (CS IT MCA) in hindi

http://www.cs.nyu.edu/courses/spring10/G22.2130-001/lecture9.pdf

www.cs.nyu.edu

https://www.youtube.com/watch?v=8hNrXo88LCc&list=PLXVjll7-2kRmpnXxL5QIZBZdRQys6ZHZC&index=8

Compiler Design lecture: Code Optimization, Target Machine Code Generation Compiler Design lecture | Code Optimization | Target Machine Code Generation, Lexical Analysis, Syntax Analysis,Semantic Analysis, Intermediate Code Generati...

https://scontent.fdel1-2.fna.fbcdn.net/hphotos-xpa1/v/t1.0-9/12043093_10154038277722289_5111181627685776212_n.jpg?oh=d98e9d42a3c60e518013462e450f7927&oe=56B3B491

scontent.fdel1-2.fna.fbcdn.net

https://www.youtube.com/user/tejucs357/playlists

Happy Independent Day 2015

http://xpode.com/ShowArticle.aspx?ArticleId=292

What do you mean by- (a) Memory Allocation (b) Garbage Collection (c) Overflow & Underflow (a) Memory Allocation- Whenever a new node is created, memory is allocated by the system. This memory is taken from list of those memory locations which are free i.e. not allocated. This list is called AVAIL List. Similarly, whenever a node is deleted, the deleted space becomes reusable and is added…

http://xpode.com/ShowArticle.aspx?ArticleId=286

What is the difference between Linked List and Linear Array?

What is the difference between Linked List and Linear Array?

S. No. Array Linked List
1. Insertions and deletions are difficult. Insertions and deletions can be done easily.
2. It needs movements of elements for insertion and deletion. It does not need movement of nodes for insertion and deletion.
3. In it space is wasted. In it space is not wasted.
4. It is more expensive. It is less expensive.
5. It requires less space as only information is stored. It requires more space as pointers are also stored along with information.
6. Its size is fixed. Its size is not fixed.
7. It can not be extended or reduced according to requirements. It can be extended or reduced according to requirements.
8. Same amount of time is required to access each element. Different amount of time is required to access each element.
9. Elements are stored in consecutive memory locations. Elements may or may not be stored in consecutive memory locations.
10. If have to go to a particular element then we can reach there directly. If we have to go to a particular node then we have to go through all those nodes that come before that node.